Abstract

this paper is organized into five sections, as follows. The internal form of a program, which is a variant of a parse tree, is discussed in the next section. Then the tree-matching algorithm and the synchronous pretty-printing technique are described. Experience with the comparator for the C language and some performance measurements are also presented. The last section discusses related work and concludes this paper

Citations

1128	The C Programming Language - Kernighan, Ritchie - 1988
537	The String-to-String Correction Problem - Wagner, Fischer - 1974
255	Simple fast algorithms for the editing distance between trees and related problems - Zhang, Shasha - 1989
216	A Linear Space Algorithm for Computing Maximal Common Subexpressions[J - Hirschberg
179	The tree-to-tree correction problem - Tai - 1979
137	Algorithms for the longest common subsequence problem - Hirschberg - 1977
133	Pattern matching in trees - Hoffmann, O’Donnell - 1982
116	The Synthesizer Generator - Reps, Teitelbaum - 1989
90	The tree-to-tree editing problem - Selkow - 1977
86	Identifying the semantic and textual differences between two versions of a program - Horwitz - 1990
69	The string-to-string correction problem with block move - Tichy - 1984
51	A file comparison program - Miller, Myers - 1985
49	Matching sequences under deletion-insertion constraints - Sankoff - 1972
46	Speeding up dynamic programming with applications to molecular biology - Galil, Giancarlo - 1989
42	The longest common subsequence problem revisited - Apostolico, Guerra - 1987
35	A tree-to-tree distance and its application to cluster analysis - Lu - 1979
28	A technique for isolating differences between files - Heckel - 1978
25	C: A Reference Manual - Steele, Harbison - 1984
20	S.: A longest common subsequence algorithm suitable for similar text strings - Nakatsu, Kambayashi, et al. - 1982
19	An algorithm for the distance between two finite sequences - Sellers - 1980
10	Formatted programming languages - Rose, Welsh - 1981
7	Syntax-directed pretty printing---a first step towards a syntaxdirected editor - Rubin - 1983
5	Managing multi-version programs with an - KRUSKAL - 1984
2	Production trees: a compact representation of parsed programs - Waddle - 1990
2	A specification schema for indenting programs - Mateti - 1983
2	Formatted syntaxes and Modula-2 - Woodman - 1986