I don't mind trading my opinion for a better one,
but not for one with equal or lesser value.
Original Brainfuck | |
> | Move pointer to the right |
---|---|
< | Move pointer to the left |
+ | Increase current cell with 1 |
- | Decrease current cell with 1 |
[ | Continue if current cell is not 0, ignore untill matching ] if it is 0 |
] | Go back to matching [ unless the current cell is 0; |
. | Output current cell (literal value); |
, | Input literal value in current cell; |
Extended Brainfuck | |
? | Random number |
" | Inputs all characters following to the cell and moves pointer 1 to the right untill another " is encountered |
$ | Pushes current cell value to the storage stack |
! | Pops the storage stack and inputs it in the current cell; |
* | Multiplies the current cell value with the top of the storage stack, the storage stack is popped. |
/ | Devides the current cell value with the top of the storage stack, the storage stack is popped. |
= | Adds the current cell value with the top of the storage stack, the storage stack is popped. |
_ | Subtracts the current cell value with the top of the storage stack, the storage stack is popped. |
% | Takes the current cell value and performs a modules with the top of the storage stack, the storage stack is popped. |
~ | If current cell is 0, it becomes 1, otherwise it becomes 0 |
: | Output current cell (as ASCII); |
, | Input literal value in current cell; |
; | Input charcode value in current cell; |
& | Call procedure with the id equal to the current cell |
( | Define procedure with id equal to the current cell |
) | Close the procedure and continue operation from where it left off |
{ | Create new memory tape |
} | Return to previous memory tape |
^ | Breaks current procedure or loop |
@ | Shuts down the program and dumps memory information |