Content deleted Content added
m Open access bot: doi updated in citation with #oabot. |
Corrected Richard Bornat's home page URL |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{Refimprove|date=August 2011}}
A '''lookahead LR parser (LALR) generator''' is a software tool that reads a [[
There are other types of [[parser generator]]s, such as [[Simple LR parser]], [[LR parser]], [[GLR parser]], [[LL parser]] and [[GLL parser]] generators. What differentiates one from another is the type of
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.
==History==
Line 34:
{{Reflist}}
* Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. ''[[Compilers: Principles, Techniques, and Tools]]'' Addison—Wesley, 1986. (AKA [[Compilers: Principles, Techniques, and Tools|The Dragon Book]], describes the traditional techniques for building LALR(1) parsers.)
* Richard Bornat ''[[Understanding and Writing Compilers]]'', Macmillan, 1979. (Describes the principles of automated left-to-right parsing and how to construct the parser tables, what a follow set is, etc., ''in English, not mathematics'' – available freely from the author's page at [
==Further reading==
|