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 was curious, I was avid to know only what I found more real than myself, that which allowed me to glimpse the thoughts of a great genius, or the force or grace of nature left to its own devices, without the intervention of man.”
—Marcel Proust (1871–1922)