LR(0) Parsing (2)

• Principle:
  • shift , in a state where [X = A _ b B] if the next token is b.
  • reduce , in a state [X = A _]
• The resulting parser is called LR(0), since it parses left-to-right, describes a rightmost derivation. The 0 means, that the parser uses no lookahead on the input.