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:

    “Even by noon
    of the very first day,
    she’d etched the wall
    with lines, counting
    he left today,
    he left today,
    he left today.”
    —Hla Stavhana (c. 50 A.D.)