Programming Languages and Compilers WS 2013/14 - Slide 510
Objectives:
An search structure for definitions
In the lecture:
Explanations and examples for
- the environment tree,
- the binding lists.
- Each search has complexity O(n) in the number of definitions n.
Suggested reading:
Kastens / Übersetzerbau, Section 6.2.2
Questions:
- How is a binding for a particular identifier found in this structure?
- How is determined that there is no valid binding for a particular identifier and a particular environment.
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013