/
parser.ts
200 lines (175 loc) · 4.15 KB
/
parser.ts
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
namespace Parser {
enum TokenKind {
LeftParenthesis,
RightParenthesis,
Number,
Plus,
Multiple,
EndOfFile,
}
interface Token {
kind: TokenKind;
start: number;
end: number;
text: string;
}
let sourceText: string;
let pos: number;
let length: number;
let token: Token;
/**
四则运算的文法(只包含 加法 和 乘法)
Expr -> Expr + Term | Term
Term -> Term * Factor | Factor
Factor -> NUMBER | ( Expr )
消除左递归
Expr -> Term Expr'
Expr' -> + Term Expr' | ε
Term -> Factor Term'
Term' -> * Factor Term' | ε
Factor -> NUMBER | ( Expr )
Ref: https://zhuanlan.zhihu.com/p/208906640
*/
export function parse(code: string) {
sourceText = code;
pos = 0;
length = sourceText.length;
nextToken();
const expr = parseExpr();
assert(TokenKind.EndOfFile);
return expr;
}
// Expr -> Term Expr'
function parseExpr() {
const term = parseTerm();
const exprPlus = parseExprPlus(term);
return exprPlus;
}
// Expr' -> + Term Expr' | ε
function parseExprPlus(term) {
switch (token.kind) {
case TokenKind.Plus: {
nextToken();
const rightTerm = parseTerm();
const exprPlus = parseExprPlus(rightTerm);
return {
left: term,
operator: '+',
right: exprPlus,
};
}
default: {
return term;
}
}
}
// Term -> Factor Term'
function parseTerm() {
const factor = parseFactor();
const termPlus = parseTermPlus(factor);
return termPlus;
}
// Term' -> * Factor Term' | ε
function parseTermPlus(factor) {
switch (token.kind) {
case TokenKind.Multiple: {
nextToken();
const rightFactor = parseFactor();
const termPlus = parseTermPlus(rightFactor);
return {
left: factor,
operator: '*',
right: termPlus,
};
}
default: {
return factor;
}
}
}
// Factor -> NUMBER | ( Expr )
function parseFactor() {
switch (token.kind) {
case TokenKind.Number: {
const num = token;
nextToken();
return num;
}
case TokenKind.LeftParenthesis: {
nextToken();
const expr = parseExpr();
assert(TokenKind.RightParenthesis);
nextToken();
return expr;
}
default: {
debugger;
throw new Error('parseFactor error');
}
}
}
function nextToken() {
while (true) {
if (pos >= length) {
return token = createToken(TokenKind.EndOfFile, pos, pos, null);
}
const ch = sourceText.charAt(pos);
switch (ch) {
case '(':
return token = createToken(TokenKind.LeftParenthesis, pos, ++pos, ch);
case ')':
return token = createToken(TokenKind.RightParenthesis, pos, ++pos, ch);
case '+':
return token = createToken(TokenKind.Plus, pos, ++pos, ch);
case '*':
return token = createToken(TokenKind.Multiple, pos, ++pos, ch);
case ' ':
case '\n':
++pos;
continue;
default:
if (isNumberStart(ch)) {
const end = scanNumber(sourceText, pos, length);
const num = sourceText.slice(pos, end);
return token = createToken(TokenKind.Number, pos, (pos = end), num);
}
}
}
}
function scanNumber(sourceCode, pos, length) {
++pos;
while (true) {
if (pos >= length) {
break;
}
const ch = sourceCode.charAt(pos);
if (!isNumberPart(ch)) {
break;
}
++pos;
}
return pos;
}
function isNumberStart(ch) {
return ch >= '1' && ch <= '9';
}
function isNumberPart(ch) {
return ch >= '0' && ch <= '9';
}
function createToken(kind: TokenKind, start, end, text): Token {
return {
kind,
start,
end,
text,
};
}
function assert(kind) {
if (token.kind === kind) {
return;
}
debugger;
const message = `unexpected token: ${JSON.stringify(token)}`;
throw new Error(message);
}
}