Simple LR parser: Difference between revisions

Revision as of 23:21, 5 November 2012

Revision as of 02:07, 13 December 2012

Line 1:

{{norefs|date=December 2012}}

In [[computer science]], a '''Simple LR''' or '''SLR parser''' is a type of [[LR parser]] with small [[parse table]]s and a relatively simple parser generator algorithm. As with other types of LR(1) parser, an SLR parser is quite efficient at finding the single correct [[bottom-up parsing|bottom-up parse]] in a single left-to-right scan over the input stream, without guesswork or backtracking. The parser is mechanically generated from a formal grammar for the language.