Sciweavers

WIA
1998
Springer
14 years 2 days 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