Talk:Deterministic context-free language

From Wikipedia, the free encyclopedia

	Philosophy Portal This article is within the scope of the WikiProject Philosophy, which collaborates on articles related to philosophy. To participate, you can edit this article or visit the project page for more details.
Stub	This article has been rated as Stub-Class on the quality scale.
???	This article has not yet received an importance rating on the importance scale.
Additional information: Related task forces (core areas): Logic

I believe this is equivalent to the set of non-ambiguous context-free grammars? If it is then this would be useful to include on this page.

Not that simple. All DCFLs have unambiguous CFGs, but is a proper subset. Per Hopcroft, Motwani & ullman, Intro automata theory, languages and computation, 2nd edition. Added to article. (See example of unambig CFG that is not DCFG now in article). RJFJR 00:08, 12 April 2007 (UTC)

Removed the word "obviously" because I honestly can't see why that CFG is not a DCFG. Rhebus 15:23, 6 June 2007 (UTC)