Left Recursive Grammar

A Regular Grammar wherein the starting grammar has a non-terminal as the left-most symbol in the string.

<S> ::= <T> a b
<T> ::= a | <T> b