Bottom-Up Parsing/SLR(1) Exercise 03: Difference between revisions

From Wiki**3

< Bottom-Up Parsing
No edit summary
 
Line 1: Line 1:
== Problema ==
#REDIRECT [[ist:Bottom-Up Parsing/SLR(1) Exercise 03]]
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 ==
 
[[category:Compiladores]]
[[category:Ensino]]

Latest revision as of 18:02, 6 December 2018

Redirect to:

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Bottom-Up_Parsing/SLR(1)_Exercise_03&oldid=11055"