Talk:Deterministic context-free grammar
This article has serious correctness issues
| ← Previous revision | Revision as of 06:10, 24 April 2026 | ||
| Line 18: | Line 18: | ||
: Confirmed. "Deterministic Context-Free ''Grammar''" is not a well-defined term. What however '''is''' well-defined is "a [[DCFL|Deterministic Context-Free ''Language'']]". But there is already an article on that! This article might need to be '''deleted'''. --[[User:Svennik|Svennik]] ([[User talk:Svennik|talk]]) 18:03, 29 March 2026 (UTC) |
: Confirmed. "Deterministic Context-Free ''Grammar''" is not a well-defined term. What however '''is''' well-defined is "a [[DCFL|Deterministic Context-Free ''Language'']]". But there is already an article on that! This article might need to be '''deleted'''. --[[User:Svennik|Svennik]] ([[User talk:Svennik|talk]]) 18:03, 29 March 2026 (UTC) |
||
: I agree that the page can be deleted. Note however that algorithms on compressed words often describe the SLP model as "acyclic deterministic CFG", where they use deterministic to mean that there is exactly one rule for each non-terminal. In effect, a SLP is a grammar that defines a singleton language. [[User:PhS|PhS]] ([[User talk:PhS|talk]]) 06:10, 24 April 2026 (UTC) |
|||
== External links modified == |
== External links modified == |
||
