Live briefing
Everything about LR parser
Type of parser in computer science
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: LR parserA 5-minute orientation
- Skim a recent paper: DPAM : A domain parser for AlphaFold modelsInfluential work since 2022
- Pick up a classic book: Languages and machinesThe most-reprinted book on the subject
- Read the landmark paper: ACPYPE - AnteChamber PYthon Parser interfacECited 3,001 times
- Go sideways: SLR grammarA closely related topic
- Go sideways: Simple LR parserA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
ACPYPE - AnteChamber PYthon Parser interfacE
ANTLR: A predicated‐ LL ( k ) parser generator
PARSER: A Model for Word Segmentation
PDB file parser and structure class implemented in Python
Poly peak parser: Method and software for identification of unknown indels using sanger sequencing of polymerase chain reaction products
COD::CIF::Parser : an error-correcting CIF parser for the Perl language
Successive cyclicity in the grammar and the parser
Parser for protein folding units
🆕 Influential since 2022
📚 Books worth reading
Languages and machinesThomas A. Sudkamp · 1988
Principles of compiler designAlfred V. Aho, Jeffrey D. Ullman · 1977
Syntactic error recovery for LR parsersJohn Arthur Modry · 1976- 📕Automatic error recovery for LR parsers in theory and practiceJulia Anne Dain · 1989
- 📕Empirical comparison of LR(k) and precedence parsersJ. J. Herning · 1971
- 📕On the reduced matrix representation of LR(k) parser tablesMarc Louis Joliat · 1973
- 📕Incremental LR(1) Parser construction as an aid to syntactical extensibilityGeorg Fischer · 1980
- 📕The SAGA editorPeter Andre Christopher Kirslis · 1986
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- SLR grammar SLR grammars are the class of formal grammars accepted by a Simple LR parser. SLR grammars are a superset of all LR(0) grammars and a subset of all LALR(1)…
- Simple LR parser In computer science, a Simple LR or SLR parser is a type of LR parser with small parse tables and a relatively simple parser generator algorithm. As with…
- Canonical LR parser A canonical LR parser (also called a LR(1) parser) is a type of bottom-up parsing algorithm used in computer science to analyze and process programming…
- Shift-reduce parser A shift-reduce parser is a class of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by a…
- LALR parser An LALR parser (look-ahead, left-to-right, rightmost derivation parser) is a type of parser for computer languages. It is a simplified version of a canonical…
- LL parser In computer science, an LL parser is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost…
- LALR parser generator A lookahead LR parser (LALR) generator is a software tool that reads a context-free grammar (CFG) and creates an LALR parser which is capable of parsing…
- Parsing Parsing, syntax analysis, or syntactic analysis is a process of analyzing a string of symbols, either in natural language, computer languages or data structures…