Constructs for Programming with Graph Rewrites.
In: GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems.
(Full text available)
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. 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.
- Depositors only (login required):