https://github.com/kaoutherbo/monty
Stacks, Queues - LIFO, FIFO project
https://github.com/kaoutherbo/monty
alx-challenge c cmdline fifo-queue lifo-stack queue stuck
Last synced: 12 months ago
JSON representation
Stacks, Queues - LIFO, FIFO project
- Host: GitHub
- URL: https://github.com/kaoutherbo/monty
- Owner: Kaoutherbo
- Created: 2024-01-18T12:27:08.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-01-20T23:22:01.000Z (about 2 years ago)
- Last Synced: 2025-03-27T22:42:47.607Z (about 1 year ago)
- Topics: alx-challenge, c, cmdline, fifo-queue, lifo-stack, queue, stuck
- Language: C
- Homepage:
- Size: 44.9 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Stacks, Queues - LIFO, FIFO:
## Stuck
In software development, `stuck` refers to issues or tasks that are currently blocked or facing obstacles.
## Queue
The `queue` section outlines the tasks that are lined up for future development.
# The Monty language:
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.
# Usage:
To use the Monty Byte Code Interpreter, follow these instructions:
```
$ monty file
Where file is the path to the file containing Monty byte code.
```
## Tasks:
## Mendatory tasks:
| Task | File | Description |
| ---------------------------- | ------------------------------------------- | ----------------------------------------------------- |
| 0. push, pall | [opcode_functs1.c](./opcode_functs1.c) | push an element to the stack and print all the values |
| 1. pint | [opcode_functs1.c](./opcode_functs1.c) | prints the value at the top of the stack |
| 2. pop | [opcode_functs1.c](./opcode_functs1.c) | removes the top element of the stack |
| 3. swap | [opcode_functs2.c](./opcode_functs2.c) | swaps the top two elements of the stack |
| 4. add | [operations_functs.c](./operations_functs.c)| adds the top two elements of the stack |
| 5. nop | [opcode_functs2.c](./opcode_functs2.c) | doesn't do anything |
## Advenced tasks:
| Task | File | Description |
| ---------------------------- | -------------------------------------------------- | -------------------------------------------------------------- |
| 6. sub | [operations_functs.c](./operations_functs.c) | subtracts the top element of the stack |
| 7. div | [operations_functs.c](./operations_functs.c) | divides the second top element of the stack |
| 8. mul | [operations_functs.c](./operations_functs.c) | multiplies the second top element of the stack |
| 9. mod | [operations_functs.c](./operations_functs.c) | computes the rest of the division of the second top element |
| 10. comments | [get_function.c](./get_function.c) | treat the line startes with # as a comment (don’t do anything).|
| 11. pchar | [print_functs.c](./print_functs.c) | prints the char at the top of the stack, followed by a new line|
| 12. pstr | [print_functs.c](./print_functs.c) | prints the string starting at the top of the stack |
| 13. rotl | [rotations_functs.c](./rotations_functs.c) | rotates the stack to the top |
| 14. rotr | [rotations_functs.c](./rotations_functs.c) | rotates the stack to the bottom |
| 15. stack, queue | [monty.c](./monty.c) | Implement the stack and queue opcodes. |
| 16. Brainf*ck | [bf/1000-school.bf](./bf/1000-school.bf) | prints School, followed by a new line. |
| 17. Add two digits | [bf/1001-add.bf](./bf/1001-add.bf) | Add two digits given by the user. |
| 18. Multiplication | [bf/1002-mul.bf](./bf/1002-mul.bf) | Multiply two digits given by the user. |
| 19. Multiplication level up | [bf/1003-mul.bf](./bf/10023-mul.bf) | Multiply two digits given by the user. |
# Compilation & Output
The code will be compiled this command:
```
$ gcc -Wall -Werror -Wextra -pedantic -std=c89 *.c -o monty
```