Parsing Non-Recursive Context-Free Grammars¶
Nederhof, & Satta. (2002). Parsing Non-Recursive Context-Free Grammars. ACL 2002.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Recursive Grammar
- The frozen seed's stronger statement—“recursive CFG with no useless rules necessarily generates an infinite language”—is not valid for raw grammars containing unit cycles.
This sourceThe paper uses non-recursive CFGs as compact finite-language encodings.
- The frozen seed's stronger statement—“recursive CFG with no useless rules necessarily generates an infinite language”—is not valid for raw grammars containing unit cycles.
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:bbf98f86297b · see in the full table