Left-recursive grammar is a type of context-free grammar where one or more productions have a non-terminal symbol that can be rewritten as itself, potentially causing infinite recursion in top-down parsers. This issue is typically resolved by transforming the grammar to eliminate left recursion, enabling efficient parsing by algorithms like LL parsers.