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
|
#include "ast.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
static ASTNode *new_node(NodeType type) {
ASTNode *node = malloc(sizeof(ASTNode));
assert(node);
node->type = type;
return node;
}
ASTNode *ast_skip(void) {
return new_node(NT_SKIP);
}
ASTNode *ast_assign(ASTNode *var, ASTNode *aexp) {
ASTNode *node = new_node(NT_ASSIGN);
node->u.d_assign.var = var;
node->u.d_assign.aexp = aexp;
return node;
}
ASTNode *ast_seq(ASTNode *stm1, ASTNode *stm2) {
ASTNode *node = new_node(NT_SEQ);
node->u.d_seq.stm1 = stm1;
node->u.d_seq.stm2 = stm2;
return node;
}
ASTNode *ast_if(ASTNode *bexp, ASTNode *stm1, ASTNode *stm2) {
ASTNode *node = new_node(NT_IF);
node->u.d_if.bexp = bexp;
node->u.d_if.stm1 = stm1;
node->u.d_if.stm2 = stm2;
return node;
}
ASTNode *ast_while(ASTNode *bexp, ASTNode *stm) {
ASTNode *node = new_node(NT_WHILE);
node->u.d_while.bexp = bexp;
node->u.d_while.stm = stm;
return node;
}
ASTNode *ast_int(int val) {
ASTNode *node = new_node(NT_INT);
node->u.d_int.val = val;
return node;
}
ASTNode *ast_var(char *name) {
ASTNode *node = new_node(NT_VAR);
node->u.d_var.name = strdup(name);
assert(node->u.d_var.name);
return node;
}
ASTNode *ast_aop(AOp aop, ASTNode *aexp1, ASTNode *aexp2) {
ASTNode *node = new_node(NT_AOP);
node->u.d_aop.aexp1 = aexp1;
node->u.d_aop.aexp2 = aexp2;
node->u.d_aop.aop = aop;
return node;
}
ASTNode *ast_bop(BOp bop, ASTNode *bexp1, ASTNode *bexp2) {
ASTNode *node = new_node(NT_BOP);
node->u.d_bop.bexp1 = bexp1;
node->u.d_bop.bexp2 = bexp2;
node->u.d_bop.bop = bop;
return node;
}
ASTNode *ast_not(ASTNode *bexp) {
ASTNode *node = new_node(NT_NOT);
node->u.d_not.bexp = bexp;
return node;
}
ASTNode *ast_rop(ROp rop, ASTNode *aexp1, ASTNode *aexp2) {
ASTNode *node = new_node(NT_ROP);
node->u.d_rop.aexp1 = aexp1;
node->u.d_rop.aexp2 = aexp2;
node->u.d_rop.rop = rop;
return node;
}
ASTNode *ast_let(ASTNode *var, ASTNode *aexp, ASTNode *stm) {
ASTNode *node = new_node(NT_LET);
node->u.d_let.var = var;
node->u.d_let.aexp = aexp;
node->u.d_let.stm = stm;
return node;
}
void ast_free(ASTNode *node) {
if (!node) return;
switch (node->type) {
case NT_SKIP:
break;
case NT_ASSIGN:
ast_free(node->u.d_assign.var);
ast_free(node->u.d_assign.aexp);
break;
case NT_SEQ:
ast_free(node->u.d_seq.stm1);
ast_free(node->u.d_seq.stm2);
break;
case NT_IF:
ast_free(node->u.d_if.bexp);
ast_free(node->u.d_if.stm1);
ast_free(node->u.d_if.stm2);
break;
case NT_WHILE:
ast_free(node->u.d_while.bexp);
ast_free(node->u.d_while.stm);
break;
case NT_INT:
break;
case NT_VAR:
free(node->u.d_var.name);
break;
case NT_AOP:
ast_free(node->u.d_aop.aexp1);
ast_free(node->u.d_aop.aexp2);
break;
case NT_BOP:
ast_free(node->u.d_bop.bexp1);
ast_free(node->u.d_bop.bexp2);
break;
case NT_ROP:
ast_free(node->u.d_rop.aexp1);
ast_free(node->u.d_rop.aexp2);
break;
case NT_NOT:
ast_free(node->u.d_not.bexp);
break;
case NT_LET:
ast_free(node->u.d_let.var);
ast_free(node->u.d_let.aexp);
ast_free(node->u.d_let.stm);
break;
}
free(node);
}
|
