Pragmatic Graph Rewriting Modifications

Rodgers, Peter, Vidal, Natalia (1999) Pragmatic Graph Rewriting Modifications. In: Proceedings of the 1999 IEEE Symposium on Visual Languages. . pp. 206-207. IEEE ISBN 0-7695-0216-4. (doi:10.1109/VL.1999.795904) (KAR id:21777)

PDF Language: English
Download this file (PDF/58kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1109/VL.1999.795904

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 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)
DOI/Identification number:	10.1109/VL.1999.795904
Uncontrolled keywords:	Graph Rewriting
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Peter Rodgers
Date Deposited:	29 Sep 2009 12:31 UTC
Last Modified:	05 Nov 2024 10:00 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21777 (The current URI for this page, for reference purposes)

University of Kent Author Information

Rodgers, Peter.

Creator's ORCID:	https://orcid.org/0000-0002-4100-3596
CReDIT Contributor Roles:

Vidal, Natalia.

Creator's ORCID:
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.