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.
Aprknia
Jump to navigation
Jump to search
Aprknia is an esolang by User:ChuckEsoteric08 based on 1.
Description
It works on a stack with unbounded signed integers.
| Instruction | Description. |
|---|---|
* |
Pop a and b and push b+a, followed by b-a, followed by b*a, followed by b/a and then followed by b mod a. Division and modulo by zero return zero. Division rounds down towards zero |
1 |
Push 1 to the stack. |
! |
Pop top of the stack. |
~ |
Swap top two stack elements. |
[...] |
While TOS is positive do code inside the brackets. Loops can be nested |
, |
Pop a. If a mod 3 is 0, push ASCII value of the next byte of user input. If a mod 3 is 1, pop b and output it as an ASCII character. If a mod 3 is 2, output current cell as an integer. |
Useful code snippets
b+a
*!!!!
b-a
*!!!~!
Push b*a
*!!~!~!
Push b/a
*!~!~!~!
Push b%a
*~!~!~!~!
Computational class
It is easy to see that it can simulate Minsky machine either as encoding counters as top two stack values or as prime factors of top two stack values.