Left recursion is a concept in formal grammar, particularly in the context of context-free grammars used in programming languages and compilers. A grammar is said to be left recursive if it has a production rule where a non-terminal symbol on the left-hand side eventually derives itself again on the left-hand side of the same production. This creates the potential for infinite recursion during parsing, as the parser can keep calling the same rule without making any progress.
New to topics? Read the docs here!