Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars

DOI10.1007/978-3-319-61470-0_7zbMATH Open1425.68159OpenAlexW2702489693MaRDI QIDQ4972011FDOQ4972011

Mark Minas, Berthold Hoffmann, Frank Drewes

Publication date: 22 November 2019

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-61470-0_7

zbMATH Keywords

graph parsinghyperedge replacement grammargrammar analysis

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (9)

• Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
• Graph grammars according to the type of input and manipulated data: a survey
• Probabilistic hyperedge replacement grammars
• Uniform parsing for hyperedge replacement grammars
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Title not available (Why is that?)
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars

This page was built for publication: Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars

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