Bottom-Up Parsing/Exercise 13: LALR(1)
From Wiki**3
< Bottom-Up Parsing
Problema
Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:
A → A B A x | A y | z
B → x | z B
- Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
- Compact the parse table, eliminating and propagating reductions.
- Show the parsing process for input zzxzyx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
| Solução completa |
|---|
|
|
