Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| matching ASTs compilers@al-got-rhythm.net (J Alan Brogan) (2000-10-12) |
| Re: matching ASTs cfc@world.std.com (Chris F Clark) (2000-10-15) |
| Re: matching ASTs plakal@cs.wisc.edu (2000-10-15) |
| Re: matching ASTs eballen1@uswest.net (Bruce Ediger) (2000-10-15) |
| Re: matching ASTs lindig@eecs.harvard.edu (Christian Lindig) (2000-10-18) |
| Re: matching ASTs idbaxter@semdesigns.com (Ira D. Baxter) (2000-10-19) |
| matching ASTs metzger@rsn.hp.com (Robert Metzger) (2000-10-19) |
| From: | plakal@cs.wisc.edu |
| Newsgroups: | comp.compilers |
| Date: | 15 Oct 2000 16:28:47 -0400 |
| Organization: | University of WI, Madison -- Computer Sciences Dept. |
| References: | 00-10-095 |
| Keywords: | analysis |
Maybe you could look at some tools that detect "software plagiarism"
(i.e., students copying homeworks :)
http://www.cs.berkeley.edu/~aiken/moss.html
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.
Manoj
J Alan Brogan <compilers@al-got-rhythm.net> 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
comp.compilers page.
Search the
comp.compilers archives again.