Nqubl

Nqubl is an esoteric programming language created by David Catt (user:David.werecat) where instructions are queued and must be explicitly executed.

Instructions
Nqubl stores each instruction that it encounters in a queue. In order to execute all instructions in the queue, the  instruction is used. If an instruction is prefixed with  the instruction will execute immediately, bypassing the queue. This is known as an immediate instruction.

Memory is stored in eight stacks and eight registers. Each value stored in a register or on a stack is a signed integer, where FALSE is defined as 0 and TRUE is defined as -1. Registers behave like stacks, but are not cleared when the POP operation is given. The stacks are numbered 0-1,A-F; the registers are numbered 2-9. If a stack is popped when it is empty, a zero will be used instead. The program can operate on a single current stack at a time. The current stack starts at 0, but can be changed with the instruction. All operations are performed on the current stack. Values can be moved from the top of the current stack to another stack using the instruction.

Each instruction is one letter, although some instructions have a parameter which is appended to the instruction code. When an instruction operates on the stack, it will most likely consume the values (see table below). The values are ordered so the operation is executed as. Any unrecognized instructions or whitespace are ignored.

Cat Program

 * 1) igc~-1~=kx}ip{#

Hello, World!
"!dlrow ,olleH"ex

Fibonacci Numbers
s3~1~s0x#s2t0s3t0s0+s3t2s0t3s2nt0s0~1000000~>"E GT3S3T0T0T0T0S0 "i"=!KX}S2MS0# "d"=!KX}S2DS0# "s"=!KX}S2T3S4~0~]#S3T0S0~0~=KX}S3DS2T0S4T0S0+T4{#S4T2S0# "o"=!KX}S2NS0~10~P# S2T0T0S0 ~256~=!KX}S2~0~S0# ~-1~=!KX}S2~0~S0# [[[[[[[[{
 * 1) G~10~=KX}{#

External resources

 * Visual Basic .NET interpreter and sample programs