publication . Conference object . Part of book or chapter of book . 1999

Pragmatic graph rewriting modifications

Peter Rodgers; Vidal, N.;
  • Published: 01 Sep 1999
  • Country: United States
Abstract
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes of the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified as 'Single Match' are tested against the host graph one time only. This reduces the need for control flags to indicate the progress of execution of transformations.
Subjects
arXiv: Computer Science::Programming Languages
free text keywords: QA76, Graph rewriting, Rewriting, Control flow analysis, Computer science, Theoretical computer science, Graph theory, Programming language, computer.software_genre, computer, Abstract semantic graph, Graph database, Graph (abstract data type), Wait-for graph

1. P.J. Rodgers. A Graph Rewriting Programming Language for Graph Drawing. P.J. Rodgers. Proceedings of the 14th IEEE Symposium on Visual Languages (VL'98). pp. 32-39. 1998.

2. P.J. Rodgers and P.J.H. King. A Graph Rewriting Visual Language for Database Programming. The Journal of Visual Languages and Computing 8(6). Academic Press. pp. 641-674. December 1997. [OpenAIRE]

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Conference object . Part of book or chapter of book . 1999

Pragmatic graph rewriting modifications

Peter Rodgers; Vidal, N.;