Construct SLR parse table

. Construct C={I₀ , . , I_n } the collection of sets of LR(0) items

. If A α .a ß is in I_i and goto(I_i , a) = I_j then action[i,a] = shift j

. If A a . is in I_i

then action[i,a] = reduce A a for all a in follow(A)

. If S' S. is in I_i then action[i,$] = accept

. If goto(I i ,A) = I_j then goto[i,A]=j for all non terminals A

. All entries not defined are errors

The SLR parse table is constructed for parser states (I₀ to I_n ) against terminal and non terminal symbols . For terminals, entries are referred as 'action' for that state and terminal, while for non terminal, entries are 'goto' for state and non terminal. The way entries are filled is :

. If A α .a ß is in I_i and goto(I_i , a) = I _j where a is a terminal then action[i, a] = shift j.

. If A α . is in I_i where a is a string of terminals and non terminals then action[i, b] = reduce A a for all b in follow(A).

. If S' S. is in I_i where S' is symbol introduced for augmenting the grammar then action[i, $] = accept.

. If goto(I_i , A) = I_j where A is a non terminal then goto[i, A] = j.

. The entries which are not filled are errors.