8 search results - page 2 / 2 » Fast Parsing for Boolean Grammars: A Generalization of Valia... |
DLT
2003
13 years 6 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
CC
2004
Springer
13 years 10 months ago
2004
Springer
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
DAS
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...