Simple LR parser: Difference between revisions

Revision as of 15:09, 6 November 2024

Revision as of 15:19, 6 November 2024

Line 1:

{{unreferencedmore citations needed|date=DecemberNovember 20122024}}

In [[computer science]], a '''Simple LR''' or '''SLR parser''' is a type of [[LR parser]] with small [[LR parser#Constructing LR(0) parsing tables|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.