In formal language theory, weak equivalence of two grammars means they generate the same set of strings, i.e. that the formal language they generate is the same. In compiler theory the notion is distinguished from strong (or structural) equivalence, which additionally means that the two parse trees are reasonably similar in that the same semantic interpretation can be assigned to both.
Vijay-Shanker and Weir (1994) demonstrates that linear indexed grammars, combinatory categorial grammars, tree-adjoining grammars, and head grammars are weakly equivalent formalisms, in that they all define the same string languages.