[DotGNU]treecc: Locating the top node

[nymia]

Another treecc question, what is the procedure for getting the top node? A
hash value of 0 doesn't return the top node, though.

Any ideas? See sample node report on /treecc/examples/

Thanks.


hash : binary  has no parent, has no child  position: 0
hash : minus  has no parent, has child  position: 0
hash : power  has no parent, has child  position: 0
hash : unary  has no parent, has no child  position: 0
hash : divide  has no parent, has child  position: 0
hash : float_type  has no parent, has child  position: 2
hash : intnum  has no parent, has child  position: 0
hash : multiply  has no parent, has child  position: 0
hash : negate  has no parent, has child  position: 0
hash : floatnum  has no parent, has child  position: 0
hash : expression  has parent, has no child  position: 0
hash : plus  has no parent, has child  position: 0
hash : cast  has no parent, has child  position: 0
hash : error_type  has no parent, has child  position: 0
hash : int_type  has no parent, has child  position: 1
hash : type_code  has parent, has no child  position: 3