...
An important advantage that v3 has over v2 is that v3 automatically computes and stores the range of tokens associated with the subtree created for each rule. For example, imagine the simple expression 15 + 21. The root "plus" node created by the associated grammar rule will store token boundaries 0..4 assuming that the expression as the only input and that is broken down into five tokens (including the whitespaces).