呆呆向前冲的blog — Tue, 25 Jan 2005 15:19:00 GMT

mmd 感觉脑子不够用了(ji��n)。还是用�W�方法：(x��)一步一步写注释�?/P>

#include
#include /* for atof() */
#include

#define MAXOP 100       /* max size of operand and operator */
#define NUMBER '0'      /* signal that a number was found */
#define MAXVAL 100      /* maxmium depth of value stack */
#define BUFSIZE 100

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

int sp = 0;             /* next free stack position */
double val[MAXVAL];     /* value stack */
char buf[BUFSIZE];      /* buffer for ungetch */
int bufp = 0;           /* next free position in buf */

/* reverse Polish Calculator */

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%.8g\n",pop());
                                break;
                        default:
                                printf("error: unknown command %s\n",s);
                                break;
                }
        }
        return 0;
}
/* push: push f onto value stack */
void push(double f)
{
        if (sp < MAXVAL)
                val[sp++] = f;
        else
                printf("error: stack full,can't push %g\n",f);
}
/* pop: pop and return top value from stack */
double pop(void)
{
        if (sp > 0)
                return val[--sp];
        else {
                printf("error: stack empty\n");
                return 0.0;
        }
}
/* getop: get next character or numeric oprand */
int getop(char s[])
{
  //开始试图读取一个操作数或一个操作符
        int i,c;
  //忽略�I�格�Q�直到读到非�I�字�W?BR>        while ((s[0] = c = getch()) == ' ' || c == '\t')
                ;
  //末尾加字�W�串�l�束标识
        s[1] = '\0';
        //if (!(s[0] == '-' && bufp == 1))
        //        if (!isdigit(c) && c != '.')
        //                return c;
  //如果��d��的不是数字�ƈ且不是小数点�Q�表�C��C��(ji��n)一个操作符
        if (!isdigit(c) && c != '.')
                return c;       /* not a number */
        i = 0;
  //如果��d��?ji��n)数字，�l�箋��d��直到��d��非数字字�W?BR>        if (isdigit(c)) /* collect integer part */
                while (isdigit(s[++i] = c = getch()))
                        ;
  //如果上面��d��到的非数字字�W�是��数点，�l�箋��d��直到��d��到非数字字符
        if (c == '.')   /* collect fraction part */
                while (isdigit(s[++i] = c = getch()))
                        ;
  //在s�l�尾前一位加�l�束标识
        s[i] = '\0';
  //如果未读到末��，把最后读到的那个字符攑ֈ�输入�~�冲字符数组buf�?BR>        if (c != EOF)
                ungetch(c);
        return NUMBER;
}

int getch(void) /* get a (possibly pushed-back) character */
{
return (bufp > 0) ? buf[--bufp] : getchar();
}

void ungetch(int c)     /* push character back on input */
{
        if (bufp >= BUFSIZE)
                printf("ungetch: too many characters\n");
        else
                buf[bufp++] = c;
}

呆呆向前冲的blog 2005-01-25 23:19 发表评论

亚洲欧洲日韩极速播放,日本亚洲中午字幕乱码,亚洲国语精品自产拍在线观看