Extended context-free grammars and normal form algorithms

DOI10.1007/3-540-48057-9_1MaRDI QIDQ4955249zbMATH OpenFDO

Authors J. Albert, Dora Giammarresi, D. Wood

Publication date 25 May 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48057-9_1

zbMATH Keywords

extended context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Normal form algorithms for extended context-free grammars
• scientific article; zbMATH DE number 2201369
• Greibach normal form transformation revisited.
• Complexity of normal form grammars
• On normal form grammars and their size

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?)
• scientific article; zbMATH DE number 1951550 (Why is no real title available?)
• scientific article; zbMATH DE number 1962786 (Why is no real title available?)
• scientific article; zbMATH DE number 2080940 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• Grail

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)