(→Problema) |
(→Problema) |
||
Line 1: | Line 1: | ||
== Problema == | == Problema == | ||
− | Consider the following grammar, where ''' | + | Consider the following grammar, where '''X''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: |
<source lang="text"> | <source lang="text"> | ||
X → X Y c | X a | a | X → X Y c | X a | a |
Consider the following grammar, where X 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 |
---|