S' -> S új
S -> T | S + T
T -> F | T * F
F -> i | ( S )

állapot     action          S   T   F   +   *   i   (   )
0           lépés           1   2   3
1
2           redukál S->T
3           redukál T->F
4


I0= closure([S'->.S])=[S'->.S],
                      [S->.T],[S->.S+T],
                      [T->.F],[T->.T*F],
                      [F->.i],[F->.(S)]
I1= read(I0, S)=[S'->S.],[S->S.+T]
I2= read(I0, T)=[S->T.],[T->T.*F]
I3= read(I0, F)=[T->F.]
I4= read(I0, i)=[F->i.]
I5= read(I0, ( )=   [F->(.S)],
                    [S->.T],[S->.S+T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I6= read(I1, + ) =  [S->S+.T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I7= read(I2, * ) =  [T->T*.F]
                    [F->.i],[F->.(S)]
I8= read(I5, S ) =  [F->(S.)],[S->S.+T]
I2= read(I5, T ) =  [S->T.],[T->T.*F]
I3= read(I5, F ) =  [T->F.]
I4= read(I5, i ) =  [F->i.]
I5= read(I5, ( ) =  [F->(.S)],
                    [S->.T],[S->.S+T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I9= read(I6, T ) =  [S->S+T.],[T->T.*F]
I3= read(I6, F ) =  [T->F.]
I4= read(I6, i ) =  [F->i.]
I5= read(I6, ( ) =  [F->(.S)],
                    [S->.T],[S->.S+T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I10=read(I7, F ) =  [T->T*F.]
I4= read(I7, i ) =  [F->i.]
I5= read(I7, ( ) =  [F->(.S)],
                    [S->.T],[S->.S+T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I11=read(I8, ) ) =  [F->(S).]
I6= read(I8, + ) =  [S->S+.T],
                    [T->.F],[T->.T*F],
                    [F->.i],[F->.(S)]
I7= read(I9, * ) =  [T->T*.F]
                    [F->.i],[F->.(S)]