# LR Grammar > [!info] 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 [[parser#LR Parsing|LR Parsing]].