Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
From MaRDI portal
Publication:2117263
DOI10.1007/978-3-030-78946-6_9zbMATH Open1492.68068OpenAlexW3173299608MaRDI QIDQ2117263FDOQ2117263
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
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
- Hyperedge replacement: grammars and languages
- Handbook of Graph Grammars and Computing by Graph Transformation
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Correctness of high-level transformation systems relative to nested conditions
- Handbook of Graph Grammars and Computing by Graph Transformation
- Fundamentals of algebraic graph transformation
- Linear and Context-Free Graph Grammars
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Contextual hyperedge replacement
- The complexity of graph languages generated by hyperedge replacement
- Title not available (Why is that?)
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Graph Parsing as Graph Transformation
Cited In (7)
- 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
- Compositional analysis of probabilistic timed graph transformation systems
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
- CHR grammars
- 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)
