Live briefing
Everything about Shift-reduce parser
Class of bottom-up parsing methods
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 grammar. The parsing methods most commonly used for parsing programming languages, LR parsing and its variations, are shift-reduce methods. The precedence parsers used before the invention of LR parsing are also shift-reduce methods. All shift-reduce parsers have similar outward effects, in the incremental order in which they build a parse tree or call specific output actions. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Shift-reduce parserA 5-minute orientation
- Pick up a classic book: Principles of compiler designThe most-reprinted book on the subject
- Read the landmark paper: Error repair in shift-reduce parsersCited 12 times
- Go sideways: LR parserA closely related topic
- Go sideways: Canonical LR parserA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Principles of compiler designAlfred V. Aho, Jeffrey D. Ullman · 1977
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…
- 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…
- 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…
- 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…
- Operator-precedence parser In computer science, an operator-precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators…
- Parsing expression grammar In computer science, a parsing expression grammar (PEG) is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of…
- 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…