This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: The concept of stack is extremely important in computer science and is used in a wide variety of problems. This assignment requires you to write a program that can be used to evaluate ordinary arithmetic expressions that contains any of the five arithmetic operators (+, , *, /, %). This exercise requires three distinct steps, namely: 1. Verify that the infix arithmetic expression (the original expression), that may contain regular parentheses, is properly formed as far as parentheses are concerned . 2. If the parenthesized expression is properly formed, convert the expression from an infix expression to its equivalent postfix expression, called Reverse Polish Notation (RPN) named after the Polish Mathematician J. Lukasiewics. 3. Evaluate the postfix expression, and print the result. Step 1  Verify that the expression Given an arithmetic expression, called an infixed expression, to verify that it is properly formed as far as parentheses are concerned, do the following: Create an empty stack to hold left parenthesis ONLY ....
View
Full
Document
This note was uploaded on 01/06/2012 for the course COP 3804 taught by Professor Staff during the Fall '08 term at FIU.
 Fall '08
 STAFF

Click to edit the document details