This project challenges us to create a double linked list, interpreting the Monty language through the bytecode

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 is 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:

hsh~$ cat -e bytecodes/000.m
push 0$
push 1$
push 2$
  push 3$
                   pall    $
push 4$
    push 5    $
      push    6        $
pall$

Some of the challenges of this project are:

• Explain without the help of Google some concepts such as: What do LIFO and FIFO mean, What is a stack, and when to use it, What is a queue, and when to use it, What are the most common use cases of stacks and queues, etc.

• Work in: vi, vim, emacs editos.
• All your files should end with a new line.
• You allowed to use a maximum of one global variable.
• No more than 5 functions per file.
• You are allowed to use the C standard library.
• Don’t forget to push your header file, in this case it's called "monty.h".

The code will be compiled this way:

$ gcc -Wall -Werror -Wextra -pedantic *.c -o monty

Usage: monty file, where file is the path to the file containing Monty byte code. example:

$ ./monty bytecodes/01.m

Andres Felipe Garcia y Jonatan Mazo Castro.