Live briefing
Everything about Simple LR parser
Computer mechanic
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 other types of LR(1) parser, an SLR parser is quite efficient at finding the single correct 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Simple LR parserA 5-minute orientation
- Skim a recent paper: A Simple Resume Parser used for Extracting Information from ResumesInfluential work since 2022
- Pick up a classic book: Principles of compiler designThe most-reprinted book on the subject
- Read the landmark paper: An experimental comparison of deductive and inductive feedback generated by a simple parserCited 15 times
- Go sideways: LR parserA closely related topic
- Go sideways: SLR grammarA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
An experimental comparison of deductive and inductive feedback generated by a simple parser
A Simple, Possibly Correct LR Parser for C11
A cognitive interactionist sentence parser with simple recurrent networks
A simple realization of LR-parsers for regular right part grammars
A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers
The simple and powerful yfx operator precedence parser
A Simple Command Line Argument Parser
A SIMPLE UNIVERSAL PARSER BASED ON FUNCTIONAL PROGRAMMING
🆕 Influential since 2022
📚 Books worth reading
Principles of compiler designAlfred V. Aho, Jeffrey D. Ullman · 1977
Introduction to compiler constructionParsons, Thomas W. · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- LR parser 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…
- 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)…
- 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…
- 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…
- 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…
- 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…
- 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…
- 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…