Abstract
Generalized LR parsing has become popular in the second half of the 1980s, after the publication of Tomita’s algorithm [Tomita, 1985]. The theoretical foundation of this approach is in fact much older and dates back to Lang [1974].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sikkel, K. (1997). Generalized LR parsing. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive