57 search results - page 1 / 12 » Generalized Lr Parsing Algorithm for Boolean Grammars |
IJFCS
2006
13 years 4 months ago
2006
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
CC
1999
Springer
13 years 9 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
WIA
1997
Springer
13 years 8 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
DLT
2010
13 years 6 months ago
2010
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
WIA
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context