Have you ever wondered what happens if you hook up a lexer to a diff algorithm? I was feeling smart until I built it and saw the result.
The longest common subsequence here is ( ) ( ) ; which is not terribly helpful. I'm going to have to look at proper tree diffing techniques.
