-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathorth.c
350 lines (294 loc) · 6.37 KB
/
orth.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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
/*
MIT License
Copyright (c) 1994, 2016 Jeff Epler
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#define OP_NOOP 0
#define OP_PLUS 1
#define OP_MINUS 2
#define OP_MULT 3
#define OP_DIV 4
#define OP_MOD 5
#define OP_EXCH 6
#define OP_NOT 7
#define OP_AND 8
#define OP_OR 9
#define OP_XOR 10
#define OP_DUP 11
#define OP_DISC 12
#define OP_PUSH 13
#define OP_SET 14
#define OP_IF 15
#define OP_DX 16
#define OP_DY 17
#define OP_X 18
#define OP_Y 19
#define OP_CHAR 20
#define OP_STRING 21
#define OP_DECIMAL 22
#define OP_CCW 23
#define OP_CW 24
#define OP_REV 25
#define OP_H 26
#define OP_J 27
#define OP_K 28
#define OP_L 29
#define OP_RET 30
#define OP_MAX 31
char *operators[OP_MAX]= {
"nop","+","-","*","/","%","~","!","&","|","^","@","$","=","#","?","dx","dy",
"x","y","c","s","d","ccw","cw","rev","h","j","k","l","ret"
};
typedef int s32;
#define GRID_SIZE 256
/* Of course, if you change this you will break any
* program that relies on wraparound
*/
#define STACK_SIZE 256
/* This ought to be enough for most people */
int type[GRID_SIZE][GRID_SIZE];
/* Holds a TRUE value if the associated grid coordinate
* is an operator
*/
int grid[GRID_SIZE][GRID_SIZE];
/* Holds either an integer quantity, or the #defined value
* of the operator
*/
int stack[STACK_SIZE];
int sp=0;
int parse_element(const char *e) {
int i=0;
while(i<OP_MAX) {
if (!strcasecmp(e,operators[i])) return i;
i++;
}
return OP_MAX;
}
int parse(FILE *f) {
char line[255];
int lnum=0;
int x,y;
char element[sizeof(line)];
while(!feof(f)) {
fgets(line,sizeof(line),f);
lnum++;
if(line[strlen(line)-1]!='\n') {
fprintf(stderr,"Warning: Long line %d\n",lnum);
while(fgetc(f)!='\n') /* NOTHING */ ;
line[79]='\n';
}
if(line[0]==';') continue;
sscanf(line,"%d %d %s\n",&x,&y,element);
#ifdef DEBUGGER
fprintf(stderr,"%d %d %s\n",x,y,element);
#endif
if((element[0]=='-'&&element[1])||isdigit(element[0]))
grid[x][y]=atoi(element);
else if(element[0]=='\'')
grid[x][y]=element[1];
else {
type[x][y]=1;
if(OP_MAX==(grid[x][y]=parse_element(element))) {
fprintf(stderr,"Error: Line %d\n",lnum);
exit(1);
}
}
}
return 0;
}
int push(int quantity) {
if(sp==STACK_SIZE) {
fprintf(stderr,"Stack overflow\n");
exit(1);
}
#ifdef DEBUGGER
fprintf(stderr,"push: %d\n",quantity);
#endif
stack[sp++]=quantity;
return 0;
}
int pop() {
if(sp==0) {
fprintf(stderr,"Stack underflow\n");
exit(1);
}
#ifdef DEBUGGER
fprintf(stderr,"pop: %d\n",stack[sp-1]);
#endif
return stack[--sp];
}
int execute() {
int x=0,y=0,dx=1,dy=0;
int temp,temp2;
while(1) {
#ifdef DEBUGGER
if(type[x][y])
fprintf(stderr,"(%4d,%4d)\t%s\t%d\n",x,y,operators[grid[x][y]],sp);
else
fprintf(stderr,"(%4d,%4d)\t%d\t%d\n",x,y,grid[x][y],sp);
#endif
if(type[x][y]) {
switch(grid[x][y]) {
case OP_NOOP:
break;
case OP_PLUS:
push(pop()+pop());
break;
case OP_MINUS:
temp=pop();
push(pop()-temp);
break;
case OP_MULT:
push(pop()*pop());
break;
case OP_DIV:
temp=pop();
push(pop()/temp);
break;
case OP_MOD:
temp=pop();
push(pop()%temp);
break;
case OP_EXCH:
temp=pop();
temp2=pop();
push(temp);
push(temp2);
break;
case OP_NOT:
push(!pop());
break;
case OP_AND:
push(pop()&pop());
break;
case OP_OR:
push(pop()|pop());
break;
case OP_XOR:
push(pop()^pop());
break;
case OP_DUP:
temp=pop();
push(temp);
push(temp);
break;
case OP_DISC:
pop();
break;
case OP_PUSH:
temp=pop()%GRID_SIZE;
temp2=pop()%GRID_SIZE;
push(grid[temp][temp2]);
break;
case OP_SET:
temp=pop()%GRID_SIZE;
temp2=pop()%GRID_SIZE;
grid[temp][temp2]=pop();
type[temp][temp2]=0;
break;
case OP_IF:
if(!pop()) {
x+=dx; y+=dy;
}
break;
case OP_DX:
dx=pop();
break;
case OP_DY:
dy=pop();
break;
case OP_X:
x=pop();
break;
case OP_Y:
y=pop();
break;
case OP_CHAR:
temp=pop();
if(temp)
putchar(pop());
else
putchar('\n');
break;
case OP_STRING:
while((temp=pop())!=0)
putchar(temp);
break;
case OP_DECIMAL:
printf("%d",pop());
break;
case OP_CCW:
temp=dx;
dx=dy;
dy=-temp;
break;
case OP_CW:
temp=dx;
dx=-dy;
dy=temp;
break;
case OP_REV:
dx=-dx;
dy=-dy;
break;
case OP_H:
dx=-1;
dy=0;
break;
case OP_J:
dx=0;
dy=1;
break;
case OP_K:
dx=0;
dy=-1;
break;
case OP_L:
dx=1;
dy=0;
break;
case OP_RET:
return(pop());
break;
default:
fprintf(stderr,"Unknown opcode %d at (%d,%d)",grid[x][y],x,y);
exit(1);
}
} else
push(grid[x][y]);
x+=dx;
while(x<0) x+=GRID_SIZE;
x%=GRID_SIZE;
y+=dy;
while(y<0) y+=GRID_SIZE;
y%=GRID_SIZE;
}
}
int main(int argc, char **argv) {
int i;
parse(stdin);
if(argc>1)
for(i=0;argv[1][i]&&(i<256);i++) {
grid[i][GRID_SIZE-1]=argv[1][i];
type[i][GRID_SIZE-1]=0;
}
return(execute());
}