recursive descent

英語（米国） (en-US) 英語（イギリス） (en-GB)

名詞

不可算名詞

(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.

日本語の意味

再帰下降解析：文脈自由文法の各非終端記号に対して相互に再帰する手続きを用いるトップダウン型パーサー生成手法。文法の構造に沿ったパーサーの実装が特徴。

英語の意味

(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.

このボタンはなに？

While debugging the new compiler, I found that recursive descent made it easier to trace how each non-terminal was handled.

新しいコンパイラをデバッグしているとき、各非終端記号がどのように処理されるかを追跡しやすいので、再帰下降法は便利だと分かった。

詳細

意味（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.