Difference between revisions of "Bottom-Up Parsing/Example 3: SLR(1)"

From Wiki**3

< Bottom-Up Parsing
(Problem)
Line 16: Line 16:
 
== Solution ==
 
== Solution ==
  
[[category:Teaching]]
+
[[category:Compiladores]]
[[category:Compilers]]
+
[[category:Ensino]]

Revision as of 16:27, 6 April 2015

Problem

S -> x A y | x B y | x A z
B -> k
A -> w S | k

Initial symbol: S

Terminals: { k, w, x, y, z }

Input: xwxkyy

Is this an SLR(1) grammar?

Solution