Hmm, how do you store the expressions? If you store them as a tree, you already have the information necessary, because you can always generate parenthesis for an <+|->-Node with to children on the fly - that's what I meant with showing relevant code - do you store the expression as a tree - otherwise this is a useless info on my part *g*?
regards,
tomte
An intellectual is someone whose mind watches itself.
-- Albert Camus
In reply to Re^3: Using overload to parse arithmetic terms
by Tomte
in thread Using overload to parse arithmetic terms
by esskar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |