Recursive-descent parsing is a top-down method of syntax
analysis in which
a set of recursive procedures is used to process the input. One procedure is
associated with each nonterminal of a grammar. Here, we consider a simple
of recursive-descent parsing, called predictive parsing, in which the
symbol unambiguously determines the flow of control through the procedure
body for each nonterminal. The sequence of procedure calls during the
of an input string implicitly defines a parse tree for the input, and can be used
to build an explicit parse tree, if desired.
The goal of predictive parsing is to construct a top-down parser
that never backtracks. To do so, we must transform a grammar
in two ways:
eliminate left recursion, and
perform left factoring.
These rules eliminate most common causes for backtracking
although they do not guarantee a completely backtrack-free
parsing (called LL(1) as we will see later).
• no backtracking
• needs a special form of grammars (LL(1) grammars).
• Recursive Predictive Parsing is a special form of
Recursive Descent parsing
• Non-Recursive (Table Driven) Predictive Parser is also
known as LL(1)
A special case of recursive-descent parsing that does
not require backtracking
• Must always know which production to use based on
current input symbol
• Can often create appropriate grammar:
– removing left-recursion
– left factoring the resulting grammar