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:

    “Had I but died an hour before this chance
    I had lived a blessed time; for from this instant
    There’s nothing serious in mortality.
    All is but toys. Renown and grace is dead;
    The wine of life is drawn, and the mere lees
    Is left this vault to brag of.”
    —William Shakespeare (1564–1616)