graph grammar interpreter

Article View: comp.theory

Article #1796

#1796

From: Hoda Fahmy
Date: Tue, 11 Jun 1991 19:50

17 lines
896 bytes

I was wondering if anyone knows of a working graph
grammar interpreter that I could use.    I have designed a 
graph grammar and  I am now looking for a way to 
implement it.  My grammar has the following requirements:

         -  unconnected graphs on the left-hand and right-hand
        	sides of production rules
         -  labels and attributes for nodes
         -  an "elementary" embedding mechanism (as defined
             by Nagl)

If you are aware of anything that could be of use 
to me, please respond to:
	
	 fahmyh@qucis.queensu.ca.

Much appreciated.

Technical Details

Message-ID: <2731@qusunc.queensu.CA>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!qucis!fahmyh

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!qucis!fahmyh
From: fahmyh@qucis.queensu.CA (Hoda Fahmy)
Newsgroups: comp.theory
Subject: graph grammar interpreter
Message-ID: <2731@qusunc.queensu.CA>
Date: 11 Jun 91 19:50:08 GMT
Distribution: na
Organization: Queen's University, Kingston
Lines: 18