I’m not a big expert, but that’s what the original article or Wikipedia page says. Classical parser combinators are top-down parsers for LL(k) grammars, using the same strategy as recursive descent.
As an example, I have written a super toy JSON parser that uses the recursive descent method. It can be ported 1 to 1 to a monadic version that uses the same parsing strategy.