Difference between revisions of "Bottom-Up Parsing/Exercise 14: LALR(1)"
From Wiki**3
< Bottom-Up Parsing
(Created page with "== Problema == Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: <source lang="text"> A -> M z x | z M x |...") |
(→Solução) |
||
| Line 12: | Line 12: | ||
== Solução == | == Solução == | ||
| + | Na imagem, os conflitos indicados para a regra 2 são para a regra 5. | ||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
[[Image:Mzx1.jpg|768px]] | [[Image:Mzx1.jpg|768px]] | ||
Revision as of 09:29, 25 May 2023
Problema
Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:
A -> M z x | z M x | z x z
M -> y | (eps)
- 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 zyx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
Na imagem, os conflitos indicados para a regra 2 são para a regra 5.
| Solução completa |
|---|
|
|
