Mint

From Esolang
Jump to navigation Jump to search

Mint, finally an esolang by User:Hajunsheng that is Turing-complete,[proof needed] the only issue is its still in scratch. at least it uses stacks now! reminder: no ascii is used, ever. visit

Everything before the program

one variable i will call mint

one stack i will call stack

another stack called back (numbers)

Commands

Command Description
^ adds mint to stack.
v deletes last from stack and sets mint to last in stack before deleting.
~ sets mint to first character of next user input.
> rotates by moving the first in the stack to the end.
* pushes back to code pointer.
= sets code pointer to last of back if mint is not equal to last of stack.
< will set mint to next character in code e.g. "<u" "<t".
+ adds last of stack to mint and adds the result to stack while deleting the one in the list that was used to add.

at all points of the program the stack will be printed

Examples

Ok fine I will make examples, but they are simple not like I'm going to make a python interpreter here.

program that prints 1 character of user input:

~^

program that takes user input forever and prints it until enters 0 and prints all entered:

*~^<0=

Also

if you want to subtract for some reason idc just make the second to top character "-" and use + for subtracting mint from stack and to run last thing from the stack for some reason you do it by making mint "$" and then putting the command at the last of the stack and use + but before running the last of list it first deletes it and then runs the deleted on the now last of stack, it continues like this until it encounters a $ in the stack and if mint is ? and last of list exists it has a chance to set that value to 0 when using +. also forward jumps for = supported by doing smth like "=maybe skipped code*" so just flip the = signs. and + can get parts of the code starting from first item by taking first until "," is reached in code, then it stops adding to stack but the i is remembered for next time.


© 2025 Hajunsheng. Licensed under Creative Commons BY-NC-SA 4.0.