Difference between revisions of "Bottom-Up Parsing/Exercise 11: 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: <text> A -> B y y | z z x | x B x B -> z | ε </...") |
(→Solução) |
||
| Line 11: | Line 11: | ||
== Solução == | == Solução == | ||
| + | |||
| + | {{CollapsedCode|Solução completa| | ||
| + | [[Image:Byy.jpg|768px]] | ||
| + | }} | ||
[[category:Compiladores]] | [[category:Compiladores]] | ||
[[category:Ensino]] | [[category:Ensino]] | ||
Revision as of 15:55, 21 April 2016
Problema
Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols: <text> A -> B y y | z z x | x B x B -> z | ε </text>
- 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 xx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
| [Expand] Solução completa |
|---|
