Problem

(Postfix Evaluator) Write a program that evaluates a postfix expression (assume it's v...

(Postfix Evaluator) Write a program that evaluates a postfix expression (assume it's valid) such as

62 + 5 * 84/-

The program should read a postfix expression consisting of single digits and operators into a character array. Using the stack functions implemented earlier in this chapter, the program should scan the expression and evaluate it. The algorithm is as follows:

1) Append the null character ('\0') to the end of the postfix expression. When the null character is encountered, no further processing is necessary.

2) While ' \0' has not been encountered, read the expression from left to right.

If the current character is a digit,

Push its integer value onto the stack (the integer value of a digit character is its value in the computer's character set minus the value of ' 0' in the computer's character set). Otherwise, if the current character is an operator.

Pop the two top elements of the stack into variables x and y. Calculate y operator x.

Push the result of the calculation onto the stack.

3) When the null character is encountered in the expression, pop the top value of the stack. This is the result of the postfix expression.

[Note: In 2) above, if the operator is '/', the top of the stack is 2, and the next element in the stack is 8, then pop 2 into x, pop 8 into y, evaluate 8/2, and push the result, 4, back onto the stack. This note also applies to the other binary operators.]

The arithmetic operations allowed in an expression are:

+ addition subtraction

* multiplication

/ division

aexponentiation

% remainder

The stack should be maintained with the following declarations:

struct stackNode {

int data;

struct stackNode *nextPtr;

};

typedef struct stackNode StackNode;

typedef StackNode -StackNodePtr;

The program should consist of main and six other functions with the following function headers:

int evaluatePostfix Expression(char *expr)

Evaluate the postfix expression,

int calculate(int op1, int op2, char operator)

Evaluate the expression op1 operator op2.

void push(StackNodePtr *topPtr, int value)

Push a value on the stack,

int popCStackNodePtr *topPtr)

Pop a value off the stack.

int is Empty(StackNodePtr topPtr)

Determine whether the stack is empty,

void printStack(StackNodePtr topPtr)

Print the stack.

Step-by-Step Solution

Request Professional Solution

Request Solution!

We need at least 10 more requests to produce the solution.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)


All students who have requested the solution will be notified once they are available.
Add your Solution
Textbook Solutions and Answers Search
Solutions For Problems in Chapter 12
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT