 Type-2 grammars generate the context-free languages.These are defined by rules of the form formula_12 with formula_3 being a nonterminal and formula_4 being a string of terminals and/or nonterminals.These languages are exactly all languages that can be recognized by a non-deterministic pushdown automaton.