/usr/lib/python2.7/dist-packages/slimit/parser.py is in python-slimit 0.8.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 | ###############################################################################
#
# Copyright (c) 2011 Ruslan Spivak
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
#
###############################################################################
__author__ = 'Ruslan Spivak <ruslan.spivak@gmail.com>'
import ply.yacc
from slimit import ast
from slimit.lexer import Lexer
try:
from slimit import lextab, yacctab
except ImportError:
lextab, yacctab = 'lextab', 'yacctab'
class Parser(object):
"""JavaScript parser(ECMA-262 5th edition grammar).
The '*noin' variants are needed to avoid confusing the `in` operator in
a relational expression with the `in` operator in a `for` statement.
'*nobf' stands for 'no brace or function'
"""
def __init__(self, lex_optimize=True, lextab=lextab,
yacc_optimize=True, yacctab=yacctab, yacc_debug=False):
self.lex_optimize = lex_optimize
self.lextab = lextab
self.yacc_optimize = yacc_optimize
self.yacctab = yacctab
self.yacc_debug = yacc_debug
self.lexer = Lexer()
self.lexer.build(optimize=lex_optimize, lextab=lextab)
self.tokens = self.lexer.tokens
self.parser = ply.yacc.yacc(
module=self, optimize=yacc_optimize,
debug=yacc_debug, tabmodule=yacctab, start='program')
# https://github.com/rspivak/slimit/issues/29
# lexer.auto_semi can cause a loop in a parser
# when a parser error happens on a token right after
# a newline.
# We keep record of the tokens that caused p_error
# and if the token has already been seen - we raise
# a SyntaxError exception to avoid looping over and
# over again.
self._error_tokens = {}
def _has_been_seen_before(self, token):
if token is None:
return False
key = token.type, token.value, token.lineno, token.lexpos
return key in self._error_tokens
def _mark_as_seen(self, token):
if token is None:
return
key = token.type, token.value, token.lineno, token.lexpos
self._error_tokens[key] = True
def _raise_syntax_error(self, token):
raise SyntaxError(
'Unexpected token (%s, %r) at %s:%s between %s and %s' % (
token.type, token.value, token.lineno, token.lexpos,
self.lexer.prev_token, self.lexer.token())
)
def parse(self, text, debug=False):
return self.parser.parse(text, lexer=self.lexer, debug=debug)
def p_empty(self, p):
"""empty :"""
pass
def p_auto_semi(self, p):
"""auto_semi : error"""
pass
def p_error(self, token):
# https://github.com/rspivak/slimit/issues/29
if self._has_been_seen_before(token):
self._raise_syntax_error(token)
if token is None or token.type != 'SEMI':
next_token = self.lexer.auto_semi(token)
if next_token is not None:
# https://github.com/rspivak/slimit/issues/29
self._mark_as_seen(token)
self.parser.errok()
return next_token
self._raise_syntax_error(token)
# Comment rules
# def p_single_line_comment(self, p):
# """single_line_comment : LINE_COMMENT"""
# pass
# def p_multi_line_comment(self, p):
# """multi_line_comment : BLOCK_COMMENT"""
# pass
# Main rules
def p_program(self, p):
"""program : source_elements"""
p[0] = ast.Program(p[1])
def p_source_elements(self, p):
"""source_elements : empty
| source_element_list
"""
p[0] = p[1]
def p_source_element_list(self, p):
"""source_element_list : source_element
| source_element_list source_element
"""
if len(p) == 2: # single source element
p[0] = [p[1]]
else:
p[1].append(p[2])
p[0] = p[1]
def p_source_element(self, p):
"""source_element : statement
| function_declaration
"""
p[0] = p[1]
def p_statement(self, p):
"""statement : block
| variable_statement
| empty_statement
| expr_statement
| if_statement
| iteration_statement
| continue_statement
| break_statement
| return_statement
| with_statement
| switch_statement
| labelled_statement
| throw_statement
| try_statement
| debugger_statement
| function_declaration
"""
p[0] = p[1]
# By having source_elements in the production we support
# also function_declaration inside blocks
def p_block(self, p):
"""block : LBRACE source_elements RBRACE"""
p[0] = ast.Block(p[2])
def p_literal(self, p):
"""literal : null_literal
| boolean_literal
| numeric_literal
| string_literal
| regex_literal
"""
p[0] = p[1]
def p_boolean_literal(self, p):
"""boolean_literal : TRUE
| FALSE
"""
p[0] = ast.Boolean(p[1])
def p_null_literal(self, p):
"""null_literal : NULL"""
p[0] = ast.Null(p[1])
def p_numeric_literal(self, p):
"""numeric_literal : NUMBER"""
p[0] = ast.Number(p[1])
def p_string_literal(self, p):
"""string_literal : STRING"""
p[0] = ast.String(p[1])
def p_regex_literal(self, p):
"""regex_literal : REGEX"""
p[0] = ast.Regex(p[1])
def p_identifier(self, p):
"""identifier : ID"""
p[0] = ast.Identifier(p[1])
###########################################
# Expressions
###########################################
def p_primary_expr(self, p):
"""primary_expr : primary_expr_no_brace
| object_literal
"""
p[0] = p[1]
def p_primary_expr_no_brace_1(self, p):
"""primary_expr_no_brace : identifier"""
p[1]._mangle_candidate = True
p[1]._in_expression = True
p[0] = p[1]
def p_primary_expr_no_brace_2(self, p):
"""primary_expr_no_brace : THIS"""
p[0] = ast.This()
def p_primary_expr_no_brace_3(self, p):
"""primary_expr_no_brace : literal
| array_literal
"""
p[0] = p[1]
def p_primary_expr_no_brace_4(self, p):
"""primary_expr_no_brace : LPAREN expr RPAREN"""
p[2]._parens = True
p[0] = p[2]
def p_array_literal_1(self, p):
"""array_literal : LBRACKET elision_opt RBRACKET"""
p[0] = ast.Array(items=p[2])
def p_array_literal_2(self, p):
"""array_literal : LBRACKET element_list RBRACKET
| LBRACKET element_list COMMA elision_opt RBRACKET
"""
items = p[2]
if len(p) == 6:
items.extend(p[4])
p[0] = ast.Array(items=items)
def p_element_list(self, p):
"""element_list : elision_opt assignment_expr
| element_list COMMA elision_opt assignment_expr
"""
if len(p) == 3:
p[0] = p[1] + [p[2]]
else:
p[1].extend(p[3])
p[1].append(p[4])
p[0] = p[1]
def p_elision_opt_1(self, p):
"""elision_opt : empty"""
p[0] = []
def p_elision_opt_2(self, p):
"""elision_opt : elision"""
p[0] = p[1]
def p_elision(self, p):
"""elision : COMMA
| elision COMMA
"""
if len(p) == 2:
p[0] = [ast.Elision(p[1])]
else:
p[1].append(ast.Elision(p[2]))
p[0] = p[1]
def p_object_literal(self, p):
"""object_literal : LBRACE RBRACE
| LBRACE property_list RBRACE
| LBRACE property_list COMMA RBRACE
"""
if len(p) == 3:
p[0] = ast.Object()
else:
p[0] = ast.Object(properties=p[2])
def p_property_list(self, p):
"""property_list : property_assignment
| property_list COMMA property_assignment
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[3])
p[0] = p[1]
# XXX: GET / SET
def p_property_assignment(self, p):
"""property_assignment \
: property_name COLON assignment_expr
| GETPROP property_name LPAREN RPAREN LBRACE function_body RBRACE
| SETPROP property_name LPAREN formal_parameter_list RPAREN \
LBRACE function_body RBRACE
"""
if len(p) == 4:
p[0] = ast.Assign(left=p[1], op=p[2], right=p[3])
elif len(p) == 8:
p[0] = ast.GetPropAssign(prop_name=p[2], elements=p[6])
else:
p[0] = ast.SetPropAssign(
prop_name=p[2], parameters=p[4], elements=p[7])
def p_property_name(self, p):
"""property_name : identifier
| string_literal
| numeric_literal
"""
p[0] = p[1]
# 11.2 Left-Hand-Side Expressions
def p_member_expr(self, p):
"""member_expr : primary_expr
| function_expr
| member_expr LBRACKET expr RBRACKET
| member_expr PERIOD identifier
| NEW member_expr arguments
"""
if len(p) == 2:
p[0] = p[1]
elif p[1] == 'new':
p[0] = ast.NewExpr(p[2], p[3])
elif p[2] == '.':
p[0] = ast.DotAccessor(p[1], p[3])
else:
p[0] = ast.BracketAccessor(p[1], p[3])
def p_member_expr_nobf(self, p):
"""member_expr_nobf : primary_expr_no_brace
| function_expr
| member_expr_nobf LBRACKET expr RBRACKET
| member_expr_nobf PERIOD identifier
| NEW member_expr arguments
"""
if len(p) == 2:
p[0] = p[1]
elif p[1] == 'new':
p[0] = ast.NewExpr(p[2], p[3])
elif p[2] == '.':
p[0] = ast.DotAccessor(p[1], p[3])
else:
p[0] = ast.BracketAccessor(p[1], p[3])
def p_new_expr(self, p):
"""new_expr : member_expr
| NEW new_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.NewExpr(p[2])
def p_new_expr_nobf(self, p):
"""new_expr_nobf : member_expr_nobf
| NEW new_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.NewExpr(p[2])
def p_call_expr(self, p):
"""call_expr : member_expr arguments
| call_expr arguments
| call_expr LBRACKET expr RBRACKET
| call_expr PERIOD identifier
"""
if len(p) == 3:
p[0] = ast.FunctionCall(p[1], p[2])
elif len(p) == 4:
p[0] = ast.DotAccessor(p[1], p[3])
else:
p[0] = ast.BracketAccessor(p[1], p[3])
def p_call_expr_nobf(self, p):
"""call_expr_nobf : member_expr_nobf arguments
| call_expr_nobf arguments
| call_expr_nobf LBRACKET expr RBRACKET
| call_expr_nobf PERIOD identifier
"""
if len(p) == 3:
p[0] = ast.FunctionCall(p[1], p[2])
elif len(p) == 4:
p[0] = ast.DotAccessor(p[1], p[3])
else:
p[0] = ast.BracketAccessor(p[1], p[3])
def p_arguments(self, p):
"""arguments : LPAREN RPAREN
| LPAREN argument_list RPAREN
"""
if len(p) == 4:
p[0] = p[2]
def p_argument_list(self, p):
"""argument_list : assignment_expr
| argument_list COMMA assignment_expr
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[3])
p[0] = p[1]
def p_lef_hand_side_expr(self, p):
"""left_hand_side_expr : new_expr
| call_expr
"""
p[0] = p[1]
def p_lef_hand_side_expr_nobf(self, p):
"""left_hand_side_expr_nobf : new_expr_nobf
| call_expr_nobf
"""
p[0] = p[1]
# 11.3 Postfix Expressions
def p_postfix_expr(self, p):
"""postfix_expr : left_hand_side_expr
| left_hand_side_expr PLUSPLUS
| left_hand_side_expr MINUSMINUS
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.UnaryOp(op=p[2], value=p[1], postfix=True)
def p_postfix_expr_nobf(self, p):
"""postfix_expr_nobf : left_hand_side_expr_nobf
| left_hand_side_expr_nobf PLUSPLUS
| left_hand_side_expr_nobf MINUSMINUS
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.UnaryOp(op=p[2], value=p[1], postfix=True)
# 11.4 Unary Operators
def p_unary_expr(self, p):
"""unary_expr : postfix_expr
| unary_expr_common
"""
p[0] = p[1]
def p_unary_expr_nobf(self, p):
"""unary_expr_nobf : postfix_expr_nobf
| unary_expr_common
"""
p[0] = p[1]
def p_unary_expr_common(self, p):
"""unary_expr_common : DELETE unary_expr
| VOID unary_expr
| TYPEOF unary_expr
| PLUSPLUS unary_expr
| MINUSMINUS unary_expr
| PLUS unary_expr
| MINUS unary_expr
| BNOT unary_expr
| NOT unary_expr
"""
p[0] = ast.UnaryOp(p[1], p[2])
# 11.5 Multiplicative Operators
def p_multiplicative_expr(self, p):
"""multiplicative_expr : unary_expr
| multiplicative_expr MULT unary_expr
| multiplicative_expr DIV unary_expr
| multiplicative_expr MOD unary_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_multiplicative_expr_nobf(self, p):
"""multiplicative_expr_nobf : unary_expr_nobf
| multiplicative_expr_nobf MULT unary_expr
| multiplicative_expr_nobf DIV unary_expr
| multiplicative_expr_nobf MOD unary_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.6 Additive Operators
def p_additive_expr(self, p):
"""additive_expr : multiplicative_expr
| additive_expr PLUS multiplicative_expr
| additive_expr MINUS multiplicative_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_additive_expr_nobf(self, p):
"""additive_expr_nobf : multiplicative_expr_nobf
| additive_expr_nobf PLUS multiplicative_expr
| additive_expr_nobf MINUS multiplicative_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.7 Bitwise Shift Operators
def p_shift_expr(self, p):
"""shift_expr : additive_expr
| shift_expr LSHIFT additive_expr
| shift_expr RSHIFT additive_expr
| shift_expr URSHIFT additive_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_shift_expr_nobf(self, p):
"""shift_expr_nobf : additive_expr_nobf
| shift_expr_nobf LSHIFT additive_expr
| shift_expr_nobf RSHIFT additive_expr
| shift_expr_nobf URSHIFT additive_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.8 Relational Operators
def p_relational_expr(self, p):
"""relational_expr : shift_expr
| relational_expr LT shift_expr
| relational_expr GT shift_expr
| relational_expr LE shift_expr
| relational_expr GE shift_expr
| relational_expr INSTANCEOF shift_expr
| relational_expr IN shift_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_relational_expr_noin(self, p):
"""relational_expr_noin : shift_expr
| relational_expr_noin LT shift_expr
| relational_expr_noin GT shift_expr
| relational_expr_noin LE shift_expr
| relational_expr_noin GE shift_expr
| relational_expr_noin INSTANCEOF shift_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_relational_expr_nobf(self, p):
"""relational_expr_nobf : shift_expr_nobf
| relational_expr_nobf LT shift_expr
| relational_expr_nobf GT shift_expr
| relational_expr_nobf LE shift_expr
| relational_expr_nobf GE shift_expr
| relational_expr_nobf INSTANCEOF shift_expr
| relational_expr_nobf IN shift_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.9 Equality Operators
def p_equality_expr(self, p):
"""equality_expr : relational_expr
| equality_expr EQEQ relational_expr
| equality_expr NE relational_expr
| equality_expr STREQ relational_expr
| equality_expr STRNEQ relational_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_equality_expr_noin(self, p):
"""equality_expr_noin : relational_expr_noin
| equality_expr_noin EQEQ relational_expr
| equality_expr_noin NE relational_expr
| equality_expr_noin STREQ relational_expr
| equality_expr_noin STRNEQ relational_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_equality_expr_nobf(self, p):
"""equality_expr_nobf : relational_expr_nobf
| equality_expr_nobf EQEQ relational_expr
| equality_expr_nobf NE relational_expr
| equality_expr_nobf STREQ relational_expr
| equality_expr_nobf STRNEQ relational_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.10 Binary Bitwise Operators
def p_bitwise_and_expr(self, p):
"""bitwise_and_expr : equality_expr
| bitwise_and_expr BAND equality_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_and_expr_noin(self, p):
"""bitwise_and_expr_noin \
: equality_expr_noin
| bitwise_and_expr_noin BAND equality_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_and_expr_nobf(self, p):
"""bitwise_and_expr_nobf \
: equality_expr_nobf
| bitwise_and_expr_nobf BAND equality_expr_nobf
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_xor_expr(self, p):
"""bitwise_xor_expr : bitwise_and_expr
| bitwise_xor_expr BXOR bitwise_and_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_xor_expr_noin(self, p):
"""
bitwise_xor_expr_noin \
: bitwise_and_expr_noin
| bitwise_xor_expr_noin BXOR bitwise_and_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_xor_expr_nobf(self, p):
"""
bitwise_xor_expr_nobf \
: bitwise_and_expr_nobf
| bitwise_xor_expr_nobf BXOR bitwise_and_expr_nobf
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_or_expr(self, p):
"""bitwise_or_expr : bitwise_xor_expr
| bitwise_or_expr BOR bitwise_xor_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_or_expr_noin(self, p):
"""
bitwise_or_expr_noin \
: bitwise_xor_expr_noin
| bitwise_or_expr_noin BOR bitwise_xor_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_bitwise_or_expr_nobf(self, p):
"""
bitwise_or_expr_nobf \
: bitwise_xor_expr_nobf
| bitwise_or_expr_nobf BOR bitwise_xor_expr_nobf
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.11 Binary Logical Operators
def p_logical_and_expr(self, p):
"""logical_and_expr : bitwise_or_expr
| logical_and_expr AND bitwise_or_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_logical_and_expr_noin(self, p):
"""
logical_and_expr_noin : bitwise_or_expr_noin
| logical_and_expr_noin AND bitwise_or_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_logical_and_expr_nobf(self, p):
"""
logical_and_expr_nobf : bitwise_or_expr_nobf
| logical_and_expr_nobf AND bitwise_or_expr_nobf
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_logical_or_expr(self, p):
"""logical_or_expr : logical_and_expr
| logical_or_expr OR logical_and_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_logical_or_expr_noin(self, p):
"""logical_or_expr_noin : logical_and_expr_noin
| logical_or_expr_noin OR logical_and_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
def p_logical_or_expr_nobf(self, p):
"""logical_or_expr_nobf : logical_and_expr_nobf
| logical_or_expr_nobf OR logical_and_expr_nobf
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.BinOp(op=p[2], left=p[1], right=p[3])
# 11.12 Conditional Operator ( ? : )
def p_conditional_expr(self, p):
"""
conditional_expr \
: logical_or_expr
| logical_or_expr CONDOP assignment_expr COLON assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Conditional(
predicate=p[1], consequent=p[3], alternative=p[5])
def p_conditional_expr_noin(self, p):
"""
conditional_expr_noin \
: logical_or_expr_noin
| logical_or_expr_noin CONDOP assignment_expr_noin COLON \
assignment_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Conditional(
predicate=p[1], consequent=p[3], alternative=p[5])
def p_conditional_expr_nobf(self, p):
"""
conditional_expr_nobf \
: logical_or_expr_nobf
| logical_or_expr_nobf CONDOP assignment_expr COLON assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Conditional(
predicate=p[1], consequent=p[3], alternative=p[5])
# 11.13 Assignment Operators
def p_assignment_expr(self, p):
"""
assignment_expr \
: conditional_expr
| left_hand_side_expr assignment_operator assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Assign(left=p[1], op=p[2], right=p[3])
def p_assignment_expr_noin(self, p):
"""
assignment_expr_noin \
: conditional_expr_noin
| left_hand_side_expr assignment_operator assignment_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Assign(left=p[1], op=p[2], right=p[3])
def p_assignment_expr_nobf(self, p):
"""
assignment_expr_nobf \
: conditional_expr_nobf
| left_hand_side_expr_nobf assignment_operator assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Assign(left=p[1], op=p[2], right=p[3])
def p_assignment_operator(self, p):
"""assignment_operator : EQ
| MULTEQUAL
| DIVEQUAL
| MODEQUAL
| PLUSEQUAL
| MINUSEQUAL
| LSHIFTEQUAL
| RSHIFTEQUAL
| URSHIFTEQUAL
| ANDEQUAL
| XOREQUAL
| OREQUAL
"""
p[0] = p[1]
# 11.4 Comma Operator
def p_expr(self, p):
"""expr : assignment_expr
| expr COMMA assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Comma(left=p[1], right=p[3])
def p_expr_noin(self, p):
"""expr_noin : assignment_expr_noin
| expr_noin COMMA assignment_expr_noin
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Comma(left=p[1], right=p[3])
def p_expr_nobf(self, p):
"""expr_nobf : assignment_expr_nobf
| expr_nobf COMMA assignment_expr
"""
if len(p) == 2:
p[0] = p[1]
else:
p[0] = ast.Comma(left=p[1], right=p[3])
# 12.2 Variable Statement
def p_variable_statement(self, p):
"""variable_statement : VAR variable_declaration_list SEMI
| VAR variable_declaration_list auto_semi
"""
p[0] = ast.VarStatement(p[2])
def p_variable_declaration_list(self, p):
"""
variable_declaration_list \
: variable_declaration
| variable_declaration_list COMMA variable_declaration
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[3])
p[0] = p[1]
def p_variable_declaration_list_noin(self, p):
"""
variable_declaration_list_noin \
: variable_declaration_noin
| variable_declaration_list_noin COMMA variable_declaration_noin
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[3])
p[0] = p[1]
def p_variable_declaration(self, p):
"""variable_declaration : identifier
| identifier initializer
"""
if len(p) == 2:
p[0] = ast.VarDecl(p[1])
else:
p[0] = ast.VarDecl(p[1], p[2])
def p_variable_declaration_noin(self, p):
"""variable_declaration_noin : identifier
| identifier initializer_noin
"""
if len(p) == 2:
p[0] = ast.VarDecl(p[1])
else:
p[0] = ast.VarDecl(p[1], p[2])
def p_initializer(self, p):
"""initializer : EQ assignment_expr"""
p[0] = p[2]
def p_initializer_noin(self, p):
"""initializer_noin : EQ assignment_expr_noin"""
p[0] = p[2]
# 12.3 Empty Statement
def p_empty_statement(self, p):
"""empty_statement : SEMI"""
p[0] = ast.EmptyStatement(p[1])
# 12.4 Expression Statement
def p_expr_statement(self, p):
"""expr_statement : expr_nobf SEMI
| expr_nobf auto_semi
"""
p[0] = ast.ExprStatement(p[1])
# 12.5 The if Statement
def p_if_statement_1(self, p):
"""if_statement : IF LPAREN expr RPAREN statement"""
p[0] = ast.If(predicate=p[3], consequent=p[5])
def p_if_statement_2(self, p):
"""if_statement : IF LPAREN expr RPAREN statement ELSE statement"""
p[0] = ast.If(predicate=p[3], consequent=p[5], alternative=p[7])
# 12.6 Iteration Statements
def p_iteration_statement_1(self, p):
"""
iteration_statement \
: DO statement WHILE LPAREN expr RPAREN SEMI
| DO statement WHILE LPAREN expr RPAREN auto_semi
"""
p[0] = ast.DoWhile(predicate=p[5], statement=p[2])
def p_iteration_statement_2(self, p):
"""iteration_statement : WHILE LPAREN expr RPAREN statement"""
p[0] = ast.While(predicate=p[3], statement=p[5])
def p_iteration_statement_3(self, p):
"""
iteration_statement \
: FOR LPAREN expr_noin_opt SEMI expr_opt SEMI expr_opt RPAREN \
statement
| FOR LPAREN VAR variable_declaration_list_noin SEMI expr_opt SEMI\
expr_opt RPAREN statement
"""
if len(p) == 10:
p[0] = ast.For(init=p[3], cond=p[5], count=p[7], statement=p[9])
else:
init = ast.VarStatement(p[4])
p[0] = ast.For(init=init, cond=p[6], count=p[8], statement=p[10])
def p_iteration_statement_4(self, p):
"""
iteration_statement \
: FOR LPAREN left_hand_side_expr IN expr RPAREN statement
"""
p[0] = ast.ForIn(item=p[3], iterable=p[5], statement=p[7])
def p_iteration_statement_5(self, p):
"""
iteration_statement : \
FOR LPAREN VAR identifier IN expr RPAREN statement
"""
p[0] = ast.ForIn(item=ast.VarDecl(p[4]), iterable=p[6], statement=p[8])
def p_iteration_statement_6(self, p):
"""
iteration_statement \
: FOR LPAREN VAR identifier initializer_noin IN expr RPAREN statement
"""
p[0] = ast.ForIn(item=ast.VarDecl(identifier=p[4], initializer=p[5]),
iterable=p[7], statement=p[9])
def p_expr_opt(self, p):
"""expr_opt : empty
| expr
"""
p[0] = p[1]
def p_expr_noin_opt(self, p):
"""expr_noin_opt : empty
| expr_noin
"""
p[0] = p[1]
# 12.7 The continue Statement
def p_continue_statement_1(self, p):
"""continue_statement : CONTINUE SEMI
| CONTINUE auto_semi
"""
p[0] = ast.Continue()
def p_continue_statement_2(self, p):
"""continue_statement : CONTINUE identifier SEMI
| CONTINUE identifier auto_semi
"""
p[0] = ast.Continue(p[2])
# 12.8 The break Statement
def p_break_statement_1(self, p):
"""break_statement : BREAK SEMI
| BREAK auto_semi
"""
p[0] = ast.Break()
def p_break_statement_2(self, p):
"""break_statement : BREAK identifier SEMI
| BREAK identifier auto_semi
"""
p[0] = ast.Break(p[2])
# 12.9 The return Statement
def p_return_statement_1(self, p):
"""return_statement : RETURN SEMI
| RETURN auto_semi
"""
p[0] = ast.Return()
def p_return_statement_2(self, p):
"""return_statement : RETURN expr SEMI
| RETURN expr auto_semi
"""
p[0] = ast.Return(expr=p[2])
# 12.10 The with Statement
def p_with_statement(self, p):
"""with_statement : WITH LPAREN expr RPAREN statement"""
p[0] = ast.With(expr=p[3], statement=p[5])
# 12.11 The switch Statement
def p_switch_statement(self, p):
"""switch_statement : SWITCH LPAREN expr RPAREN case_block"""
cases = []
default = None
# iterate over return values from case_block
for item in p[5]:
if isinstance(item, ast.Default):
default = item
elif isinstance(item, list):
cases.extend(item)
p[0] = ast.Switch(expr=p[3], cases=cases, default=default)
def p_case_block(self, p):
"""
case_block \
: LBRACE case_clauses_opt RBRACE
| LBRACE case_clauses_opt default_clause case_clauses_opt RBRACE
"""
p[0] = p[2:-1]
def p_case_clauses_opt(self, p):
"""case_clauses_opt : empty
| case_clauses
"""
p[0] = p[1]
def p_case_clauses(self, p):
"""case_clauses : case_clause
| case_clauses case_clause
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[2])
p[0] = p[1]
def p_case_clause(self, p):
"""case_clause : CASE expr COLON source_elements"""
p[0] = ast.Case(expr=p[2], elements=p[4])
def p_default_clause(self, p):
"""default_clause : DEFAULT COLON source_elements"""
p[0] = ast.Default(elements=p[3])
# 12.12 Labelled Statements
def p_labelled_statement(self, p):
"""labelled_statement : identifier COLON statement"""
p[0] = ast.Label(identifier=p[1], statement=p[3])
# 12.13 The throw Statement
def p_throw_statement(self, p):
"""throw_statement : THROW expr SEMI
| THROW expr auto_semi
"""
p[0] = ast.Throw(expr=p[2])
# 12.14 The try Statement
def p_try_statement_1(self, p):
"""try_statement : TRY block catch"""
p[0] = ast.Try(statements=p[2], catch=p[3])
def p_try_statement_2(self, p):
"""try_statement : TRY block finally"""
p[0] = ast.Try(statements=p[2], fin=p[3])
def p_try_statement_3(self, p):
"""try_statement : TRY block catch finally"""
p[0] = ast.Try(statements=p[2], catch=p[3], fin=p[4])
def p_catch(self, p):
"""catch : CATCH LPAREN identifier RPAREN block"""
p[0] = ast.Catch(identifier=p[3], elements=p[5])
def p_finally(self, p):
"""finally : FINALLY block"""
p[0] = ast.Finally(elements=p[2])
# 12.15 The debugger statement
def p_debugger_statement(self, p):
"""debugger_statement : DEBUGGER SEMI
| DEBUGGER auto_semi
"""
p[0] = ast.Debugger(p[1])
# 13 Function Definition
def p_function_declaration(self, p):
"""
function_declaration \
: FUNCTION identifier LPAREN RPAREN LBRACE function_body RBRACE
| FUNCTION identifier LPAREN formal_parameter_list RPAREN LBRACE \
function_body RBRACE
"""
if len(p) == 8:
p[0] = ast.FuncDecl(
identifier=p[2], parameters=None, elements=p[6])
else:
p[0] = ast.FuncDecl(
identifier=p[2], parameters=p[4], elements=p[7])
def p_function_expr_1(self, p):
"""
function_expr \
: FUNCTION LPAREN RPAREN LBRACE function_body RBRACE
| FUNCTION LPAREN formal_parameter_list RPAREN \
LBRACE function_body RBRACE
"""
if len(p) == 7:
p[0] = ast.FuncExpr(
identifier=None, parameters=None, elements=p[5])
else:
p[0] = ast.FuncExpr(
identifier=None, parameters=p[3], elements=p[6])
def p_function_expr_2(self, p):
"""
function_expr \
: FUNCTION identifier LPAREN RPAREN LBRACE function_body RBRACE
| FUNCTION identifier LPAREN formal_parameter_list RPAREN \
LBRACE function_body RBRACE
"""
if len(p) == 8:
p[0] = ast.FuncExpr(
identifier=p[2], parameters=None, elements=p[6])
else:
p[0] = ast.FuncExpr(
identifier=p[2], parameters=p[4], elements=p[7])
def p_formal_parameter_list(self, p):
"""formal_parameter_list : identifier
| formal_parameter_list COMMA identifier
"""
if len(p) == 2:
p[0] = [p[1]]
else:
p[1].append(p[3])
p[0] = p[1]
def p_function_body(self, p):
"""function_body : source_elements"""
p[0] = p[1]
|