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

From Wiki**3

< Bottom-Up Parsing

Problem

Initial symbol: S

Terminals: { 0, 1, 2 }

Input: 112110 

S → 1 S 1 | 1 X 0 | 2
X → 2 | S 1 | X 2

Is this an LR(0) grammar?

Describe the processing of the input by an LALR(1) parser for this grammar.

Solution

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