🚀 go-pugleaf

Archive-name: auto/comp.theory/Summary-on-PARSERS-and-EDITORS-for-graph-grammars

Hi,
here the summary for my request on PARSERS and EDITORS for graph grammars:

__________________________________________________________________________
(Message # 4: 1088 bytes, New)
Date: Tue, 28 Jul 92 16:58:30 -0400
From: Earlin Lutz <earlin@eye.com>
To: klauck@dfki.uni-kl.de
Subject: Re: PARSERS and EDITORS for graph grammars
Newsgroups: comp.theory
In-Reply-To: <1992Jul27.055853.6697@rhrk.uni-kl.de>
Organization: 3D/EYE, Inc.  Ithaca, NY
Cc:


There is a paper in ACM transactions on Software Engineering,
this year, issue 2, dealing with a graph-grammar approach
to module management.  I'm sorry I don't have it right here
to give a more complete reference.

I would be very interested in responses you get to
your posting.

Thank you.
__________________________________________________________________________

__________________________________________________________________________
(Message # 7: 1893 bytes, New)
Date: Thu, 30 Jul 1992 20:41:57 +0200
From: Michael Himsolt <himsolt@fmi.uni-passau.de>
To: Christoph Klauck <klauck@dfki.uni-kl.de>
Subject: Re: PARSERS and EDITORS for graph grammars
Newsgroups: comp.theory
Organization: University of Passau, Germany

Hallo,

In article <1992Jul27.055853.6697@rhrk.uni-kl.de> you write:
: Hi,
: I am looking for any pointers to
:       PARSERS, EDITORS or/and "GENERATORS"
: for any kind of graph grammars (gg's):
:       - attributed gg's
:       - node labeled gg's
:       - edge labeled gg's
:       - any combination of above gg`s

We have developed such a tool :  GraphEd. GraphEd is  an editor /
interpreter for BNLC, NLC, NCE and 1-eNCE grammars, both directed
and  undirected.  One of our  next goals is   a parser for (B)NLC
graph grammars.

GraphEd is available for non-commercial use by anon ftp from

    forwiss.uni-passau.de (132.231.1.10) : /pub/local/graphed

Manuals (Macintosh MS Word Format) are also on the server.

Timo Hickl (also here at Passau) has implemented a precedence
graph grammar parser several years ago. I will redirect your
question to him.

: If interest I can post the summary here.

I am very interested.

-- Michael Himsolt

--
Michael Himsolt,  Universitaet Passau,  Postfach 2540,  D-8390 Passau,  GERMANY
himsolt@fmi.uni-passau.de                             graphed@fmi.uni-passau.de
__________________________________________________________________________

__________________________________________________________________________
(Message # 8: 1116 bytes, New)
To: Christoph Klauck <klauck@dfki.uni-kl.de>
cc: G.Joly@cs.ucl.ac.uk
Subject: Re: PARSERS and EDITORS for graph grammars
In-reply-to: Your message of "27 Jul 92 05:58:53 GMT." <1992Jul27.055853.6697@rh
rk.uni-kl.de>
Date: Fri, 31 Jul 92 16:50:23 +0100
From: Gordon Joly <G.Joly@cs.ucl.ac.uk>



I have nothing much to offer, excepts "xgrab" but would welcome a
summary.

____

Gordon Joly      Phone  +44 71 387 7050 ext 3703      FAX  +44 71 387 1397
Internet: G.Joly@cs.ucl.ac.uk        UUCP: ...!{uunet,uknet}!ucl-cs!G.Joly
Computer Science, University College London, Gower Street, LONDON WC1E 6BT
__________________________________________________________________________

__________________________________________________________________________
(Message # 9: 1630 bytes, New)
From: "Dr. Mario Hilgemeier" <mhi@megatel.de>
Date: Wed, 12 Aug 92 12:57:49 MET DST
To: Christoph Klauck <klauck@dfki.uni-kl.de>
Subject: Re: PARSERS and EDITORS for graph grammars

In comp.theory article <1992Jul27.055853.6697@rhrk.uni-kl.de> you wrote:
" Hi,
" I am looking for any pointers to
"       PARSERS, EDITORS or/and "GENERATORS"
" for any kind of graph grammars (gg's):
"       - attributed gg's
"       - node labeled gg's
"       - edge labeled gg's
"       - any combination of above gg`s
" If interest I can post the summary here.
" Thank in advance.
"       Christoph


some years ago I wrote a Turbo Pascal program under MS-DOS for L-Systems
which lets you edit the rules and shows the succeeding developments on an EGA sc
reen.
If you`re interested, I`ll try to search it out.
A summary would be welcome.

Dr. Mario Hilgemeier
__________________________________________________________________________

__________________________________________________________________________
At my institute we have also developed tools for graph grammars:

1) A Heuristic Driven Chart Based Parser for Attributed Node labeled GG's
   - Allows Rules with only one Node on the left hand side
   - Allows to specify Overlappings and Deep Neighboorhoudness
   - is used for feature recognition in CIM

2) A Editor for the Graph Grammars used by the Parser
   - Support the Editing of rules by integrating a KL-ONE like tool

If you are interessted in some more informations, send e-mail to
E-mail: klauck@dfki.uni-kl.de
__________________________________________________________________________

END OF SUMMARY