Practical parsing is concerned almost exclusively with context-free (Type 2) and regular (Type 3) grammars. Unrestricted (Type 0) and context-sensitive (Type 1) grammars are hardly used since, first, they are user-unfriendly in that it is next to impossible to construct a clear and readable Type 0 or Type 1 grammar and, second, all known parsers for them have exponential time requirements. Chapter 15 describes a number of polynomial-time and even linear-time parsers for non-Chomsky systems, but few have seen practical application. For more experimental results see (Web)Section 18.2.6.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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). Practical Parser Writing and Usage. In: Parsing Techniques. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68954-8_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-68954-8_17
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)