Recursive-descent parsers turn the nonterminals into a group of mutually recursive procedures whose actions are based on the right-hand side of the BNFs.

Question

Quizplus · Accepted Answer

Recursive-descent parsers are a class of top-down parsers that work based on the mutually recursive procedures that correspond with the nonterminals of a BNF. Each procedure validates a specific part of the input string by calling other procedures recursively until a complete parse tree is constructed or an error is detected. Therefore, the statement is true.

Recursive-Descent Parsers Turn the Nonterminals into a Group of Mutually