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:

    Were she to lose her love, because she had lost
    Her confidence in mine, or even lose
    Its first simplicity, love, voice and all,
    All my fine feathers would be plucked away
    And I left shivering.
    William Butler Yeats (1865–1939)