Skip to content
printicon
Show report in:

UMINF 18.16

Parsing Weighted Order-Preserving Hyperedge Replacement Grammars

We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper).

Keywords

graph grammars, order-preservation, parsing, weighted graph grammars

Authors

Back Edit this report
Entry responsible: Petter Ericson

Page Responsible: Frank Drewes
2020-02-25