-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyinterpreter.java
More file actions
591 lines (552 loc) · 17.7 KB
/
Myinterpreter.java
File metadata and controls
591 lines (552 loc) · 17.7 KB
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
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
import java.io.*;
import java.util.*;
class InterpreterException extends Exception {
String errStr; // describes the error
public InterpreterException(String str) {
errStr = str;
}
public String toString() {
return errStr;
}
}
class interpreter {
private static final int PROG_SIZE = 10000;
private char[] prog; // 프로시저에 대한 배열
private int progIdx; // 프로그램안에서의 인덱스
private int progIdx_K; //프레임 구할 때 쓰는 인덱스
private int progIdx_F; //토큰 구할 때 쓰는 인덱스
private String kwToken;
private int kwTktype;
private String Token;
private int TokenType;
private List<Character> Frame;
private final TreeMap<String,Integer> fun_label;
private final TreeMap<String,Integer> var_label = new TreeMap<>();
class Keyword {
String keyword; // 문자열 형태
int keywordTok; // 내부 표현
public Keyword(String str, int t) {
keyword = str;
keywordTok = t;
}
}
final int UNKNCOM = 0;
final int PRINT = 1;
final int INPUT = 2;
final int IF = 3;
final int GOTO = 4;
final int FOR = 5;
final int DEF = 6;
final int RETURN = 7;
final int END = 8;
final int ASM = 9;
final int NONE = 0;
final int VARIABLE = 1;
final int COMMAND = 2;
final int NUMBER = 3;
final int DELIMITER = 4;
final int QUOTEDSTR = 5;
// 이중연산자 정의(ex. <=,>=,!=)
final char LE = 1;
final char GE = 2;
final char NE = 3;
// 관계연산자 정의
char rops[] = {
GE, NE, LE, '<', '>', '=', 0
};
/* 관계연산자를 좀더 편하게 계산하기 위한 문자열 클래스 */
String relops = new String(rops);
final Stack<Integer> fun_stack = new Stack<>();
Keyword[] kwtable = {
new Keyword("출력", PRINT),
new Keyword("저장", INPUT),
new Keyword("실행", IF),
new Keyword("이동", GOTO),
new Keyword("반복", FOR),
new Keyword("선언", DEF),
new Keyword("복귀", RETURN),
new Keyword("종료", END),
new Keyword("할당", ASM)
};
public interpreter(String progName) throws InterpreterException {
char tempbuf[] = new char[PROG_SIZE];
int size;
fun_label = new TreeMap<>();
// 프로그램을 실행하기위해 프로그램을 메모리에 읽어 올림
size = loadProgram(tempbuf, progName);
if (size != -1) {
progIdx = 0;
Frame = new ArrayList<>();
// 프로그램을 저장할 적당한 크기의 배열 생성
prog = new char[size+1];
// 프로그램을 프로그램 배열로 복사
System.arraycopy(tempbuf, 0, prog, 0, size);
prog[size] = '\0';
}
}
private int loadProgram(char[] p, String fname) throws InterpreterException {
int size = 0;
try {
FileReader fr = new FileReader(fname);
BufferedReader br = new BufferedReader(fr);
size = br.read(p, 0, PROG_SIZE);
fr.close();
} catch (IOException exc) {
handleErr(0);
}
// 파일이 EOF 기호로 끝나는 경우, 크기는 1만큼 감소시킴
if (p[size - 1] == (char)26 ) size--;
return size; // return size of program
}
private void scanLabels() throws InterpreterException {
do {
getKeyword();
if(kwTktype == DEF){
getFrame();
getToken();
fun_label.put(Token,progIdx-1);
}
}
while(prog[progIdx] != '\0');
progIdx = 0;
progIdx_K = 0;
}
private void getKeyword() throws InterpreterException
{
keyword_init();
int i = progIdx;
while(prog[progIdx] != '\r' && prog[progIdx] != '\0')
progIdx++;
kwToken = prog[progIdx - 2] + Character.toString(prog[progIdx-1]);
kwTktype = lookup(kwToken);
progIdx_K = i;
if(prog[progIdx] == '\0')
return;
progIdx+=2;
}
public void run() throws InterpreterException {
// 새 프로그램을 위한 초기화
scanLabels();
mainstart();
}
private void mainstart() throws InterpreterException{
do{
getKeyword();
switch(kwTktype){
case PRINT:
print();
break;
case INPUT:
input();
break;
case IF:
fun_if();
break;
case GOTO:
fun_goto();
break;
case FOR:
fun_for();
break;
case ASM:
assignment();
break;
case RETURN:
fun_return();
break;
case END:
return;
}
}while(prog[progIdx] != '\0');
}
private void getFrame() throws InterpreterException{
Frame.clear();
while(prog[progIdx_K] != '('){
progIdx_K++;
}
progIdx_F = 0;
int count = 1;
progIdx_K++;
while(count != 0){
if (prog[progIdx_K] == '('){
Frame.add(prog[progIdx_K]);
progIdx_K++;
count++;
}
else if (prog[progIdx_K] == ')'){
Frame.add(prog[progIdx_K]);
progIdx_K++;
count--;
}
else{
Frame.add(prog[progIdx_K]);
progIdx_K++;
}
}
Frame.remove(Frame.size()-1);
}
private void getToken() throws InterpreterException{
TokenType = NONE;
Token = "";
if(progIdx_F == Frame.size()) {
Token = "\r";
return;
}
while(progIdx_F < Frame.size() && isSpaceOrTab(Frame.get(progIdx_F)))
progIdx_F++;
if(isDelim(Frame.get(progIdx_F))) {
// 연산자인 경우
Token += Frame.get(progIdx_F);
progIdx_F++;
TokenType = DELIMITER;
}
else if(Character.isLetter(Frame.get(progIdx_F))) {
// 변수 또는 키워드인 경우
while(!isDelim(Frame.get(progIdx_F))) {
Token += Frame.get(progIdx_F);
progIdx_F++;
if(progIdx_F >= Frame.size()) break;
}
if(lookup(Token)==UNKNCOM) TokenType = VARIABLE;
}
else if(Character.isDigit(Frame.get(progIdx_F))) {
// Is a number.
while(!isDelim(Frame.get(progIdx_F))) {
Token += Frame.get(progIdx_F);
progIdx_F++;
if(progIdx_F >= Frame.size())
break;
}
TokenType = NUMBER;
}
else if(Frame.get(progIdx_F) == '"') {
// 인용부호가 있는 문자열인 경우
progIdx_F++;
char ch = Frame.get(progIdx_F);
while(ch !='"' && ch != '\r') {
Token += ch;
progIdx_F++;
ch = Frame.get(progIdx_F);
}
if(ch == '\r') handleErr(5);
progIdx++;
TokenType = QUOTEDSTR;
}
else if(Frame.get(progIdx_F) == '<' || Frame.get(progIdx_F) == '>') {
if(progIdx_F+1 == Frame.size()) handleErr(6);
switch(Frame.get(progIdx_F)) {
case '<':
if(Frame.get(progIdx_F+1) == '>') {
progIdx_F += 2;
Token = String.valueOf(NE);
}
else if(Frame.get(progIdx_F+1) == '=') {
progIdx_F += 2;
Token = String.valueOf(LE);
}
else {
progIdx_F++;
Token = "<";
}
break;
case '>':
if(Frame.get(progIdx_F+1) == '=') {
progIdx_F += 2;;
Token = String.valueOf(GE);
}
else {
progIdx_F++;
Token = ">";
}
break;
}
TokenType = DELIMITER;
return;
}
}
private void assignment() throws InterpreterException{
char buffer;
getFrame();
getToken();
buffer = Token.charAt(0);
if(!Character.isLetter(buffer)) {
handleErr(1);
return;
}
String var = Token;
getFrame();
double result = evaluate();
var_label.put(var,(int)result);
}
private void input() throws InterpreterException{
String str;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
getFrame();
getToken();
System.out.print("input: ");
try {
str = br.readLine();
var_label.put(Token,Integer.valueOf(str)); // read the value
} catch (IOException exc) {
handleErr(4);
} catch (NumberFormatException exc) {
System.out.println("Invalid input.");
}
}
private void fun_goto() throws InterpreterException{
getFrame();
getToken();
fun_stack.push(progIdx-1);
fun_stack.push(progIdx_K);
if(fun_label.get(Token) != null){
int buf = fun_label.get(Token);
progIdx = buf;
progIdx_K = buf;
}
}
private void fun_for() throws InterpreterException{
getFrame();
getToken();
getFrame();
Frame.add('\0');
int progIdx_b = progIdx;
int progIdx_fb = progIdx_F;
int progIdx_kb = progIdx_K;
char[] prog_b = prog;
for(int i = 0; i < Frame.size(); i++){
prog[i] = Frame.get(i);
}
int repeat = Integer.valueOf(Token);
for(int i = 0; i < repeat; i++){
progIdx = 0;
progIdx_F = 0;
progIdx_K = 0;
mainstart();
}
progIdx = progIdx_b;
progIdx_F = progIdx_fb;
progIdx_K = progIdx_kb;
prog = prog_b;
}
private void fun_if() throws InterpreterException {
double result;
getFrame();
result = evaluate();
if (result != 0.0) {
getFrame();
Frame.add('\0');
int progIdx_b = progIdx;
int progIdx_fb = progIdx_F;
int progIdx_kb = progIdx_K;
char[] prog_b = prog;
for(int i = 0; i < Frame.size(); i++){
prog[i] = Frame.get(i);
}
progIdx = 0;
progIdx_F = 0;
progIdx_K = 0;
mainstart();
progIdx = progIdx_b;
progIdx_F = progIdx_fb;
progIdx_K = progIdx_kb;
prog = prog_b;
}
else{
getFrame();
getFrame();
Frame.add('\0');
int progIdx_b = progIdx;
int progIdx_fb = progIdx_F;
int progIdx_kb = progIdx_K;
char[] prog_b = prog;
for(int i = 0; i < Frame.size(); i++){
prog[i] = Frame.get(i);
}
progIdx = 0;
progIdx_F = 0;
progIdx_K = 0;
mainstart();
progIdx = progIdx_b;
progIdx_F = progIdx_fb;
progIdx_K = progIdx_kb;
prog = prog_b;
}
}
private void fun_return() throws InterpreterException {
progIdx_K = fun_stack.pop();
progIdx = fun_stack.pop();
}
private void print() throws InterpreterException {
getFrame();
getToken();
switch (TokenType){
case VARIABLE:
if(var_label.get(Token) != null){
System.out.println(var_label.get(Token));
}
else{
handleErr(7);
}
break;
case QUOTEDSTR:
System.out.println(Token);
progIdx--;
break;
case NUMBER:
System.out.println(Integer.valueOf(Token));
break;
}
}
private double evaluate() throws InterpreterException{
double result = 0.0;
getToken();
result = relop();
return result;
}
private double relop() throws InterpreterException{
double l_temp, r_temp, result;
char op;
result = addop();
op = Token.charAt(0);
if(isRelop(op)) {
l_temp = result;
getToken();
r_temp = relop();
switch(op) { // perform the relational operation
case '<':
if(l_temp < r_temp) result = 1.0;
else result = 0.0;
break;
case LE:
if(l_temp <= r_temp) result = 1.0;
else result = 0.0;
break;
case '>':
if(l_temp > r_temp) result = 1.0;
else result = 0.0;
break;
case GE:
if(l_temp >= r_temp) result = 1.0;
else result = 0.0;
break;
case '=':
if(l_temp == r_temp) result = 1.0;
else result = 0.0;
break;
case NE:
if(l_temp != r_temp) result = 1.0;
else result = 0.0;
break;
}
}
return result;
}
private double addop() throws InterpreterException{
char op;
double result;
double partialResult;
result = mulop();
while((op = Token.charAt(0)) == '+' || op == '-') {
getToken();
partialResult = mulop();
switch(op) {
case '-':
result = result - partialResult;
break;
case '+':
result = result + partialResult;
break;
}
}
return result;
}
private double mulop() throws InterpreterException {
char op;
double result;
double partialResult;
result = atom();
while((op = Token.charAt(0)) == '*' ||
op == '/' || op == '%') {
getToken();
partialResult = atom();
switch (op) {
case '*':
result = result * partialResult;
break;
case '/':
if (partialResult == 0.0)
handleErr(3);
result = result / partialResult;
break;
case '%':
if (partialResult == 0.0)
handleErr(3);
result = result % partialResult;
break;
}
}
return result;
}
private double atom() throws InterpreterException{
double result = 0.0;
switch(TokenType){
case NUMBER:
result = Double.parseDouble(Token);
getToken();
break;
case VARIABLE:
result = var_label.get(Token);
getToken();
break;
}
return result;
}
private void handleErr(int error) throws InterpreterException {
String[] err = {
"Wrong File!",
"변수가 아닙니다.",
"숫자가 아닙니다.",
"나눗셈을 할 수 없습니다.",
"입력값 에러입니다.",
"\"가 없습니다.",
"구문 에러!",
"없는 변수입니다."
};
throw new InterpreterException(err[error]);
}
private void keyword_init(){
kwToken = "";
kwTktype = 0;
}
private int lookup(String s){
// 토큰테이블에서 토큰을 검색
for(int i=0; i < kwtable.length; i++)
if(kwtable[i].keyword.equals(s))
return kwtable[i].keywordTok;
return UNKNCOM; // unknown keyword
}
boolean isSpaceOrTab(char c) {
if(c == ' ' || c =='\t') return true;
return false;
}
boolean isRelop(char c) {
if(relops.indexOf(c) != -1) return true;
return false;
}
private boolean isDelim(char c)
{
if((" \r+-/*=".indexOf(c) != -1))
return true;
return false;
}
}
public class Myinterpreter {
public static void main(String args[]) {
try {
interpreter i = new interpreter("TEST.txt");
i.run();
}catch(InterpreterException exc) {
System.out.println(exc);
}
}
}