Lecture Not (AST)
Introduction of Chapter 4 Building Intermediate Form Trees
1. Draw the multistage pipeline of a language application (Figure 1.1) and indicate where we need
to generate intermediate representation (In general, this is a tree.).
function : def | decl ;
def : functionhead cfw_ body ; / void bar() cfw_
decl : functionhead ; ; / void bar();
functionhead : ;
How to distinguish these two constructs starting at the left of function ?
Lecture Note Memoizing Parser
Pattern 6 Memoizing Parser
We use backtracking parser ONLY when we need to _. [distinguish
between similar language constructs]
If the constructs are similar, the associated grammar likely contains _. [re
Lecture Note 0731_14
Chapter 5 Walking and Rewriting the Trees
1. After AST tree, we need to walk/visit the tree to find out more information (semantic) on the
tree, or reconstruct the tree.
Find out more information: create symbol table
Lecture Note Backtracking_2
Page | 1/4
The heart of backtracking parser lies in its _. (token buffer management)
The buffer must handle an arbitrary amount of _ and support nested _ and _
operations. (lookahead, mark, release
Lecture Note Interpreter, Translator
Chapter 9 Building High-Level Interpreter
1. What we have covered? Validating!
Verify syntax (parser) Follow semantic rule (AST, Walker, Symbol Table, Typing Rule)
2. Now, time to process the input sentence.
Chapter 6 Tracking and identifying program Symbols
Tracking and Identifying Program Symbols
1. Represent Program Symbols
2. Group Program Symbols (scope of symbol)
3. Resolve Program Symbols
1. We now can write _ for input sentence, we
1 Distinguish between the following: i) Plane and Geodetic survey ii) Plan and Map iii) Precision
and accuracy iv) Instrumental error and Personal error
2. Discuss the classification of surveying
3. Explain b