 In addition, Minimal LR(1) parsers can use shift-reduce actions, which makes them faster than Canonical LR(1) parsers.The LR(1) parser is a deterministic automaton and as such its operation is based on static state transition tables.These codify the grammar of the language it recognizes and are typically called "parsing tables".