Hey, I'm back from a vacation and just noticed this topic.  For your first question, the compiler ignores lowercase letters (unless you're compiling as an app) since program names can not have any lowercase letters.  Instead it will count that as part of the description.  So you were compiling the program "S" with description "teel A Parser" so my guess is that your source code file was also program "S".

The Axe language in general has very high similarity to both Assembly and Basic, so a strong background in either one will definitely help with programming.  An assembly tutorial will have some very useful information for you about how some things actually work and a Basic tutorial would help with program flow since the syntax is similar, however the optimizations are completely different and hardly any basic "tricks" can actually be carried over.  What programming languages do you have a background in?

Reading the entire commands list as well as the documentation should be enough to get started.  Some gaps can be filled with trial and error, other specific things feel free to ask in this forum, that's the primary purpose of it since there are no complete tutorials currently.

That's correct, you have the right idea.  The only weird thing about it is that the actual machine code generated DOES account for the size of the line.  So if you look at the hex code and see that its moving back 3, just remember that's why so don't let it confuse you that what you write in the assembler looks different than the machine code.  The way you're doing it is correct for all the major assemblers.  I'm not sure if there are any assemblers that count the current line when using $.

Also, another change since 0.3.3 is that if you don't need the pointer for the rest of the program you can define the variable at the same time as using it without needing a static pointer.  For instance, your example could be:

1->A
If A
Text(23,20,"HELLO")
Else
Text(23,20,"GOODBYE")
End
You can do this anywhere in the code with any data type, even sprites:

Pt-On(8,10,[004299E7E7FFA542])
But since you aren't giving the data a name, that means you can't use it anywhere else in the code unless you create a duplicate or something like that.

Axe comes with a re-signer in the tools folder by the way since it can only compile to unsigned apps on-calc, but I'm not sure if it was included at the time he uploaded the demo.

As for how the logic works in this game, once a wall is completed, every BALL flood-fills its area, marking it with a number.  Anything that has been marked is kept clean, and anything not marked is set as solid.

Ah! That's really smart!  It's quite literally thinking outside the box

That reminds me of when I was working on Puyo Puyo.  I couldn't find any algorithms published for how to detect if 4 or more balls on a grid are connected 4-directionally and it took me months before I figured out a way to do it.  You just detect all the balls that form chains of 3 or less, which is easy since there are so few combinations and they're all trivial, and then just destroy everything else.

Okay then, it will be Wednesday (tomorrow) at these updated times:
6:00  PM Alaska Time
7:00  PM Pacific Time
8:00  PM Mountain Time
9:00  PM Central Time
10:00 PM Eastern Time

They are all correct, yes.  /10 is only there because there is a B_CALL for that specific number and I figured that if you're going to be dividing by a constant ten, then you're probably trying to display a decimal number or something like that in which case the micro seconds don't matter and its better to have a smaller size.  The division is indeed crazy, but that's correct, it takes more bytes to do a unsigned division by 64 than it does for a signed division (unless someone can come up with a smaller one).  The 16 bit check routines are identical to the 8-bit checks, they just have different numbers since it counts from the left.  Unless you mean the routine itself?  That's due to a speed optimization since an extra byte more than doubles the speed, I took it.

There are a few other cases like that where I take the extra speed instead of a smaller size.  My rule is if 1 byte increases speed more than 50% faster then I don't mind adding it.  That's why *2048 is 6 bytes instead of 5 for instance.

This looks cool!  I made this game before on the computer, its really addicting.  I'm also curious how you did the fill algorithm since there are 2 or more sides to every line and you have to detect if you've trapped anything in either one.