L
- Instance of
- Subclass of
Overview
All data
7 statements · 29% with external sources · numbers in brackets are citations
On other databases
5 identifiers linking LR parser across the web's reference databases
7 statements · 29% with external sources · numbers in brackets are citations
5 identifiers linking LR parser across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants of LR parsers: SLR parsers, LALR parsers, canonical LR(1) parsers, minimal LR(1) parsers, and generalized LR parsers. LR parsers can be generated by a parser generator from a formal grammar defining the syntax of the language to be parsed. They are widely used for the processing of computer languages.