|
In computer science, left recursion is a special case of recursion.
A formal grammar that comprises left recursion cannot be parsed by a recursive descent parser.
Examples
The BNF grammar
- <E> ::= <E> "+" <T> | <E> "-" <T>
is a left-recursive grammar.
See also
|
