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:
“There are great advantages to seeing yourself as an accident created by amateur parents as they practiced. You then have been left in an imperfect state and the rest is up to you. Only the most pitifully inept child requires perfection from parents.”
—Frank Pittman (20th century)