栈的应用举例：数制转换，表达式求值

以下代码由C编写，VS调试：

#include <stdio.h>
#include <malloc.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef char SElemType;
typedef char Status;

//栈的定义
typedef struct
{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;

//构造一个空栈S
Status InitStack(SqStack *S)
{
S->base =(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S->base ) exit(OVERFLOW); //存储分配失败
S->top =S->base ;
S->stacksize =STACK_INIT_SIZE;
return OK;
} //InitStack

//取栈顶元素值
Status GetTop(SqStack *S)
{
SElemType e;
if(S->top==S->base ) return ERROR;
e=*(S->top -1);
return e;
}//GetTop

//插入元素e为新的栈顶元素
Status Push(SqStack *S,SElemType e)
{
if(S->top-S->base>=S->stacksize  ) { //栈满,追加存储空间
S->base =(SElemType *)realloc (S->base ,(S->stacksize +STACKINCREMENT) * sizeof(SElemType));
if(!S->base ) exit(OVERFLOW);
S->top =S->base +S->stacksize ;
S->stacksize +=STACKINCREMENT;
}
*S->top ++=e;
return OK;
}//Push

//若栈不为空，则删除S的栈顶元素，用E返回其值，并返回OK；否则返回ERROR
Status Pop(SqStack *S,SElemType *e)
{
if(S->top==S->base ) return ERROR;
e=--S->top ;
return (*e);
}//Pop
Status StackEmpty(SqStack *S){
if(S->base==S->top) return TRUE;
else return FALSE;
}//StackEmpty

//获得两运算符优先级
SElemType Precede(SElemType i,SElemType j)
{
int a, b;char c;
char s[7][7]={{'>','>','<','<','<','>','>'},{'>','>','<','<','<','>','>'},{'>','>','>','>','<','>','>'},
{'>','>','>','>','<','>','>'},{'<','<','<','<','<','=',' '},{'>','>','>','>',' ','>','>'},{'<','<','<','<','<',' ','='}};
//算符间优先关系
switch (i){
case '+':
a=0;break;
case '-':
a=1;break;
case '*':
a=2;break;
case '/':
a=3;break;
case '(':
a=4;break;
case ')':
a=5;break;
case '#':
a=6;break;
}
switch (j){
case '+':
b=0;break;
case '-':
b=1;break;
case '*':
b=2;break;
case '/':
b=3;break;
case '(':
b=4;break;
case ')':
b=5;break;
case '#':
b=6;break;
}
   c=s[a][b];
return c; 
}//Procede

//求算数表达式的值
Status Operate(SElemType a,SElemType theta,SElemType b)
{
int c,x,y;
switch (theta){
case '+':
x=(int)a-48; //或x=(int)(a-'o')
y=(int)b-48;
c=x+y+48;
return (char)c;
break;
case '-':
x=(int)a-48;
y=(int)b-48;
c=x-y+48;
return (char)c;
break;
case '*':
x=(int)a-48;
y=(int)b-48;
c=x*y+48;
return (char)c;
break;
case '/':
x=(int)a-48;
y=(int)b-48;
c=x/y+48;
return (char)c;
break;
}
}//Operate

//算数表达式求值的算符优先算法，设OPTR和OPND分别为运算符栈和运算数栈
char  EvaluateExpress()
{
SqStack OPTR,OPND;
char c,a,b,x,theta;
c=' ';
InitStack(&OPTR);Push(&OPTR,'#');
    InitStack(&OPND);
printf("\n请输入要计算的表达式");
c=getchar();
while(c!='#'||GetTop(&OPTR)!='#')
{
if(c>'0'&&c<'9'){
Push(&OPND,c);c=getchar();//不是运算符进运算数栈
}
else
switch(Precede(GetTop(&OPTR),c))
{
case '<': //栈顶元素优先权低
Push(&OPTR,c);c=getchar();
break;
case '=': //脱冒号并接收下一个字符
Pop(&OPTR,&x);c=getchar();
break;
case '>': //退栈并将运算结果入栈
theta=Pop(&OPTR,&theta);
b=Pop(&OPND,&b);
a=Pop(&OPND,&a);
Push(&OPND,Operate(a,theta,b));
break;
} //switch
} //while
return GetTop(&OPND);
} //EvaluateExpress