Constructs for Programming with Graph Rewrites
Peter J. Rodgers · Kent Academic Repository (University of Kent) · 2000
Abstract. Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifica-tions to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The con-structs we present are once only nodes, attractor nodes and single match re-writes. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce the size of programs, improve the efficiency of execution and simplify the host graph undergoing rewriting. 1