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. The goal of this project was to create an interpreter for Monty ByteCodes files.
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:
push 0
push 1
push 2
push 3
pall
push 4
push 5
push 6
pall
Monty byte code files can contain blank lines (empty or made of spaces only, and any additional text after the opcode or its required argument is not taken into account:
push 0 Push 0 onto the stack
push 1 Push 1 onto the stack
push 2
push 3
pall
push 4
push 5
push 6
pall This is the end of our program. Monty is awesome!
gcc -Wall -Werror -Wextra -pedantic *.c -o monty
Output is printed on stdout.
Any error message are printed on stderr
monty file
where file is the path to the file containing Monty byte code
| File name | Description |
|---|---|
| monty.c | Entry point to the program |
| file_handling.c | Contain functions that are involved in reading instructions from the file |
| interpret.c | Contain functions ressponsible for stepping through each instruction and interprating |
| instructions.c | Functions responsible for operations perfomed from opcodes instructions |
| instructions2.c | An extension of instructions.c. Opcodes functionality |
| instructions3.c) | An extension of instructions.c. Opcodes functionality |
| instructions4.c) | An extension of instructions.c. Opcodes functionality |
| stack_handling.c | Contains functions involved in manipulating elements in a stack, ie pushing, popping ... |
| stack_handling2.c | An extension of stack_handling2.c functions |
| string_functions.c | Contains functions responsible for string handling and validations |
| error_handling.c | Functions responsible for error handling including handling safe exitting on errors |
| monty.h | Contains all function prototypes, data structures and header files |
| bytecodes | Folder that contains monty bytecodes test files |
| Opcode | Description |
|---|---|
| push | pushes an element to the stack. Usage: push <int> |
| pall | prints all the values on the stack, starting from the top of the stack. Usage: pall |
| pint | prints the value at the top of the stack, followed by a new line. Usage: pint |
| pop | removes the top element of the stack. Usage: pop |
| swap | swaps the top two elements of the stack. Usage: swap |
| add | adds the top two elements of the stack. Usage: add. Result is stored in the second top element of the stack, and the top element is removed |
| nop | doesn’t do anything. Does absolutely nothing. Usage: nop |
| sub | subtracts the top element of the stack from the second top element of the stack |
| div | divides the second top element of the stack by the top element of the stack |
| mul | multiplies the second top element of the stack with the top element of the stack |
| mod | computes the rest of the division of the second top element of the stack by the top element of the stack. i.e modulus |
| comments | ignores instruction when the first non-space character of a line is #. On encountering # it does absolutely nothing |
| pchar | prints the char at the top of the stack |
| pstr | prints the string starting at the top of the stack |
| rotl | rotates the stack to the top. top element of the stack becomes the last one, and the second top element of the stack becomes the first one |
| rotr | rotates the stack to the bottom. The last element of the stack becomes the top element of the stack |
| stack | sets the format of the data to a stack (LIFO) |
| queue | sets the format of the data to a queue (FIFO) |
Brainfuck is an esoteric programming language created in 1993 by Urban Müller. Notable for its extreme minimalism, the language consists of only eight simple commands and an instruction pointer.
All Brainf*ck files are stored inside the bf sub directory. Install the bf interpreter to run code in brainfuck files: sudo apt-get install bf. Enter into the directory and run bf filename
| File name | Description |
|---|---|
| 1000-holberton.bf | prints Holberton, followed by a new line |
| 1001-add.bf | Add two digits given by the user. Iotal of the two digits will be one digit-long (<10) |
Alex Steve [mutheeal.am@gmail.com]