Well except for the operators, my problem is CGIASM is pretty much solved. I'll need to replace 3 bits of binary for any operands, but what I didn't realize before was that octals replace three bits at a time (111b = 8d). I do something like this, only with octals: Instruction code: 11010001 where 000 is the space for the coding of the operand
If I then find that the specified operand codes as 101, I add 1010 to tha number:
11010001
+00001010 I get the final code, for INSTRUCTION OPERAND:
11011010
If I just convert everything to Octals, it solved. No if I could just figure out those rogue operators....
