-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathparser.h
More file actions
311 lines (262 loc) · 8.56 KB
/
parser.h
File metadata and controls
311 lines (262 loc) · 8.56 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
#pragma once
#include "expr.h"
#include "hashmap.h"
#include "objects/customdeque.h"
#include "stmt.h"
class Precedence {
// Ordered in increasing precedence.
public:
static const int ASSIGNMENT = 1;
static const int OR = 2;
static const int AND = 3;
static const int EQUALITY = 4;
static const int COMPARISON = 5;
static const int BITWISE_OR = 6;
static const int BITWISE_XOR = 7;
static const int BITWISE_AND = 8;
static const int BITWISE_SHIFT = 9;
static const int SUM = 10;
static const int PRODUCT = 11;
static const int PREFIX = 12;
static const int POSTFIX = 13;
static const int REFERENCE = 14;
static const int CALL = 15;
static const int PRIMARY = 16;
};
class Parser;
class PrefixParselet {
public:
virtual Expression *parse(Parser *parser, Token t) = 0;
virtual ~PrefixParselet() {}
};
class NameParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class ThisOrSuperParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class LiteralParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class ArrayLiteralParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class HashmapLiteralParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class PrefixOperatorParselet : public PrefixParselet {
private:
int precedence;
public:
PrefixOperatorParselet(int prec) : precedence(prec) {}
Expression *parse(Parser *parser, Token t);
int getPrecedence() { return precedence; }
};
class GroupParselet : public PrefixParselet {
public:
Expression *parse(Parser *parser, Token t);
};
class InfixParselet {
private:
int precedence;
public:
InfixParselet(int prec) : precedence(prec) {}
virtual Expression *parse(Parser *parser, const Expression2 &left,
Token t) = 0;
int getPrecedence() { return precedence; }
virtual bool isAssignment() { return false; }
virtual ~InfixParselet() {}
};
class BinaryOperatorParselet : public InfixParselet {
private:
bool isRight;
public:
BinaryOperatorParselet(int precedence, bool isr)
: InfixParselet(precedence), isRight(isr) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
};
class PostfixOperatorParselet : public InfixParselet {
public:
PostfixOperatorParselet(int precedence) : InfixParselet(precedence) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
bool isAssignment() {
return true; // only ++/--
}
};
class AssignParselet : public InfixParselet {
public:
AssignParselet() : InfixParselet(Precedence::ASSIGNMENT) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
bool isAssignment() { return true; }
};
class CallParselet : public InfixParselet {
public:
CallParselet() : InfixParselet(Precedence::CALL) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
};
class ReferenceParselet : public InfixParselet {
public:
ReferenceParselet() : InfixParselet(Precedence::REFERENCE) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
};
class SubscriptParselet : public InfixParselet {
public:
SubscriptParselet() : InfixParselet(Precedence::REFERENCE) {}
Expression *parse(Parser *parser, const Expression2 &left, Token t);
};
class DeclarationParselet {
public:
Statement *parse(Parser *p, Token t) {
return this->parse(p, t, VIS_DEFAULT);
}
virtual Statement *parse(Parser *p, Token t, Visibility vis) = 0;
virtual ~DeclarationParselet() {}
};
class StatementParselet {
public:
virtual Statement *parse(Parser *p, Token t) = 0;
virtual ~StatementParselet() {}
};
class ImportDeclaration : public DeclarationParselet {
public:
Statement *
parse(Parser *p, Token t,
Visibility vis); // vis_priv will throw an exception for import
};
class ClassDeclaration : public DeclarationParselet {
private:
Statement *parseClassBody(Parser *p);
using ClassBodyParselet = HashMap<Token::Type, StatementParselet *>;
static ClassBodyParselet *classBodyParselets;
public:
static void registerParselet(Token::Type t, StatementParselet *parselet);
Visibility memberVisibility;
Statement * parse(Parser *p, Token t, Visibility vis);
};
class FnDeclaration : public DeclarationParselet {
public:
virtual Statement *parse(Parser *p, Token t, Visibility vis);
static FnBodyStatement *
parseFnBody(Parser *p, Token t, bool isNative = false, int numArgs = -1);
static Statement *parseFnStatement(Parser *p, Token t, bool ism, bool iss,
Visibility vis);
};
class VarDeclaration : public DeclarationParselet {
Statement *parse(Parser *p, Token t, Visibility vis);
};
class IfStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class WhileStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class DoStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class TryStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class ThrowStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class ReturnStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class ForStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class BreakStatementParselet : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
// Class Body Statements
class ConstructorDeclaration : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class VisibilityDeclaration : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
// it can either be a static block, or a static function,
// or a static variable
class StaticDeclaration : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class MethodDeclaration : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class OpMethodDeclaration : public StatementParselet {
public:
Statement *parse(Parser *p, Token t);
};
class MemberDeclaration : public StatementParselet {
public:
Statement * parse(Parser *p, Token t);
static Statement *parse(Parser *p, Token t, bool isStatic);
};
// Parser
class Parser {
private:
HashMap<Token::Type, PrefixParselet *> prefixParselets;
HashMap<Token::Type, InfixParselet *> infixParselets;
HashMap<Token::Type, DeclarationParselet *> declarationParselets;
HashMap<Token::Type, StatementParselet *> statementParselets;
Scanner & scanner;
CustomDeque<Token> tokenCache;
int getPrecedence();
Array *declarations; // root of the tree currently being compiled
public:
Parser(Scanner &sc);
Token lookAhead(size_t distance);
bool match(Token::Type expected);
Token consume();
Token consume(Token::Type expected, const char *message);
void registerParselet(Token::Type type, PrefixParselet *p);
void registerParselet(Token::Type type, InfixParselet *p);
void registerParselet(Token::Type type, DeclarationParselet *p);
void registerParselet(Token::Type type, StatementParselet *p);
// if silent is true, the parser won't trigger an
// exception if it cannot find a suitable expression
// to parse. it will bail out and return null
Expression *parseExpression(Token token, bool silent = false);
Expression *parseExpression(bool silent = false);
Expression *parseExpression(int precedence, Token token,
bool silent = false);
Expression *parseExpression(int precedence, bool silent = false);
Statement * parseDeclaration();
Array * parseAllDeclarations();
Statement * parseStatement();
Statement * parseBlock(bool isStatic = false);
String * buildNextString(Token &t);
InfixParselet *
getInfixParselet(Token::Type type); // return an infixparselet for the token
// release the parselets
void releaseAll();
void mark() { Gc::mark(declarations); }
};
class ParseException : public std::runtime_error {
private:
Token t;
const char *message;
public:
ParseException() : runtime_error("Error occurred while parsing!") {}
ParseException(Token to, const char *msg)
: runtime_error(msg), t(to), message(msg) {}
virtual const char *what() const throw() { return message; }
Token getToken() { return t; }
};