' A rule whose result symbol is also its first component symbol; for example, ` expseq1 : expseq1 ',' exp;'. See Recursion.

The condition in which the definition of a symbol begins with the same symbol.

Left recursion is defined in a grammar by a rule that contains the head symbol as the first tail symbol. Left recursion is the desired way to specify repetition in an LALR grammar. For example: IdentifierList - identifier - IdentifierList ',' identifier