Stack whack
Jump to navigation
Jump to search
Stack whack is a stack-based language which can be compiled to BF.
Instructions
| Name | BF |
|---|---|
| (Number) | (+*Number)> |
| -(Number) | (-*Number)> |
| < | < |
| > | > |
| [ | <[ |
| ] | <] |
| ADD | <[-<+>] |
| SUB | <[-<->] |
| IN | ,> |
| OUT | <. |
Computational class
Stack whack is Turing-complete because with a few adjustments BF can be compiled into it.