Graph parsing as graph transformation. Correctness of predictive top-down parsers
From MaRDI portal
Publication:5100735
DOI10.1007/978-3-030-51372-6_13zbMATH Open1502.68150OpenAlexW3037529315MaRDI QIDQ5100735FDOQ5100735
Mark Minas, Frank Drewes, Berthold Hoffmann
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
Recommendations
- Predictive top-down parsing for hyperedge replacement grammars
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Predictive shift-reduce parsing for hyperedge replacement grammars
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
Cites Work
- Hyperedge replacement: grammars and languages
- Title not available (Why is that?)
- Correctness of high-level transformation systems relative to nested conditions
- Fundamentals of algebraic graph transformation
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Contextual hyperedge replacement
- Double-pushout graph transformation revisited
- A parsing automata approach to LR theory
- On the membership problem for regular DNLC grammars
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars
- Title not available (Why is that?)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
Cited In (7)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
- Compositional analysis of probabilistic timed graph transformation systems
- Title not available (Why is that?)
- Compositional analysis of probabilistic timed graph transformation systems
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Graph parsing as graph transformation. Correctness of predictive top-down parsers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100735)
