Example
The figure shows the finite automaton containing different parser states viz. I0 to In and possible transitions between them on seeing a non- terminal symbol i.e., from set of LR(0) items, for every item goto(I i , x) = Ij where x is a non-terminal, we have a transition from Ii to Ij on 'x'.
