An algorithm for parsing a graph grammar

@inproceedings{McCreary1987AnAF,
  title={An algorithm for parsing a graph grammar},
  author={Carolyn L. McCreary},
  year={1987}
}
A dependency graph is an acyclic, directed graph with the transitive property. A graph-grammar describes the process of building a dependency graph from a simpler dependency graph. A derivation step replaces a mother node with a daughter dependency graph and connects each node of the daughter graph to nodes adjacent to the mother node. The algorithm described in this paper, takes an arbitrary dependency graph and shows the derivation steps used by the graph-grammar to derive the graph, i.e. the… CONTINUE READING