Programming Languages and Compilers WS 2013/14 - Slide 210
Objectives:
Understand the consequences of the rule
In the lecture:
- Discuss examples for the rule of the longest match.
- Discuss different cases of token separation.
Suggested reading:
Kastens / Übersetzerbau, Section 3.2
Questions:
- Point out applications of the rule in the Lax automaton, which arose from the composition of sub-automata.
- Which tokens have to be separated by white space?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013