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:
LALR parser[a] or Look-Ahead LR parser