-
Notifications
You must be signed in to change notification settings - Fork 0
/
int.c
187 lines (154 loc) · 4.31 KB
/
int.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// the brainfuck lexicon
typedef enum {
INC = '+',
DEC = '-',
NEXT = '>',
PREV = '<',
GET = ',',
PUT = '.',
LOOP_START = '[',
LOOP_END = ']',
/* - extensions ------ */
ZERO = '0',
} command_t;
typedef struct _instruction {
command_t opcode;
int value; /* repetition value: +++ = 3 */
struct _instruction *loop;
struct _instruction *next;
} instruction;
static int istoken(char c)
{
return (c == INC) || (c == DEC) ||
(c == NEXT) || (c == PREV) ||
(c == GET) || (c == PUT) ||
(c == LOOP_START) || (c == LOOP_END);
}
static int lex_next(void)
{
int c;
// skip other tokens
do {
if ((c = fgetc(stdin)) == EOF)
return 0;
} while (!istoken(c));
return c;
}
// prepare the linked-list of instruction cells
static instruction *parse_iter(void)
{
command_t op;
instruction *prog = NULL, *ptr = NULL, *cell;
while ((op = lex_next()) != 0) {
if (op == LOOP_END)
return prog;
cell = (instruction *) malloc(sizeof(instruction));
if (prog == NULL)
prog = cell;
else
ptr->next = cell;
ptr = cell;
cell->opcode = op;
cell->value = 1;
cell->next = NULL;
// recursively parse loops
cell->loop = (op == LOOP_START) ? parse_iter() : NULL;
}
return prog;
}
/* Optimizations */
inline char same (instruction *prog) {
return (prog->opcode == prog->next->opcode);
}
inline char another (instruction *prog) {
return (prog->opcode == INC && prog->next->opcode == DEC) ||
(prog->opcode == DEC && prog->next->opcode == INC) ||
(prog->opcode == PREV && prog->next->opcode == NEXT) ||
(prog->opcode == NEXT && prog->next->opcode == PREV);
}
// compact: compact repeat instructions
static instruction *compact (instruction *prog) {
instruction *ret = prog;
register char flag1 = 0, flag2 = 0;
while (prog) {
switch ((int) prog->opcode) {
case LOOP_START:
prog->loop = compact(prog->loop);
break;
case INC:
case DEC:
case NEXT:
case PREV:
flag1 = flag2 = 0;
while (prog->next && (flag1 = same(prog) || (flag2 = another(prog)))) {
instruction *t = prog->next;
prog->value += flag1 && !flag2 ? t->value : -t->value;
prog->next = t->next;
free(t);
}
break;
}
prog = prog->next;
}
return ret;
}
static instruction *deduce_zeros (instruction *prog)
{
instruction *t = prog;
if (prog->opcode == DEC && prog->next == NULL)
prog->opcode = ZERO;
while (prog) {
if (prog->opcode == LOOP_START)
prog->loop = deduce_zeros(prog->loop);
prog = prog->next;
}
return t;
}
instruction *optimize (instruction *prog) {
prog = compact(prog);
prog = deduce_zeros(prog);
return prog;
}
// our tape
#define HEAPSIZE 500000
static char heap[HEAPSIZE], *ptr = heap;
// interpret the list
static void interpret(instruction *prog)
{
while (prog) {
switch (prog->opcode) {
case ZERO: *ptr = 0; break;
case INC: *ptr = *ptr + prog->value; break;
case DEC: *ptr = *ptr - prog->value; break;
case NEXT: ptr += prog->value; break;
case PREV: ptr -= prog->value; break;
case PUT: putchar(*ptr); break;
case GET: *ptr = getchar(); break;
case LOOP_START:
while(*ptr) interpret(prog->loop); break;
default:
/* Ignore unknown symbol */
break;
}
prog = prog->next;
}
}
static void free_i(instruction *prog) {
while (prog) {
if (prog->opcode == LOOP_START)
free_i(prog->loop);
instruction *t = prog;
prog = prog->next;
free(t);
}
}
int main (void) {
instruction *prog = parse_iter();
interpret(optimize(prog));
//interpret(prog);
free_i(prog);
return 0;
}