Recursive descent is a TOP-DOWN parsing strategy. Its main weakness is

1. A LEFT-RECURSIVE rule like $A \to A\alpha \mid \beta$ means the parser, on entering function parseA(), would immediately call parseA() again — infinite recursion. 2. SOLUTION: rewrite as right-recursive. $A \to A\alpha \mid \beta$ becomes $A \to \beta A'$ with $A' \to \alpha A' \mid \varepsilon$. 3. Algebraically equivalent (generates the same language) but no left recursion. 4. Bottom-up parsers (LR) handle left recursion natively, but recursive descent (top-down) cannot. 5. Option A is also a problem but not unique to recursive descent. Options C, D are wrong. _Source: Bob Nystrom, "Crafting Interpreters", Ch 6.2 (Limitations of recursive descent)._