CMPS 223 Data Structures and Algorithms 
             Stack Implementation and Application


I.  Write C++ program that

	1. Randomly generate integer-only infix arithmetic expressions with 
	   following features:
		-- it contains X amount of operators, where X is between
		   maxOP (=8 operator) and minOP (=3 3 operator),
		-- The binary operators of an expressions are limited to
		   addition (+), subtraction(-), multiplication (*),
		   divisiton (/) and modulus (%),
		-- operands are integers only, and are between 1 and 10 
		   inclusively,
		-- the expression and its subexpressions will have 50%
		   chance to have parentheses,
	2. Implemente Dynamic Array-based class Template, named
	   DStack<typename T>, with proper constructors, bool empty(),
	   void push(T item), void pop(), T top() functions. Add any
	   member functions as needed,
	3. Convert an infix integer expression into a postfix expression
	   using DStack stack class template based on dynamic array,
	4. Evaluate the value for a integer infix expression from the
	   equivalent postfix expression, 
	5. Design a menu-driven program to complete the task.


II. Related Files

   To see or review the algorithm of converting infix expression
to postfix expression, copy /usr/users/wang/223/AExpression to your
directory and run AExpression.