Graph Parsing as Graph Transformation

DOI10.1007/978-3-030-51372-6_13zbMath1502.68150OpenAlexW3037529315MaRDI QIDQ5100735

Mark Minas, Berthold Hoffmann, Frank Drewes

Publication date: 1 September 2022

Published in: Graph Transformation (Search for Journal in Brave)

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

zbMATH Keywords

correctnessparsinggraph transformationhyperedge replacement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Compositional analysis of probabilistic timed graph transformation systems ⋮ Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars

Uses Software

• AGG

Cites Work

• Unnamed Item
• Unnamed Item
• Contextual hyperedge replacement
• Hyperedge replacement: grammars and languages
• On the membership problem for regular DNLC grammars
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• A parsing automata approach to LR theory
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamentals of algebraic graph transformation
• Double-pushout graph transformation revisited
• Predictive Top-Down Parsing for Hyperedge Replacement Grammars
• Correctness of high-level transformation systems relative to nested conditions

This page was built for publication: Graph Parsing as Graph Transformation