Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars

DOI10.1007/978-3-030-78946-6_9zbMath1492.68068OpenAlexW3173299608MaRDI QIDQ2117263

Berthold Hoffmann, Frank Drewes, Mark Minas

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78946-6_9

zbMATH Keywords

correctnessparsinggraph transformationhyperedge replacementcontextual hyperedge replacement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Transduction from trees to graphs through folding

Cites Work

• Contextual hyperedge replacement
• Hyperedge replacement: grammars and languages
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The complexity of graph languages generated by hyperedge replacement
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamentals of algebraic graph transformation
• Predictive Top-Down Parsing for Hyperedge Replacement Grammars
• Correctness of high-level transformation systems relative to nested conditions
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Graph Parsing as Graph Transformation
• Linear and Context-Free Graph Grammars
• Unnamed Item

This page was built for publication: Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars