逆波兰表达式的实现

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

#define MAXOP 100
#define NUMBER '0'

int getop(char []);
void push(double);
double pop(void);

int main(int argc, char **argv) {
    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(); // error handling of zero
                push(pop() / op2);
                break;
            case '\n':
                printf("\t%.8g\n", pop());
                break;
            default:
                printf("error, unknow operator %s\n", s);
                break;
        }
    }
    return 0;
}

#define MAXVAL 100 //Depth of the stack

int sp = 0;        //Current stack position
double val[MAXVAL]; //Stack

void push(double value) {
    if (sp < MAXVAL) {
        val[sp++] = value;
    } else {
        printf("Full stack\n");
    }
}

double pop() {
    if (sp > 0) {
        return val[--sp];
    } else {
        printf("Empty stack\n");
        return 0.0;
    }
}

#include <ctype.h>

int getch(void);
void ungetch(int);

int getop(char s[]) {
    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

char buf[BUFSIZE];
int bufp = 0;

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

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