recursive descent
Jump to navigation
Jump to search
English[edit]
Noun[edit]
recursive descent (uncountable)
- (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.