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