Abstract
There are two ways of doing parsing: top-down and bottom-up. For top-down parsers, one has the choice of writing them by hand or having them generated automatically, but bottom-up parsers can only be generated. In all three cases, the syntax structure to be recognized is specified using a context-free grammar; grammars were discussed in Section 1.8. Sections 3.2 and 3.5.10 detail considerations concerning error detection and error recovery in syntax analysis.
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
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grune, D., van Reeuwijk, K., Bal, H.E., Jacobs, C.J.H., Langendoen, K. (2012). Tokens to Syntax Tree — Syntax Analysis. In: Modern Compiler Design. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4699-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4699-6_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4698-9
Online ISBN: 978-1-4614-4699-6
eBook Packages: Computer ScienceComputer Science (R0)