(→Solução) |
(→Problema) |
||
Line 3: | Line 3: | ||
Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | ||
<source lang="text"> | <source lang="text"> | ||
− | A | + | A → M z x | z M x | z x z |
− | M | + | M → y | ε |
</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 A is the initial symbol and { x, y, z } is the set of terminal symbols:
A → M z x | z M x | z x z
M → y | ε
Na imagem, os conflitos indicados para a regra 2 são para a regra 5.
Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho).
Solução completa |
---|