C语言代码实现表达式求值 - 栈的应用

参考博客：http://blog.sina.com.cn/s/blog_67af05770100hux8.html
仍有错误！！！！！

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <conio.h>

#define OK      1
#define ERROR 0
#define OVERFLOW 0
#define TRUE 1
#define FALSE 0
#define STACK_INIT_SIZE 300 //存储空间初始化分配量
#define STACKINCREMENT 10 //存储空间分配增量

typedef int Status; //函数返回状态
typedef int ElemType; //元素类型

typedef struct{//顺序栈结构定义
    ElemType *base;
    ElemType *top; //栈底指针
    int stacksize;
}Stack;

Status InitStack(Stack *S);
Status GetTop(Stack *S);
Status Push(Stack *S, ElemType e);
Status Pop(Stack *S, ElemType e);
Status In(char c);
char Precede(char a, char b);
Status Operate(ElemType a, char c, ElemType b);
Status EvalueExpression();

Status InitStack(Stack *S)
{ //构造一个空栈S
    S->base=(ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType));
    if(!S->base)
    {
        printf("分配内存失败!\n");
        exit (ERROR);
    }
    S->top=S->base;
    S->stacksize=STACK_INIT_SIZE;

    return OK;
}

Status GetTop(Stack *S)
{ //若栈不空，用e返回S的栈顶元素，并返回OK；否则返回ERROR
    if(S->top == S->base)
        return ERROR;
    printf("*(S->top-1))=%d\n", *(S->top-1));
    return *(S->top-1);
}

Status Push(Stack *S, ElemType e)
{ //插入元素e为新的栈顶元素
    printf("入栈\n");

    if(S->top-S->base>=S->stacksize)
    {
        printf("栈满\n");
        printf("%d\n", S->stacksize);
        S->base = (ElemType *)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(ElemType));
        if(!S->base)
            exit (OVERFLOW);
        S->top=S->base+S->stacksize;
        S->stacksize+=STACKINCREMENT;
    }
    *S->top++=e;
    return OK;
}

Status Pop(Stack *S, ElemType e)
{ //若栈不空，则删除，用e返回其值，并返回OK；否则返回ERROR
    if(S->top==S->base)
        return ERROR;
    e=*--S->top;
    return OK;
}

Status In(char c)
{ //判别c是否为运算符
    if (c=='+'||c=='-'||c=='*'||c=='/'||c=='('||c==')'||c=='#')
        return OK;
    else
        return ERROR;
}

char Precede(char a,char b)
{ //算符间优先关系
    switch(a)
    {
    case '+':
        switch (b)
        {
        case '+': return '>'; break;
        case '-': return '>'; break;
        case '*': return '<'; break;
        case '/': return '<'; break;
        case '(': return '<'; break;
        case ')': return '>'; break;
        case '#': return '>'; break;
        default: break;
        }
        break;
    case '-':
        switch (b)
        {
        case '+': return '>'; break;
        case '-': return '>'; break;
        case '*': return '<'; break;
        case '/': return '<'; break;
        case '(': return '<'; break;
        case ')': return '>'; break;
        case '#': return '>'; break;
        default: break;
        }
         break;
    case '*':
        switch (b)
        {
        case '+': return '>'; break;
        case '-': return '>'; break;
        case '*': return '>'; break;
        case '/': return '>'; break;
        case '(': return '<'; break;
        case ')': return '>'; break;
        case '#': return '>'; break;
        default: break;
        }
        break;
    case '/':
        switch (b)
        {
        case '+': return '>'; break;
        case '-': return '>'; break;
        case '*': return '>'; break;
        case '/': return '>'; break;
        case '(': return '<'; break;
        case ')': return '>'; break;
        case '#': return '>'; break;
        default: break;
        }
        break;
    case '(':
        switch (b)
        {
        case '+': return '<'; break;
        case '-': return '<'; break;
        case '*': return '<'; break;
        case '/': return '<'; break;
        case '(': return '<'; break;
        case ')': return '='; break;
        default: break;
        }
        break;
    case ')':
        switch (b)
        {
        case '+': return '>'; break;
        case '-': return '>'; break;
        case '*': return '>'; break;
        case '/': return '>'; break;
        case ')': return '>'; break;
        case '#': return '>'; break;
        default: break;
        }
        break;
    case '#':
        switch (b)
        {
        case '+': return '<'; break;
        case '-': return '<'; break;
        case '*': return '<'; break;
        case '/': return '<'; break;
        case '(': return '<'; break;
        case '#': return '='; break;
        default: break;
        }
        break;
    default: break;
    }//switch(a)
}

Status Operate(int a,char c,int b)
{ //二元运算
    switch (c)
    {
    case '+': return a+b; break;
    case '-': return a-b; break;
    case '*': return a*b; break;
    case '/':
        if(b==0)
        {
            printf("（提示：存在除数为零错误）\n");
            return ERROR;
        } //除数不能为零
        else
            return a/b;
        break;
    }
}

Status EvalueExpression()
{
    char c;
    int a, b, x, theta;
    Stack OPTR, OPND;

    InitStack(&OPTR);
    Push(&OPTR, '#');
    InitStack(&OPND);
    printf("输入一个字符\n");
    c = getchar();
    while (getchar() != '\n')
        continue;
    while( || GetTop(&OPTR)!='#')
    {
        printf("c=%c\n", c);
        if (!In(c))
        {
            printf("输入一个字符\n");

            printf("数据\n");
            Push(&OPND, c);
            c = getchar();
            while (getchar() != '\n')
                continue;
        }
        else
        {
            printf("运算符\n");

            switch (Precede(GetTop(&OPTR), c))
            {
            case '<' : // 栈顶元素优先权低
                printf("压入运算符栈\n");
                Push(&OPTR, c);
                c = getchar();
                while (getchar() != '\n')
                    continue;

                break;
            case '=' : //脱括号并接收下一个字符
                Pop(&OPTR, x);
                c = getchar();
                while (getchar() != '\n')
                    continue;
                break;
            case '>' : //退栈并将结果入栈
                Pop(&OPTR, theta);
                Pop(&OPND, b);
                Pop(&OPND, a);
                Push(&OPND, Operate(a, theta, b));
                break;
            }//switch
        }//else
    }//while
    printf("%d\n", GetTop(&OPND));
    return 0;
}

int main()
{
    EvalueExpression();

    return 0;
}