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

DOI10.1007/978-3-030-78946-6_9MaRDI QIDQ2117263zbMATH OpenOpenAlexFDO

Authors Frank Drewes, Berthold Hoffmann, 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

parsinggraph transformationcorrectnesshyperedge replacementcontextual hyperedge replacement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
• Graph parsing as graph transformation. Correctness of predictive top-down parsers
• Predictive top-down parsing for hyperedge replacement grammars
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars

Cites work

• scientific article; zbMATH DE number 4049101 (Why is no real title available?)
• Contextual hyperedge replacement
• Correctness of high-level transformation systems relative to nested conditions
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamentals of algebraic graph transformation
• Graph parsing as graph transformation. Correctness of predictive top-down parsers
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Hyperedge replacement: grammars and languages
• Linear and Context-Free Graph Grammars
• Predictive top-down parsing for hyperedge replacement grammars
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• The complexity of graph languages generated by hyperedge replacement
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability

Cited in

(10)

• Transduction from trees to graphs through folding
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
• On the power of local graph expansion grammars with and without additional restrictions
• Uniform parsing for hyperedge replacement grammars
• Compositional analysis of probabilistic timed graph transformation systems
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• CHR grammars
• Finite automata for efficient graph recognition
• \textit{Grappa RE} -- a tool for efficient graph recognition based on finite automata and regular expressions
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117263)