got to go save a few thousand bytes

*happybobjr thinks you should get noticed for your work.  maybe ask in a readme for credit on optimization.  because this is so great for basic...

note:   maybe you can have it replace words in a string.  such as,  "and" with "and" but this time from 2nd math right 1
or If... or... else.. and so on

If you don't mind,  I signed your program so it can go on a real calc instead of an emu.

Cool project! I just skimmed over but were those fancy boolean functions mentioned? I mean like;

If K=24
Then
X+1->X
End
If K=26
Then
X-1->x
end
which could be:
X+(K=24)-(K=26->X

Second, not to be rude or anything but isn't celticIII better suited for this? I mean with the "linereplace" command and the "hextobin" command and all, surely it makes recognising tokens easy...

Axe on the other hand is far faster which is a big plus on large progams (which they tend to be or the couldn't be much optimized)

Yeah, not only would Celtic3 be a *lot* slower, but it is actualy not any easier to read tokens.  It's very easy to read tokens in axe, since most all tokens are just a single number.  So not only would it be faster in axe, but you also wouldn't need two or more programs to carry around.   

And thanks happybobjr for the signed app, I forgot to sign the app once again I made it an app just because it seemed appropriate for this type of program.  And so that it would be completely safe if I messed up when I'm working with the vat

as for the Boolean optimizations, it hasn't been implemented yet, but a primitive version is being planned

And that's an awesome optimization on Illustat! although it might be mostly linebreaks if you use them to organize your code.

Wow, it works! That is an awesome program!

If you don't mind,  I signed your program so it can go on a real calc instead of an emu.

An idea to fix that: Optimize strings like that only if the line starts with Disp ". That way, there's no way tokens can be counted.

Does not( always work? I don't know why I'm asking since I use that every time, I just thought I saw someone say there are times when you do need ...=0 or 0=.... I may just be misremembering though.

By the way, what do you mean by Sting Character Optimization?

The Not() trick only works if the =0 is at the end of the expression, that way the parenthesis can be taken off the end, hence the optimization.  I *believe* that in all times where the =0 is at the end, the not() optimization should work, but i will have to run some more tests.

As for the String Character Optimization, i just mean optimizing the lowercase letters like " and " into the single token " and ".  Which yields a 7 byte optimization :O

EDIT: And the conditional optimization is a good idea, it may be very specific however.  As in it may not always catch the optimization.