RECURSIVE DESCENT parsers translate each grammar rule into

1. RECURSIVE DESCENT: top-down parser, written by hand or generated. 2. Each non-terminal in the grammar becomes one PARSING FUNCTION. 3. The function body matches the grammar rule's structure: - Sequence A B → function calls parseA() then parseB() - Alternative A | B → if/else looking at current token - Repetition A* → while loop 4. The grammar reads almost directly from the parser code — makes recursive descent EASY TO WRITE and DEBUG. 5. Other options misdescribe the technique. _Source: Bob Nystrom, "Crafting Interpreters", Ch 6.2 (Recursive Descent Parsing — overview)._