An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion, which will decide whether or not to retain it. Feel free to improve the article, but do not remove this notice before the discussion is closed. For more information, see the guide to deletion. Find sources: "Recursive grammar" – news · newspapers · books · scholar · JSTOR%5B%5BWikipedia%3AArticles+for+deletion%2FRecursive+grammar%5D%5DAFD |
In formal language theory, an Recursive grammar is a formal grammar on which one restrictions are made on the left or right sides of the grammar's productions. This is the second most general class of grammars in the Chomsky–Schützenberger hierarchy, and can generate arbitrary recursive languages.
| |||||||||
Each category of languages, except those marked by a *, is a proper subset of the category directly above it. Any language in each category is generated by a grammar and by an automaton in the category in the same line. | |||||||||
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |
