Top-down parsers, including LL parsers and recursive-descent parsers, cannot handle left-recursive production rules directly. This is because left recursion can lead to infinite recursion in the parsing process. To handle left recursion, top-down parsers require grammars to be rewritten to eliminate left recursion, often by transforming them into equivalent non-left-recursive forms.