Table of Contents

About

LR is a type of parser that build the tree from the leaves (bottom-up).

The inverse (top down) is called a LL parser.

LR(k) means: Left to right, Rightmost derivation parser.

LR(k), is:

  • a bottom-up parser
  • that parses from left to right
  • and constructs a rightmost derivation of the input.

LALR

LALR parser[a] or Look-Ahead LR parser