This?

Quote

'CHAR'   The expression becomes the ASCII value of the single character between the apostrophes. It can even be another apostrophe.

Yep, that would be it. Like, if you read a byte, B, from a string you can check to see if it is "A" by doing:
If B='A'instead of the more cryptic
If B=65
This really helped the readability of my BrainF*** compiler

okay, i know i must sound like a huge idiot for asking this, but how does axe work? for my calc at least, i just load up the app, select one of my programs and it give me an error. and the parsing doesn't seem to work for me. do i have to activate something?

ohhh. yeah, i thought it just automatically converted. so once i make it all axe syntax, i just run it through the application and then run it like a normal program? or do i have to run it with asm(    ?

okay thanks

Quigibo, can you show another example using the int( command?  I can't figure out how to use it, and I'd like to know how.

DJ, EHex just puts the hex number into Base 10.  Here are some examples:
E0001 = 1
E0009 = 9
E000F = 15
EFFFF = 65535
E001F = 31
All it does is convert from base 16 to base 10.  Does that make sense?
Note: Remember it must be 4 characters long after the E. 

Hmm, I see.  Can you give an example when this would be useful?  I can't come up with anything, but I'm sure it's useful when used right.

On a side note, the documentation doesn't include the { and }.

The {} actually are in the doc in the middle, but I am getting the feeling that the doc is starting to get so large, that I really should divide it into categories like Math, Data, Constants, etc. to make individual commands easier to find.

int() is almost always used with {}, in fact, I might even change it to imply the brackets.  But right now, its like this:

say you have a data structure like this:
[-2,-1,0,1,2]
And you want to display 2 more than the number so your program looks like this:

-2->{L1}
-1->{L1+1}
0->{L1+2}
1->{L1+3}
2->{L1+4}
For(A,0,4)
Disp {L1+A}+2>Dec
End

Try it.  It doesn't return the right number since even though FF is -1 for an 8 bit number, it is actually 00FF as a 16 bit number.  That value is 255, not -1 as a 16 bit.  So we need to extend the sign.  In general, that means that 00xx has to become FFxx so our 00FF becomes FFFF which IS -1.  This is the low level explanation.  You don't need to know the technical details of HOW it works, just know that it preserves the sign when reading bytes in RAM.

Now try this:

-2->{L1}
-1->{L1+1}
0->{L1+2}
1->{L1+3}
2->{L1+4}
For(A,0,4)
Disp int({L1+A})+2>Dec
End

Tada!

Ah, I see! Thanks!

This could really help me with compression!