Re: matching ASTs

Chris F Clark <cfc@world.std.com>
15 Oct 2000 16:26:09 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: Chris F Clark <cfc@world.std.com>
Newsgroups: comp.compilers
Date: 15 Oct 2000 16:26:09 -0400
Organization: The World Public Access UNIX, Brookline, MA
References: 00-10-095
Keywords: analysis

Yes, a very good idea. Try looking up "Knowledge Based Emacs" by
Richard Watters(sp?) of MIT for where that idea might lead. As I
recall, it was a programming system that recognized fragments of
algorithms in a paritally completed program and filled in the missing
parts.


Another take on that idea was pursued by Susan Horowitz (U Minn?),
where she cut to the semantic core of the algorithms and "diff'ed"
that. I believe the resulting pieces were called "slices". She was
looking for the parts of programs that didn't change due to edits that
moved the code around (but not to where it would make a semantic
difference).


Hope this helps,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.