Say I have the following grammar:
E -> TE' E' -> +TE'| -TE' | λ T -> (E) | id
I need to build the finite state machine with the LR(0) items,
But I know in order to do this I have to remove the λ.
How to I accomplish this ?
Also, after I have the SLR(1) table, how to I prove is valid ?
Thanks, I'm studying for an exam, and I'm stuck here :(