LALR parser generator

A lookahead LR parser (LALR) generator is a software tool that reads a <a href="/facts/Context-free_grammar/yu1FFdK4">context-free grammar</a> (CFG) and creates an <a href="/facts/LALR_parser/4ey0KkTU">LALR parser</a> which is capable of parsing files written in the <a href="/facts/Context-free_language/sHDxB5So">context-free language</a> defined by the CFG. <a href="/facts/LALR_parser/4ey0KkTU">LALR parsers</a> are desirable because they are very fast and small in comparison to other types of parsers.
There are other types of <a href="/facts/Parser_generator/Ud51JPrv">parser generators</a>, such as <a href="/facts/Simple_LR_parser/VaBjqE0y">Simple LR parser</a>, <a href="/facts/LR_parser/bpMod8K0">LR parser</a>, <a href="/facts/GLR_parser/Pn3I1AYt">GLR parser</a>, <a href="/facts/LL_parser/ot65DwYm">LL parser</a> and GLL parser generators. What differentiates one from another is the type of CFG which they are capable of accepting and the type of parsing algorithm which is used in the generated parser. An LALR parser generator accepts an LALR grammar as input and generates a parser that uses an LALR parsing algorithm (which is driven by LALR parser tables).
In practice, LALR offers a good solution, because LALR(1) grammars are more powerful than SLR(1), and can parse most practical LL(1) grammars. LR(1) grammars are more powerful than LALR(1), but ("canonical") LR(1) parsers can be extremely large in size and are considered not practical. Minimal LR(1) parsers are small in size and comparable to LALR(1) parsers.

LALR parser generator open-in-new

LALR parser generator