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
gcc -Wall -Werror -Wextra -pedantic *.c -o monty
./monty file where 'file' is the path to the file containing Monty byte code
cat -e bytecodes/00.m
push 1$
push 2$
push 3$
pall$
$ ./monty bytecodes/00.m
3
2
1
push /*adds the int to stack/queue*/
pall /*prints all the elements from top to bottom*/
pint /*prints the top element*/
pop /*deletes the top element*/
swap /*swaps the top two elements*/
add /*adds the top element to its previous one and makes it the top one*/
sub /*subtractss the top element from previous one and makes it the top one*/
div /*dividess the top element with previous one and makes it the top one*/
mul /*multiplies the top element with previous and makes it the top one */
mod /*modules the top element with previous and makes it the top one*/
nop /*does nothing*/
pchar /*prints the ascii char with the value of the top element*/
pstr /*prints all ascii char of the entire list until the 1st non-matching*/
rotl /*rotates the stack to the top*/
rotr /*rotates the stack to the bottom*/
stack /*sets push mode to LIFO*/
queue /*sets push mode to FIFO*/
Every good language comes with the capability of commenting. When the first non-space character of a line is #, line is treated as a comment.
Functions:
int main(int ac, char **av); --- main interpreters function
int processor(char *line, unsigned int ln, stack_t **top); --- parses input line
void free_stack(stack_t **top); --- free's the stack/double linked list
void free_mem(stack_t **top); --- free's allocated memory and EXIT_FAILURE
int make_int(stack_t **top, char *n, unsigned int ln); --- converts string to int and returns it
header file containing all function's and struct's prototypes
void push(stack_t **top, int n); --- instruction push
void pall(stack_t **head, unsigned int line_number); --- instruction pall
void pint(stack_t **head, unsigned int line_number); --- instruction pint
void pop(stack_t **head, unsigned int line_number); --- instruction pop
void swap(stack_t **head, unsigned int line_number); --- instruction swap
void add(stack_t **head, unsigned int line_number); --- instruction add
void sub(stack_t **head, unsigned int line_number); --- instruction sub
void nop(stack_t **head, unsigned int line_number); --- instruction nop
void mul(stack_t **head, unsigned int line_number); --- instruction mul
void divv(stack_t **head, unsigned int line_number); --- instruction div
void mod(stack_t **head, unsigned int line_number); --- instruction mod
void pchar(stack_t **head, unsigned int line_number); --- instruction pchar
void pstr(stack_t **head, unsigned int line_number); --- instruction pstr
void rotl(stack_t **head, unsigned int line_number); --- instruction rotl
void rotr(stack_t **head, unsigned int line_number); --- instruction rotr
void queue(stack_t **head, unsigned int line_number); --- instruction queue
void stack(stack_t **head, unsigned int line_number); --- instruction stack