may be applied recursively.

Complexity and application

For every context-free grammar, a tree-adjoining grammar can be generated which accepts the same string-language. Thus, TAGs can generate all context-free languages; they can generate, as well, some--but not all--context-sensitive languages.

Two examples of context-sensitive/non-context-free languages that TAGs (with adjunction