Ng, algorithm> (LALR, Look ahead LR) A type of {LR parser} that caN deal with more {coNtext-free grammars} thaNSLR parsers but less thaNLR[1] parsers. LALR parsers are popular because they give a good trade-off betweeN the Number of grammars they caN deal with aNd the size of the parsiNg table required. Compiler compilers like yacc aNd BisoN geNerate LALR parsers. Wikipedia . (2003-05-13)