Extended context-free grammars and normal form algorithms
From MaRDI portal
(Redirected from Extended context-free grammars and normal form algorithms)
Recommendations
Cited in
(12)- SGML and XML document grammars and exceptions
- COMAR: a Data Format for Integration of CFG Tools
- Normal forms for context-free node-rewriting hypergraph grammars
- scientific article; zbMATH DE number 637403 (Why is no real title available?)
- On predictive parsing and extended context-free grammars
- On predictive parsing and extended context-free grammars
- Normal forms of grammars, finite automata, abstract families, and closure properties of multiset languages
- On normal form grammars and their size
- scientific article; zbMATH DE number 2201369 (Why is no real title available?)
- Normal-order reduction grammars
- scientific article; zbMATH DE number 4189198 (Why is no real title available?)
- Normal form algorithms for extended context-free grammars
This page was built for publication: Extended context-free grammars and normal form algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955249)