11.2 Problem Set 2: PostScript Stack Commands

For this assignment you are to implement a PostScript command interpreter using a Stack. You must implement the stack using a singly-linked list. Solutions that use a data structure other than a singly-linked list will received no credit. The interpreter must read and execute a string of PostScript commands based on the following definitions: 1. = objn objn-1 obj1 = : objn-1 obj1 This command removes the topmost object form the stack and prints it.

2. count objn obj1count : [depth of the stack] objn obj1 This command puts the depth of the stack on the top of the stack.
3. clear objn obj1clear : [empty stack] This command removes all objects from the stack.
4. dup objn obj1 = : objn objn obj1 This command adds a duplicate copy of the top object to the stack .
5. exch objn objn-1 obj1 exch : objn-1 objn obj1 This command exchanges the position of the top two elements of the stack.
6. index objn obj1 a index : objn obja obj1 This command adds a copy of the ath object to the top the stack.
7. pop objn objn-1 obj1 pop : objn-1 . obj1 This command removes the top element from the stack.
8. stack This command prints a copy of the entire stack, starting from the top and working to the bottom.. The input will be a series of data and commands separated by a space. The data will go onto the stack. Commands do not go onto the stack. You must write at least one separate method for each of the commands. You may reuse the standard Stack methods discussed in class: push(), pop(), peek() and is_empty(). A template file has been provided.