Predictive Top-Down Parsing for Hyperedge Replacement Grammars
From MaRDI portal
Publication:2947208
DOI10.1007/978-3-319-21145-9_2zbMath1321.68328OpenAlexW642719942MaRDI QIDQ2947208
Mark Minas, Berthold Hoffmann, Frank Drewes
Publication date: 22 September 2015
Published in: Graph Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21145-9_2
Related Items (5)
Uniform parsing for hyperedge replacement grammars ⋮ Graph Parsing as Graph Transformation ⋮ Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement ⋮ 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
- Contextual hyperedge replacement
- Recognising \(k\)-connected hypergraphs in cubic time
- Contact homology and one parameter families of Legendrian knots
- A class of linearly parsable graph grammars
- The complexity of graph languages generated by hyperedge replacement
- Orthogonal least squares methods and their application to non-linear system identification
- On Context-Free Languages
- Syntax-Directed Transduction
This page was built for publication: Predictive Top-Down Parsing for Hyperedge Replacement Grammars
