Another more obvious meaning would be for recursive instead of recursively enumerable languages. The current def is not actually cited. JMP EAX (talk) 09:23, 17
| This article was nominated for deletion on 29 March 2013 (UTC). The result of the discussion was speedy keep. |
| This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||
Another more obvious meaning would be for recursive instead of recursively enumerable languages. The current def is not actually cited. JMP EAX (talk) 09:23, 17 August 2014 (UTC)
What does it mean "if it contains production rules that are recursive"? Is S -> aSa recursive? Perhaps so. What about the grammar with two rules A -> aB and B -> Aa? JMP EAX (talk) 09:38, 17 August 2014 (UTC)
Also, the concept of leftmost derivation is not well defined above CFGs. JMP EAX (talk) 09:33, 17 August 2014 (UTC)
I see the this is another article "saved" at AfD by doing partial string matches versus random sources. JMP EAX (talk) 10:13, 17 August 2014 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.