Expression pre-processing needs a better tree composition.

[mmirko]

Currently, the expression pre-processing creates a sequence of nodes of the type a + ( previous node ). This is not a good tree representation because in the end it bring latency to the evaluation of the expression. The tree should be a binary tree.