逆波兰计算法

# define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdbool.h>
#include<stdlib.h>




#define STACK_SIZE 20


int make_empty(void);
bool is_empty(void);
bool is_full(void);
void push(char);
void pop(char);
void stack_overflow(void);
void stack_underflow(void);


char contents[STACK_SIZE] = { 0 }, top;


int main(int argc, char *argv[])
{
char ch = '1';
while (ch != 'q'){
make_empty();
printf("Enter an RPNexpression:");
do{
scanf(" %c", &ch);
if (ch >= '1'&&ch <= '9')
push(ch);
else if (ch == '+' || ch == '-' || ch == '*' || ch == '/'){
top--; pop(ch);
}
else if (ch == '='){
if ((top - 1) == 0)
pop(ch);
else
printf("Nunber notused!");
break;
}
else if (ch == '\n');
else{
ch = 'q'; break;   /*其它情况置为退出标志q*/
}
} while (ch != '\n');
}
return 0;
}


int make_empty(void){
return top = 0;
}


bool is_empty(void){
return top == 0;
}


bool is_full(void){
return top == STACK_SIZE;
}


void push(char ch){
if (is_full())
stack_overflow();
else
contents[top++] = ch - '0';
}


void pop(char ch){
if (is_empty())
stack_underflow();
else
switch (ch){
case'+':contents[top - 1] += contents[top]; break;
case '-':contents[top - 1] -= contents[top]; break;
case'*':contents[top - 1] *= contents[top]; break;
case'/':contents[top - 1] /= contents[top]; break;
case '=':printf("Value ofexpression:%d\n", (int)contents[0]); break;
}
}


void stack_overflow(void){
printf("Expression is toocomplex!");
exit(EXIT_FAILURE);
}


void stack_underflow(void){
printf("Not enough operands inexpression!");
exit(EXIT_FAILURE);
}