CS 15-121 Introduction to Data Structures                 Lab 4

1. Write a java program called StringParser, that will ask the user to input a string and parse it.
2. In the main method, ask the user to enter a string, and for each character of the string, output the type of character you have encountered.
3. Note that the allowed types of input are the alphabet, numbers, the operators +,*,% and /, and finally parenthesis.
	Sample output for the string ab+() is given below:
	a 	Character
	b	Character
	+	Operator
	(	Left Parenthesis
	)	Right Parenthesis

4. Print the output for the string (/(*A(+BC))D)
5. A queue is similar to a stack, but it has two pointers, one to point to the front and one to point to the rear.  Insertion is done through the rear and deletion is done through the front.
6. Create a class called Queue. It should have an array of integers of size 10 that will represent a queue, and two integer variables called front and rear.
7. Define methods to push and pop from the Queue class.
8. In the main method of the Queue class, create an instance of the Queue, and add the numbers 12,3,43,54,65 onto it.
9. Now remove all the numbers and print them to the console.
10. A stack is a data structure that is LIFO, i.e. Last in First out since the last element to be pushed into the stack is the first to be popped.
11. A queue is a data structure that is ______.