Abstract
One of the most important applications of context-free languages and pushdown automata is in compilers. The input to a PASCAL compiler is a PASCAL program, but it is presented to the compiler as a string of ASCII characters. Before it can do anything else, the compiler has to scan this string and determine the syntactic structure of the program. This process is called parsing.
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
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). Parsing. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive