-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathparser.py
417 lines (364 loc) · 14.2 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
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
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
"""
The parser for the HERA language. As an assembly language, HERA has quite a simple
syntax.
Abstract grammar:
start := (op | include)*
op := SYMBOL LPAREN arglist? RPAREN
include := INCLUDE (STRING | BRACKETED)
arglist := (value COMMA)* value
The lexical structure of the language is defined in `hera/lexer.py`.
Author: Ian Fisher (iafisher@protonmail.com)
Version: July 2019
"""
import os.path
import re
from .data import HERAError, Messages, Settings, Token
from .lexer import Lexer
from .op import AbstractOperation, name_to_class
from .stdlib import (
TIGER_STDLIB_REG,
TIGER_STDLIB_REG_DATA,
TIGER_STDLIB_STACK,
TIGER_STDLIB_STACK_DATA,
)
from .utils import Path, PATH_STRING, read_file, register_to_index
def parse(
text: str, *, path=PATH_STRING, settings=Settings()
) -> "Tuple[List[AbstractOperation], Messages]":
"""
Parse a HERA program.
`path` is the path of the file being parsed, as it will appear in error and
warning messages. It defaults to "<string>".
"""
text = evaluate_ifdefs(text)
lexer = Lexer(text, path=path)
parser = Parser(lexer, settings)
program = parser.parse()
return (program, parser.messages)
class Parser:
def __init__(self, lexer: Lexer, settings: Settings) -> None:
self.lexer = lexer
# Keep track of the set of files that have already been parsed, to avoid
# infinite recursion through #include statements.
self.visited = set() # type: Set[str]
self.settings = settings
self.messages = Messages()
def parse(self) -> "List[AbstractOperation]":
if self.lexer.path:
self.visited.add(get_canonical_path(self.lexer.path))
try:
ops = self.match_program()
except HERAError as e:
self.messages.err(*e.args)
return []
# Make sure to capture any warnings from the lexer.
self.messages.extend(self.lexer.messages)
return ops
def match_program(self) -> "List[AbstractOperation]":
"""Match an entire program."""
expecting_brace = False
ops = []
while self.lexer.tkn.type != Token.EOF:
msg = "expected HERA operation or #include"
if not self.expect({Token.INCLUDE, Token.SYMBOL, Token.RBRACE}, msg):
self.skip_until({Token.INCLUDE, Token.SYMBOL})
continue
if self.lexer.tkn.type == Token.INCLUDE:
ops.extend(self.match_include())
elif self.lexer.tkn.type == Token.SYMBOL:
name_tkn = self.lexer.tkn
self.lexer.next_token()
# Legacy HERA program are enclosed in void HERA_main() { ... }, which is
# handled here.
if self.lexer.tkn.type == Token.SYMBOL and name_tkn.value == "void":
expecting_brace = True
self.handle_cpp_boilerplate()
elif self.lexer.tkn.type == Token.LPAREN:
op = self.match_op(name_tkn)
if op:
ops.append(op)
# Operations may optionally be separated by semicolons.
if self.lexer.tkn.type == Token.SEMICOLON:
self.lexer.next_token()
else:
self.err("expected left parenthesis")
else:
if expecting_brace:
expecting_brace = False
else:
self.err("unexpected right brace")
self.lexer.next_token()
return ops
def match_op(self, name_tkn: Token) -> "Optional[AbstractOperation]":
"""
Match an operation, assuming that self.lexer.tkn is on the left parenthesis.
"""
self.lexer.next_token()
args = self.match_optional_arglist()
self.lexer.next_token()
if args is None:
return None
try:
cls = name_to_class[name_tkn.value]
except KeyError:
self.err("unknown instruction `{}`".format(name_tkn.value), name_tkn)
return None
else:
return cls(*args, loc=name_tkn)
VALUE_TOKENS = {
Token.INT,
Token.REGISTER,
Token.SYMBOL,
Token.STRING,
Token.CHAR,
Token.MINUS,
}
def match_optional_arglist(self) -> "Optional[List[Token]]":
"""
Match zero or more comma-separated values. Exits with the right parenthesis as
the current token. Make sure to distinguish between a None return value (the
arglist could not be parsed) and a [] return value (an empty arglist was parsed
successfully).
"""
if self.lexer.tkn.type == Token.RPAREN:
return []
args = []
hit_error = False
while True:
if self.expect(self.VALUE_TOKENS, "expected value"):
val = self.match_value()
else:
val = None
if val is None:
hit_error = True
self.skip_until({Token.COMMA, Token.RPAREN})
if self.lexer.tkn.type == Token.COMMA:
self.lexer.next_token()
continue
else:
break
else:
args.append(val)
self.lexer.next_token()
if self.lexer.tkn.type == Token.RPAREN:
break
elif self.lexer.tkn.type != Token.COMMA:
hit_error = True
self.err("expected comma or right parenthesis")
self.skip_until({Token.COMMA, Token.RPAREN})
if (
self.lexer.tkn.type == Token.EOF
or self.lexer.tkn.type == Token.RPAREN
):
break
else:
self.lexer.next_token()
return args if not hit_error else None
def match_value(self) -> "Optional[Token]":
"""Match a value (e.g., an integer, a register)."""
if self.lexer.tkn.type == Token.INT:
return self.match_int()
elif self.lexer.tkn.type == Token.CHAR:
return Token(
Token.INT, ord(self.lexer.tkn.value), location=self.lexer.tkn.location
)
elif self.lexer.tkn.type == Token.REGISTER:
try:
i = register_to_index(self.lexer.tkn.value)
except HERAError:
self.err("{} is not a valid register".format(self.lexer.tkn.value))
i = 0
self.lexer.tkn.value = i
return self.lexer.tkn
elif self.lexer.tkn.type == Token.MINUS:
self.lexer.next_token()
if not self.expect(Token.INT, "expected integer"):
return None
else:
ret = self.match_int()
ret.value *= -1
return ret
else:
return self.lexer.tkn
def match_int(self) -> Token:
"""
Match an integer literal. Binary, octal and hexadecimal literals are supported.
"""
# Detect zero-prefixed octal numbers.
prefix = self.lexer.tkn.value[:2]
if len(prefix) == 2 and prefix[0] == "0" and prefix[1].isdigit():
base = 8
if self.settings.warn_octal_on:
self.warn('consider using "0o" prefix for octal numbers')
else:
base = 0
try:
arg_as_int = int(self.lexer.tkn.value, base=base)
except ValueError:
self.err("invalid integer literal")
# 1 is a neutral value that is valid anywhere an integer is.
arg_as_int = 1
self.lexer.tkn.value = arg_as_int
return self.lexer.tkn
def match_include(self) -> "List[AbstractOperation]":
"""Match an #include statement."""
root_path = self.lexer.path
tkn = self.lexer.next_token()
msg = "expected quote or angle-bracket delimited string"
if not self.expect({Token.STRING, Token.BRACKETED}, msg):
self.lexer.next_token()
return []
self.lexer.next_token()
if tkn.type == Token.STRING:
include_path = os.path.join(os.path.dirname(root_path), tkn.value)
if get_canonical_path(include_path) in self.visited:
self.err("recursive include", tkn)
return []
try:
included_text = read_file(include_path)
except HERAError as e:
self.err(str(e), tkn)
return []
else:
old_lexer = self.lexer
included_text = evaluate_ifdefs(included_text)
self.lexer = Lexer(included_text, path=include_path)
ops = self.parse()
self.lexer = old_lexer
return ops
else:
return self.expand_angle_include(tkn)
def handle_cpp_boilerplate(self) -> None:
self.lexer.next_token()
if self.expect(Token.LPAREN, "expected left parenthesis"):
self.lexer.next_token()
if self.expect(Token.RPAREN, "expected right parenthesis"):
self.lexer.next_token()
self.expect(Token.LBRACE, "expected left curly brace")
self.lexer.next_token()
def expand_angle_include(self, include_path: Token) -> "List[AbstractOperation]":
"""
Given a path to a system library from an #include <...> statement, retrieve
the library, parse it, and return the HERA operations.
"""
# There is no check for recursive includes in this function, under the
# assumption that system libraries do not have recursive includes.
if include_path.value == "HERA.h":
self.warn("#include <HERA.h> is not necessary for hera-py", include_path)
return []
elif include_path.value == "Tiger-stdlib-stack-data.hera":
included_text = TIGER_STDLIB_STACK_DATA
elif include_path.value == "Tiger-stdlib-stack.hera":
included_text = TIGER_STDLIB_STACK
elif include_path.value == "Tiger-stdlib-reg-data.hera":
included_text = TIGER_STDLIB_REG_DATA
elif include_path.value == "Tiger-stdlib-reg.hera":
included_text = TIGER_STDLIB_REG
else:
# If the library name is not a known library, look for it in a number of
# defined places.
root_path = os.environ.get(
"HERA_PY_DIR",
os.environ.get("HERA_C_DIR", "/home/courses/lib/HERA-lib"),
)
try:
included_text = read_file(os.path.join(root_path, include_path.value))
except HERAError as e:
self.err(str(e), include_path)
return []
old_lexer = self.lexer
self.lexer = Lexer(included_text, path=include_path.value)
ops = self.parse()
self.lexer = old_lexer
return ops
def expect(self, types: "Union[str, Set[str]]", msg="unexpected token") -> bool:
"""
Expect the current token to be one of the types in `types`, and record an error
and return False if it is not.
"""
if isinstance(types, str):
types = {types}
if self.lexer.tkn.type not in types:
if self.lexer.tkn.type == Token.EOF:
self.err("premature end of input")
elif self.lexer.tkn.type == Token.ERROR:
self.err(self.lexer.tkn.value)
else:
self.err(msg)
return False
else:
return True
def skip_until(self, types: "Set[str]") -> None:
"""Keep consuming tokens until a token whose type is in `types` is reached."""
types.add(Token.EOF)
while self.lexer.tkn.type not in types:
self.lexer.next_token()
def err(self, msg: str, tkn: "Optional[Token]" = None) -> None:
"""Record an error. Note that this does not immediately print to the console."""
if tkn is None:
tkn = self.lexer.tkn
self.messages.err(msg, tkn.location)
def warn(self, msg: str, tkn: "Optional[Token]" = None) -> None:
"""
Record a warning. Note that this does not immediately print to the console.
"""
if tkn is None:
tkn = self.lexer.tkn
self.messages.warn(msg, tkn.location)
_ifdef_symbol = r"[A-Za-z_][A-Za-z0-9_]*"
_ifdef_tokens = (
("IFDEF", r"^\s*#ifdef\s+" + _ifdef_symbol + r"\s*$"),
("IFNDEF", r"^\s*#ifndef\s+" + _ifdef_symbol + r"\s*$"),
("ELSE", r"^\s*#else\s*$"),
("ENDIF", r"^\s*#endif\s*$"),
)
_ifdef_pattern = re.compile(
"|".join("(?P<%s>%s)" % pair for pair in _ifdef_tokens), flags=re.MULTILINE
)
def evaluate_ifdefs(text):
"""
For compatibility with the HERA-C interpreter written in C++, hera-py supports
#ifdef <x> ... #else ... #endif and #ifndef statements. The only token defined by
the hera-py interpreter is HERA_PY, so for instance in
#ifdef HERA_PY
...
#else
...
#endif
everything in the else clause will be stripped and may contain code that is not
valid HERA, e.g. C++.
"""
ret = []
starting_at = 0
# A stack of booleans indicating whether we should keep text in the current block.
keeping = [True]
for mo in _ifdef_pattern.finditer(text):
if keeping[-1]:
ret.append(text[starting_at : mo.start()])
kind = mo.lastgroup
value = mo.group()
if kind == "IFDEF":
word = value.split()[-1]
if word == "HERA_PY":
keeping.append(True)
else:
keeping.append(False)
elif kind == "IFNDEF":
word = value.split()[-1]
if word != "HERA_PY":
keeping.append(True)
else:
keeping.append(False)
elif kind == "ELSE" and len(keeping) > 1:
keeping[-1] = not keeping[-1]
elif kind == "ENDIF" and len(keeping) > 1:
keeping.pop()
if keeping[-1]:
starting_at = mo.end()
ret.append(text[starting_at:])
return "".join(ret)
def get_canonical_path(fpath: Path) -> str:
if not isinstance(fpath, Path) or fpath.kind == Path.FILE:
return Path(os.path.realpath(fpath))
else:
return fpath