Programming Languages and Compilers WS 2013/14 - Slide 203
Objectives:
Recognize difficult specifications
In the lecture:
Explain
- isolated recognition and encoding of tokens,
- feedback of information,
- unusual notation of keywords,
- separation of tokens in FORTRAN,
Suggested reading:
Kastens / Übersetzerbau, Section 3, 3.3.1
Questions:
- Give examples of context dependent information about tokens, which the lexical analysis can not know.
- Some decisions on the notation of tokens and the syntax of a language may complicate lexical analysis. Give examples.
- Explain the typedef problem in C.
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013