Formalisms
Some attempts at creating mildly context-sensitive language formalisms include:
- Linear context-free rewriting systems developed by D. J. Weir
- Minimalist grammars of Edward P. Stabler, Alain Lecomte, Christian Retoré, etc.
- Multicomponent tree-adjoining grammars (defined in ).
- Multiple context free grammars, developed in.
- Simple range concatenation grammars, developed by Boullier, 2000.
-
- Head grammars of Carl Pollard
- Combinatory categorial grammars developed by Mark Steedman
- Linear indexed grammars defined by Gerald Gazdar
- Tree-adjoining grammars developed by Aravind Joshi
The first grouping of these grammar classes define one set of languages, while the second grouping defines another strictly smaller class. The larger of the two classes may be parsed by thread automatons, while the other, smaller one may be parsed by embedded pushdown automatons.
Read more about this topic: Mildly Context-sensitive Language