Talk:Deterministic context-free grammar

{{WikiProject banner shell|class=Start|1=

{{WikiProject Computer science |importance=Low}}

{{WikiProject Philosophy|importance=low|logic=yes}}

}}

Reworking the page

I'm considering fleshing out this stub. I'm planning on adding a formal definition, more background, and a few more examples.

Also, the history and current use of deterministic context-free grammars would be nice. Any comments or ideas? Stratsve (talk) 05:08, 25 February 2008 (UTC)

Yes, also these are exactly the well known LR grammars. —Preceding unsigned comment added by 186.124.33.244 (talk) 13:50, 1 October 2009 (UTC)

:I wouldn't mind seeing an example of a grammar that is context-free but not deterministic-context-free. --Doradus (talk) 14:17, 10 November 2009 (UTC)

This article has serious correctness issues

See recent discussion [http://cstheory.stackexchange.com/questions/22664] at the CS stack exchange.

PhS (talk) 13:31, 25 May 2014 (UTC)