|Tree Pattern recognition? email@example.com (1993-05-07)|
|Re: Tree Pattern recognition? chased@rbbb.Eng.Sun.COM (1993-05-11)|
|Re: Tree Pattern recognition? firstname.lastname@example.org (1993-05-14)|
|Re: Tree Pattern recognition? email@example.com (1993-05-16)|
|From:||firstname.lastname@example.org (Willem Jan Withagen)|
|Organization:||Eindhoven University of Technology, The Netherlands|
|Date:||Fri, 14 May 1993 11:29:41 GMT|
=>Is there a tool out there which will allow pattern matching of a sub-tree
=>(given its nodal structure and elements) to a section of a larger tree?
Over time I've become very pleaed with the tree-grammar and tools which
are in the Cocktail toolbox.
In your case it is probably a little too late to get working with little
effort. You'll atleast need to rewrite the tree generation part. (Note
that you can have the names of your old node members as attributes
in the new tree.)
The bonus is that there's standard available:
sub-tree comparison (are two subtrees fully compatible)
And other tools allow you to do more complext things:
Ag for attribute evaluators
Puma to do pattern matching.
[ You will want to use this ]
Cocktail is available at:
It has a listserver at:
To subscribe send a message with
subscribe cocktail <your real name>
Several 'ports' are available, including MS-DOS and OS/2.
Installing on a Unix box is "usualy" not much work.
Willem jan Withagen.
Digital Information Systems Group, Tel: +31-40-473401,Fax: +31-40-448375
Room EH 10.35 Eindhoven University of Technology
P.O. 513, 5600 MB Eindhoven, The Netherlands
Return to the
Search the comp.compilers archives again.