Live briefing
Everything about Recursive descent parser
Top-down parser utilizing recursion
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures where each such procedure implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Recursive descent parserA 5-minute orientation
- Pick up a classic book: Introduction to compiler constructionThe most-reprinted book on the subject
- Read the landmark paper: rdp—an iterator-based recursive descent parser generator with tree promotion operatorsCited 7 times
- Go sideways: Parsing expression grammarA closely related topic
- Go sideways: Top-down parsing languageA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
rdp—an iterator-based recursive descent parser generator with tree promotion operators
Evaluating and Improving Recursive Descent Parsers
An object oriented approach to constructing recursive descent parsers
A note on error recovery in recursive descent parsers
TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator
đź“š Books worth reading
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
- 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…
- Top-down parsing language Top-Down Parsing Language (TDPL) is a type of analytic formal grammar developed by Alexander Birman in the early 1970s in order to study formally the behavior…
- Left recursion In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by…
- Packrat parser The Packrat parser is a type of parser that shares similarities with the recursive descent parser in its construction. However, it differs because it takes…
- 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…
- 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…
- 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…