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 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952
|
""" Base class with all the support code of the rpython peg parser """
import io
import os
import sys
from pypy.interpreter.pyparser.pygram import tokens
from pypy.interpreter.pyparser.parser import Token
from pypy.interpreter.pyparser import pytokenizer as tokenize, pytoken
from pypy.interpreter.pyparser.error import SyntaxError, IndentationError
from pypy.interpreter.astcompiler import ast
from pypy.interpreter.astcompiler.astbuilder import parse_number
from pypy.interpreter.astcompiler import asthelpers # Side effects
from pypy.interpreter.astcompiler import consts, misc
from rpython.rlib.objectmodel import specialize
Load = ast.Load
Store = ast.Store
Del = ast.Del
class BaseMemoEntry(object):
_attrs_ = ['endmark', 'next']
def __init__(self, endmark, next):
self.endmark = endmark
self.next = next
def find_memo(tok, cls):
memo = tok.memo
while memo:
if type(memo) is cls:
return memo
memo = memo.next
return None
def shorttok(tok):
return "%-25.25s" % ("%s.%s: %s:%r" % (tok.lineno, tok.column, tok.token_type, tok.value))
def log_start(self, method_name):
fill = " " * self._level
print "%s%s() .... (looking at %s)" % (fill, method_name, self.showpeek())
self._level += 1
def log_end(self, method_name, result):
self._level -= 1
fill = " " * self._level
print "%s... %s(%s) --> %s" % (fill, method_name, result)
def make_memo_class(method_name):
class MemoEntry(BaseMemoEntry):
_attrs_ = ['tree']
def __init__(self, tree, endmark, next):
BaseMemoEntry.__init__(self, endmark, next)
self.tree = tree
MemoEntry.__name__ += "_" + "method_name"
return MemoEntry
def memoize(method):
"""Memoize a symbol method."""
method_name = method.__name__
MemoEntry = make_memo_class(method_name)
def memoize_wrapper(self):
tok = self.peek()
memo = find_memo(tok, MemoEntry)
# Fast path: cache hit, and not verbose.
fill = ''
if memo:
assert isinstance(memo, MemoEntry)
self._reset(memo.endmark)
return memo.tree
# Slow path: no cache hit, or verbose.
verbose = self._verbose
if verbose:
fill = " " * self._level
print "%s%s() .... (looking at %s)" % (fill, method_name, self.showpeek())
self._level += 1
tree = method(self)
if verbose:
self._level -= 1
print "%s... %s() --> %s" % (fill, method_name, tree)
endmark = self._mark()
tok.memo = MemoEntry(tree, endmark, tok.memo)
return tree
memoize_wrapper.__wrapped__ = method # type: ignore
return memoize_wrapper
def memoize_left_rec(method):
"""Memoize a left-recursive symbol method."""
method_name = method.__name__
MemoEntry = make_memo_class(method_name)
def memoize_left_rec_wrapper(self):
mark = self._mark()
tok = self.peek()
memo = find_memo(tok, MemoEntry)
# Fast path: cache hit
if memo:
assert isinstance(memo, MemoEntry)
self._reset(memo.endmark)
return memo.tree
fill = " " * self._level
# key not in cache
verbose = self._verbose
if verbose:
print "%s%s .... (looking at %s)" % (fill, method_name, self.showpeek())
self._level += 1
# For left-recursive rules we manipulate the cache and
# loop until the rule shows no progress, then pick the
# previous result. For an explanation why this works, see
# https://github.com/PhilippeSigaud/Pegged/wiki/Left-Recursion
# (But we use the memoization cache instead of a static
# variable; perhaps this is similar to a paper by Warth et al.
# (http://web.cs.ucla.edu/~todd/research/pub.php?id=pepm08).
# Prime the cache with a failure.
memo = tok.memo = MemoEntry(None, mark, tok.memo)
lastresult, lastmark = None, mark
depth = 0
if verbose:
print "%sRecursive %s at %s depth %s" % (fill, method_name, mark, depth)
while True:
self._reset(mark)
self.in_recursive_rule += 1
try:
result = method(self)
finally:
self.in_recursive_rule -= 1
endmark = self._mark()
depth += 1
if verbose:
print "%sRecursive %s at %s depth %s: %.200s to %s" % (fill, method_name, mark, depth, result, endmark)
if not result:
if verbose:
print "%sFail with %.200s to %s" % (fill, lastresult, lastmark)
break
if endmark <= lastmark:
if verbose:
print "%sBailing with %.200s to %s" % (fill, lastresult, lastmark)
break
memo.tree, memo.endmark = lastresult, lastmark = result, endmark
self._reset(lastmark)
tree = lastresult
self._level -= 1
if verbose:
print "%s... %s() --> %s [cached]" % (fill, method_name, tree)
if tree:
endmark = self._mark()
else:
endmark = mark
self._reset(endmark)
memo.tree, memo.endmark = tree, endmark
return tree
memoize_left_rec_wrapper.__wrapped__ = method # type: ignore
return memoize_left_rec_wrapper
def without_invalid(func):
def without_invalid_wrapper(self):
old = self.call_invalid_rules
try:
return func(self)
finally:
self.call_invalid_rules = old
without_invalid_wrapper.func_name = func.func_name + "_without_invalid_wrapper"
return without_invalid_wrapper
def isspace(s):
res = True
for c in s:
if not c.isspace():
res = False
return res
class NameDefaultPair(object):
def __init__(self, arg, value):
self.arg = arg
self.value = value
class StarEtc(object):
def __init__(self, vararg, kwonlyargs, kwarg):
self.vararg = vararg
self.kwonlyargs = kwonlyargs
self.kwarg = kwarg
class SlashWithDefault(object):
def __init__(self, plain_names, names_with_defaults):
self.plain_names = plain_names
self.names_with_defaults = names_with_defaults
class DictDisplaysEntry(object):
def __init__(self, key, value):
self.key = key
self.value = value
class CmpopExprPair(object):
def __init__(self, cmpop, expr):
self.cmpop = cmpop
self.expr = expr
class KeyPatternPair(object):
def __init__(self, keyword, pattern):
self.keyword = keyword
self.pattern = pattern
class Parser:
"""Parsing base class."""
# KEYWORDS: ClassVar[Tuple[str, ...]]
# SOFT_KEYWORDS: ClassVar[Tuple[str, ...]]
def __init__(self, space, tokenlist, compile_info, verbose=False):
# initialize tokenization stuff
self._tokens = []
self._lines = {}
self._path = "" # XXX
self.type_ignores = []
self.compile_info = compile_info
self._warnings = []
for tok in tokenlist:
# Special handling for TYPE_IGNOREs
if tok.token_type == tokens.TYPE_IGNORE:
self.type_ignores.append(tok)
continue
if tok.token_type in (tokens.NL, tokens.COMMENT):
continue
if tok.token_type == tokens.ERRORTOKEN and isspace(tok.value):
continue
if tok.token_type == tokens.WARNING:
self._warnings.append(tok)
continue
if (
tok.token_type == tokens.NEWLINE
and self._tokens
and self._tokens[-1].token_type == tokens.NEWLINE
):
continue
if tok.token_type == tokens.NAME:
index = self.KEYWORD_INDICES.get(tok.value, -1)
if index != -1:
tok.token_type = index
tok.memo = None
self._tokens.append(tok)
if not self._path and tok.line and tok.lineno not in self._lines:
self._lines[tok.lineno] = tok.line
self._index = 0
self._highwatermark = 0
# parser stuff
self._verbose = verbose
self._level = 0
self._cache = {}
# Integer tracking wether we are in a left recursive rule or not. Can be useful
# for error reporting.
self.in_recursive_rule = 0
self.call_invalid_rules = False
self.py_version = (3, compile_info.feature_version)
self.space = space
def parse_meth_or_raise(self, meth):
res = meth(self)
if res is None:
tok = self.diagnose()
if self.compile_info.flags & consts.PyCF_ALLOW_INCOMPLETE_INPUT:
# bit of a heuristic: if the remaining tokens are ENDMARKER,
# NEWLINE, DEDENT then more input could fix things, so we raise
# "incomplete input"
for index in range(self._highwatermark, len(self._tokens)):
typ = tok.token_type
if (typ != tokens.ENDMARKER and typ != tokens.NEWLINE and
typ != tokens.DEDENT):
break
else:
self.raise_syntax_error_known_location("incomplete input", tok)
self.reset()
self.call_invalid_rules = True
meth(self) # often raises
# we're still here, so no specific error message
if tok.token_type == tokens.INDENT:
self.raise_indentation_error("unexpected indent")
self.raise_syntax_error_known_location("invalid syntax", tok)
assert res
# now raise all warnings from the tokenizer
for tok in self._warnings:
self.deprecation_warn(tok.value, tok)
return res
def recursive_parse_to_ast(self, str, info):
from pypy.interpreter.pyparser import pytokenizer as tokenize
from pypy.interpreter.pyparser import rpypegparse
tokenlist = tokenize.generate_tokens(str.splitlines(True), 0)
parser = rpypegparse.PythonParser(self.space, tokenlist, self.compile_info, verbose=False)
return parser.parse_meth_or_raise(rpypegparse.PythonParser.eval)
def deprecation_warn(self, msg, tok):
from pypy.interpreter import error
from pypy.module._warnings.interp_warnings import warn_explicit
space = self.space
try:
warn_explicit(
space, space.newtext(msg),
space.w_DeprecationWarning,
space.newtext(self.compile_info.filename),
tok.lineno,
space.w_None,
space.w_None,
space.w_None,
space.w_None,
)
except error.OperationError as e:
if e.match(space, space.w_DeprecationWarning):
self.raise_syntax_error_known_location(msg, tok)
else:
raise
def parse(self, entry):
res = entry()
if res is not None:
return res
self.reset()
self.call_invalid_rules = True
entry() # usually raises
def reset(self):
self._index = 0
self._highwatermark = 0
self._verbose = False
self._level = 0
self._cache = {}
for tok in self._tokens:
tok.memo = None
self.in_recursive_rule = 0
# tokenizer methods
def _mark(self):
return self._index
def getnext(self):
"""Return the next token and updates the index."""
cached = not self._index == len(self._tokens)
tok = self.peek()
self._index += 1
self._highwatermark = max(self._highwatermark, self._index)
if self._verbose:
self.report(cached, False)
return tok
def peek(self):
"""Return the next token *without* updating the index."""
assert self._index < len(self._tokens)
return self._tokens[self._index]
def diagnose(self):
return self._tokens[self._highwatermark]
def get_last_non_whitespace_token(self):
tok = self._tokens[0]
for index in range(self._index - 1, -1, -1):
tok = self._tokens[index]
if tok.token_type != tokens.ENDMARKER and (
tok.token_type < tokens.NEWLINE or tok.token_type > tokens.DEDENT
):
break
return tok
def get_lines(self, line_numbers):
"""Retrieve source lines corresponding to line numbers."""
if self._lines:
lines = self._lines
else:
# cannot happen, except for empty strings
return []
return [lines.get(n, "?\n") for n in line_numbers]
def _reset(self, index):
if index == self._index:
return
assert 0 <= index <= len(self._tokens), (index, len(self._tokens))
old_index = self._index
self._index = index
if self._verbose:
self.report(True, index < old_index)
def report(self, cached, back):
if back:
fill = "-" * self._index + "-"
elif cached:
fill = "-" * self._index + ">"
else:
fill = "-" * self._index + "*"
if self._index == 0:
print("%s (Bof)" % fill)
else:
tok = self._tokens[self._index - 1]
print "%s %s" % (fill, shorttok(tok))
# parser methods
def start(self):
pass
def showpeek(self):
tok = self.peek()
return shorttok(tok)
def name(self):
tok = self.peek()
if tok.token_type == tokens.NAME:
self.getnext()
return ast.Name(
id=self.new_identifier(tok.value),
ctx=Load,
lineno=tok.lineno,
col_offset=tok.column,
end_lineno=tok.end_lineno,
end_col_offset=tok.end_column,
)
return None
def number(self):
tok = self.peek()
if tok.token_type == tokens.NUMBER:
return self.getnext()
return None
def string(self):
tok = self.peek()
if tok.token_type == tokens.STRING:
return self.getnext()
return None
def op(self):
tok = self.peek()
if tok.token_type == tokens.OP:
return self.getnext()
return None
def type_comment(self):
tok = self.peek()
space = self.space
if tok.token_type == tokens.TYPE_COMMENT:
return space.newtext(self.getnext().value)
return space.w_None
def soft_keyword(self):
tok = self.peek()
if tok.token_type == tokens.NAME and tok.value in self.SOFT_KEYWORDS:
self.getnext()
return ast.Name(
id=self.new_identifier(tok.value),
ctx=Load,
lineno=tok.lineno,
col_offset=tok.column,
end_lineno=tok.end_lineno,
end_col_offset=tok.end_column,
)
return None
def expect(self, type):
tok = self.peek()
if tok.value == type:
return self.getnext()
if type in pytoken.python_opmap:
if tok.token_type == pytoken.python_opmap[type]:
return self.getnext()
if type in pytoken.python_tokens:
if tok.token_type == pytoken.python_tokens[type]:
return self.getnext()
if tok.token_type == tokens.OP and tok.value == type:
return self.getnext()
return None
def expect_type(self, type):
tok = self.peek()
if tok.token_type == type:
return self.getnext()
def expect_forced(self, res, expectation):
if res is None:
self.raise_syntax_error("expected " + expectation)
return res
def positive_lookahead(self, func, *args):
mark = self._mark()
ok = func(self, *args)
self._reset(mark)
return ok
@specialize.arg(1)
def negative_lookahead(self, func, *args):
mark = self._mark()
ok = func(self, *args)
self._reset(mark)
return not ok
@specialize.argtype(3)
def check_version(self, min_version, error_msg, node):
"""Check that the python version is high enough for a rule to apply.
"""
if (self.py_version[0] > min_version[0] or
(self.py_version[0] == min_version[0] and
self.py_version[1] >= min_version[1])):
return node
else:
self.raise_syntax_error_known_location(
"%s only supported in Python %s and above." % (error_msg, min_version),
node)
def raise_indentation_error(self, msg):
"""Raise an indentation error."""
self._raise_syntax_error(msg, cls=IndentationError)
def get_expr_name(self, node):
"""Get a descriptive name for an expression."""
return node._get_descr(self.space)
def raise_syntax_error_if_invalid_target(self, node, assignment_type):
what = self._get_invalid_target(node, assignment_type)
if what is None:
return None
elif assignment_type == "delete":
msg = "cannot delete " + self.get_expr_name(what)
else:
assert assignment_type in ("assign", "for")
msg = "cannot assign to " + self.get_expr_name(what)
self.raise_syntax_error_known_location(msg, what)
def _get_invalid_target(self, node, assignment_type):
def loop(self, lst, assignment_type):
for elt in lst:
elt = self._get_invalid_target(elt, assignment_type)
if elt is not None:
return elt
return None
if isinstance(node, ast.List):
if node.elts is None:
return None
return loop(self, node.elts, assignment_type)
elif isinstance(node, ast.Tuple):
if node.elts is None:
return None
return loop(self, node.elts, assignment_type)
elif isinstance(node, ast.Starred):
if assignment_type == "delete":
return node
return self._get_invalid_target(node.value, assignment_type)
elif isinstance(node, ast.Compare):
if assignment_type == "for":
if node.ops[0] == ast.In:
return self._get_invalid_target(node.left, "assign")
return None
return node
elif isinstance(node, ast.Name):
return None
elif isinstance(node, ast.Subscript):
return None
elif isinstance(node, ast.Attribute):
return None
else:
return node
def set_expr_context(self, node, context):
"""make a copy of node, changing context"""
return node.set_context_copy(context)
def extract_id(self, name):
if name is None:
return None
assert isinstance(name, ast.Name)
return name.id
def parse_number(self, tok):
from pypy.interpreter import error
if "_" in tok.value:
self.check_version((3, 6), "Underscores in numeric literals are", tok)
try:
return parse_number(self.space, tok.value)
except error.OperationError as e:
if not e.match(self.space, self.space.w_ValueError):
raise
# The only way a ValueError should happen in _this_ code is via
# int(raw) hitting a length limit
msg = self.space.text_w(e.get_w_value(self.space))
msg += (" - Consider hexadecimal for huge integer literals "
"to avoid decimal conversion limits.")
self.raise_syntax_error_known_location(msg, tok)
def get_last(self, l):
if not l:
return None
return l[-1]
def check_last_keyword_no_arg(self, args):
if not args.keywords:
return False
kw = args.keywords[-1]
assert isinstance(kw, ast.keyword)
return kw.arg is None
def new_identifier(self, name):
return misc.new_identifier(self.space, name)
def ensure_real(self, tok):
w_number = self.parse_number(tok)
if self.space.is_w(self.space.type(w_number), self.space.w_complex):
self.raise_syntax_error("real number required in complex literal")
return w_number
def ensure_imaginary(self, tok):
w_number = self.parse_number(tok)
if not self.space.is_w(self.space.type(w_number), self.space.w_complex):
self.raise_syntax_error("imaginary number required in complex literal")
return w_number
def generate_ast_for_string(self, tokens):
"""Generate AST nodes for strings."""
from pypy.interpreter.astcompiler.fstring import string_parse_literal
return string_parse_literal(self, tokens)
def extract_import_level(self, tokens):
"""Extract the relative import level from the tokens preceding the module name.
'.' count for one and '...' for 3.
"""
level = 0
for t in tokens:
if t.value == ".":
level += 1
else:
level += 3
return level
def set_decorators(self,
target,
decorators
):
"""Set the decorators on a function or class definition."""
# for rpython
if isinstance(target, ast.FunctionDef):
return ast.FunctionDef(
target.name,
target.args,
target.body,
decorators,
target.returns,
target.type_comment,
*target.location())
elif isinstance(target, ast.AsyncFunctionDef):
return ast.AsyncFunctionDef(
target.name,
target.args,
target.body,
decorators,
target.returns,
target.type_comment,
*target.location())
else:
assert isinstance(target, ast.ClassDef)
return ast.ClassDef(
target.name,
target.bases,
target.keywords,
target.body,
decorators,
*target.location())
return target
def get_comparison_ops(self, pairs):
return [p.cmpop for p in pairs]
def get_comparators(self, pairs):
return [p.expr for p in pairs]
def get_pattern_keys(self, pairs):
return [p.keyword for p in pairs]
def get_patterns(self, pairs):
return [p.pattern for p in pairs]
def get_pattern_names(self, pairs):
res = [None] * len(pairs)
for i, p in enumerate(pairs):
key = p.keyword
assert isinstance(key, ast.Name)
res[i] = key.id
return res
def set_arg_type_comment(self, arg, type_comment):
if type_comment is None:
return arg
return ast.arg(
arg.arg,
arg.annotation,
type_comment,
*arg.location())
def name_default_pair(self, arg, value, type_comment):
arg = self.set_arg_type_comment(arg, type_comment)
return NameDefaultPair(arg, value)
def make_star_etc(self, a, b, c):
return StarEtc(a, b, c)
def make_slash_with_default(self, plain_names, names_with_default):
return SlashWithDefault(plain_names, names_with_default)
def dict_display_entry(self, key, value):
return DictDisplaysEntry(key, value)
def cmpop_expr_pair(self, cmpop, expr):
return CmpopExprPair(cmpop, expr)
def key_pattern_pair(self, keyword, pattern):
return KeyPatternPair(keyword, pattern)
def dummy_name(self, *args):
return ast.Name(
id="dummy%s" % (len(args), ),
ctx=Load,
lineno=1,
col_offset=0,
end_lineno=1,
end_col_offset=0,
)
def get_names(self, names_with_defaults):
if names_with_defaults is None:
return []
return [p.arg for p in names_with_defaults]
def get_defaults(self, names_with_defaults):
if names_with_defaults is None:
return []
return [p.value for p in names_with_defaults]
def make_posonlyargs(self, slash_without_default, slash_with_default):
if slash_without_default is not None:
return slash_without_default
elif slash_with_default is not None:
names = self.get_names(slash_with_default.names_with_defaults)
return slash_with_default.plain_names + names
else:
return []
def make_posargs(self, plain_names, names_with_default):
if plain_names is None:
plain_names = []
names = self.get_names(names_with_default)
return plain_names + names
def make_arguments(self,
slash_without_default,
slash_with_default,
plain_names,
names_with_default,
star_etc,
):
"""Build a function definition arguments."""
if slash_without_default or slash_with_default:
if slash_without_default:
arg = slash_without_default[-1]
else:
assert slash_with_default
arg = slash_with_default.names_with_defaults[-1].arg
self.check_version(
(3, 8), "Positional only arguments are", arg)
posonlyargs = self.make_posonlyargs(
slash_without_default, slash_with_default)
posargs = self.make_posargs(plain_names, names_with_default)
posdefaults = (self.get_defaults(slash_with_default.names_with_defaults)
if slash_with_default else [])
posdefaults.extend(self.get_defaults(names_with_default))
vararg = star_etc.vararg if star_etc else None
kwonlyargs = self.get_names(star_etc.kwonlyargs) if star_etc else []
kwdefaults = self.get_defaults(star_etc.kwonlyargs) if star_etc else []
kwarg = star_etc.kwarg if star_etc else None
return ast.arguments(
posonlyargs=posonlyargs if posonlyargs else None,
args=posargs if posargs else None,
defaults=posdefaults if posdefaults else None,
vararg=vararg,
kwonlyargs=kwonlyargs if kwonlyargs else None,
kw_defaults=kwdefaults if kwdefaults else None,
kwarg=kwarg
)
def _raise_syntax_error(
self,
message,
start_lineno=-1,
start_col_offset=-1,
end_lineno=-1,
end_col_offset=-1,
cls=SyntaxError,
):
line_from_token = start_lineno == -1 and end_lineno == -1
tok = self.diagnose()
if start_lineno == -1:
start_lineno = tok.lineno
start_col_offset = tok.column
if end_lineno == -1:
if tok.end_lineno != -1:
end_lineno = tok.end_lineno
end_col_offset = tok.end_column
else:
end_lineno = start_lineno
end_col_offset = start_col_offset
if line_from_token:
line = tok.line
else:
# End is used only to get the proper text
line = "".join(
self.get_lines(range(start_lineno, end_lineno + 1))
)
raise cls(
message,
start_lineno, start_col_offset + 1, line, self.compile_info.filename,
end_lineno=end_lineno, end_offset=end_col_offset + 1
)
@specialize.argtype(1)
def extract_pos_start(self, node_or_tok):
if isinstance(node_or_tok, ast.AST):
return node_or_tok.lineno, node_or_tok.col_offset
else:
assert isinstance(node_or_tok, Token)
return node_or_tok.lineno, node_or_tok.column
@specialize.argtype(1)
def extract_pos_end(self, node_or_tok):
if isinstance(node_or_tok, ast.AST):
return node_or_tok.end_lineno, node_or_tok.end_col_offset
else:
assert isinstance(node_or_tok, Token)
return node_or_tok.end_lineno, node_or_tok.end_column
@specialize.argtype(2, 3)
def raise_syntax_error_known_range(
self,
message,
start_node_or_tok,
end_node_or_tok,
):
start_lineno, start_col_offset = self.extract_pos_start(start_node_or_tok)
end_lineno, end_col_offset = self.extract_pos_end(end_node_or_tok)
self._raise_syntax_error(message, start_lineno, start_col_offset, end_lineno, end_col_offset)
@specialize.argtype(2)
def raise_syntax_error_starting_from(
self,
message,
start_node_or_tok,
):
start_lineno, start_col_offset = self.extract_pos_start(start_node_or_tok)
self._raise_syntax_error(message, start_lineno, start_col_offset, -1, -1)
def raise_syntax_error(self, message):
self._raise_syntax_error(message)
@specialize.argtype(2)
def raise_syntax_error_known_location(
self,
message,
node_or_tok,
):
"""Raise a syntax error that occured at a given AST node or Token."""
start_lineno, start_col_offset = self.extract_pos_start(node_or_tok)
end_lineno, end_col_offset = self.extract_pos_end(node_or_tok)
self._raise_syntax_error(message, start_lineno, start_col_offset, end_lineno, end_col_offset)
def make_type_ignores(self):
type_ignores = []
for type_ignore in self.type_ignores:
tag = self.space.newtext(type_ignore.value)
type_ignores.append(ast.TypeIgnore(type_ignore.lineno, tag))
return type_ignores
def check_barry(self, tok):
flufl = self.compile_info.flags & consts.CO_FUTURE_BARRY_AS_BDFL
if flufl and tok.value == '!=':
self.raise_syntax_error_known_location("with Barry as BDFL, use '<>' instead of '!='", tok)
elif not flufl and tok.value == '<>':
self.raise_syntax_error_known_location('invalid syntax', tok)
return tok
def kwarg_illegal_assignment(self, a, b):
space = self.space
if isinstance(a, ast.Constant):
if space.is_w(a.value, space.w_True):
error = "True"
elif space.is_w(a.value, space.w_False):
error = "False"
elif space.is_w(a.value, space.w_None):
error = "None"
else:
error = None
if error is not None:
self.raise_syntax_error_known_range(
"cannot assign to " + error, a, b,
)
self.raise_syntax_error_known_range(
'expression cannot contain assignment, perhaps you meant "=="?', a, b,
)
def get_last_comprehension_item(self, comp):
assert isinstance(comp, ast.comprehension)
if comp.ifs:
return comp.ifs[-1]
else:
return comp.iter
def check_nonparen_genexp_in_call(self, msg, a, b):
assert isinstance(a, ast.Call)
if len(a.args) > 1:
self.raise_syntax_error_known_range(
msg,
a.args[-1],
self.get_last_comprehension_item(b[-1]))
return None
def check_legacy_stmt(self, a):
return isinstance(a, ast.Name) and a.id in ('exec', 'print')
def revdbmetavar(self, num, lineno, col_offset, end_lineno, end_col_offset):
if not self.space.config.translation.reverse_debugger:
self._raise_syntax_error("Unkown character", lineno, col_offset, end_lineno, end_col_offset)
return ast.RevDBMetaVar(num, lineno, col_offset, end_lineno, end_col_offset)
|