Abstract
The lexical analysis and parsing described in Chapters 2 and 3, applied to a program text, result in an abstract syntax tree (AST) with a minimal but important degree of annotation: the Token.class and Token.repr attributes supplied by the lexical analyzer as the initial attributes of the terminals in the leaf nodes of the AST. For example, a token representing an integer has the class “integer” and its value derives from the token representation; a token representing an identifier has the class “identifier”, but completion of further attributes may have to wait until the identification mechanism has done its work.
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). Grammar-based Context Handling. In: Modern Compiler Design. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4699-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4699-6_4
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)