Difference between revisions of "Bottom-Up Parsing/Exercise 16: 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 -> a | c R ->...") |
(→Problema) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 3: | Line 3: | ||
Consider the following grammar, where '''R''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: | Consider the following grammar, where '''R''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: | ||
<source lang="text"> | <source lang="text"> | ||
| − | X | + | X → a | c |
| − | R | + | R → R X b | R a | a |
</source> | </source> | ||
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. | # Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. | ||
| Line 11: | Line 11: | ||
== Solução == | == Solução == | ||
| + | Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho). | ||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
Latest revision as of 11:44, 2 May 2024
Problema
Consider the following grammar, where R is the initial symbol and { a, b, c } is the set of terminal symbols:
X → a | c
R → R X b | R a | a
- 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(1) e LALR(1) (a vermelho).
| Solução completa |
|---|
|
|
