In the formal language theory of computer science, left recursion is a special case of recursion.
In terms of context-free grammar, a non-terminal r is left-recursive if the left-most symbol in any of r’s ‘alternatives’ either immediately (direct left-recursive) or through some other non-terminal definitions (indirect/hidden left-recursive) rewrites to r again.
Read more about Left Recursion: Definition, Accommodating Left Recursion in Top-down Parsing, Pitfalls
Famous quotes containing the word left:
“I left the woods for as good a reason as I went there. Perhaps it seemed to me that I had several more lives to live, and could not spare any more time for that one.”
—Henry David Thoreau (1817–1862)