root.addSon(n);
Node n2 = new Node("V", NodeType.INTERN_TYPE);
Node lexnode = new LexicalNode("boit", "V");
n2.addSon(lexnode);
n.addSon(n2);
ElementaryTree t1 = new ElementaryTree(root, "N0V");
t1.print();
System.out.println("");
// detN0 - Arbre à substituer à N0 de t1
root = new Node("N", NodeType.ROOT_TYPE);
n = new Node("det", NodeType.INTERN_TYPE);
root.addSon(n);
lexnode = new LexicalNode("le", "det");
n.addSon(lexnode);
n = new Node("N", NodeType.SUBST_TYPE);
root.addSon(n);
ElementaryTree t2 = new ElementaryTree(root, "detN");
t2.print();
System.out.println("");
// Arbre à substituer au noeud de subst de t2
root = new Node("N", NodeType.ROOT_TYPE);
lexnode = new LexicalNode("hérisson", "N");
root.addSon(lexnode);
ElementaryTree t3 = new ElementaryTree(root, "N");
t3.print();
Set<ElementaryTree> sourceTrees = new HashSet<ElementaryTree>();
sourceTrees.add(t1);
sourceTrees.add(t2);