Recursive Descent Parser can have backtracking. It is the most primitive level top down approach of parsing. It usually does backtracking and applies brute force to evaluate the grammar. Moreover, we have something called Predictive Parser, which is a more sophisticated way of using top down parsing approach, which doesn't need backtracking. LL(1) is one of the kind of predictive parser.
Image Source :- The Dragon Book.