Skip to content

Left recursion

Special case of recursion, which is problematic for some parsers (parsing algorithms), for example, PEG.

Happens if grammar has rules like this:

S→SaS \rightarrow Sa