So far I've tried 2 evaluators I've found on the forums. After stripping down Xombies as much as I could, and finding srod's ifix->rpn->solution code, here is what i've discovered so far.
100,000 evaluations of "100+1" takes 700ms on my computer using Xombies. Using srods, it takes 1200ms.
However once you start adding more operations, Xombies falls behind srod's after just 2 more operations and starts to REALLY lag behind with 5+ operations. Does anyone have any suggestions?
The dillemma is that when evaluating loop conditions, typically its an expression like "i+1" which would mean Xombies is a faster algo to use for looping. However once you add a couple more operations, it becomes much much slower (about 60% slower than srods).
I was considering adding a special case to srod's to detect if its a 1-operation expression and handle it in a faster way.
Once I get the math evaluator speed faster the language will be very nearly done. It's pretty quick, though not as fast as lua yet

Also I don't think either of these has a modulus % operator so if anyone can recommend one that does it'd be handy.
I could of course write my own but with all the heads here at pb I figured some of have probably made quite a few already =)