 Type-0 grammars include all formal grammars.They generate exactly all languages that can be recognized by a Turing machine.These languages are also known as the "recursively enumerable" or "Turing-recognizable" languages.