|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)|
|Date:||15 Oct 2000 16:28:47 -0400|
|Organization:||University of WI, Madison -- Computer Sciences Dept.|
Maybe you could look at some tools that detect "software plagiarism"
(i.e., students copying homeworks :)
This compares source code directly, but apparently uses program structure.
No source code, but it's available as an on-line form through which you
submit code in C,C++,Java,Ada,Pascal,ML,Lisp or Scheme for comparison.
J Alan Brogan <email@example.com> wrote:
> 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.
Return to the
Search the comp.compilers archives again.