matching ASTs

J Alan Brogan <>
12 Oct 2000 22:25:40 -0400

          From comp.compilers

Related articles
matching ASTs (J Alan Brogan) (2000-10-12)
Re: matching ASTs (Chris F Clark) (2000-10-15)
Re: matching ASTs (2000-10-15)
Re: matching ASTs (Bruce Ediger) (2000-10-15)
Re: matching ASTs (Christian Lindig) (2000-10-18)
Re: matching ASTs (Ira D. Baxter) (2000-10-19)
matching ASTs (Robert Metzger) (2000-10-19)
| List of all articles for this month |

From: J Alan Brogan <>
Newsgroups: comp.compilers
Date: 12 Oct 2000 22:25:40 -0400
Organization: One of these days ...
Keywords: analysis, question
X-No-Archive: yes

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.

Co. Kerry

Post a followup to this message

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