This repository has been archived by the owner on May 11, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
syntree.c
664 lines (650 loc) · 31.5 KB
/
syntree.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
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
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
#ifdef NGDEBUG
#include <assert.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include "global.h"
#include "lexer.h"
#include "syntree.h"
#include "stab.h"
FILE *fmsg;
static int nodeid_count = 0;
static void syntree_type_check(struct Syntree_node *node)
{
if (node->ntype.kind != T_VOID) return ;
if (node->nkind == K_STMT) {
switch (node->se.stmt) {
case K_IFELSE: case K_IF:
case K_WHILE:
if (node->child[0]->ntype.kind >= T_VOID) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
break;
case K_RET:
if (node->child_count == 0) {
if (node->info.symbol->type->kind != T_VOID) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
} else if (node->info.symbol->type->kind < T_VOID) {
if (node->child[0]->ntype.kind >= T_VOID) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->child[0]->ntype = *(node->info.symbol->type);
} else if (node->info.symbol->type->kind == T_VOID) {
if (node->child[0]->ntype.kind != T_VOID) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
} else if (node->info.symbol->type->kind == T_STRUCT) {
if (node->child[0]->ntype.kind != T_STRUCT || node->child[0]->ntype.struct_sym != node->info.symbol->type->struct_sym) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
} else {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
break;
case K_FOR:
break;
case K_DO:
/* TODO */
default:
fprintf(stderr, "C-- currently does not support line %d now.\n", node->lineno);
exit(1);
}
} else if (node->nkind == K_EXPR) {
switch (node->se.expr) {
case K_OPR:
{
node->ntype.kind = -1;
switch (node->info.token) {
case INC: case DEC: case PINC: case PDEC: case NOT:
if (node->child[0]->ntype.kind > T_INT) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->ntype = node->child[0]->ntype;
break;
case MEMBER:
/* TODO */
break;
case LNOT:
node->ntype.kind = T_INT;
case UPLUS: case UMINUS:
if (node->child[0]->ntype.kind > T_DOUBLE) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
break;
case PTR:
break; // check when generating codes
case REFR:
break; // check when generating codes
case LT: case LE: case GT: case GE: case EQ: case NE: case LAND: case LOR:
node->ntype.kind = T_INT;
case MULTIPLY: case DIVIDE: case PLUS: case MINUS:
if (node->child[0]->ntype.kind > T_DOUBLE || node->child[1]->ntype.kind > T_DOUBLE) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->child[0]->ntype.kind = node->child[1]->ntype.kind = MAX(node->child[0]->ntype.kind, node->child[1]->ntype.kind);
break;
case MOD: case SHL: case SHR: case AND: case XOR: case OR:
if (node->child[0]->ntype.kind > T_INT || node->child[1]->ntype.kind > T_INT) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->child[0]->ntype.kind = node->child[1]->ntype.kind = MAX(node->child[0]->ntype.kind, node->child[1]->ntype.kind);
break;
case ASSIGN:
if (node->child[0]->ntype.kind == T_STRUCT && node->child[1]->ntype.kind == T_STRUCT) {
if (node->child[0]->ntype.struct_sym != node->child[1]->ntype.struct_sym) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
} else if (node->child[0]->ntype.kind > T_DOUBLE || node->child[1]->ntype.kind > T_DOUBLE) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->ntype = node->child[1]->ntype = node->child[0]->ntype;
break;
case PLUSASN: case MINUSASN: case MULASN: case DIVASN:
/* TODO */
break;
case MODASN: case SHLASN: case SHRASN: case ANDASN: case XORASN: case ORASN:
/* TODO */
break;
case COMMA:
node->ntype = node->child[1]->ntype;
}
if (node->ntype.kind == -1) {
node->ntype = node->child[0]->ntype;
}
break;
}
case K_DOT:
if (node->child[0]->ntype.kind != T_STRUCT || node->child[1]->se.expr != K_SYM) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
node->ntype = node->child[1]->ntype;
break;
case K_PTR:
node->ntype = node->child[0]->ntype;
break; // check when generating codes
case K_ARY:
node->ntype = *(node->info.symbol->type);
break; // check when generating codes
case K_CALL:
{
if (node->info.symbol->lineno < 0) {
node->ntype = *(node->info.symbol->type);
break;
}
struct Param_entry *pe = node->info.symbol->param_list;
if (node->child[0] == NULL) {
if (pe != NULL) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
} else if (pe == NULL) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
} else {
struct Syntree_node *sn = node->child[0];
while (sn->se.expr == K_OPR && sn->info.token == COMMA && pe->next) {
if (sn->child[0]->ntype.kind != pe->symbol->type->kind || sn->child[0]->ntype.struct_sym != pe->symbol->type->struct_sym) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
sn = sn->child[1];
pe = pe->next;
}
#ifdef NGDEBUG
assert(pe);
#endif
if ((sn->se.expr == K_OPR && sn->info.token == COMMA) || pe->next) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
if (sn->ntype.kind != pe->symbol->type->kind || sn->ntype.struct_sym != pe->symbol->type->struct_sym) {
fprintf(stderr, "Bad type at line: %d.\n", node->lineno);
exit(1);
}
}
node->ntype = *(node->info.symbol->type);
break;
}
default:
fprintf(stderr, "There must be something wrong at line %d.\n", node->lineno);
exit(1);
}
}
}
struct Syntree_node *syntree_new_node(int child_count, enum Node_kind nkind, enum Type_kind ntype, void *se, void *info,
struct Syntree_node *child0, struct Syntree_node *child1, struct Syntree_node *child2, struct Syntree_node *child3)
{
struct Syntree_node *node = (struct Syntree_node *)malloc(sizeof(struct Syntree_node));
node->child_count = child_count;
if (child_count) {
node->child = (struct Syntree_node **)malloc(sizeof(struct Syntree_node) * child_count);
} else {
node->child = 0;
}
node->next = 0;
node->tail = node;
node->env = curr_env;
node->lineno = yyget_lineno();
node->nkind = nkind;
node->ntype.kind = ntype;
if (ntype == T_STRUCT) {
node->ntype.struct_sym = ((struct Stab *)info)->type->struct_sym;
}
node->se = (union SE_kind)se;
node->info = (union Information)info;
if (child0) node->child[0] = child0;
if (child1) node->child[1] = child1;
if (child2) node->child[2] = child2;
if (child3) node->child[3] = child3;
syntree_type_check(node);
if (node->nkind != K_EXPR || node->se.expr < K_OPR) {
node->tmppos = -1;
} else {
node->tmppos = curr_env->tmp_size;
curr_env->tmp_size += type_size(&node->ntype);
}
node->nodeid = nodeid_count++;
return node;
}
struct Syntree_node *syntree_insert_last(struct Syntree_node *dest, struct Syntree_node *src)
{
#ifdef NGDEBUG
assert(dest->tail->next == NULL);
#endif
dest->tail->next = src;
dest->tail = src->tail;
return dest;
}
static void print_child(struct Syntree_node *node)
{
if (node->child) {
fprintf(fmsg, "Children:");
int child_it;
for (child_it = 0; child_it < node->child_count; child_it++) {
if (node->child[child_it]) {
fprintf(fmsg, " %d", node->child[child_it]->nodeid);
}
}
}
fputc(10, fmsg);
}
static void print_symbol(struct Stab *symbol, enum Node_kind nkind)
{
switch (symbol->type->kind) {
case T_VOID: fprintf(fmsg, "void"); break;
case T_INT: fprintf(fmsg, "int"); break;
case T_CHAR: fprintf(fmsg, "char"); break;
case T_FLOAT: fprintf(fmsg, "float"); break;
case T_DOUBLE: fprintf(fmsg, "double"); break;
case T_STRUCT: fprintf(fmsg, "struct %s", symbol->type->struct_sym->name);
}
fprintf(fmsg, "(size %zd)", symbol->size);
if (symbol->ptr_cnt) {
fprintf(fmsg, " (%d)", symbol->ptr_cnt);
int t;
for (t = 0; t < symbol->ptr_cnt; t++) fputc('*', fmsg);
}
if (nkind == K_FUNC && symbol->param_cnt) {
fputc(10, fmsg);
fprintf(fmsg, "\tParamlist(%d): ", symbol->param_cnt);
struct Param_entry *pe;
for (pe = symbol->param_list; pe; pe = pe->next) {
print_symbol(pe->symbol, K_DEF);
fprintf(fmsg, " %s\t", pe->symbol->name);
}
} else if (nkind == K_DEF && symbol->arysize_cnt) {
fprintf(fmsg, " (%d)", symbol->arysize_cnt);
struct Arysize_entry *ae;
for (ae = symbol->arysize_list; ae; ae = ae->next) {
fprintf(fmsg, "[%zd]", ae->size);
}
} else if (nkind == K_STRUCT) {
fprintf(fmsg, " (%d)\t", symbol->member_cnt);
}
}
int syntree_translate(struct Syntree_node *root)
{
if (root == NULL) return 0;
struct Syntree_node *node = root;
for ( ; node; node = node->next) {
fprintf(fmsg, "%2d(%d):\t", node->nodeid, node->env->envid);
switch (node->nkind) {
case K_FUNC:
fprintf(fmsg, "Function definition:\t");
print_symbol(node->info.symbol, K_FUNC);
fprintf(fmsg, "\tsymbol: %s\t", node->info.symbol->name);
print_child(node);
syntree_translate(node->child[0]);
break;
case K_STRUCT:
fprintf(fmsg, "Struct definition:\t");
print_symbol(node->info.symbol, K_STRUCT);
fprintf(fmsg, "\tsymbol: %s\t", node->info.symbol->name);
print_child(node);
syntree_translate(node->child[0]);
break;
case K_DEF:
fprintf(fmsg, "Var definition: ");
print_symbol(node->info.symbol, K_DEF);
fprintf(fmsg, "\tsymbol: %s\t", node->info.symbol->name);
print_child(node);
break;
case K_STMT:
switch (node->se.stmt) {
case K_IFELSE:
fprintf(fmsg, "IF-ELSE statement:\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
syntree_translate(node->child[2]);
break;
case K_IF:
fprintf(fmsg, "IF statement:\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case K_WHILE:
fprintf(fmsg, "WHILE statement:\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case K_DO:
fprintf(fmsg, "DO statement:\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case K_FOR:
fprintf(fmsg, "FOR Statement:\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
syntree_translate(node->child[2]);
syntree_translate(node->child[3]);
break;
case K_RET:
fprintf(fmsg, "Return statement of %s:\t", node->info.symbol->name);
print_child(node);
if (node->child_count) syntree_translate(node->child[0]);
break;
}
break;
case K_EXPR:
switch (node->se.expr) {
case K_CHAR:
fprintf(fmsg, "CHAR constant:\t%c\t", node->info.c);
print_child(node);
break;
case K_STR:
fprintf(fmsg, "STRING constant:\t%s\t", strings[node->info.strno]);
print_child(node);
break;
case K_INT:
fprintf(fmsg, "Integer constant:\t%d\t", node->info.val);
print_child(node);
break;
case K_DOUBLE:
fprintf(fmsg, "Float point constant:\t%f\t", dbl[node->info.dblno]);
print_child(node);
break;
case K_SYM:
fprintf(fmsg, "symbol:\t%s\t", node->info.symbol->name);
print_child(node);
break;
case K_PTR:
fputs("Pointer expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case K_ARY:
fprintf(fmsg, "ARY symbol:\t%s\t", node->info.symbol->name);
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case K_CALL:
fprintf(fmsg, "Function call symbol\t%s\t", node->info.symbol->name);
print_child(node);
syntree_translate(node->child[0]);
break;
case K_OPR:
fprintf(fmsg, "Operation expression:\t");
switch (node->info.token) {
case INC:
fprintf(fmsg, "OP:\t++(suffix)\t");
print_child(node);
syntree_translate(node->child[0]);
break;
case DEC:
fprintf(fmsg, "OP:\t--(suffix)\t");
print_child(node);
syntree_translate(node->child[0]);
break;
case DOT:
fputs("Struct get member:\n", fmsg);
fputs("expr:\n", fmsg);
syntree_translate(node->child[0]);
fputs("member id:\n", fmsg);
syntree_translate(node->child[1]);
break;
case MEMBER:
fputs("Struct pointer get member:\n", fmsg);
fputs("expr:\n", fmsg);
syntree_translate(node->child[0]);
fputs("member id:\n", fmsg);
syntree_translate(node->child[1]);
break;
case PINC:
fputs("Prefix INC expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case PDEC:
fputs("Prefix DEC expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case UPLUS:
fputs("Unary + expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case UMINUS:
fprintf(fmsg, "OP:\tunary -\t");
print_child(node);
syntree_translate(node->child[0]);
break;
case LNOT:
fputs("Logical NOT expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case NOT:
fputs("Arithmetic NOT expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case REFR:
fputs("Reference expression:\n", fmsg);
syntree_translate(node->child[0]);
break;
case MULTIPLY:
fputs("Multiply expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case DIVIDE:
fputs("DIVIDE expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case MOD:
fprintf(fmsg, "OP:\t%%\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case PLUS:
fprintf(fmsg, "OP:\t+\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case MINUS:
fprintf(fmsg, "OP:\t-\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case SHL:
fputs("SHL expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case SHR:
fputs("SHR expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case LT:
fprintf(fmsg, "OP:\t<\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case LE:
fputs("LE expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case GT:
fputs("GT expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case GE:
fputs("GE expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case EQ:
fprintf(fmsg, "OP:\t==\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case NE:
fputs("NE expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case AND:
fputs("Arithmetic AND expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case XOR:
fputs("Arithmetic XOR expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case OR:
fputs("Arithmetic OR expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case LAND:
fputs("Logical AND expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case LOR:
fputs("Logical OR expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case ASSIGN:
fprintf(fmsg, "OP:\t=\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
break;
case PLUSASN:
fputs("PLUS and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
case MINUSASN:
fputs("MINUS and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case MULASN:
fputs("MULTIPLY and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case DIVASN:
fputs("DIVIDE and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case MODASN:
fputs("MOD and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case SHLASN:
fputs("SHL and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case SHRASN:
fputs("SHR and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case ANDASN:
fputs("AND and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case XORASN:
fputs("XOR and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case ORASN:
fputs("OR and ASSIGN expression:\n", fmsg);
fputs("expression 1:\n", fmsg);
syntree_translate(node->child[0]);
fputs("expression 2:\n", fmsg);
syntree_translate(node->child[1]);
break;
case COMMA:
fprintf(fmsg, "OP:\t,\t");
print_child(node);
syntree_translate(node->child[0]);
syntree_translate(node->child[1]);
default:
break;
}
}
break;
}
}
return 0;
}