GXL: a new graph transformation language

Authors:
Medha Shukla Sarkar
Affiliations:
Middle Tennessee State University, Murfreesboro, TN
Venue:
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Year:
2004

Citing 5
Cited 0

TXL: a rapid prototyping system for programming language dialects

Computer Languages
Programming in PROLOG

Programming in PROLOG
Introduction to Functional Programming

Introduction to Functional Programming
Visual programming with graph rewriting systems

VL '95 Proceedings of the 11th International IEEE Symposium on Visual Languages
Gxl: a graph transformation language with scoping and graph parameters

Gxl: a graph transformation language with scoping and graph parameters

Quantified Score

Hi-index	0.01

Visualization

Abstract

GXL - the graph transformation language presented in this abstract is a programmable graph rewriting language that combines ideas from current tree rewriting technology, exemplified by the TXL language, and general graph rewriting systems. From TXL it inherits the idea of scoping (limitation of a transformation rule to a particular sub tree or sub graph) and parameterization (working with multiple independent copies of a subtree or subgraph). From graph rewriting it inherits the generalization to graphs from trees. The resulting language adresses both problems in tree rewriting imposed by the limitation to trees, and problems in graph rewriting imposed by the lack of scoping and parameterization.