-
Notifications
You must be signed in to change notification settings - Fork 0
/
exercise4-11.c
128 lines (112 loc) · 2.39 KB
/
exercise4-11.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <stdio.h>
#include <stdlib.h> // for atof()
#define MAXOP 100 // max size of operand or operator
#define NUMBER '0'
int getop(char []);
void push(double);
double pop(void);
void showInternals(int);
//reverse polish calculator
int main(){
int type;
double op2;
char s[MAXOP];
while((type = getop(s)) != EOF) {
showInternals(type);
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("\tResult: %.8g\n", pop());
break;
default:
printf("error: unknown command %s\n", s);
break;
}
}
return 0;
}
#define MAXVAL 100 // maximum depth of val stack
int sp = 0; // next free stack position
double val[MAXVAL]; // value stack
// 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("pop error: stack empty.\n");
return 0.0;
}
}
#include <ctype.h>
int getch(void);
void ungetch(int);
// getop: get next operator or numeric operand
// separate inputs with either space or tab
int getop(char s[]){
int i, c;
static int holder = 0; // 0 represents no char
while((s[0] = c = (holder == 0 ? getch() : holder)) == ' ' || c == '\t'){
holder = 0;
// ignore
}
s[1] = '\0';
if (!isdigit(c) && c != '.')
return c; // not a number
i = 0;
if(isdigit(c)) // collect integer part
while(isdigit(s[++i] = c = getch()))
;
if(c == '.') // collect fractional part
while (isdigit(s[++i] = c = getch()))
;
s[i] = '\0';
if( c != EOF)
holder = c;
return NUMBER;
}
#define BUFSIZE 100
char buf[BUFSIZE]; // buffer for ungetch
int bufp = 0; // next free position in buf
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;
}
void showInternals(int type)
{
int i;
printf("Operation: %c\tstack:\t", type == NUMBER ? ' ' : type);
for(i = 0; i < sp; i++)
printf("%lf, ", val[i]);
printf("\n\n");
}