|matching ASTs firstname.lastname@example.org (J Alan Brogan) (2000-10-12)|
|Re: matching ASTs email@example.com (Chris F Clark) (2000-10-15)|
|Re: matching ASTs firstname.lastname@example.org (2000-10-15)|
|Re: matching ASTs email@example.com (Bruce Ediger) (2000-10-15)|
|Re: matching ASTs firstname.lastname@example.org (Christian Lindig) (2000-10-18)|
|Re: matching ASTs email@example.com (Ira D. Baxter) (2000-10-19)|
|matching ASTs firstname.lastname@example.org (Robert Metzger) (2000-10-19)|
|From:||J Alan Brogan <email@example.com>|
|Date:||12 Oct 2000 22:25:40 -0400|
|Organization:||One of these days ...|
Can anyone give me any help in the matching of syntax trees - how to find
out whether two such trees are "similar", and what "similar" might mean.
Also - any references to work on the idea of canonical form of source code?
Context: The idea (for a college project) is to try to match example
source code (a "query") with some standard examples of known
algorithms. I figure I should reduce the query code to some canonical
form, then see which of the standard examples it is closest to.
Return to the
Search the comp.compilers archives again.