Everything about Recursive descent parser

🧭 Start here: a 6-step reading path

1. Read the overview: Recursive descent parserA 5-minute orientation
2. Go sideways: Parsing expression grammarA closely related topic
3. Go sideways: Top-down parsing languageA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 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…