Compiler I WS 2001/2002 - Slide 43
Objectives:
Understand transformations and their need
In the lecture:
- Argue why strong LL(1) grammars can not have such productions.
- Show why the transformations remove those problems.
- Replacing left-recursion by right recursion would usually distort the structure.
- There are more general rules for indirect recursion.
- Show EBNF productions in recursive descent parsers.
Questions:
- Apply recursion elimination for expression grammars.
- Write a strong LL(1) expression grammar using EBNF.
©2001 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006