Left Recursion

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:

    “You got an all-out prize fight, you wait ‘til the fight’s over, one guy’s left standing and that’s how you know who’s won.”
    —David Mamet, U.S. screenwriter, and Brian DePalma. Al Capone (Robert DeNiro)