LR(0) derivation example

Grammar

E -> T
E -> E + T
T -> i
T -> ( E )
T -> i [ E ]

Input

STEP 1

Stack  :

<s0> E -> . E + T E -> . T T -> . ( E ) T -> . i T -> . i [ E ]

Input  : i [ i ]

Action : shift

STEP 2

Stack  :

<s0> E -> . E + T E -> . T T -> . ( E ) T -> . i T -> . i [ E ]

i

Input  : [ i ]

Action : goto

STEP 3

Stack  :

<s0> E -> . E + T E -> . T T -> . ( E ) T -> . i T -> . i [ E ]

i

<s4> T -> i . T -> i . [ E ]

Input  : [ i ]

Action : conflict shift/reduce

Automaton

The example on this page is auto-generated with dOvs teaching LR parser generator tool. The tool and the webpage is maintained by Aslan Askarov.