 Note that this is different from the recursive languages, which can be "decided" by an always-halting Turing machine.Type-1 grammars generate context-sensitive languages.These grammars have rules of the form formula_2 with formula_3 a nonterminal and formula_4, formula_5 and formula_6 strings of terminals and/or nonterminals.