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.

Translations

Translations

• Chinese:

  Mandarin: 递归下降

• Japanese: 再帰下降
• Thai: please add this translation if you can
• Vietnamese: please add this translation if you can

See also

• predictive parser