Programming Languages and Compilers WS 2013/14 - Slide 510a
Objectives:
An efficient search structure
In the lecture:
Explanations and examples for
- the concept of identifier stacks,
- the effect of the operations,
- O(1) access instaed of linear search,
- how the current environment is changed using operations Enter and Leave, which insert a set of bindings into the stacks or remove it.
Suggested reading:
Kastens / Übersetzerbau, Section 6.2.2
Questions:
- In what sense is this data structure efficient?
- Describe a program for which a linear search in definition lists is more efficient than using this data structure.
- The efficiency advantage may be lost if the operations are executed in an unsuitable order. Explain!
- How can the current environment be changed without calling Enter and Leave explicitly?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013