| 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: | Bruce Ediger <eballen1@uswest.net> |
| Newsgroups: | comp.compilers |
| Date: | 15 Oct 2000 16:30:49 -0400 |
| Organization: | Runciter Associates |
| References: | 00-10-095 |
| Keywords: | analysis |
J Alan Brogan 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.
Bell Lab's Brenda Baker did something that you might find interesting:
ftp://netlib.bell-labs.com/who/bsb/projects.html#dup
Her work covers "similar" source code for various definitions of
"similar".
Return to the
comp.compilers page.
Search the
comp.compilers archives again.