We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
AnotherStonck
Jump to navigation
Jump to search
AnotherStonck is another stack language made by User:Mrtli08 which is another stack language.
Commands
| Name | Function |
|---|---|
| >n | Pushes the number n to the stack. |
| < | Pops the element above. |
| ! | Reverses stack. |
| + | Pops 2 elements above, adds them and pushes the result. |
| - | Pops 2 elements above, subtracts them and pushes the result. |
| * | Pops 2 elements above, multiplies them and pushes the result. |
| / | Pops 2 elements above, adds them and pushes the result. |
| ? | Pushes input. |
| . | Outputs the element above as ASCII. |
| {...}(n) | Loops until the element above is equal to n. |
| [...](n) | Loops until the element above is not equal to n. |
| ^(s) | Creates new stack s. |
| $(s) | Switches to stack s. |
| % | Duplicates the element above the stack. |
Example programs
Hello, world!
>72.>101.>108.>108.>111.>44.>32.>119.>111.>114.>108.>100.>33<
Computational class
It is easy to see that character subset >01<!{}() can easily simulate StackBit if we assume two sides of the stack are two seperate stacks:
| StackBit | AnotherStonck |
|---|---|
0 |
>0
|
1 |
>1
|
* |
<
|
~ |
!
|
[...] |
{...}(0)
|
Thus it is Turing-complete.