To create the SLR parsing tables for a grammar G, we will create the canonical LR(0) collection of the grammar G'. Algorithm : C is { closure({S'→•S}) } repeat the followings until no more set of LR(0) items can be added to C . for each I in C and each grammar symbol X if goto(I,X) is not empty and not in C add goto(I,X) to C goto function is a DFA on the sets in C.