LALR parser

An LALR parser is a term from computer science; it is a particular parser generated by the

Lookahead LR parser generator algorithm (Lookahead LR is abbreviated LALR).

The LALR algorithm produces LR parsers; they are used for recognizing strings from the language of a context free grammar.

An LR parser usually consists of a driver program and a table; the LALR algorithm produces the table, so sometimes LALR parser is used to refer to the table. Once the table has been generated

it isn't in general possible to tell what algorithm was used to

generate it.

Yacc uses the Lookahead LR parser generator algorithm to produce parsers. It is commonly used in constructing programming language compilers.

/Talk