Bottom-Up Parsing/SLR(1) Exercise 03

From Wiki**3

< Bottom-Up Parsing
Revision as of 16:09, 9 February 2015 by Root (talk | contribs)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Problema

Considere a gramática seguinte, onde a e b são símbolos terminais. 

S -> A a A b | B b B a
A -> ε
B -> ε

Demonstre que esta gramática é LL(1), mas não LR(0).

Solução

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Bottom-Up_Parsing/SLR(1)_Exercise_03&oldid=5514"