...compiler
- Check the start locations of all nodes produced by the parser, as I noticed...

...dots are called nodes, and the lines are edges.  We say that nodes A and...

...uda2:
int a = 3;

Same here, two nodes.

That's a great solution! However since...

...of removed nodes in the tree
  * 48ed0a5 dustmite: Make findEntity traverse dead nodes
  * 196f5f7 dustmite...

p.s. Something equivalent can be built using tuples but it's less convenient to...

I'm looking for a data structure that is fully specified at compile time and...

If you want to keep things simple, use OOP (classes).

If you need to use...

...data structure composed of differently (statically) typed nodes. The basic case is a binary tree...

...of removed nodes in the tree
  * 48ed0a5 dustmite: Make findEntity traverse dead nodes
  * 196f5f7 dustmite...

...not need a location, but the inner nodes would.

For your above examples:

`@uda1 @uda2...