4ME
Jump to navigation
Jump to search
| Designed by | User:Ractangle |
|---|---|
| Appeared in | 2024 |
| Memory system | Queue-based |
| Computational class | Possibly Turing complete |
| Reference implementation | GitHub Repo |
| File extension(s) | .wm |
4ME is a programming language created by User:Ractangle
Commands
| Command | It's action |
|---|---|
| P: | Starts the program |
| out{...} | Prints a string |
| is | Gets string input and pushes it to the stack |
| ns | Same thing as is but uses number input
|
| add{...} | Pushes a value to the stack |
| pop | Pop's element from stack |
| get | Prints a element on the stack and pop's the element |
| +,-,*,/ | Operators |
| duplicate | duplicate the top value on the stack |
| store | Moves element from the stack to the other stack |
| unstore | the opposite of store
|
Errors
| The action to error | S Code |
|---|---|
| Not having any code in the line at all | S1456 |
| Outputing variable v with out seting it to a value | S3452 |
| No P: at the start of the file | S1245 |
Examples
Hello, world!
P:
out{Hello, world!}
Cat program
P: is get
A+B Problem
P: ns ns + get
Computational Class
Well if the langauge suported functions definition and if condtions (i don't know how do i add that in) then it whould probabaly be turing complete. Despite the fact that the programming language has 2 queue stacks, it's still not turing complete. probabaly