Rodgers, Peter and Vidal, Natalia (1999) Pragmatic Graph Rewriting Modifications. In: Proceedings of the 1999 IEEE Symposium on Visual Languages, 13-16 Sept. 1999, Tokyo, Japan.
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 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.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Graph Rewriting|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Peter Rodgers|
|Date Deposited:||29 Sep 2009 12:31|
|Last Modified:||16 Nov 2012 10:51|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21777 (The current URI for this page, for reference purposes)|
- Depositors only (login required):