LALR parser generator: Difference between revisions

Content deleted Content added
Transfer parser-generator-relative info from Advantages-Disadvantages list of "LALR parser" article
Line 10:
Frank DeRemer invented LALR parsers with his PhD dissertation, called "Practical LR(k) Translators", in 1969, at MIT. This was an important breakthrough, because LR(k) translators, as defined by [[Donald Knuth]] in his 1965 paper, "On the Translation of Languages from Left to Right", were much too large for implementation on computer systems in the 1960s and 70's.
 
An early LALR parser generator and probably the most popular one for many years was "[[yacc]]" (Yet Another Compiler Compiler), created by Stephen Johnson in 1975 at AT&T Labs.<ref>{{Citecite web
|title=Yacc: Yet Another Compiler-Compiler
|author=Stephen C. Johnson
Line 44:
== References ==
{{Reflist}}
* Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. ''[[Compilers: Principles, Techniques, and Tools]]'' Addison—Wesley, 1986. (AKA [[DragonCompilers: BookPrinciples, 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 [http://www.cs.mdx.ac.uk/staffpages/r_bornat/#vanitypublishing].)