Parsing weighted order-preserving hyperedge replacement grammars

MaRDI QIDQ5094884zbMATH OpenFDO

Authors Henrik Björklund, Petter Ericson, Frank Drewes

Publication date 4 August 2022

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Uniform parsing for hyperedge replacement grammars
• Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
• The complexity of graph languages generated by hyperedge replacement
• Tree-Based Generation of Restricted Graph Languages

Cited in

(8)

• Generalized predictive shift-reduce parsing for hyperedge replacement graph 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
• Uniform parsing for hyperedge replacement grammars
• Weighted Deductive Parsing and Knuth's Algorithm
• scientific article; zbMATH DE number 177450 (Why is no real title available?)
• Tree-Based Generation of Restricted Graph Languages
• Parsing unranked tree languages, folded once

This page was built for publication: Parsing weighted order-preserving hyperedge replacement grammars

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