Sciweavers

WIA
1998
Springer
13 years 9 months ago
On Parsing and Condensing Substrings of LR Languages in Linear Time
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
Heiko Goeman
CC
1999
Springer
154views System Software» more  CC 1999»
13 years 9 months ago
Faster Generalized LR Parsing
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...
John Aycock, R. Nigel Horspool