Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
From MaRDI portal
Publication:2423756
DOI10.1016/j.jlamp.2018.12.006zbMath1423.68230arXiv1812.11927OpenAlexW3102336422MaRDI QIDQ2423756
Frank Drewes, Berthold Hoffmann, Mark Minas
Publication date: 20 June 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.11927
Related Items
Graph Parsing as Graph Transformation, Preface to the special issue on the 10th international conference on graph transformation, Unnamed Item, Compositional analysis of probabilistic timed graph transformation systems, Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contextual hyperedge replacement
- Hyperedge replacement: grammars and languages
- Recognising \(k\)-connected hypergraphs in cubic time
- On the membership problem for regular DNLC grammars
- Power properties of NLC graph grammars with a polynomial membership problem
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- A class of linearly parsable graph grammars
- The complexity of graph languages generated by hyperedge replacement
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
- Pair grammars, graph languages and string-to-graph translations
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars
- Context-free graph grammars
- Handbook of Graph Grammars and Computing by Graph Transformation
- Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
- Syntax-Directed Transduction
- Simple LR(k) grammars
- Linear and Context-Free Graph Grammars
- On the translation of languages from left to right
- Optimization of Straight Line Programs
