The previous chapters have provided us with an annotated syntax tree, either explicitly available as a data structure in memory in a broad compiler or implicitly available during parsing in a narrow compiler. This annotated syntax tree still bears very much the traces of the source language and the programming paradigm it belongs to: higher-level constructs like for-loops, method calls, list comprehensions, logic variables, and parallel select statements are all still directly represented by nodes and subtrees. Yet we have seen that the methods used to obtain the annotated syntax tree are largely language- and paradigm-independent.
- Status Indicator
- Node Type
- Source Language
- Machine Instruction
- Memory Array
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.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
© 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). Interpretation. In: Modern Compiler Design. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4699-6_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4698-9
Online ISBN: 978-1-4614-4699-6