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:
“If you’re going to burn, burn.
If you’re going to boil, boil
and if you’re breaking, O Heart,
go ahead and break,
for I’ve just left him,
that no-good man.”
—Hla Stavhana (c. 50 A.D.)
Related Phrases
Related Words