This article is missing information about context for lay readers (How is this class related to natural languages? Are there any applications? When were they first described?).April 2019)(
In formal language theory, the class of unrestricted grammars (also called semi-Thue, type 0, or phrase structure grammars by some authors) is the most general class of grammars in the Chomsky–Schützenberger hierarchy. On the productions of an unrestricted grammar, no other restrictions are made than each of their left-hand sides being non-empty.:220 This grammar class can generate arbitrary recursively enumerable languages.
An unrestricted grammar is a formal grammar , where is a set of nonterminal symbols, is a set of terminal symbols, and are disjoint,[note 1] is a set of production rules of the form where and are strings of symbols in and is not the empty string, and is a specially designated start symbol.:220 As the name implies, there are no real restrictions on the types of production rules that unrestricted grammars can have.[clarification needed]
Equivalence to Turing machines
The unrestricted grammars characterize the recursively enumerable languages. This is the same as saying that for every unrestricted grammar there exists some Turing machine capable of recognizing and vice versa. Given an unrestricted grammar, such a Turing machine is simple enough to construct, as a two-tape nondeterministic Turing machine.:221 The first tape contains the input word to be tested, and the second tape is used by the machine to generate sentential forms from . The Turing machine then does the following:
- Start at the left of the second tape and repeatedly choose to move right or select the current position on the tape.
- Nondeterministically choose a production from the productions in .
- If appears at some position on the second tape, replace by at that point, possibly shifting the symbols on the tape left or right depending on the relative lengths of and (e.g. if is longer than , shift the tape symbols left).
- Compare the resulting sentential form on tape 2 to the word on tape 1. If they match, then the Turing machine accepts the word. If they don't, the Turing machine will go back to step 1.
It is easy to see that this Turing machine will generate all and only the sentential forms of on its second tape after the last step is executed an arbitrary number of times, thus the language must be recursively enumerable.
The reverse construction is also possible. Given some Turing machine, it is possible to create an equivalent unrestricted grammar:222 which even uses only productions with one or more non-terminal symbols on their left-hand sides. Therefore, an arbitrary unrestricted grammar can always be equivalently converted to obey the latter form, by converting it to a Turing machine and back again. Some authors use the latter form as definition of unrestricted grammar.
The decision problem of whether a given string can be generated by a given unrestricted grammar is equivalent to the problem of whether it can be accepted by the Turing machine equivalent to the grammar. The latter problem is called the Halting problem and is undecidable.
The equivalence of unrestricted grammars to Turing machines implies the existence of a universal unrestricted grammar, a grammar capable of accepting any other unrestricted grammar's language given a description of the language. For this reason, it is theoretically possible to build a programming language based on unrestricted grammars (e.g. Thue).
- Lambda calculus
- Semi-Thue system — doesn't distinguish terminal and nonterminal symbols, admits empty left-hand sides
- Actually, this is not strictly necessary since unrestricted grammars make no real distinction between the two. The designation exists purely so that one knows when to stop generating sentential forms of the grammar; more precisely, the language recognized by is restricted to strings of nonterminal symbols
- Hopcroft, John; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-44124-1.