recursive descent

English

Noun

recursive descent (uncountable)

1. (computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar.

See also

• predictive parser