-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBrainFuck.java
177 lines (147 loc) · 4.84 KB
/
BrainFuck.java
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
package bf;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
/**
* Created by ПК on 16.05.2015.
*/
public class BrainFuck {
public static int var = 0;
public static int j =0;
public static int[] data = new int[30000];
public static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
LinkedList<String> commands = new LinkedList<>();
String s = sc.nextLine();
for(Character command : s.toCharArray()){
commands.add(command.toString().trim());
}
int ifop = Collections.frequency(commands,"(");
int ifend = Collections.frequency(commands,")");
int loopop = Collections.frequency(commands,"[");
int loopend = Collections.frequency(commands,"]");
if(ifop!= ifend || loopop!=loopend)System.exit(0);
brainFuck(commands);
}
public static void brainFuck(LinkedList<String> commands){
for(int i =0;i<commands.size();i++){
String com = commands.get(i);
switch (com){
case ">" : right();break;
case "<" : left();break;
case "|" : reset();break;
case "," : read();break;
case "." : print();break;
case "=" : curSetPrev();break;
case "0" : curSetZero();break;
case "!" : copyToVar();break;
case "?" : copyToData();break;
case "*" : multPrev();break;
case "/" : divPrev();break;
case "+" : incData();break;
case "-" : dicData();break;
case "[":
int countOpenLoop = 1;
int countCloseLoop = 0;
String commLoop;
LinkedList<String> loopCmd = new LinkedList<>();
for(int z = i+1;countOpenLoop != countCloseLoop;z++,i++){
commLoop = commands.get(z);
if(commLoop.equals("["))countOpenLoop++;
if(commLoop.equals("]"))countCloseLoop++;
loopCmd.add(commLoop);
}
loopCmd.remove(loopCmd.size()-1);
while (data[j]>0){
brainFuck(loopCmd);
}
break;
case "(":
int countOpenIf = 1;
int countCloseIf = 0;
String commIf;
LinkedList<String> ifCmd = new LinkedList<>();
for(int z = i+1;countOpenIf != countCloseIf ;z++,i++){
commIf = commands.get(z);
if(commIf.equals("("))countOpenIf++;
if(commIf.equals(")"))countCloseIf++;
ifCmd.add(commIf);
}
ifCmd.remove(ifCmd.size()-1);
if(data[j]>0)brainFuck(ifCmd);
break;
case "^": printVar();break;
case "$": indexToVar();break;
case ")": break;
case "]": break;
}
}
}
public static void read(){
try {
data[j] = (Integer.parseInt(sc.nextLine())) % 256;
}catch (Exception e){
data[j] = 0;
}
}
private static void indexToVar() {
var = j;
}
private static void printVar() {
System.out.println(var);
}
private static void dicData() {
if(data[j]!=0){
data[j]-=1;
}else data[j] = 0;
}
private static void incData() {
if(data[j]==255)data[j] = 0;
else data[j]+=1;
}
private static void divPrev() {
int a = data[j];
left();
int b = data[j];
right();
int res =a/b;
data[j] = res;
}
private static void multPrev() {
left();
int mult = data[j];
right();
int res = (data[j]*mult)%256;
data[j]=res;
}
private static void copyToData() {
data[j] = var%256;
}
private static void copyToVar() {
var = data[j];
// System.out.println(var);
}
private static void curSetZero() {
data[j] = 0;
}
private static void curSetPrev() {
left();
int a = data[j];
right();
data[j]=a;
}
private static void print() {
System.out.println(data[j]);
}
private static void reset() {
j=0;
}
private static void left() {
if(j == 0)j=29999;
else j--;
}
public static void right(){
if(j == 29999)j=0;
else j++;
}
}