- At the end of this project, you are expected to be able to explain to anyone, without the help of Google:
- 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 common implementations of stacks and queues
- What are the most common use cases of stacks and queues
- What is the proper way to use global variables
- Allowed editors: vi, vim, emacs
- All your files will be compiled on Ubuntu 20.04 LTS using gcc, using the options -Wall -Werror -Wextra -pedantic -std=c89
- All your files should end with a new line
- A README.md file, at the root of the folder of the project is mandatory
- Your code should use the Betty style. It will be checked using betty-style.pl and betty-doc.pl
- 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
- The prototypes of all your functions should be included in your header file called monty.h
- Don’t forget to push your header file
- All your header files should be include guarded
- You are expected to do the tasks in the order shown in the project
- Please use the following data structures for this project. Don’t forget to include them in your header file.
/**
* struct stack_s - doubly linked list representation of a stack (or queue)
* @n: integer
* @prev: points to the previous element of the stack (or queue)
* @next: points to the next element of the stack (or queue)
*
* Description: doubly linked list node structure
* for stack, queues, LIFO, FIFO
*/
typedef struct stack_s
{
int n;
struct stack_s *prev;
struct stack_s *next;
} stack_t;
/**
* struct instruction_s - opcode and its function
* @opcode: the opcode
* @f: function to handle the opcode
*
* Description: opcode and its function
* for stack, queues, LIFO, FIFO
*/
typedef struct instruction_s
{
char *opcode;
void (*f)(stack_t **stack, unsigned int line_number);
} instruction_t;
gcc -Wall -Werror -Wextra -pedantic -std=c89 *.c -o monty
- Any output must be printed on stdout
- Any error message must be printed on stderr
- Here is a link to a GitHub repository that could help you making sure your errors are printed on stderr
- We strongly encourage you to work all together on a set of tests
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:
julien@ubuntu:~/monty$ cat -e bytecodes/000.m
push 0$
push 1$
push 2$
push 3$
pall $
push 4$
push 5 $
push 6 $
pall$
julien@ubuntu:~/monty$
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:
julien@ubuntu:~/monty$ cat -e bytecodes/001.m
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!$
julien@ubuntu:~/monty$
All the files are compiled in the following form:
gcc -Wall -Werror -Wextra -pedantic *.c -o monty.
Available Operation Codes:
Opcode | Description |
---|---|
push | Pushes an element to the stack. e.g (push 1 # pushes 1 into the stack) |
pall | Prints all the values on the stack, starting from the to of the stack. |
pint | Prints the value at the top of the stack. |
pop | Removes the to element of the stack. |
swap | Swaps the top to elements of the stack. |
add | Adds the top two elements of the stack. The result is then stored in the second node, and the first node is removed. |
nop | This opcode does not do anything. |
sub | Subtracts the top two elements of the stack from the second top element. The result is then stored in the second node, and the first node is removed. |
div | Divides the top two elements of the stack from the second top element. The result is then stored in the second node, and the first node is removed. |
mul | Multiplies the top two elements of the stack from the second top element. The result is then stored in the second node, and the first node is removed. |
mod | Computes the remainder of the top two elements of the stack from the second top element. The result is then stored in the second node, and the first node is removed. |
# | When the first non-space of a line is a # the line will be trated as a comment. |
pchar | Prints the integer stored in the top of the stack as its ascii value representation. |
pstr | Prints the integers stored in the stack as their ascii value representation. It stops printing when the value is 0, when the stack is over and when the value of the element is a non-ascii value. |
rotl | Rotates the top of the stack to the bottom of the stack. |
rotr | Rotates the bottom of the stack to the top of the stack. |
stack | This is the default behavior. Sets the format of the data into a stack (LIFO). |
queue | Sets the format of the data into a queue (FIFO). |