Parsing expressions

There is a handout outside my office that describes the next homework assignment. You are going to write two programs: one translates expressions (Strings) from infix to postfix; the other evaluates the postfix expression.

The second one is easier, so you should do it first. Your assignment for the weekend is to read the handout and send me email with a development plan.

Your plan should explain what classes you plan to create and what they will be called. It should propose at least three intermediate programs that you intend to write that do something testable.

It should also explain what built-in classes you intend to use. Hint: you will use Stacks, Strings, and StringBuffers. For info about Strings and StringBuffers, review Section 10.2 of Kamin, Mickunas and Reingold. Also see Section 7.5 of Standish.

Hint: what should you do when you start working with a new class for the first time?

The hardest part of this assignment will be the READING. You will have to collect and assimilate information from at least three sources: the handout, Standish, and Kamin, Mickunas and Reingold.

• Start the reading EARLY (i.e. now).

• Write comments and highlight the important information so you can refer back to it quickly.

• If there are things you don't understand, have questions ready on Monday.

• We will have a reading quiz on either Monday or Wednesday.

• If you are not sure about the details of how something works, write a short program to test it and write the results of your test back into the book.

Please send me your development plan by email before 9am on Monday.