I almost forgot it was my birthday

I once had my birthday the day before the AP Chem test so I ended up spending the whole day studying

That one is actually really complicated, the Parser itself uses an algorithm to determine what to make H and L.  That's why I require the number for direct keys to be constant instead of variable becasue it would be way too slow to have to convert it each time its trying to detect a key.

Anyway, H is the key group and L is the bit inverse of the key code I think.  There's a chart on day 22 of the learn z80 in 28 days tutorial you can use for reference.

By the way, I haven't updated the list with new commands since the last few versions.  If anyone wants any just ask and I'll post them up here.

Just curious, would it be useful to set and get exact bits in the 2 byte number?  Like "get the 11th bit" and "set the 2nd bit" or is it more useful to have the Nth bit with N being variable?  Unfortunately, these routines with variable bits are kinda big.  Big enough where they wouldn't be inline like the constant bit checking and I would make it a subroutine to save space.

I might be able to do both, but I'll have to come up with some clever syntax.

By the way, I just coined a new term: "Axe Hax" for clever exploits of Axe commands.

After re-reading your post, it sounds like you're worried that if you have too much data in one pointer location, that it would somehow be possible to overflow into another pointer location?  It would never happen.  If you had that much data, the program would not compile becasue it would be past the program size limit.

What you might also be asking is how to make sure that when writing over data in Str1 (I assume a string in memory) it doesn't overwrite anything in Str2 (A string in memory right after Str1)

This is simple.  First, if you know what size Str1 is, lets say the string is 20 characters long, then just make sure you don't write past 20 characters.  If you don't know the length off-hand, then just make sure that the pointer is less than the Str2 pointer.  This routine writes a character D to Str1 at position A only if it does not overflow into Str2:

:If Str1+A<Str2
:D->{Str1+A}
:End

Sorry if I'm misunderstanding the question.  I will now explain how Axe decides what pointers to assign to your data.  During the first parsing "pass", it creates the entire program minus the data.  On the second pass, it now knows where the executable ends, so it reads through the code and every time it sees you creating data, it adds it to the end of the program.  It will be in exactly the order you have declared the data in.

So if the compiled program, ends at address 9000, then it might read through until it encounters your first data, lets say its a 10 character string Str1.  It will create Str1's pointer at 9000 and then fill up that memory with the letters in the string until it gets to 9010.  Then your next data might be another 10 character string Str2.  So Str2 now equals 9010 and it fills up data until it gets to 9020.  If that's all the data, then your final program size will be all the compiled code plus the data.

WOW!  I can't believe its so fast!  Also, that website is really cool!

EDIT:  If its fast enough, a port of that game to the calculator would be really really neat and original, although with only black, light gray and dark gray, there really wouldn't be that many possible objects.

Well, it has to be a location that isn't in any of the L1-L6 free ram and it can't ever be modified from any standard bcalls.  I switched to asm_flag2, we'll see if this fixes it.

When you create an application variable, assume random garbage is already there, it is not automatically set to 0.

Wait, so what is the error right now?  Is it the 65535 size error or is Mirage actually changing the high scores?