Test to match two empty nodes

And the code that makes it pass
Matching only if nodes have the same type
Not mating if a property differs
Not matching if the number of properties is different
Not matching if property types differ
Sanity test
Refactored the tests

I don't care who equals who, as long as they are (or aren't) the same.

To put it otherwise, I am testing the contract, not the implementation.
Doing matching recursively
Doing matching for a list of nodes

Not complete, but works so far
Multiple identical children don't lead to a match if the number differs.
Added a sanity test
Removing the annotations

If I want to do multiple matchings?

Also, for when I upload, just so things don't blow up
Extracted the code two match two lists into a separate method

Cleans up the thing a bit
Testing the matching on a real program

And it works!
BASE and DEFAULT owners are the same

Since there is not good reason to have two, and it only complicates
things (leads to conflict when there really shouldn't be one), I decided
to make them one.
Marking a node as belonging to an owner
Dealing with adding statements
Sanity test
code that gets all successors from a tree
Merge branch 'master' into successorSearch