Re: Please any one suggest me some project ideas

From: Willem (willem_at_stack.nl)
Date: 02/02/04 

Date: Mon, 2 Feb 2004 19:43:47 +0000 (UTC)

Edward wrote:
) The syntax isn't that difficult. If the language is of typical
) structure you can construct two parse trees using recursive descent
) hand coded from the BNF of the language.
)
) You then walk the two trees noticing what's missing and present. This
) algorithm would be for me the tricky part. I have searched for, but
) not found, an algorithm for "the minimal difference of two trees".

That would be very hard.
Probably harder than finding the minimal difference of two files.
Besides which, you have the downside that you have to have a separate
algorithm for each and every language.
And you lose all the formatting, obviously, which is a bad thing.

Tell me, what would be the benefit of munging up a piece of source code
using the grammar of the language to find the minimal difference ?

SaSW, Willem 

-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
Quantcast