-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparse.c
147 lines (126 loc) · 2.89 KB
/
parse.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
#include "9cc.h"
static Node *new_node(NodeKind kind) {
Node *node = calloc(1, sizeof(Node));
node->kind = kind;
return node;
}
static Node *new_binary(NodeKind kind, Node *lhs, Node *rhs) {
Node *node = new_node(kind);
node->lhs = lhs;
node->rhs = rhs;
return node;
}
static Node *new_unary(NodeKind kind, Node *expr) {
Node *node = new_node(kind);
node->lhs = expr;
return node;
}
static Node *new_num(long val) {
Node *node = new_node(ND_NUM);
node->val = val;
return node;
}
static Node *stmt(void);
static Node *expr(void);
static Node *equality(void);
static Node *relational(void);
static Node *add(void);
static Node *mul(void);
static Node *unary(void);
static Node *primary(void);
// program = stmt*
Node *program(void) {
Node head = {};
Node *cur = &head;
while (!at_eof()) {
cur->next = stmt();
cur = cur->next;
}
return head.next;
}
// stmt = "return" expr ";"
// | expr ";"
static Node *stmt(void) {
if (consume("return")) {
Node *node = new_unary(ND_RETURN, expr());
expect(";");
return node;
}
Node *node = new_unary(ND_EXPR_STMT, expr());
expect(";");
return node;
}
// expr = equality
static Node *expr(void) {
return equality();
}
// equality = relational ("==" relational | "!=" relational)*
static Node *equality(void) {
Node *node = relational();
for (;;) {
if (consume("=="))
node = new_binary(ND_EQ, node, relational());
else if (consume("!="))
node = new_binary(ND_NE, node, relational());
else
return node;
}
}
// relational = add ("<" add | "<=" add | ">" add | ">=" add)*
static Node *relational(void) {
Node *node = add();
for (;;) {
if (consume("<"))
node = new_binary(ND_LT, node, add());
else if (consume("<="))
node = new_binary(ND_LE, node, add());
else if (consume(">"))
node = new_binary(ND_LT, add(), node);
else if (consume(">="))
node = new_binary(ND_LE, add(), node);
else
return node;
}
}
// add = mul ("+" mul | "-" mul)*
static Node *add(void) {
Node *node = mul();
for (;;) {
if (consume("+"))
node = new_binary(ND_ADD, node, mul());
else if (consume("-"))
node = new_binary(ND_SUB, node, mul());
else
return node;
}
}
// mul = unary ("*" unary | "/" unary)*
static Node *mul(void) {
Node *node = unary();
for (;;) {
if (consume("*"))
node = new_binary(ND_MUL, node, unary());
else if (consume("/"))
node = new_binary(ND_DIV, node, unary());
else
return node;
}
}
// unary = ("+" | "-")? unary
// | primary
static Node *unary(void) {
if (consume("+"))
return unary();
if (consume("-"))
return new_binary(ND_SUB, new_num(0), unary());
return primary();
}
// primary = "(" expr ")" | num
static Node *primary(void) {
if (consume("(")) {
Node *node = expr();
expect(")");
return node;
}
return new_num(expect_number());
}