-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreversePolishCalc.c
176 lines (155 loc) · 2.6 KB
/
reversePolishCalc.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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define MAXOP 100 // max size of operand or operator
#define NUMBER 0
#define MAXVAL 100 // max depth of value stack
#define BUFSIZE 100
double getTop(void);
char buf[BUFSIZE];
int bufp = 0;
int getch(void);
void ungetch(int);
int sp = 0;
double val[MAXVAL];
int getop(char []);
void push(double);
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 '%':
op2 = pop();
int result = (int)pop() % (int)op2;
push((double)result);
break;
case 'p': // print top
printf("\t%.8g\n", getTop());
break;
case 'd': // duplicate top
op2 = getTop();
push(op2);
break;
case 's': // swap top two
op2 = pop();
double nt = pop();
push(op2);
push(nt);
break;
case 'c': // clear
sp = 0;
break;
case '\n':
printf("\t%.8g\n", pop());
break;
default:
printf("error: unknown command %s\n", s);
break;
}
}
return 0;
}
void push(double f)
{
if (sp < MAXVAL) {
// printf("double f %g\n", f);
val[sp++] = f;
} else {
printf("error: stack full, can't push %g\n", f);
}
}
double getTop(void)
{
if (sp > 0) {
double r = val[sp-1];
// printf("val[--sp] %g\n", r);
return r;
} else {
printf("error: stack empty\n");
return 0.0;
}
}
double pop(void)
{
if (sp > 0) {
double r = val[--sp];
// printf("val[--sp] %g\n", r);
return r;
} else {
printf("error: stack empty\n");
return 0.0;
}
}
int getop(char s[])
{
int i, c;
while((s[0] = c = getch()) == ' ' || c == '\t') {
continue;
}
s[1] = '\0';
if (!isdigit(c) && c != '.' && c != '-') {
return c;
}
i = 0;
if (isdigit(c)) {
// while (isdigit(s[++i] = c = getch())) {
// continue;
// }
while (isdigit(c)) {
c = getch();
s[++i] = c;
}
}
if (c == '.') {
while (isdigit(s[++i] = c = getch())) {
continue;
}
}
if (c == '-') {
while (isdigit(s[++i] = c = getch())) {
continue;
}
}
s[i] = '\0'; // EOF
if (c != EOF) {
ungetch(c);
}
return NUMBER;
}
int getch(void)
{
return (bufp > 0) ? buf[--bufp] : getchar();
}
void ungetch(int c)
{
if (bufp >= BUFSIZE) {
printf("ungetch: too many characters\n");
} else {
buf[bufp++] = c;
}
}