Construct LALR parse table

. Construct C={I₀ , .. ,I_n } set of LR(1) items

. For each core present in LR(1) items find all sets having the same core and replace these sets by their union

. Let C' = {J₀ , .. .,J_m } be the resulting set of items

. Construct action table as was done earlier

. Let J = I₁ U I₂ .. .U I_k

since I ₁ , I₂ .. ., I_k have same core, goto(J,X) will have he same core

Let K=goto(I₁ ,X) U goto(I₂ ,X) .. goto(I_k ,X) the goto(J,X)=K

The construction rules for LALR parse table are similar to construction of LR(1) parse table.