Abstract
In this section we consider strong LL grammars. This grammatical class is important because members of the class, and especially members of the class strong LL(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong LL(1) description, so parsing based on this grammatical characteristic has important applications in computer science.
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
© 1988 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Moll, R.N., Arbib, M.A., Kfoury, A.J. (1988). Parsing, Part II. In: An Introduction to Formal Language Theory. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9595-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9595-9_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9597-3
Online ISBN: 978-1-4613-9595-9
eBook Packages: Springer Book Archive