Bottom-Up Parsing/Example 2: SLR(1): Difference between revisions

From Wiki**3

< Bottom-Up Parsing
No edit summary
Line 8: Line 8:


Terminals: { 0, 1, 2 }
Terminals: { 0, 1, 2 }
Input: 112110


== Solution ==
== Solution ==

Revision as of 15:15, 16 May 2011

Problem

S -> 1 S 1 | 1 X 0 | 2
X -> 2 | S 1 | X 2

Initial symbol: S

Terminals: { 0, 1, 2 }

Input: 112110

Solution