Reursive descent is debuggable. A grammar rule is a function, which means you can put a breakpoint on a grammar rule, and the backtrace tells you how you got there when you hit it.

Recursive descent carries no tooling dependencies.

Recursive descent is re-entrant, unless you don't know what you're doing.