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.
CITATION STYLE
Grune, D., van Reeuwijk, K., Bal, H. E., Jacobs, C. J. H., & Langendoen, K. (2012). Grammar-based Context Handling. In Modern Compiler Design (pp. 209–259). Springer New York. https://doi.org/10.1007/978-1-4614-4699-6_4
Mendeley helps you to discover research relevant for your work.