Original research on CFG dependency graphs and recursive, reachable, productive nonterminals¶
Original research on CFG dependency graphs and recursive, reachable, productive nonterminals.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Recursive Grammar
- A dependency graph records an edge when expanding one nonterminal introduces another; a cycle is the structural witness.
This sourceThe growth inference there assumes Chomsky normal form without epsilon productions.
- A dependency graph records an edge when expanding one nonterminal introduces another; a cycle is the structural witness.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:66a41b46eea8 · see in the full table