package melange
Toolchain to produce JS from Reason/OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
melange-4.0.1-52.tbz
sha256=91494286a42d2d7ef387dd062b6de26ccab223f308a74b0c60b8e43d7f6f7537
sha512=7517c7c651f118f7e2418f58fa97296890ed4623d6fdc801ff7b7abc3ae799142829c537c4dcbb1fec7c15d017cd3f85b527cad1af8b230b3da32474fdfc88df
doc/src/melange.js_parser/parser_env.ml.html
Source file parser_env.ml
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 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300
(* * Copyright (c) Meta Platforms, Inc. and affiliates. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. *) module Sedlexing = Flow_sedlexing open Flow_ast module SSet = Flow_set.Make (String) module Lex_mode = struct type t = | NORMAL | TYPE | JSX_TAG | JSX_CHILD | TEMPLATE | REGEXP let debug_string_of_lex_mode (mode : t) = match mode with | NORMAL -> "NORMAL" | TYPE -> "TYPE" | JSX_TAG -> "JSX_TAG" | JSX_CHILD -> "JSX_CHILD" | TEMPLATE -> "TEMPLATE" | REGEXP -> "REGEXP" end (* READ THIS BEFORE YOU MODIFY: * * The current implementation for lookahead beyond a single token is * inefficient. If you believe you need to increase this constant, do one of the * following: * - Find another way * - Benchmark your change and provide convincing evidence that it doesn't * actually have a significant perf impact. * - Refactor this to memoize all requested lookahead, so we aren't lexing the * same token multiple times. *) module Lookahead : sig type t val create : Lex_env.t -> Lex_mode.t -> t val peek_0 : t -> Lex_result.t val peek_1 : t -> Lex_result.t val lex_env_0 : t -> Lex_env.t val junk : t -> unit end = struct type la_result = (Lex_env.t * Lex_result.t) option type t = { mutable la_results_0: la_result; mutable la_results_1: la_result; la_lex_mode: Lex_mode.t; mutable la_lex_env: Lex_env.t; } let create lex_env mode = let lex_env = Lex_env.clone lex_env in { la_results_0 = None; la_results_1 = None; la_lex_mode = mode; la_lex_env = lex_env } (* precondition: there is enough room in t.la_results for the result *) let lex t = let lex_env = t.la_lex_env in let (lex_env, lex_result) = match t.la_lex_mode with | Lex_mode.NORMAL -> Flow_lexer.token lex_env | Lex_mode.TYPE -> Flow_lexer.type_token lex_env | Lex_mode.JSX_TAG -> Flow_lexer.jsx_tag lex_env | Lex_mode.JSX_CHILD -> Flow_lexer.jsx_child lex_env | Lex_mode.TEMPLATE -> Flow_lexer.template_tail lex_env | Lex_mode.REGEXP -> Flow_lexer.regexp lex_env in let cloned_env = Lex_env.clone lex_env in let result = (cloned_env, lex_result) in t.la_lex_env <- lex_env; begin match t.la_results_0 with | None -> t.la_results_0 <- Some result | Some _ -> t.la_results_1 <- Some result end; result let peek_0 t = match t.la_results_0 with | Some (_, result) -> result | None -> snd (lex t) let peek_1 t = (match t.la_results_0 with | None -> ignore (lex t) | Some _ -> ()); match t.la_results_1 with | None -> snd (lex t) | Some (_, result) -> result let lex_env_0 t = match t.la_results_0 with | Some (lex_env, _) -> lex_env | None -> fst (lex t) (* Throws away the first peeked-at token, shifting any subsequent tokens up *) let junk t = match t.la_results_1 with | None -> ignore (peek_0 t); t.la_results_0 <- None | Some _ -> t.la_results_0 <- t.la_results_1; t.la_results_1 <- None end type token_sink_result = { token_loc: Loc.t; token: Token.t; token_context: Lex_mode.t; } type parse_options = { components: bool; (* enable parsing of Flow component syntax *) enums: bool; (** enable parsing of Flow enums *) esproposal_decorators: bool; (** enable parsing of decorators *) types: bool; (** enable parsing of Flow types *) use_strict: bool; (** treat the file as strict, without needing a "use strict" directive *) module_ref_prefix: string option; module_ref_prefix_LEGACY_INTEROP: string option; } let default_parse_options = { components = false; enums = false; esproposal_decorators = false; types = true; use_strict = false; module_ref_prefix = None; module_ref_prefix_LEGACY_INTEROP = None; } type allowed_super = | No_super | Super_prop | Super_prop_or_call type env = { errors: (Loc.t * Parse_error.t) list ref; comments: Loc.t Comment.t list ref; labels: SSet.t; last_lex_result: Lex_result.t option ref; in_strict_mode: bool; in_export: bool; in_export_default: bool; in_loop: bool; in_switch: bool; in_formal_parameters: bool; in_function: bool; no_in: bool; no_call: bool; no_let: bool; no_anon_function_type: bool; no_conditional_type: bool; no_new: bool; allow_yield: bool; allow_await: bool; allow_directive: bool; has_simple_parameters: bool; allow_super: allowed_super; error_callback: (env -> Parse_error.t -> unit) option; lex_mode_stack: Lex_mode.t list ref; (* lex_env is the lex_env after the single lookahead has been lexed *) lex_env: Lex_env.t ref; (* This needs to be cleared whenever we advance. *) lookahead: Lookahead.t ref; token_sink: (token_sink_result -> unit) option ref; parse_options: parse_options; source: File_key.t option; (* It is a syntax error to reference private fields not in scope. In order to enforce this, * we keep track of the privates we've seen declared and used. *) privates: (SSet.t * (string * Loc.t) list) list ref; (* The position up to which comments have been consumed, exclusive. *) consumed_comments_pos: Loc.position ref; } (* constructor *) let init_env ?(token_sink = None) ?(parse_options = None) source content = (* let lb = Sedlexing.Utf16.from_string content (Some Sedlexing.Utf16.Little_endian) in *) let (lb, errors) = try (Sedlexing.Utf8.from_string content, []) with | Sedlexing.MalFormed -> (Sedlexing.Utf8.from_string "", [({ Loc.none with Loc.source }, Parse_error.MalformedUnicode)]) in let parse_options = match parse_options with | Some opts -> opts | None -> default_parse_options in let enable_types_in_comments = parse_options.types in let lex_env = Lex_env.new_lex_env source lb ~enable_types_in_comments in { errors = ref errors; comments = ref []; labels = SSet.empty; last_lex_result = ref None; has_simple_parameters = true; in_strict_mode = parse_options.use_strict; in_export = false; in_export_default = false; in_loop = false; in_switch = false; in_formal_parameters = false; in_function = false; no_in = false; no_call = false; no_let = false; no_anon_function_type = false; no_conditional_type = false; no_new = false; allow_yield = false; allow_await = false; allow_directive = false; allow_super = No_super; error_callback = None; lex_mode_stack = ref [Lex_mode.NORMAL]; lex_env = ref lex_env; lookahead = ref (Lookahead.create lex_env Lex_mode.NORMAL); token_sink = ref token_sink; parse_options; source; privates = ref []; consumed_comments_pos = ref { Loc.line = 0; column = 0 }; } (* getters: *) let in_strict_mode env = env.in_strict_mode let lex_mode env = List.hd !(env.lex_mode_stack) let in_export env = env.in_export let in_export_default env = env.in_export_default let comments env = !(env.comments) let labels env = env.labels let in_loop env = env.in_loop let in_switch env = env.in_switch let in_formal_parameters env = env.in_formal_parameters let in_function env = env.in_function let allow_yield env = env.allow_yield let allow_await env = env.allow_await let allow_directive env = env.allow_directive let allow_super env = env.allow_super let has_simple_parameters env = env.has_simple_parameters let no_in env = env.no_in let no_call env = env.no_call let no_let env = env.no_let let no_anon_function_type env = env.no_anon_function_type let no_conditional_type env = env.no_conditional_type let no_new env = env.no_new let errors env = !(env.errors) let parse_options env = env.parse_options let source env = env.source let should_parse_types env = env.parse_options.types (* mutators: *) let error_at env (loc, e) = env.errors := (loc, e) :: !(env.errors); match env.error_callback with | None -> () | Some callback -> callback env e (* Since private fields out of scope are a parse error, we keep track of the declared and used * private fields. * * Whenever we enter a class, we push new empty lists of declared and used privates. * When we encounter a new declared private, we add it to the top of the declared_privates list * via add_declared_private. We do the same with used_privates via add_used_private. * * When we exit a class, we look for all the unbound private variables. Since class fields * are hoisted to the scope of the class, we may need to look further before we conclude that * a field is out of scope. To do that, we add all of the unbound private fields to the * next used_private list. Once we run out of declared private lists, any leftover used_privates * are unbound private variables. *) let enter_class env = env.privates := (SSet.empty, []) :: !(env.privates) let exit_class env = let get_unbound_privates declared_privates used_privates = List.filter (fun x -> not (SSet.mem (fst x) declared_privates)) used_privates in match !(env.privates) with | [(declared_privates, used_privates)] -> let unbound_privates = get_unbound_privates declared_privates used_privates in List.iter (fun (name, loc) -> error_at env (loc, Parse_error.UnboundPrivate name)) unbound_privates; env.privates := [] | (loc_declared_privates, loc_used_privates) :: privates -> let unbound_privates = get_unbound_privates loc_declared_privates loc_used_privates in let (decl_head, used_head) = List.hd privates in env.privates := (decl_head, used_head @ unbound_privates) :: List.tl privates | _ -> failwith "Internal Error: `exit_class` called before a matching `enter_class`" let add_declared_private env name = match !(env.privates) with | [] -> failwith "Internal Error: Tried to add_declared_private with outside of class scope." | (declared, used) :: xs -> env.privates := (SSet.add name declared, used) :: xs let add_used_private env name loc = match !(env.privates) with | [] -> error_at env (loc, Parse_error.PrivateNotInClass) | (declared, used) :: xs -> env.privates := (declared, (name, loc) :: used) :: xs let consume_comments_until env pos = env.consumed_comments_pos := pos (* lookahead: *) let lookahead_0 env = Lookahead.peek_0 !(env.lookahead) let lookahead_1 env = Lookahead.peek_1 !(env.lookahead) let lookahead ~i env = match i with | 0 -> lookahead_0 env | 1 -> lookahead_1 env | _ -> assert false (* functional operations: *) let with_strict in_strict_mode env = if in_strict_mode = env.in_strict_mode then env else { env with in_strict_mode } let with_in_formal_parameters in_formal_parameters env = if in_formal_parameters = env.in_formal_parameters then env else { env with in_formal_parameters } let with_in_function in_function env = if in_function = env.in_function then env else { env with in_function } let with_allow_yield allow_yield env = if allow_yield = env.allow_yield then env else { env with allow_yield } let with_allow_await allow_await env = if allow_await = env.allow_await then env else { env with allow_await } let with_allow_directive allow_directive env = if allow_directive = env.allow_directive then env else { env with allow_directive } let with_allow_super allow_super env = if allow_super = env.allow_super then env else { env with allow_super } let with_no_let no_let env = if no_let = env.no_let then env else { env with no_let } let with_in_loop in_loop env = if in_loop = env.in_loop then env else { env with in_loop } let with_no_in no_in env = if no_in = env.no_in then env else { env with no_in } let with_no_anon_function_type no_anon_function_type env = if no_anon_function_type = env.no_anon_function_type then env else { env with no_anon_function_type } let with_no_conditional_type no_conditional_type env = if no_conditional_type = env.no_conditional_type then env else { env with no_conditional_type } let with_no_new no_new env = if no_new = env.no_new then env else { env with no_new } let with_in_switch in_switch env = if in_switch = env.in_switch then env else { env with in_switch } let with_in_export in_export env = if in_export = env.in_export then env else { env with in_export } let with_in_export_default in_export_default env = if in_export_default = env.in_export_default then env else { env with in_export_default } let with_no_call no_call env = if no_call = env.no_call then env else { env with no_call } let with_error_callback error_callback env = { env with error_callback = Some error_callback } (* other helper functions: *) let error_list env = List.iter (error_at env) let last_loc env = match !(env.last_lex_result) with | Some lex_result -> Some (Lex_result.loc lex_result) | None -> None let last_token env = match !(env.last_lex_result) with | Some lex_result -> Some (Lex_result.token lex_result) | None -> None let without_error_callback env = { env with error_callback = None } let add_label env label = { env with labels = SSet.add label env.labels } let enter_function env ~async ~generator ~simple_params = { env with in_formal_parameters = false; has_simple_parameters = simple_params; in_function = true; in_loop = false; in_switch = false; in_export = false; in_export_default = false; labels = SSet.empty; allow_await = async; allow_yield = generator; } (** IdentifierNames that can't be used as Identifiers in strict mode. https://tc39.es/ecma262/#sec-strict-mode-of-ecmascript *) let is_strict_reserved = function | "implements" | "interface" | "let" | "package" | "private" | "protected" | "public" | "static" | "yield" -> true | _ -> false (** Tokens which, if parsed as an identifier, are reserved words in strict mode. *) let token_is_strict_reserved = let open Token in function | T_IDENTIFIER { value; _ } -> is_strict_reserved value | T_INTERFACE | T_IMPLEMENTS | T_LET | T_PACKAGE | T_PRIVATE | T_PROTECTED | T_PUBLIC | T_STATIC | T_YIELD -> true | _ -> false (* #sec-strict-mode-of-ecmascript *) let is_restricted = function | "eval" | "arguments" -> true | _ -> false (** Words that are sometimes reserved, and sometimes allowed as identifiers (namely "await" and "yield") https://tc39.es/ecma262/#sec-keywords-and-reserved-words *) let is_contextually_reserved str_val = match str_val with | "await" | "yield" -> true | _ -> false (** Words that are sometimes reserved, and sometimes allowed as identifiers (namely "await" and "yield") https://tc39.es/ecma262/#sec-keywords-and-reserved-words *) let token_is_contextually_reserved t = let open Token in match t with | T_IDENTIFIER { raw; _ } -> is_contextually_reserved raw | T_AWAIT | T_YIELD -> true | _ -> false (** Words that are always reserved (mostly keywords) https://tc39.es/ecma262/#sec-keywords-and-reserved-words *) let is_reserved str_val = match str_val with | "break" | "case" | "catch" | "class" | "const" | "continue" | "debugger" | "default" | "delete" | "do" | "else" | "enum" | "export" | "extends" | "false" | "finally" | "for" | "function" | "if" | "import" | "in" | "instanceof" | "new" | "null" | "return" | "super" | "switch" | "this" | "throw" | "true" | "try" | "typeof" | "var" | "void" | "while" | "with" -> true | _ -> false (** Words that are always reserved (mostly keywords) https://tc39.es/ecma262/#sec-keywords-and-reserved-words *) let token_is_reserved t = let open Token in match t with | T_IDENTIFIER { raw; _ } -> is_reserved raw | T_BREAK | T_CASE | T_CATCH | T_CLASS | T_CONST | T_CONTINUE | T_DEBUGGER | T_DEFAULT | T_DELETE | T_DO | T_ELSE | T_ENUM | T_EXPORT | T_EXTENDS | T_FALSE | T_FINALLY | T_FOR | T_FUNCTION | T_IF | T_IMPORT | T_IN | T_INSTANCEOF | T_NEW | T_NULL | T_RETURN | T_SUPER | T_SWITCH | T_THIS | T_THROW | T_TRUE | T_TRY | T_TYPEOF | T_VAR | T_VOID | T_WHILE | T_WITH -> true | _ -> false let is_reserved_type str_val = match str_val with | "any" | "bigint" | "bool" | "boolean" | "empty" | "extends" | "false" | "function" | "interface" | "keyof" | "mixed" | "never" | "null" | "number" | "readonly" | "static" | "string" | "symbol" | "true" | "typeof" | "undefined" | "unknown" | "void" | "_" -> true | _ -> false let token_is_reserved_type t = let open Token in match t with | T_IDENTIFIER { raw; _ } when is_reserved_type raw -> true | T_ANY_TYPE | T_BIGINT_TYPE | T_BOOLEAN_TYPE _ | T_EMPTY_TYPE | T_EXTENDS | T_FALSE | T_FUNCTION | T_INTERFACE | T_KEYOF | T_MIXED_TYPE | T_NEVER_TYPE | T_NULL | T_NUMBER_TYPE | T_READONLY | T_STATIC | T_STRING_TYPE | T_SYMBOL_TYPE | T_TRUE | T_TYPEOF | T_UNDEFINED_TYPE | T_UNKNOWN_TYPE | T_VOID_TYPE -> true | _ -> false let token_is_type_identifier env t = let open Token in match lex_mode env with | Lex_mode.TYPE -> begin match t with | T_IDENTIFIER _ -> true | _ -> false end | Lex_mode.NORMAL -> begin (* Sometimes we peek at type identifiers while in normal lex mode. For example, when deciding whether a `type` token is an identifier or the start of a type declaration, based on whether the following token `is_type_identifier`. *) match t with | T_IDENTIFIER { raw; _ } when is_reserved_type raw -> false (* reserved type identifiers, but these don't appear in NORMAL mode *) | T_ANY_TYPE | T_MIXED_TYPE | T_EMPTY_TYPE | T_NUMBER_TYPE | T_BIGINT_TYPE | T_STRING_TYPE | T_VOID_TYPE | T_SYMBOL_TYPE | T_UNKNOWN_TYPE | T_NEVER_TYPE | T_UNDEFINED_TYPE | T_BOOLEAN_TYPE _ | T_NUMBER_SINGLETON_TYPE _ | T_BIGINT_SINGLETON_TYPE _ (* identifier-ish *) | T_ASYNC | T_AWAIT | T_BREAK | T_CASE | T_CATCH | T_CLASS | T_CONST | T_CONTINUE | T_DEBUGGER | T_DECLARE | T_DEFAULT | T_DELETE | T_DO | T_ELSE | T_ENUM | T_EXPORT | T_EXTENDS | T_FALSE | T_FINALLY | T_FOR | T_IDENTIFIER _ | T_IF | T_IMPLEMENTS | T_IMPORT | T_IN | T_INSTANCEOF | T_INTERFACE | T_LET | T_NEW | T_NULL | T_OF | T_OPAQUE | T_PACKAGE | T_PRIVATE | T_PROTECTED | T_PUBLIC | T_RETURN | T_SUPER | T_SWITCH | T_THIS | T_THROW | T_TRUE | T_TRY | T_TYPE | T_VAR | T_WHILE | T_WITH | T_YIELD -> true (* identifier-ish, but not valid types *) | T_STATIC | T_TYPEOF | T_FUNCTION | T_KEYOF | T_READONLY | T_INFER | T_IS | T_ASSERTS | T_VOID | T_RENDERS_QUESTION | T_RENDERS_STAR -> false (* syntax *) | T_LCURLY | T_RCURLY | T_LCURLYBAR | T_RCURLYBAR | T_LPAREN | T_RPAREN | T_LBRACKET | T_RBRACKET | T_SEMICOLON | T_COMMA | T_PERIOD | T_ARROW | T_ELLIPSIS | T_AT | T_POUND | T_CHECKS | T_RSHIFT3_ASSIGN | T_RSHIFT_ASSIGN | T_LSHIFT_ASSIGN | T_BIT_XOR_ASSIGN | T_BIT_OR_ASSIGN | T_BIT_AND_ASSIGN | T_MOD_ASSIGN | T_DIV_ASSIGN | T_MULT_ASSIGN | T_EXP_ASSIGN | T_MINUS_ASSIGN | T_PLUS_ASSIGN | T_NULLISH_ASSIGN | T_AND_ASSIGN | T_OR_ASSIGN | T_ASSIGN | T_PLING_PERIOD | T_PLING_PLING | T_PLING | T_COLON | T_OR | T_AND | T_BIT_OR | T_BIT_XOR | T_BIT_AND | T_EQUAL | T_NOT_EQUAL | T_STRICT_EQUAL | T_STRICT_NOT_EQUAL | T_LESS_THAN_EQUAL | T_GREATER_THAN_EQUAL | T_LESS_THAN | T_GREATER_THAN | T_LSHIFT | T_RSHIFT | T_RSHIFT3 | T_PLUS | T_MINUS | T_DIV | T_MULT | T_EXP | T_MOD | T_NOT | T_BIT_NOT | T_INCR | T_DECR | T_INTERPRETER _ | T_EOF -> false (* literals *) | T_NUMBER _ | T_BIGINT _ | T_STRING _ | T_TEMPLATE_PART _ | T_REGEXP _ (* misc that shouldn't appear in NORMAL mode *) | T_JSX_IDENTIFIER _ | T_JSX_CHILD_TEXT _ | T_JSX_QUOTE_TEXT _ | T_ERROR _ -> false end | Lex_mode.JSX_TAG | Lex_mode.JSX_CHILD | Lex_mode.TEMPLATE | Lex_mode.REGEXP -> false let token_is_variance token = let open Token in match token with | T_PLUS | T_MINUS -> true | _ -> false (* Answer questions about what comes next *) module Peek = struct open Loc open Token let ith_token ~i env = Lex_result.token (lookahead ~i env) let ith_loc ~i env = Lex_result.loc (lookahead ~i env) let ith_errors ~i env = Lex_result.errors (lookahead ~i env) let ith_comments ~i env = let comments = Lex_result.comments (lookahead ~i env) in match comments with | [] -> [] | _ -> List.filter (fun ({ Loc.start; _ }, _) -> Loc.pos_cmp !(env.consumed_comments_pos) start <= 0) comments let token env = ith_token ~i:0 env let loc env = ith_loc ~i:0 env (* loc_skip_lookahead is used to give a loc hint to optional tokens such as type annotations *) let loc_skip_lookahead env = let loc = match last_loc env with | Some loc -> loc | None -> failwith "Peeking current location when not available" in Loc.{ loc with start = loc._end } let errors env = ith_errors ~i:0 env let comments env = ith_comments ~i:0 env let has_eaten_comments env = let comments = Lex_result.comments (lookahead ~i:0 env) in List.exists (fun ({ Loc.start; _ }, _) -> Loc.pos_cmp start !(env.consumed_comments_pos) < 0) comments let lex_env env = Lookahead.lex_env_0 !(env.lookahead) (* True if there is a line terminator before the next token *) let ith_is_line_terminator ~i env = let loc = if i > 0 then Some (ith_loc ~i:(i - 1) env) else last_loc env in match loc with | None -> false | Some loc' -> (ith_loc ~i env).start.line > loc'.start.line let is_line_terminator env = ith_is_line_terminator ~i:0 env let ith_is_implicit_semicolon ~i env = match ith_token ~i env with | T_EOF | T_RCURLY -> true | T_SEMICOLON -> false | _ -> ith_is_line_terminator ~i env let is_implicit_semicolon env = ith_is_implicit_semicolon ~i:0 env let ith_is_identifier ~i env = match ith_token ~i env with | t when token_is_strict_reserved t -> true | T_TYPE | T_OPAQUE | T_OF | T_DECLARE | T_ASYNC | T_AWAIT | T_ENUM | T_POUND | T_IDENTIFIER _ | T_READONLY -> true | _ -> false let ith_is_type_identifier ~i env = token_is_type_identifier env (ith_token ~i env) let ith_is_identifier_name ~i env = ith_is_identifier ~i env || ith_is_type_identifier ~i env (* This returns true if the next token is identifier-ish (even if it is an error) *) let is_identifier env = ith_is_identifier ~i:0 env let is_identifier_name env = ith_is_identifier_name ~i:0 env let is_type_identifier env = ith_is_type_identifier ~i:0 env let is_function env = token env = T_FUNCTION || token env = T_ASYNC && ith_token ~i:1 env = T_FUNCTION && (loc env)._end.line = (ith_loc ~i:1 env).start.line let is_class env = match token env with | T_CLASS | T_AT -> true | T_IDENTIFIER { raw = "abstract"; _ } when ith_token ~i:1 env = T_CLASS -> true | _ -> false let is_component env = (parse_options env).components && match token env with | T_IDENTIFIER { raw = "component"; _ } when ith_is_identifier ~i:1 env -> true | _ -> false let is_renders_ident env = match token env with | T_IDENTIFIER { raw = "renders"; _ } -> true | _ -> false end (*****************************************************************************) (* Errors *) (*****************************************************************************) (* Complains about an error at the location of the lookahead *) let error env e = let loc = Peek.loc env in error_at env (loc, e) let get_unexpected_error ?expected token = let unexpected = Token.explanation_of_token token in match expected with | Some expected_msg -> Parse_error.UnexpectedWithExpected (unexpected, expected_msg) | None -> Parse_error.Unexpected unexpected let error_unexpected ?expected env = (* So normally we consume the lookahead lex result when Eat.token calls * Parser_env.advance, which will add any lexing errors to our list of errors. * However, raising an unexpected error for a lookahead is kind of like * consuming that token, so we should process any lexing errors before * complaining about the unexpected token *) error_list env (Peek.errors env); error env (get_unexpected_error ?expected (Peek.token env)) let error_on_decorators env = List.iter (fun decorator -> error_at env (fst decorator, Parse_error.UnsupportedDecorator)) let error_nameless_declaration env kind = let expected = if in_export env then Printf.sprintf "an identifier. When exporting a %s as a named export, you must specify a %s name. Did you mean `export default %s ...`?" kind kind kind else "an identifier" in error_unexpected ~expected env let strict_error env e = if in_strict_mode env then error env e let strict_error_at env (loc, e) = if in_strict_mode env then error_at env (loc, e) let function_as_statement_error_at env loc = error_at env (loc, Parse_error.FunctionAsStatement { in_strict_mode = in_strict_mode env }) (* Consume zero or more tokens *) module Eat = struct (* Consume a single token *) let token env = (* If there's a token_sink, emit the lexed token before moving forward *) (match !(env.token_sink) with | None -> () | Some token_sink -> token_sink { token_loc = Peek.loc env; token = Peek.token env; (* * The lex mode is useful because it gives context to some * context-sensitive tokens. * * Some examples of such tokens include: * * `=>` - Part of an arrow function? or part of a type annotation? * `<` - A less-than? Or an opening to a JSX element? * ...etc... *) token_context = lex_mode env; }); env.lex_env := Peek.lex_env env; error_list env (Peek.errors env); env.comments := List.rev_append (Lex_result.comments (lookahead ~i:0 env)) !(env.comments); env.last_lex_result := Some (lookahead ~i:0 env); Lookahead.junk !(env.lookahead) (** [maybe env t] eats the next token and returns [true] if it is [t], else return [false] *) let maybe env t = let is_t = Token.equal (Peek.token env) t in if is_t then token env; is_t let push_lex_mode env mode = env.lex_mode_stack := mode :: !(env.lex_mode_stack); env.lookahead := Lookahead.create !(env.lex_env) (lex_mode env) let pop_lex_mode env = let new_stack = match !(env.lex_mode_stack) with | _mode :: stack -> stack | _ -> failwith "Popping lex mode from empty stack" in env.lex_mode_stack := new_stack; env.lookahead := Lookahead.create !(env.lex_env) (lex_mode env) let double_pop_lex_mode env = let new_stack = match !(env.lex_mode_stack) with | _ :: _ :: stack -> stack | _ -> failwith "Popping lex mode from empty stack" in env.lex_mode_stack := new_stack; env.lookahead := Lookahead.create !(env.lex_env) (lex_mode env) let trailing_comments env = let open Loc in let loc = Peek.loc env in if Peek.token env = Token.T_COMMA && Peek.ith_is_line_terminator ~i:1 env then ( let trailing_before_comma = Peek.comments env in let trailing_after_comma = List.filter (fun (comment_loc, _) -> comment_loc.start.line <= loc._end.line) (Lex_result.comments (lookahead ~i:1 env)) in let trailing = trailing_before_comma @ trailing_after_comma in consume_comments_until env { Loc.line = loc._end.line + 1; column = 0 }; trailing ) else let trailing = Peek.comments env in consume_comments_until env loc._end; trailing let comments_until_next_line env = let open Loc in match !(env.last_lex_result) with | None -> [] | Some { Lex_result.lex_loc = last_loc; _ } -> let comments = Peek.comments env in let comments = List.filter (fun (loc, _) -> loc.start.line <= last_loc._end.line) comments in consume_comments_until env { line = last_loc._end.line + 1; column = 0 }; comments let program_comments env = let open Flow_ast.Comment in let comments = Peek.comments env in let flow_directive = "@flow" in let flow_directive_length = String.length flow_directive in let contains_flow_directive { text; _ } = let text_length = String.length text in let rec contains_flow_directive_after_offset off = if off + flow_directive_length > text_length then false else String.sub text off flow_directive_length = flow_directive || contains_flow_directive_after_offset (off + 1) in contains_flow_directive_after_offset 0 in (* Comments up through the last comment with an @flow directive are considered program comments *) let rec flow_directive_comments comments = match comments with | [] -> [] | (loc, comment) :: rest -> if contains_flow_directive comment then ( (env.consumed_comments_pos := Loc.(loc._end)); List.rev ((loc, comment) :: rest) ) else flow_directive_comments rest in let program_comments = flow_directive_comments (List.rev comments) in let program_comments = if program_comments <> [] then program_comments else (* If there is no @flow directive, consider the first block comment a program comment if it starts with "/**" *) match comments with | ((loc, { kind = Block; text; _ }) as first_comment) :: _ when String.length text >= 1 && text.[0] = '*' -> (env.consumed_comments_pos := Loc.(loc._end)); [first_comment] | _ -> [] in program_comments end module Expect = struct let get_error env t = let expected = Token.explanation_of_token ~use_article:true t in (Peek.loc env, get_unexpected_error ~expected (Peek.token env)) let error env t = let expected = Token.explanation_of_token ~use_article:true t in error_unexpected ~expected env let token env t = if not (Token.equal (Peek.token env) t) then error env t; Eat.token env (** [token_maybe env T_FOO] eats a token if it is [T_FOO], and errors without consuming if not. Returns whether it consumed a token, like [Eat.maybe]. *) let token_maybe env t = let ate = Eat.maybe env t in if not ate then error env t; ate (** [token_opt env T_FOO] eats a token if it is [T_FOO], and errors without consuming if not. This differs from [token], which always consumes. Only use [token_opt] when it's ok for the parser to not advance, like if you are guaranteed that something else has eaten a token. *) let token_opt env t = ignore (token_maybe env t) let identifier env name = let t = Peek.token env in begin match t with | Token.T_IDENTIFIER { raw; _ } when raw = name -> () | _ -> let expected = Printf.sprintf "the identifier `%s`" name in error_unexpected ~expected env end; Eat.token env end (* This module allows you to try parsing and rollback if you need. This is not * cheap and its usage is strongly discouraged *) module Try = struct type 'a parse_result = | ParsedSuccessfully of 'a | FailedToParse exception Rollback type saved_state = { saved_errors: (Loc.t * Parse_error.t) list; saved_comments: Loc.t Flow_ast.Comment.t list; saved_last_lex_result: Lex_result.t option; saved_lex_mode_stack: Lex_mode.t list; saved_lex_env: Lex_env.t; saved_consumed_comments_pos: Loc.position; token_buffer: ((token_sink_result -> unit) * token_sink_result Queue.t) option; } let save_state env = let token_buffer = match !(env.token_sink) with | None -> None | Some orig_token_sink -> let buffer = Queue.create () in env.token_sink := Some (fun token_data -> Queue.add token_data buffer); Some (orig_token_sink, buffer) in { saved_errors = !(env.errors); saved_comments = !(env.comments); saved_last_lex_result = !(env.last_lex_result); saved_lex_mode_stack = !(env.lex_mode_stack); saved_lex_env = !(env.lex_env); saved_consumed_comments_pos = !(env.consumed_comments_pos); token_buffer; } let reset_token_sink ~flush env token_buffer_info = match token_buffer_info with | None -> () | Some (orig_token_sink, token_buffer) -> env.token_sink := Some orig_token_sink; if flush then Queue.iter orig_token_sink token_buffer let rollback_state env saved_state = reset_token_sink ~flush:false env saved_state.token_buffer; env.errors := saved_state.saved_errors; env.comments := saved_state.saved_comments; env.last_lex_result := saved_state.saved_last_lex_result; env.lex_mode_stack := saved_state.saved_lex_mode_stack; env.lex_env := saved_state.saved_lex_env; env.consumed_comments_pos := saved_state.saved_consumed_comments_pos; env.lookahead := Lookahead.create !(env.lex_env) (lex_mode env); FailedToParse let success env saved_state result = reset_token_sink ~flush:true env saved_state.token_buffer; ParsedSuccessfully result let to_parse env parse = let saved_state = save_state env in try success env saved_state (parse env) with | Rollback -> rollback_state env saved_state let or_else env ~fallback parse = match to_parse env parse with | ParsedSuccessfully result -> result | FailedToParse -> fallback end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>