A language interpreter made in the C programming language to manage stacks and queues (LIFO and FIFO). The aim is to interpret Monty bytecodes files. Monty is a language that aims to close the gap between scripting and programming languages.
To compile this project, you can use the following command:
$ make
The opcode push pushes an element to the stack.
Usage: push <int>, where int is an integer.
The opcode pall prints all the values on the stack, starting from the top of the stack.
Usage: pall. If the stack is empty, pall don’t print anything.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/push_pall_0.m
push 1$
push 2$
push 3$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/push_pall_0.m
3
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode pint prints the value at the top of the stack, followed by a new line.
Usage: pint. If the stack is empty, pint print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/pint.m
push 1$
pint$
push 2$
pint$
push 3$
pint$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/pint.m
1
2
3
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode pop removes the top element of the stack.
Usage: pop. If the stack is empty, pop print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/pop.m
push 1$
push 2$
push 3$
pall$
pop$
pall$
pop$
pall$
pop$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/pop.m
3
2
1
2
1
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode swap swaps the top two elements of the stack.
Usage: swap. If the stack contains less than two elements, swap print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/swap.m
push 1$
push 2$
push 3$
pall$
swap$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/swap.m
3
2
1
2
3
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode add adds the top two elements of the stack. The result is stored in the second top element of the stack, and the top element is removed, so that at the end:
- The top element of the stack contains the result
- The stack is one element shorter
Usage: add. If the stack contains less than two elements, add print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/add.m
push 1$
push 2$
push 3$
pall$
add$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/swap.m
3
2
1
5
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode nop doesn’t do anything.
Usage: nop.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/nop.m
nop$
push 1$
nop$
push 2$
nop$
push 3$
nop$
pall$
nop$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/nop.m
3
2
1
3
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode sub subtracts the top element of the stack from the second top element of the stack. The result is stored in the second top element of the stack, and the top element is removed, so that at the end:
- The top element of the stack contains the result
- The stack is one element shorter
Usage: sub. If the stack contains less than two elements, sub print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/sub.m
push 1$
push 2$
push 10$
push 3$
sub$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/sub.m
7
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode div divides the second top element of the stack by the top element of the stack. The result is stored in the second top element of the stack, and the top element is removed, so that at the end:
- The top element of the stack contains the result
- The stack is one element shorter
Usage: div. If the stack contains less than two elements, div print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/div.m
push 1$
push 2$
push 10$
push 5$
div$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/div.m
2
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode mul multiplies the second top element of the stack with the top element of the stack. The result is stored in the second top element of the stack, and the top element is removed, so that at the end:
- The top element of the stack contains the result
- The stack is one element shorter
Usage: mul. If the stack contains less than two elements, mul print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/mul.m
push 1$
push 2$
push 20$
push 5$
mul$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/mul.m
100
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode mod computes the rest of the division of the second top element of the stack by the top element of the stack. The result is stored in the second top element of the stack, and the top element is removed, so that at the end:
- The top element of the stack contains the result
- The stack is one element shorter
Usage: mod. If the stack contains less than two elements, mod print an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/mod.m
push 1$
push 2$
push 20$
push 5$
mod$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/mul.m
0
2
1
$ amonkeyprogrammer@ubuntu:~/monty$
Every good language comes with the capability of commenting. When the first non-space character of a line is #, treat this line as a comment (don’t do anything).
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/comments.m
#hello world$
#hahahaha$
#cisfun$
#montyisfun$
push 10$
push 2$
push 8$
push 5$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/comments.m
5
8
2
10
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode pchar prints the char at the top of the stack, followed by a new line. The integer stored at the top of the stack is treated as the ascii value of the character to be printed.
Usage: pchar
- If the value is not in the ascii table (
man ascii),pcharprint an error message. - If the stack is empty,
pcharprint an error message.
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/pchar.m
push 72$
pchar$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/pchar.m
H
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode pstr prints the string starting at the top of the stack, followed by a new line. The integer stored in each element of the stack is treated as the ascii value of the character to be printed.
Usage: pstr. If the stack is empty, pstr print only a new line
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/pstr.m
push 1$
push 2$
push 3$
push 4$
push 0$
push 110$
push 0$
push 121$
push 116$
push 110$
push 111$
push 77$
pstr$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/pstr.m
Monty
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode rotl rotates the stack to the top. The top element of the stack becomes the last one, and the second top element of the stack becomes the first one.
Usage: rotl
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/rotl.m
push 1$
push 2$
push 3$
push 4$
push 5$
push 6$
push 7$
push 8$
push 9$
push 0$
pall$
rotl$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/rotl.m
0
9
8
7
6
5
4
3
2
1
9
8
7
6
5
4
3
2
1
0
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode rotr rotates the stack to the bottom. The last element of the stack becomes the top element of the stack.
Usage: rotr
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/rotr.m
push 1$
push 2$
push 3$
push 4$
push 5$
push 6$
push 7$
push 8$
push 9$
push 0$
pall$
rotr$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/rotr.m
0
9
8
7
6
5
4
3
2
1
1
0
9
8
7
6
5
4
3
2
$ amonkeyprogrammer@ubuntu:~/monty$
The opcode stack sets the format of the data to a stack (LIFO). This is the default behavior of the program.
Usage: stack
The opcode queue sets the format of the data to a queue (FIFO).
Usage: queue
- The top of the stack becomes the front of the queue
- The front of the queue becomes the top of the stack
$ amonkeyprogrammer@ubuntu:~/monty$ cat -e bytecodes/queue_stack.m
queue$
push 1$
push 2$
push 3$
pall$
stack$
push 4$
push 5$
push 6$
pall$
add$
pall$
queue$
push 11111$
add$
pall$
$ amonkeyprogrammer@ubuntu:~/monty$ ./monty.run bytecodes/queue_stack.m
1
2
3
6
5
4
1
2
3
11
4
1
2
3
15
1
2
3
11111
$ amonkeyprogrammer@ubuntu:~/monty$
Brainfuck is an esoteric programming language created in 1993 by Urban Müller. Here are some testing scripts.
Write a Brainf*ck script that prints Holberton, followed by a new line.
- All your Brainf*ck files should be stored inside the bf sub directory
- You can install the bf interpreter to test your code:
sudo apt-get install bf
Source: bf/1000-holberton.bf
$ amonkeyprogrammer@ubuntu:~/monty/bf$ bf 1000-holberton.bf
Holberton
$ amonkeyprogrammer@ubuntu:~/monty/bf$
Add two digits given by the user.
- Read the two digits from stdin, add them, and print the result
- The total of the two digits with be one digit-long (<10)
Source: bf/1001-add.bf
$ amonkeyprogrammer@ubuntu:~/monty/bf$ bf ./1001-add.bf
81
9$ amonkeyprogrammer@ubuntu:~/monty/bf$