Skip to content

MYacinedouaouria/monty

Repository files navigation

Monty

0x19. C - Stacks, Queues - LIFO, FIFO

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.

Monty byte code 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!$

Usage

All the files are compiled in the following form:

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

To run the program:

 ./monty bytecode_file

Available operation codes:

Opcode Description
push pushes an element to the stack.
pall prints all the values on the stack, starting from the top of the stack
pint prints the value at the top of the stack, followed by a new line
pop removes the top element of the stack
swap swaps the top two elements of the stack
add adds the top two elements of the stack.
nop doesn’t do anything.
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.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published