Content deleted Content added
m →top: Tag Bare URL PDFs using AutoWikiBrowser |
m Replaced 1 bare URLs by {{Cite web}}; Replaced "Archived copy" by actual titles |
||
| (One intermediate revision by the same user not shown) | |||
Line 5:
SLR and the more general methods [[LALR parser]] and [[Canonical LR parser]] have identical methods and similar tables at parse time; they differ only in the mathematical grammar analysis algorithms used by the parser generator tool. SLR and LALR generators create tables of identical size and identical parser states. SLR generators accept fewer grammars than LALR generators like [[yacc]] and [[GNU bison|Bison]].{{citation needed|date=November 2024}} Many computer languages don't readily fit the restrictions of SLR, as is. Bending the language's natural grammar into [[SLR grammar]] form requires more compromises and grammar hackery. So LALR generators have become much more widely used than SLR generators, despite being somewhat more complicated tools. SLR methods remain a useful learning step in college classes on compiler theory.{{citation needed|date=November 2024}}
SLR and LALR were both developed by [[Frank DeRemer]] as the first practical uses of [[Donald Knuth]]'s LR parser theory.<ref>{{Cite web| title=Introduction to Computational Linguistics - LR Parsers | url=https://wiki.eecs.yorku.ca/course_archive/2013-14/W/6339/_media/lrk.pdf
== Lookahead sets ==
| |||