Monty 0.98 is a scripting language that is first compiled into Monty byte codes (Just like Python). It relies on a unique stack, with specific instructions to manipulate it.
Files containing Monty byte codes usually have the .m extension. Most of the industry uses this standard but it is not required by the specification of the language. There is not more than one instruction per line. There can be any number of spaces before or after the opcode and its argument:
- Must have git installed
sudo apt-get install git- Clone the repo into a new directory
git clone https://github.com/3akare/monty.gitComplile with:
gcc @flags *.c -o montyRun the interpreter on a file
./monty file.m| Opcode | Description | Usage |
|---|---|---|
| push | Add an integer to the stack | push<int> |
| pall | Prints all the values on the stack and takes no value | pall |
| pint | Prints the value at the top of the stack | pint |
| pop | Removes the element at the top of the stack | pop |
| swap | swaps the top two elements of the stack | swap |
| add | add the top two elements of the stack | add |
| mul | multiplies the top two elements of the stack | mul |
| sub | subtracts the top element from the element below it on the stack | sub |
| div | divides the second top element of the stack by the top element | div |
| mod | computes the rest of the division of the second top element of the stack by the top element of the stack | mod |
| pchar | prints the char at top of the stack | pchar |
| pstr | prints the string starting at the top of the stack | pstr |
| stack | sets the format of the data to a stack (LIFO). This is the default behavior of the program. | stack |
| queue | sets the format of the data to a queue (FIFO). | queue |
| rotr | Rotates the stack to the bottom | rotr |
| rotl | Rotates the stack to the top | rotl |
| nop | Does nothing | nop |
NOTE:
- monty interpreter runs in the default STACK (LIFO) mode. To switch mode to QUEUE (FIFO), see examples below.
- A line that begins with
#is regarded as a comment.
Push values onto the stack and print them all, or the top pf the stack /front of the queue
$ cat file.m
push 1
push 2
push 3
# this is a comment
pall
pint
$ ./monty file.m
3
2
1
3Mathematical operations like add, div, mod, mul, etc. Takes the second from the top and performs the operation on the top. The top is then deleted (popped) with the result stored in the second from the top
$ cat file.m
push 3
push 2
push 1
pall
add
pall
$ ./monty file.m
1
2
3
1
5Entering Queue mode swtiches all operations to FIFO instead of the default LIFO.
$ cat file.m
queue
push 1
push 2
push 3
pall
stack
push 4
push 5
push 6
pall
1
2
3
6
5
4
1
2
3- 0.1.0
This project was written as part of the curriculum for Holberton/ALX-SE program.