-
Notifications
You must be signed in to change notification settings - Fork 1
/
10.c
254 lines (221 loc) · 6.03 KB
/
10.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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
#include <stdio.h>
#include <stdlib.h> /* for atof() */
#include <math.h> /* for sin(), exp() and pow() */
#define MAXOP 100 /* max size of operand or operator */
#define NUMBER '0' /* signal that a number was found */
#define LAST 'L' /* signal that last value command was found */
#define SWAP '~' /* signal that swap command was found */
#define DUPLICATE 'D' /* signal that duplicate command was found */
#define CLEAR 'C' /* signal that clear was found */
#define FAKE_DOUBLE_MIN -999999.0 /* set a minimum value for stack operands */
int getop(char []);
void push(double);
double pop(void);
double last(void);
void swap(void);
void duplicate(void);
void clear(void);
/* reverse Polish calculator */
main()
{
int type, _last_read_variable = 0, i = 0;
double op2, aux, _lp = 0.0;
char s[MAXOP];
double variables[26]; /* keeps track all variable values */
/* init variables value */
for (i = 0; i < 26; i++)
variables[i] = FAKE_DOUBLE_MIN;
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();
if (op2 != 0.0)
push((int) pop() % (int) op2);
else
printf("error: zero divisor\n");
case 'S':
push(sin(pop()));
break;
case 'E':
push(exp(pop()));
break;
case '^':
op2 = pop();
aux = pop();
if (aux == 0.0 && op2 <= 0.0) {
printf("error: pow(%f, %f) is not a valid operation.\n", aux, op2);
} else {
push(pow(aux, op2));
}
break;
case LAST:
_lp = last();
printf("top value: %f\n", _lp);
break;
case DUPLICATE:
duplicate();
break;
case SWAP:
swap();
break;
case CLEAR:
clear();
break;
case '\n':
_lp = pop();
printf("\t%.8g\n", _lp);
break;
case '_':
push(_lp);
break;
case '=':
variables[_last_read_variable] = pop();
break;
case '?':
/* print all variables that were set */
for (i = 0; i < 26; i++) {
if (variables[i] != FAKE_DOUBLE_MIN)
printf("'%c' == %.8g\n", ('a' + i), variables[i]);
}
break;
default:
/* variable was found */
if (type >= 'a' && type <= 'z') {
_last_read_variable = type - 'a';
/* if variable had a value assigned before, push it to stack */
if (variables[_last_read_variable] != FAKE_DOUBLE_MIN) {
push(variables[_last_read_variable]);
} else {
/* if variable wasn't used before, initialize it to 0 */
variables[_last_read_variable] = 0.0;
}
} else {
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("error: stack empty\n");
return 0.0;
}
}
/* return top value from stack without popping */
double last(void) {
if (sp > 0)
return val[sp-1];
else {
printf("error: stack empty\n");
return 0.0;
}
}
/* duplicate top value from stack */
void duplicate(void) {
if (sp > 0) {
push(last());
} else {
printf("error: stack empty\n");
}
}
/* swap top two values from stack */
void swap(void) {
double aux1, aux2;
if (sp >= 2) {
aux1 = pop();
aux2 = pop();
push(aux1);
push(aux2);
} else {
printf("error: can't swap with %d elements\n", sp);
}
}
/* clear all stack */
void clear(void) {
sp = 0;
}
#include <ctype.h>
#include <string.h> /* for strlen() */
#define MAX_LINE 10000 /* max size of a line */
char line[MAX_LINE];
int size = 0, rc = 0;
int nextchar(void);
int getline(char [], int);
/* getop: get next character or numeric operand */
int getop(char s[])
{
int i, c;
while ((s[0] = c = nextchar()) == ' ' || c == '\t')
;
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 = nextchar()))
;
if (c == '.') /* collect fraction part */
while (isdigit(s[++i] = c = nextchar()))
;
s[i] = '\0';
return NUMBER;
}
/* read next char from input line */
int nextchar(void)
{
if (rc >= size) {
rc = 0;
size = getline(line, MAX_LINE);
}
return line[rc++];
}
/* getline: read a line into s, return length */
int getline(char s[], int lim)
{
int c, i, last = 0;
for (i=0; i < lim-1 && (c=getchar())!=EOF && c!='\n'; ++i)
s[i] = c;
/* Because of operator precedence, we don't need to check if i < lim -1 */
if (c == '\n') {
s[i] = c;
++i;
}
/* Adding the null character */
s[i] = '\0';
return i;
}