Bottom-Up Parsing/Exercise 9: LALR(1)
From Wiki**3
< Bottom-Up Parsing
Problema
Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:
E → [ E ; L ] | id
L → E | E ; L
- Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
- Show the parsing process for input [id;id;id] (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
- Is this an LL(1) grammar? Why?
Solução
| [Expand] Solução completa |
|---|
