http://www.cs.fsu.edu/~kartik/cop4530/projs/proj3.html
1 of 3 4/27/2006 2:49 PM
Assignment 3 : Implementing and Using the Stack ADT
Due Date: March 13 Monday 9:00am
Goal: In this project, you will implement the Stack ADT using the STL List class. You will then use your
implementation of Stack ADT to write a program that converts infix notations to postfix notations.
The following files are given to you:
lstack.h: Skeleton file for list-based stack implementation.
i2p: Sample executable for converting infix expressions to postfix.
Grading guidelines.
Deliverables: Please turn in a makefile and all header (*.h) and cpp (*.cpp) files that are needed to build
your software. Turn in your development log too, which should be a plain ASCII text file called LOG.txt in
your project directory. You will submit all of these using the campus blackboard submission system. Detailed
submission instructions can be found by clicking on the [Submissions] link on the course website
http://www.cs.fsu.edu/~kartik/cop4530/index.html
Background: Your first task is to write an adaptor class that implements the Stack ADT using the STL List
class as the adaptee.
You are given the function interface for a class template called LStack in the file lstack.h:
template <typename Object>
class LStack {
public:
LStack( ); // constructor
LStack(const LStack & rhs); // The copy constructor
stack & operator=(const stack &); // assignment operator
bool empty( ) const; // Returns true if the stack contains no elements,
and false otherwise. S.empty( ) is equivalent to S.size( ) == 0.
int size( ) const; // Returns the number of elements contained in the
stack.
Object & top( ); // Returns a mutable reference to the element at the top
of the stack. Precondition: empty( ) is false.
const Object & top( ) const; //Returns a const reference to the element
at the top of the stack. Precondition: empty( ) is false.
void push(const Object & x); // Inserts x at the top of the stack.
Postconditions: size( ) will be incremented by 1, and top( ) will be equal
to x.
void pop( ); // Removes the element at the top of the stack.
Precondition: empty( ) is false. Postcondition: size( ) will be
decremented by 1.
private:
list<Object> store; // STL List storing the objects in the stack
