Difference between revisions of "Bottom-Up Parsing/Exercise 17: LALR(1)"
From Wiki**3
< Bottom-Up Parsing
(Created page with "== Problema == Consider the following grammar, where '''R''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: <source lang="text"> X -> X Y c | X...") |
(→Solução) |
||
| Line 13: | Line 13: | ||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
| − | [[Image: | + | [[Image:XYc.jpg|768px]] |
| − | |||
}} | }} | ||
[[category:Compiladores]] | [[category:Compiladores]] | ||
[[category: Ensino]] | [[category: Ensino]] | ||
Revision as of 19:27, 24 May 2023
Problema
Consider the following grammar, where R is the initial symbol and { a, b, c } is the set of terminal symbols:
X -> X Y c | X a | a
Y -> a | 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 aabc (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
| Solução completa |
|---|
|
|
