First implementation of splitTree

SplitTree takes a node and split it in :
	1. A minimal Dictionary
	2. A list of occurences of the entries in the dictionary
	3. A list of edges (TODO, not yet implemented).
A test (which for now just print) is in AstCompressorTest.