CS202 Computer Science II

FAQ	Newsboard	Telnet	Email TA	Lectures	Assignments	Man pages	Help

Assignment 7.1
Due December 7th in class

Implement a stack using a linked list instead of arrays. Write a program that uses this stack class to ensure that every open parenthesis, curly brace, and square brace has a mathcing close parenthesis, curly brace, and square brace respectively. This is very similar to assignments one and two.

For example: In

  if(a < b) { vec[i]  = 2;}

Everything matches. But in

  if(a < b) { vec[i} = 2;}

There is a mismatch;

Constraints

I should also be able to compile and execute the main function for assignment two.
You CANNOT assume anything about the number of items that can be stacked.
You may use the same test cases as for aassignment two, but you will need additional cases.

Use the normal turning procedure.