Consider simple infi x expressions that consist of single-digit operands; the operators +, –, *, and /; and parentheses. Assume that unary operators are illegal and that the expression contains no embedded spaces. Design and implement a class of infi x calculators. Use the algorithms given in this chapter to evaluate infi x expressions as entered into the calculator. You must fi rst convert the infi x expression to postfi x form and then evaluate the resulting postfi x expression.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here