Left recursion occurs in a grammar when a non-terminal symbol can be rewritten in such a way that it eventually leads back to itself on the left side of a production rule, causing issues in top-down parsers like recursive descent parsers. To handle left recursion, grammars often need to be transformed into an equivalent form that eliminates the left-recursive structures, enabling efficient parsing.