From Surf Wiki (app.surf) — the open knowledge base

GrGen

Software development tool

Summary

Software development tool

Field	Value
name	GrGen.NET
logo	[[File:Grgen-256.png	220px]]
paradigm	Multi-paradigm: declarative, imperative, object-oriented
year
developer	Sebastian Hack, Rubino Geiss, Moritz Kroll, Edgar Jakumeit, and others
written_in	Java, C#
latest release version	GrGen.NET 4.5
latest release date
turing-complete	Yes
typing	Static, partly dynamic, strong, safe, nominative
operating_system	Cross-platform (multi-platform)
license	GNU Lesser General Public License
website

| turing-complete = Yes

Debugging of a sequence generating a Koch-snowflake (the rules on the left, GrShell with highlighted current rule below, yComp with highlighted match in the host graph on the right)

GrGen.NET is a software development tool that offers programming languages (domain-specific languages) that are optimized for the processing of graph structured data. The core of the languages consists of modular graph rewrite rules, which are built on declarative graph pattern matching and rewriting; they are supplemented by many of the constructs that are used in imperative and object-oriented programming, and are completed with language devices known from database query languages.

The Graph Rewrite GENerator compiles the languages into efficient CLI assemblies (via C#-Code in an intermediate step), which can be integrated via an API into code written in any .NET-language. GrGen can be executed under Windows and Linux (Mono needed) and is open source available under LGPL v3.

For rapid prototyping and debugging, an interactive shell and a (VCG-)graph viewer are included in the package. With its languages and its visual and stepwise debugging, GrGen allows one to develop at the natural level of abstraction of graph-based representations, such as those employed in engineering, model transformation, computational linguistics, or compiler construction (as intermediate representation).

GrGen increases productivity for those kinds of tasks far beyond what can be achieved by programming in a traditional programming language; due to many implemented performance optimizations it still allows one to achieve high-performance solutions. Its authors claim that the system offers the highest combined speed of development and execution available for the algorithmic processing of graph-based representations (based on their performance regarding diverse tasks posed at different editions of the Transformation Tool Contest (/GraBaTs)).

Specification sample

Below is an example containing a graph model and rule specifications from the GrGen.NET-solution to the AntWorld-case posed at Grabats 08 .

Graph model:

node class GridNode { food:int; pheromones:int; } node class GridCornerNode extends GridNode; node class AntHill extends GridNode { foodCountdown:int = 10; } node class Ant { hasFood:boolean; }

edge class GridEdge connect GridNode[1] - GridNode[1]; edge class PathToHill extends GridEdge; edge class AntPosition;

Rewrite rules:

rule TakeFood(curAnt:Ant) { curAnt -:AntPosition- n:GridNode\AntHill; if { !curAnt.hasFood && n.food 0; } modify { eval { curAnt.hasFood = true; n.food = n.food - 1; } } }

rule SearchAlongPheromones(curAnt:Ant) { curAnt -oldPos:AntPosition- old:GridNode if { new.pheromones 9; } modify { delete(oldPos); curAnt -:AntPosition- new; } }

test ReachedEndOfWorld(curAnt:Ant) : (GridNode) { curAnt -:AntPosition- n:GridNode\AntHill; negative { n } return (n); }

Conference papers

GrGen: A Fast SPO-Based Graph Rewriting Tool/http://www.info.uni-karlsruhe.de/papers/grgen_icgt2006.pdf - ICGT 06
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools - AGTIVE 07
Graph Rewriting for Hardware Dependent Program Optimizations - AGTIVE 07
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching - AGTIVE 07
Customizing GrGen.NET for Model Transformation - GraMoT 08
Graph Rewrite Rules with Structural Recursion - ICGT/GCM 08

Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

domain-specific-programming-languages graph-rewriting

Want to explore this topic further?

Ask Mako anything about GrGen — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report