/
parser.py
executable file
·172 lines (147 loc) · 4.29 KB
/
parser.py
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
#!/usr/bin/env python
from ply import yacc
from alexs_lang.lexer import Lexer
from alexs_lang import ast
class Parser(object):
precedence = (
('left', 'PLUS', 'MINUS'),
('left', 'TIMES', 'DIVIDE'),
('right', 'UMINUS'),
('right', 'UPLUS'),
('left', 'POWER'),
)
def __init__(self):
self._built = False
def build(self, **kwargs):
self.lexer = Lexer()
self.tokens = self.lexer.tokens
self.parser = yacc.yacc(module=self)
def parse(self, code):
self.require_built()
n = ast.NodeList()
n.append(self.parser.parse(code, lexer=self.lexer))
return n
def require_built(self):
if not self._built:
self.build()
def p_statement(self, t):
'''
statement : statement NEWLINE
'''
t[0] = t[1]
def p_statement_expr(self, t):
'''
statement : expression
'''
t[0] = t[1]
def p_expression(self, t):
'''
expression : NAME EQUALS expression
| NAME PLUS_EQUALS expression
| NAME MINUS_EQUALS expression
| NAME TIMES_EQUALS expression
| NAME DIVIDE_EQUALS expression
'''
if t[2] == '=':
t[0] = ast.Assignment(ast.Name(t[1]), t[3])
else:
t[0] = ast.Assignment(ast.Name(t[1]), ast.BinaryOperation(ast.Name(t[1]), t[3], t[2][0]))
def p_expression_binop(self, t):
'''
expression : expression PLUS expression
| expression MINUS expression
| expression TIMES expression
| expression DIVIDE expression
| expression MODULO expression
| expression POWER expression
'''
t[0] = ast.BinaryOperation(t[1], t[3], t[2])
def p_expression_unaryop(self, t):
'''
expression : MINUS expression %prec UMINUS
| PLUS expression %prec UPLUS
| NOT expression
'''
t[0] = ast.UnaryOperation(t[2], t[1])
def p_expression_group(self, t):
'''
expression : LPAREN expression RPAREN
'''
t[0] = t[2]
def p_expression_compare(self, t):
'''
expression : expression EQ expression
| expression LT expression
| expression GT expression
| expression LE expression
| expression GE expression
| expression AND expression
| expression OR expression
'''
t[0] = ast.Comparison(t[1], t[3], t[2])
def p_expression_constant(self, t):
'''
expression : NUMBER
| BOOL
| none
'''
t[0] = t[1]
def p_number(self, t):
'''
NUMBER : FLOAT
| INTEGER
'''
t[0] = ast.Number(t[1])
def p_bool(self, t):
'''
BOOL : TRUE
| FALSE
'''
t[0] = ast.Boolean(t[1])
def p_none(self, t):
'''
none : NONE
'''
t[0] = ast.NoneVal()
def p_expression_name(self, t):
'''
expression : NAME
'''
t[0] = ast.Name(t[1])
def p_arglist(self, t):
'''
arglist : arglist COMMA expression
| expression
'''
if len(t) == 2:
t[0] = [t[1]]
else:
t[0] = t[1] + [t[3]]
def p_expression_function_call(self, t):
'''
expression : expression LPAREN arglist RPAREN
'''
t[0] = ast.FunctionCall(t[1], t[3])
def p_statement_if(self, t):
'''
statement : IF expression COLON suite
'''
t[0] = ast.If(t[2], t[4])
def p_statements(self, t):
'''
statements : statements statement
| statement
'''
if len(t) == 2:
t[0] = ast.NodeList([t[1]])
else:
t[1].append(t[2])
t[0] = t[1]
def p_suite(self, t):
'''
suite : NEWLINE INDENT statements DEDENT
'''
t[0] = t[3]
def p_error(self, t):
import sys
sys.stderr.write("Syntax error at '%s' on line %s.\n" % (t.value, t.lineno))