blob: 0619337e0563ebaa96697e2d7c2153deb40de073 (
plain) (
blame)
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
|
#include <stdio.h>
#include <string.h>
#define MAX_DATA 30000
typedef struct brainfuck{
char data[MAX_DATA];
char command[MAX_DATA];
char *ptr;
int count;
int num;
}bf;
bf one;
void init()
{
char c;
memset(&one, 0, sizeof(one));
one.count = 0;
one.num = 0;
one.ptr = one.data;
while ((c = getchar()) != EOF)
{
if (c == '\n')
break;
one.command[++one.count] = c;
}
one.num = one.count;
one.command[one.count] = '\0';
}
void run()
{
char c;
int i;
int left;
int right;
one.count = 0;
while (c = one.command[++one.count])
{
switch (c)
{
case '+':
if (*one.ptr == 255)
*one.ptr = 0;
else
++*one.ptr;
break;
case '-':
if (*one.ptr == 0)
*one.ptr = 255;
else
--*one.ptr;
break;
case '>':
++one.ptr;
break;
case '<':
--one.ptr;
break;
case ',':
*one.ptr = getchar();
break;
case '.':
putchar(*one.ptr);
break;
case '[':
left = 0;
if (*one.ptr != 0)
break;
else
{
for (i = one.count + 1; i <= one.num; i++)
{
if (one.command[i] == '[')
++left;
else if (one.command[i] == ']')
{
if (left == 0)
{
one.count = i;
break;
}
else
--left;
}
}
}
break;
case ']':
right = 0;
if (*one.ptr == 0)
break;
else
{
for (i = one.count - 1; i >= 1; i--)
{
if (one.command[i] == ']')
++right;
else if (one.command[i] == '[')
{
if (right == 0)
{
one.count = i;
break;
}
else
--right;
}
}
}
break;
}
}
}
int main(int argc, char **argv)
{
printf("Input the brainfuck expression below\n");
init();
run();
return 0;
}
|
