I have always wanted to make an assembler syntax that would take B→A and translate that to 78 (for ld a,b) and other such basicised assembly. Now I can do that!

If you can, that would be cool, but it isn't necessary

What do you mean by splitting your labels into two bytes? Do you mean getting the MSB and LSB?

Thx for feedback calc84maniac =]

For one thing, it seems like it would be really annoying to have to delete the assembled program manually each time I want to assemble it again.

That's an interesting point.
I guess adding some kind of overwriting (wih confirmation) feature shouldn't represent too much trouble.

And also, there are no bitshifting or bitwise operators... how am I supposed to split my labels into 2 bytes?

I'm actually thinking of adding those to the feature list (multiplication also if i can).
By curiosity, in which case would you need to access the lsb or msb of a label ?

Accessing the LSB or MSB is sometimes useful in optimisations. For example, when I am computing the address to write a pixel to the graph buffer, I often do something that includes setting the 6th bit of C and loading 93h into B.

Cool! Maybe you can have something in the source code that is an "Autodelete" token. So if you started with maybe AsmPrgm.NAME it would automatically delete the program NAME. I'm just throwing around ideas, but I do like this, so far! I have already had a scenario where I was without a computer and compiler, so I used this

NEWS

Fixed a few minor bugs.
The store token is now allowed in macro name definitions (Thx xeda112358).
Overwriting the destination program is now possible (Thx calc84maniac).
Added more extra loading instructions (XLD).
Added extra exchange instructions (XEX).

LIST OF CURRENT EXTRA INSTRUCTIONS (space>speed)

no requirements :

 XLD BC,DE
 XLD BC,HL
 XLD DE,BC
 XLD DE,HL
 XLD HL,BC
 XLD HL,DE

requires 1 available stack entry :

 XLD AF,BC
 XLD AF,DE
 XLD AF,HL
 XLD AF,IX
 XLD AF,IY
 XLD BC,AF
 XLD BC,IX
 XLD BC,IY
 XLD DE,AF
 XLD DE,IX
 XLD DE,IY
 XLD HL,AF
 XLD HL,IX
 XLD HL,IY
 XLD IX,AF
 XLD IX,BC
 XLD IX,DE
 XLD IX,HL
 XLD IX,IY
 XLD IY,AF
 XLD IY,BC
 XLD IY,DE
 XLD IY,HL
 XLD IY,IX

requires 2 available stack entries :

 XEX AF,BC
 XEX AF,DE
 XEX AF,HL
 XEX AF,IX
 XEX AF,IY
 XEX BC,DE
 XEX BC,HL
 XEX BC,IX
 XEX BC,IY
 XEX DE,IX
 XEX DE,IY
 XEX HL,IX
 XEX HL,IY
 XEX IX,IY

NEXT CHALLENGE

new operators :

*:multiplication
<<:logical bit shift left
>>:logical bit shift right
 and :bitwise and
 or :bitwise or
 xor :bitwise xor
[:left parenthese (calculation priority)
]:right parenthese (calculation priority)