Holberton School - 0x18. C - Stacks, Queues - LIFO, FIFO

Description

The focus of this project is to learn:

• the definitions of LIFO and FIFO.
• what a stack is and when to use it.
• what a queue is, and when to use it.
• the common implementations of stacks and queues.
• the most common use cases of stacks and queues.
• the proper way to use global variables
• how to work with git submodules

Environment

• Ubuntu 14.04 LTS
• gcc standard C90

New commands / functions used:

N/A

Helpful Links

• http://stackoverflow.com/questions/1433204/how-do-i-use-extern-to-share-variables-between-source-files-in-c
• https://github.com/blog/2104-working-with-submodules

File Descriptions

• main.c: entry point for Monty bytecode interpreter
• execute.c: executes the requested bytecode operation
• functions.c: contains helper functions for the Monty bytecode interpreter
• calc_ops.c: functions for executing math bytecode operations.
• error.c: functions for raising various errors and in some instances exiting with code.
• print_ops: executes various bytecode operations associated with printing node elements of the stack
• push_pop_ops.c: bytecode operations push, pop and nop
• manipulation_ops.c: bytecode operations that move stack elemnts to a different position
• stack_queue.c: (not implemented) bytecode operations to move the head pointer to either the top or bottom of the stack
• add_node.c: adds an element to the top of the stack
• string_functions.c: various string manipulation functions
• monty.h: header file for the Monty bytecode interpreter

Authors

Stuart Kuredjian @stueygk

Spencer Cheng @spencerhcheng

License

Public Domain, no copyright protection