Right Recursive Grammar

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

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