Bottom-Up Parsing/Example 3: SLR(1)

From Wiki**3

< Bottom-Up Parsing
Revision as of 15:18, 16 May 2011 by Root (talk | contribs) (→‎Problem)

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

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