Recursive grammar
In formal language theory, an unrestricted grammar is a formal grammar on which one restrictions are made on the left or right sides of the grammar's productions. This is the second most general class of grammars in the Chomsky–Schützenberger hierarchy, and can generate arbitrary recursive languages.