-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrec.c
185 lines (150 loc) · 4.3 KB
/
rec.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
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <ctype.h>
int sp_ret;
void printStack(int sp, int *stack, bool nl) {
printf(" [ ");
for(int x=0; x < sp; x ++) {
printf("%d ", stack[x]);
}
printf("] ");
if (nl) {
printf("\n");
}
}
int skip_bkt(int pc, char *prog, char up, char down, int step) {
int offset = pc + step;
int level = 1;
while (prog[offset] && level > 0) {
level += prog[offset] == up;
level -= prog[offset] == down;
offset += step;
}
return offset;
}
bool run(char *prog, register int sp, int *stack) {
// Return value = whether we need to break out of an infinite loop
// (0) = no, (1) = yes
int x, v, tmp;
bool debug = false;
int next_dbg = -1;
for(int pc = 0; prog[pc]; pc++) {
if(pc == next_dbg) {
debug = true;
next_dbg = -1;
}
sp = (sp < 0) ? 0 : sp;
switch(prog[pc]) {
case '0': case '1': case '2':
case '3': case '4': case '5':
case '6': case '7': case '8':
case '9':
if(isdigit(prog[pc-1]))
stack[sp-1] = stack[sp-1] * 10 + prog[pc] - 48;
else
stack[sp++] = prog[pc] - 48;
break;
case '/':
stack[sp-1] += 1;
break;
case '\\':
stack[sp-1] -= 1;
break;
case ':':
x = stack[sp-1];
tmp = (x < 0) ? -1: sp - 2;
stack[sp-1] = stack[tmp - x];
break;
case ';':
x = stack[sp-1];
v = stack[sp-2];
tmp = (x < 0) ? -1 : sp - 3;
stack[tmp - x] = v;
sp -= 2;
break;
case '^':
if (stack[--sp] == 0)
pc = skip_bkt(pc, prog, '[', ']', 1) - 1;
break;
case ']':
pc = skip_bkt(pc, prog, ']', '[', -1);
break;
// Debugging commands
case 'P':
printf("%d\n", stack[--sp]);
break;
case 'R':
scanf("%d", &tmp);
stack[sp++] = tmp;
break;
case 'p':
putchar(stack[--sp]);
break;
case 'r':
tmp = getchar();
stack[sp++] = tmp;
break;
case 's':
printStack(sp, stack, true);
break;
case 'b':
debug = true;
break;
}
if (debug && !isspace(prog[pc])) {
printf("(%d) '%c'", pc, prog[pc]);
printStack(sp, stack, false);
char cmd;
if (scanf("%c", &cmd) == EOF) {
exit(0);
}
switch (cmd){
// Don't need to handle for '\n' case
case 'c':
getchar();
debug = false;
break;
case 'm':
getchar();
debug = false;
if(prog[pc] == '[')
next_dbg = skip_bkt(pc, prog, '[', ']', 1) + 1;
break;
case 'q':
exit(0);
break;
}
}
}
// For REPL (since local values are lost across function calls)
sp_ret = sp;
return 0;
}
int main(int argc, char **argv) {
// *stack = pointer to bottom of stack
int *stack = (int*)malloc(sizeof(int) * 20000);
int sp = 0;
if (argc < 2) {
char *s = (char*) malloc(sizeof(char) * 100);
unsigned long len = 0;
for(;;) {
printf("r> ");
len = getline(&s, &len, stdin);
if(len == -1) {
free(s);
break;
}
run(s, sp, stack);
sp = sp_ret;
printStack(sp, stack, true);
}
} else {
FILE *fp = fopen(argv[1], "r");
char prog[2000] = {};
fread(&prog, sizeof(char), -1, fp);
fclose(fp);
run(prog, sp, stack);
}
free(stack);
}