 Refinements to the LR(0) table construction procedure (such as SLR and LALR) are capable of constructing reduce actions that do not occupy entire rows.Therefore, they are capable of parsing more grammars than LR(0) parsers.The automaton is constructed in such a way that it is guaranteed to be deterministic.