Generalized deterministic parsers are general breadth-first context-free parsers that gain efficiency by exploiting the methods and tables used by deterministic parsers, even if these tables have conflicts (inadequate states) in them. Viewed alternatively, generalized deterministic parsers are deterministic parsers extended with a breadth- first search mechanism so they will be able to operate with tables with some multiple, conflicting entries. The latter view is usually more to the point.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Grune, D., Jacobs, C.J.H. (2008). Generalized Deterministic Parsers. In: Parsing Techniques. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68954-8_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-68954-8_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20248-8
Online ISBN: 978-0-387-68954-8
eBook Packages: Computer ScienceComputer Science (R0)