Pragmatic graph rewriting modifications

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.