Bottom-Up Parsing/Exercise 15: LALR(1): Difference between revisions
From Wiki**3
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 -> A M | z R -> x |..." |
|||
| Line 12: | Line 12: | ||
== Solução == | == Solução == | ||
Note-se que a solução apresentada é para SLR(0) e LALR(1) (a vermelho). | |||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
Revision as of 14:04, 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 -> A M | z
R -> x | z
M -> R y | z
- 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 zzxy (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
Note-se que a solução apresentada é para SLR(0) e LALR(1) (a vermelho).
| Solução completa |
|---|
|
Error creating thumbnail: File missing Error creating thumbnail: File missing |
