Consider the following augmented grammar, which is to be parsed with a SLR…

Key idea: compute GOTO(I0, S) by advancing the dot over S in all items of I0 that have • before S, then take the closure of the resulting items.

• Start: I0 contains all items with the dot at the beginning for S and for any nonterminal immediately after a dot. Concretely I0 includes:

  • S' → • S

  • S → • S S

  • S → • A a

  • S → • b A c

  • S → • B c

  • S → • b B a

  • A → • d #

  • B → • @

• Advance the dot for symbols with • before S in I0 (those are S' → • S and S → • S S). The kernel of GOTO(I0, S) is:

  • S' → S •

  • S → S • S

• Take the closure: because S → S • S has • before S, include all S-productions with • at start, and then include A and B productions reached from those. The closure adds:

  • S → • S S

  • S → • A a

  • S → • b A c

  • S → • B c

  • S → • b B a

  • A → • d #

  • B → • @

• Counting all distinct items (the two kernel items plus the seven closure items) gives a total of 9 items in GOTO(I0, S).