逆波兰计算器

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>

#define MAXOP 100       //操作数或运算符的最大长度
#define NUMBER '0'      //标识找到一个数

int getop(char *s);
void push(double f);
double pop(void);

int main()
{
    int type;
    double op2;
    char s[MAXOP];

    while((type = getop(s)) != EOF)
    {
        switch(type)
        {
            case NUMBER:
                push(atof(s));
                break;

            case '+':
                push(pop() + pop());
                break;

            case '*':
                push(pop() * pop());
                break;

            case '-':                       //需要确定弹出次序
                op2 = pop();
                push(pop() - op2);
                break;

            case  '/':                      //需要确定弹出次序
                op2 = pop();
                if( op2 != 0.0 )
                    push(pop() / op2);
                else
                    printf("error:zero divisor!\n");
                break;

            case '\n':
                printf("\t%.g\n", pop());
                break;

            default:
                printf("error: unknwon command %s\n", s);
                break;
        }
    }
    return 0;
}



int getop(char *s)
{
    int getch(void);
    void ungetch(int c);

    int i, c;

    while( (s[0] = c = getch()) == ' ' || c == '\t');

    s[1] = '\0';

    if( !isdigit(c) && c != '.')
    {
        return c;
    }

    i = 0;

    if( isdigit(c) )
    {
        while( isdigit(s[++i] = c = getch()) )
            ;
    }
    if(c == '.')
    {
        while(isdigit(s[++i] = c = getch()) )
            ;
    }

    s[i] = '\0';
    if(c != EOF)
    {
        ungetch(c);
    }

    return NUMBER;
}

#define BUFSIZE 100         /**getch and ungetch**/
char buf[BUFSIZE];
int bufp = 0;

int getch(void)
{
    return (bufp > 0) ? buf[--bufp] : getchar();
}

void ungetch(int c)
{
    if(bufp >= BUFSIZE)
    {
        printf("ungetch: too many character\n");
    }
    else
    {
        buf[bufp++] = c;
    }
}


#define MAXVAL 100      /**pop and push**/
int sp = 0;             /*下一个空闲栈位置*/
double val[MAXVAL];     /*值栈*/

void push(double f)
{
    if(sp < val)
    {
        val[sp++] = f;
    }
    else
    {
        printf("error:stack is full, can't push %g\n", f);
    }
}

/*pop函数:弹出并返回栈顶的值*/
double pop(void)
{
    if(sp > 0)
    {
        return val[--sp];                   //因为push函数中sp的运算符是++,所以 从0到sp 总是比实际的数多一个,因此需要--
    }
    else
    {
        printf("error:stack is empty\n");
        return 0.0;
    }
}