(→Solução) |
(→Problema) |
||
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 → X Y c | X a | a |
− | Y | + | Y → a | b |
</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. |
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
Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho).
Solução completa |
---|