Yes, and especially stuff like {P*2+4390+E+C}++; because whenever you have the form {EXP}+1->{EXP}, the expression has to be evaluated twice, while with the ++ and -- it only needs to be evaluated once.

Yes:

DelVar "prgmNAME"


Think about it in binary: 7 is %00000111 and 5 is %00000101. ANDing them together would give you %00000101, which should be 5.

What AND does is leave on all the bits that are on in both operands and turn off all the others. If you want to turn off a specific bit, you should AND it with a number with just that bit turned off -- for example, to turn off the first bit (second rightmost), you'd use AND %11111101.

Here's how I learned it: http://eeezor.ec3club.tk/Files/Resources/Tutorials/ASMin28Days/lesson/day08.html

Actually, N and not(P) is all you need.

with the number in decimal form, it just cuts off the digits to the right of the decimal point.  So closer to zero, I guess.

In Axe, calculations that would generate decimals, such as division, will always be truncated. When dealing with positive numbers, this means results are rounded down. However, with negative numbers, the story changes slightly depending upon how the math is performed.

With something like ⁻10//3, the signed division routine converts any negative inputs to positives and then corrects the sign later. So it actually calculates the result of 10/3 which gives 3 due to truncation, but then negating the final answer to correct for the signs results in the answer actually having been rounded to zero from -3.333...

However, with optimized divisions like ⁻7//2, the inputs are not first converted to positive numbers and then operated on, resulting in the truncation actually rounding down to ⁻4.


In summary:

• Normal division: rounds to zero (down)
• Signed division: rounds to zero (not always down)
• Signed disivion by optimized constants: rounds down