57 search results - page 2 / 12 » Generalized Lr Parsing Algorithm for Boolean Grammars |
ACL
1998
13 years 6 months ago
1998
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
ACTA
2007
13 years 5 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
CASCON
2006
13 years 6 months ago
2006
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
CC
2002
Springer
13 years 5 months ago
2002
Springer
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
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...