OPERATOR hierarchy

() first priority

** second priority

*, / third priority

+, - last priority

I want a c basic code that calculates according to process priority using the above features

for example 3*5+2 first of all 3*5 must be solve after that +2

another example

(2+2)*3 primarily in parentheses after others.

I wrote on top, must use stack,POP.

Algorithm for Evaluation of Postfix Expression Create an empty stack and start scanning the postfix expression from left to right. If the element is an operand, push it into the stack. If the element is an operator o, pop twice and get A and B respectively. Calculate BOA and push it back to the stack. When the expression is ended, the value in the stack is the final answer. Evaluation of a postfix expression using a stack is explained in below example: 2 10 + 9 6 - 1 push 2 push 10 pop 10 pop 2 push 9 push 6 pop 6 pop 9 Pop 3 pop 12 pop answer: 4 push 2 + 10 = 12 push 9 - 6 = 3 push 12 / 3 = 4 6 10 9 3 3 2 12 12 12 4 1