|need help with labelled graph rewriting email@example.com (1996-04-29)|
|Re: need help with labelled graph rewriting Uwe.Assmann@inria.fr (Uwe Assmann) (1996-05-02)|
|From:||firstname.lastname@example.org (Curtis Hrischuk)|
|Date:||29 Apr 1996 23:26:17 -0400|
|Organization:||Carleton Univeristy, Systems & Computer Eng. Dept.|
Hi. I have a labelled directed acyclic graph that I want to rewrite.
The rewrite rules are not context free but can have, potentially,
infinite lookahead. I plan to implement my parser in Prolog so the
lookahead is not an issue.
Has anyone else done this? If so, how do you specify the rewriting of
portions of the sub-graph? Particularly I am interested in specifying
these types of graph transforamtions.
Thanks for your time.
_/ Curtis Hrischuk (PhD Cand)
_/ Carleton University
_/ Ottawa, On. ,Canada, K1S-5B6
_/ Ph (613) 520-2600 x1762
_/ FAX (613) 520-5727
Return to the
Search the comp.compilers archives again.