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:

    Individuality is the aim of political liberty. By leaving to the citizen as much freedom of action and of being, as comports with order and the rights of others, the institutions render him truly a freeman. He is left to pursue his means of happiness in his own manner.
    James Fenimore Cooper (1789–1851)