For these reasons, languages generated by tree-adjoining grammars are referred to as 'mildly context-sensitive language's.

There exist several formal definitions of the language generated by a Boolean grammar.

A growing context-sensitive language is a context-sensitive language generated by these grammars.

It can be shown that there does not exist any LL(k)-grammar accepting the language generated by this grammar.

Linguists studying a signing system that spontaneously developed in an isolated Bedouin village say they have captured a new language being generated from scratch.

A linear language is a language generated by some linear grammar.

All languages generated by a regular grammar can be recognized in linear time by a finite state machine.

To show the converse, that every language generated by a Lambek grammar is context-free, is much more difficult.

If p and p are production rules, the language generated by both p and p is their set intersection.

A language generated by some regular tree grammar is called a regular tree language.