LR Grammar
About LR(1) Grammar
- Not ambiguity.
- May have left recursion.
- May have common left prefixes.
- Can be parsed via shift-reduce technique with a single token of lookahead, i.e. no shift-reduce conflict or reduce-reduce conflicts.
L = Left-to-right scan
R = Right-most parse
For LR(0), SLR, see LR Parsing.