Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 8x 8x 2x 6x 2x 4x 2x 2x 2x 10x 10x 6x 10x 2x 82x 82x 72x 10x 1x 14x 11x 3x 4x 14x 11x 3x 2x 1x 4x 9913x 55x 56x 1x 1x 1x 1x 1x 1x 70x 190x 46x 241x 292x 309x 21x 74x 211x 300x 100x 513x 1481x 80x 560x 246x 90x 100x 3074x 5184x 2950x 2950x 2950x 2950x 20x 51x 220x 347x 381x 381x 136x 356x 174x 515x 112x 127x 118x 118x 118x 18571x 7686x 7686x 7686x 18571x 18571x 1x 1x 1x 1x 1x 3953x 1x 1x 1x 52x 2765x 1007x 2439x 941x 941x 2308x 941x 1x 1x 1x 1x 469x 469x 469x 469x 105x 105x 105x 105x 105x 364x 364x 364x 364x 364x 469x 409x 409x 296x 113x 115x 85x 85x 68x 6x 9x 1x 14x 29x 1x 1x 7x 60x 17x 1x 27499x 27499x 157x 162x 157x 27499x 27499x 27499x 189x 188x 188x 188x 27498x 20829x 20829x 73x 73x 68x 68x 20761x 10808x 10041x 7988x 7979x 16x 22155x 22155x 22155x 1065x 1065x 1065x 1065x 1065x 21090x 6669x 190x 190x 6669x 1263x 1239x 62x 62x 1177x 24x 182x 418x 418x 47x 47x 376x 182x 27849x 32622x 32622x 11081x 21541x 21090x 9953x 9953x 9951x 4635x 5316x 91x 91x 5225x 36x 36x 5189x 9951x 303x 810x 810x 283x 487x 283x 283x 20x 7988x 317x 106x 34x 211x 2050x 2035x 51x 30x 25x 10x 10x 10x 21x 14x 41x 19x 10x 9x 22x 14x 68x 49x 2x 47x 9x 1x 306x 161x 291x 200x 42x 5x 37x 19x 1x 18x 53x 12x 41x 20x 1x 19x 36x 2x 34x 203x 134x 2x 132x 5x 127x 127x 127x 4346x 16x 7682x 7682x 413x 185x 80x 333x 72x 72x 767x 767x 767x 767x 767x 767x 2580x 2580x 1855x 10x 10x 1845x 458x 14x 14x 458x 426x 14x 426x 725x 22x 22x 721x 91x 91x 91x 87x 86x 82x 36x 36x 36x 36x 15x 82x 2053x 2053x 2053x 2048x 2048x 2036x 4x 2032x 2048x 114x 70x 70x 44x 2048x 114x 20x 20x 16x 16x 12x 12x 4x 4x 94x 16x 16x 12x 12x 4x 120x 120x 120x 120x 120x 7x 2x 156x 118x 113x 5x 118x 118x 45x 45x 45x 45x 45x 118x 118x 36x 36x 36x 20x 36x 36x 1x 35x 35x 35x 117x 27x 27x 27x 1x 51x 26x 16x 10x 26x 26x 20x 20x 45x 20x 20x 26x 1921x 1906x 1906x 52x 52x 52x 1906x 1906x 41x 41x 41x 41x 1x 40x 1905x 72x 72x 1x 71x 1x 70x 70x 70x 246x 246x 1x 69x 69x 3x 2x 1x 66x 66x 66x 2x 64x 458x 458x 458x 20x 16x 10x 10x 15x 10x 15x 24x 24x 110x 47x 47x 47x 2x 45x 10x 5x 5x 5x 5x 24x 19x 16x 16x 3x 5x 78x 72x 6x 11x 184x 154x 89x 89x 44x 19x 25x 89x 89x 89x 89x 89x 89x 7x 12x 10x 33x 30x 52x 50x 50x 50x 50x 50x 50x 50x 49x 19x 16x 16x 6x 5x 30x 45x 14x 189x 189x 189x 189x 189x 189x 189x 189x 189x 189x 121x 120x 105x 188x 83x 995x 968x 83x 188x 118x 4x 4x 4x 3x 118x 118x 48x 118x 83x 118x 118x 212x 212x 212x 212x 212x 212x 212x 212x 212x 206x 10x 196x 196x 196x 1146x 1146x 45x 45x 45x 40x 40x 20x 20x 40x 20x 20x 40x 5x 1146x 205x 205x 71x 205x 205x 191x 149x 42x 42x 20x 20x 42x 191x 191x 955x 955x 5x 24113x 24113x 24113x 220x 220x 23893x 23893x 23893x 23801x 93x 93x 93x 17132x 3298x 3298x 13834x 6872x 143x 32691x 29594x 10808x 14679x 882x 169x 65x 20761x 9932x 10829x 21x 10808x 25038x 14895x 10143x 190x 9953x 9951x 1126x 1465x 409x 251x 158x 52x 106x 1336x 407x 319x 4889x 5197x 1057x 898x 4140x 4011x 663x 100x 86x 84x 49x 14x 9176x 6210x 186x 6024x 7701x 7701x 476x 116x 116x 7585x 5340x 4133x 4133x 4133x 3567x 3567x 3567x 991x 991x 942x 917x 917x 3806x 2439x 3806x 2829x 1x 14516x 14550x 8876x 14550x 1x 7686x 4223x 4223x 7686x 7658x 1x 7686x 4223x 4223x 7686x 7658x 14601x 6735x 1388x 1388x 1x 62x 62x 70x 55x 7x 1x 1852x 1852x 1x 1672x 28x 28x 21x 6x 1666x 1x 46x 46x 82x 82x 82x 5x 41x 1x 71x 71x 1x 70x 70x 37x 37x 35x 20x 35x 2x 70x 70x 1x 119x 1x 2169x 1x 1979x 1979x 1979x 5x 5x 2442x 2442x 1x 144x 1x 3240x 3240x 361x 1x 2887x 2887x 2887x 479x 339x 2887x 1x 1x 3830x 3535x 3521x 3521x 3521x 3521x 3521x 3521x 3088x 3082x 3082x 3074x 3074x 5050x 5050x 4986x 390x 376x 4596x 4126x 4126x 4566x 4986x 4986x 240x 4913x 1873x 42x 42x 4871x 4867x 2479x 616x 326x 246x 154x 154x 147x 240x 221x 116x 206x 310x 41x 2391x 6x 2385x 2385x 73x 73x 72x 60x 60x 72x 71x 70x 206x 206x 16x 190x 190x 47x 47x 47x 47x 46x 46x 310x 310x 310x 310x 305x 305x 305x 300x 240x 240x 240x 240x 128x 128x 37x 37x 240x 240x 121x 240x 236x 111x 111x 125x 226x 96x 96x 226x 226x 226x 219x 219x 219x 4x 215x 211x 116x 116x 116x 116x 107x 103x 102x 100x 100x 100x 246x 246x 246x 176x 174x 105x 105x 33x 31x 30x 171x 241x 326x 326x 326x 326x 178x 178x 32x 32x 326x 326x 326x 152x 152x 326x 171x 326x 323x 166x 166x 157x 314x 166x 166x 314x 314x 314x 309x 309x 309x 309x 308x 308x 24x 24x 22x 21x 21x 21x 21x 21x 21x 21x 305x 76x 34x 34x 76x 76x 76x 74x 74x 74x 303x 8x 8x 3x 300x 292x 221x 221x 215x 177x 177x 215x 101x 99x 97x 96x 95x 94x 94x 92x 92x 90x 90x 114x 114x 42x 41x 41x 113x 109x 109x 120x 117x 106x 105x 105x 103x 103x 100x 100x 616x 616x 616x 518x 518x 518x 589x 587x 587x 516x 211x 247x 244x 513x 412x 465x 513x 98x 92x 89x 89x 75x 75x 89x 6x 2385x 2385x 2385x 2385x 2416x 2416x 2265x 2265x 2194x 2194x 151x 100x 100x 98x 98x 51x 2292x 3255x 278x 278x 703x 703x 2274x 981x 2274x 2274x 2242x 32x 1x 31x 2242x 560x 560x 1682x 8x 1674x 1674x 80x 80x 1594x 1630x 1630x 1650x 1561x 1561x 1561x 5280x 5280x 5280x 5255x 5184x 309x 309x 309x 309x 295x 155x 273x 202x 202x 202x 202x 71x 55x 55x 16x 139x 127x 267x 248x 248x 246x 246x 246x 154x 154x 151x 128x 128x 151x 34x 34x 32x 149x 19x 19x 17x 17x 147x 368x 368x 559x 559x 25x 23x 22x 21x 20x 534x 143x 55x 55x 55x 51x 88x 88x 391x 258x 258x 132x 291x 191x 191x 100x 358x 347x 4658x 4592x 3568x 3506x 3463x 2847x 2847x 2847x 1923x 35x 11x 68x 120x 2x 37x 18x 36x 924x 522x 5x 28x 30x 22x 6x 44x 35x 402x 15x 387x 2338x 5197x 5197x 5197x 143x 143x 143x 143x 136x 5190x 5054x 5017x 1954x 5144x 4478x 4859x 4859x 4859x 396x 396x 396x 394x 381x 381x 4463x 2400x 1902x 175x 175x 175x 174x 174x 174x 174x 174x 171x 137x 137x 137x 136x 136x 136x 538x 538x 498x 97x 97x 1279x 1954x 1954x 1176x 1176x 1176x 778x 112x 110x 666x 1283x 1419x 1415x 1279x 136x 1279x 771x 642x 529x 237x 5x 524x 523x 523x 522x 246x 246x 42x 40x 520x 515x 112x 112x 112x 112x 129x 127x 3x 5236x 5236x 5236x 5236x 5236x 2x 5234x 2951x 2951x 2951x 2951x 2950x 2283x 73x 73x 73x 73x 2210x 256x 256x 1x 1x 1x 1x 3546x 1x 1x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 3546x 2x 3544x 3544x 52x 3544x 1x 3543x 3543x 3543x 1x 1x 1x 1x 1x 1x 3543x 3543x 3543x 2480x 1x 1063x 173x 173x 168x 168x 168x 168x 168x 173x 173x 138x 138x 168x 133x 890x 890x 1058x 3538x 3538x 3538x 3535x 3074x 3074x 3074x 3074x 3074x 1x | /* global exports:true, module:true, require:true, define:true, global:true */
(function (root, name, factory) {
'use strict';
// Used to determine if values are of the language type `Object`
var objectTypes = {
'function': true
, 'object': true
}
// Detect free variable `exports`
, freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports
// Detect free variable `module`
, freeModule = objectTypes[typeof module] && module && !module.nodeType && module
// Detect free variable `global`, from Node.js or Browserified code, and
// use it as `window`
, freeGlobal = freeExports && freeModule && typeof global === 'object' && global
// Detect the popular CommonJS extension `module.exports`
, moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
/* istanbul ignore else */
if (freeGlobal && (freeGlobal.global === freeGlobal ||
/* istanbul ignore next */ freeGlobal.window === freeGlobal ||
/* istanbul ignore next */ freeGlobal.self === freeGlobal)) {
root = freeGlobal;
}
// Some AMD build optimizers, like r.js, check for specific condition
// patterns like the following:
/* istanbul ignore if */
if (typeof define === 'function' &&
/* istanbul ignore next */ typeof define.amd === 'object' &&
/* istanbul ignore next */ define.amd) {
// defined as an anonymous module.
define(['exports'], factory);
// In case the source has been processed and wrapped in a define module use
// the supplied `exports` object.
if (freeExports && moduleExports) factory(freeModule.exports);
}
// check for `exports` after `define` in case a build optimizer adds an
// `exports` object
else /* istanbul ignore else */ if (freeExports && freeModule) {
// in Node.js or RingoJS v0.8.0+
/* istanbul ignore else */
if (moduleExports) factory(freeModule.exports);
// in RingoJS v0.7.0-
else factory(freeExports);
}
// in a browser or Rhino
else {
factory((root[name] = {}));
}
}(this, 'pico8parse', function (exports) {
'use strict';
exports.version = "0.4.1";
var input, options, length, features, encodingMode;
// Options can be set either globally on the parser object through
// defaultOptions, or during the parse call.
var defaultOptions = exports.defaultOptions = {
// Explicitly tell the parser when the input ends.
wait: false
// Store comments as an array in the chunk object.
, comments: true
// Track identifier scopes by adding an isLocal attribute to each
// identifier-node.
, scope: false
// Store location information on each syntax node as
// `loc: { start: { line, column }, end: { line, column } }`.
, locations: false
// Store the start and end character locations on each syntax node as
// `range: [start, end]`.
, ranges: false
// A callback which will be invoked when a syntax node has been completed.
// The node which has been created will be passed as the only parameter.
, onCreateNode: null
// A callback which will be invoked when a new scope is created.
, onCreateScope: null
// A callback which will be invoked when the current scope is destroyed.
, onDestroyScope: null
// A callback which will be invoked when a local variable is declared in the current scope.
// The variable's name will be passed as the only parameter
, onLocalDeclaration: null
// The version of Lua targeted by the parser (string; allowed values are
// '5.1', '5.2', '5.3', 'LuaJIT', 'PICO-8', 'PICO-8-0.2.1'..'PICO-8-0.2.5').
, luaVersion: '5.1'
// Encoding mode: how to interpret code units higher than U+007F in input.
, encodingMode: 'none'
// This option overrides the `strictP8FileFormat` feature, making it possible to parse
// snippets lacking the proper header and sections.
, ignoreStrictP8FileFormat: false
// Ignore "P8SCII" string escape sequences.
, ignoreP8scii: false
};
function encodeUTF8(codepoint, highMask) {
highMask = highMask || 0;
if (codepoint < 0x80) {
return String.fromCharCode(codepoint);
} else if (codepoint < 0x800) {
return String.fromCharCode(
highMask | 0xc0 | (codepoint >> 6) ,
highMask | 0x80 | ( codepoint & 0x3f)
);
} else if (codepoint < 0x10000) {
return String.fromCharCode(
highMask | 0xe0 | (codepoint >> 12) ,
highMask | 0x80 | ((codepoint >> 6) & 0x3f),
highMask | 0x80 | ( codepoint & 0x3f)
);
} else /* istanbul ignore else */ if (codepoint < 0x110000) {
return String.fromCharCode(
highMask | 0xf0 | (codepoint >> 18) ,
highMask | 0x80 | ((codepoint >> 12) & 0x3f),
highMask | 0x80 | ((codepoint >> 6) & 0x3f),
highMask | 0x80 | ( codepoint & 0x3f)
);
} else {
// TODO: Lua 5.4 allows up to six-byte sequences, as in UTF-8:1993
return null;
}
}
function toHex(num, digits) {
var result = num.toString(16);
while (result.length < digits)
result = '0' + result;
return result;
}
function checkChars(rx) {
return function (s) {
var m = rx.exec(s);
if (!m)
return s;
raise(null, errors.invalidCodeUnit, toHex(m[0].charCodeAt(0), 4).toUpperCase());
};
}
var encodingModes = {
// `pseudo-latin1` encoding mode: assume the input was decoded with the latin1 encoding
// WARNING: latin1 does **NOT** mean cp1252 here like in the bone-headed WHATWG standard;
// it means true ISO/IEC 8859-1 identity-mapped to Basic Latin and Latin-1 Supplement blocks
'pseudo-latin1': {
fixup: checkChars(/[^\x00-\xff]/),
encodeByte: function (value) {
if (value === null)
return '';
return String.fromCharCode(value);
},
encodeUTF8: function (codepoint) {
return encodeUTF8(codepoint);
},
},
// `x-user-defined` encoding mode: assume the input was decoded with the WHATWG `x-user-defined` encoding
'x-user-defined': {
fixup: checkChars(/[^\x00-\x7f\uf780-\uf7ff]/),
encodeByte: function (value) {
if (value === null)
return '';
if (value >= 0x80)
return String.fromCharCode(value | 0xf700);
return String.fromCharCode(value);
},
encodeUTF8: function (codepoint) {
return encodeUTF8(codepoint, 0xf700);
}
},
// `none` encoding mode: disregard interpretation of string literals, leave identifiers as-is
'none': {
discardStrings: true,
fixup: function (s) {
return s;
},
encodeByte: function (value) {
return '';
},
encodeUTF8: function (codepoint) {
return '';
}
}
};
// The available tokens expressed as enum flags so they can be checked with
// bitwise operations.
var EOF = 1, StringLiteral = 2, Keyword = 4, Identifier = 8
, NumericLiteral = 16, Punctuator = 32, BooleanLiteral = 64
, NilLiteral = 128, VarargLiteral = 256;
exports.tokenTypes = { EOF: EOF, StringLiteral: StringLiteral
, Keyword: Keyword, Identifier: Identifier, NumericLiteral: NumericLiteral
, Punctuator: Punctuator, BooleanLiteral: BooleanLiteral
, NilLiteral: NilLiteral, VarargLiteral: VarargLiteral
};
// As this parser is a bit different from luas own, the error messages
// will be different in some situations.
var errors = exports.errors = {
unexpected: 'unexpected %1 \'%2\' near \'%3\''
, unexpectedEOF: 'unexpected symbol near \'<eof>\''
, expected: '\'%1\' expected near \'%2\''
, expectedToken: '%1 expected near \'%2\''
, unfinishedString: 'unfinished string near \'%1\''
, malformedNumber: 'malformed number near \'%1\''
, decimalEscapeTooLarge: 'decimal escape too large near \'%1\''
, invalidEscape: 'invalid escape sequence near \'%1\''
, hexadecimalDigitExpected: 'hexadecimal digit expected near \'%1\''
, braceExpected: 'missing \'%1\' near \'%2\''
, tooLargeCodepoint: 'UTF-8 value too large near \'%1\''
, unfinishedLongString: 'unfinished long string (starting at line %1) near \'%2\''
, unfinishedLongComment: 'unfinished long comment (starting at line %1) near \'%2\''
, ambiguousSyntax: 'ambiguous syntax (function call x new statement) near \'%1\''
, noLoopToBreak: 'no loop to break near \'%1\''
, labelAlreadyDefined: 'label \'%1\' already defined on line %2'
, labelNotVisible: 'no visible label \'%1\' for <goto>'
, gotoJumpInLocalScope: '<goto %1> jumps into the scope of local \'%2\''
, cannotUseVararg: 'cannot use \'...\' outside a vararg function near \'%1\''
, invalidCodeUnit: 'code unit U+%1 is not allowed in the current encoding mode'
, missingHeader: 'missing header \'%1\''
};
// ### Abstract Syntax Tree
//
// The default AST structure is inspired by the Mozilla Parser API but can
// easily be customized by overriding these functions.
var ast = exports.ast = {
labelStatement: function(label) {
return {
type: 'LabelStatement'
, label: label
};
}
, breakStatement: function() {
return {
type: 'BreakStatement'
};
}
, gotoStatement: function(label) {
return {
type: 'GotoStatement'
, label: label
};
}
, returnStatement: function(args) {
return {
type: 'ReturnStatement'
, 'arguments': args
};
}
, ifStatement: function(clauses) {
return {
type: 'IfStatement'
, clauses: clauses
};
}
, ifClause: function(condition, body) {
return {
type: 'IfClause'
, condition: condition
, body: body
};
}
, elseifClause: function(condition, body) {
return {
type: 'ElseifClause'
, condition: condition
, body: body
};
}
, elseClause: function(body) {
return {
type: 'ElseClause'
, body: body
};
}
, whileStatement: function(condition, body) {
return {
type: 'WhileStatement'
, condition: condition
, body: body
};
}
, doStatement: function(body) {
return {
type: 'DoStatement'
, body: body
};
}
, repeatStatement: function(condition, body) {
return {
type: 'RepeatStatement'
, condition: condition
, body: body
};
}
, localStatement: function(variables, init) {
return {
type: 'LocalStatement'
, variables: variables
, init: init
};
}
, assignmentStatement: function(variables, init) {
return {
type: 'AssignmentStatement'
, variables: variables
, init: init
};
}
, assignmentOperatorStatement: function(operator, variables, init) {
return {
type: 'AssignmentOperatorStatement'
, operator: operator
, variables: variables
, init: init
};
}
, callStatement: function(expression) {
return {
type: 'CallStatement'
, expression: expression
};
}
, functionStatement: function(identifier, parameters, isLocal, body) {
return {
type: 'FunctionDeclaration'
, identifier: identifier
, isLocal: isLocal
, parameters: parameters
, body: body
};
}
, forNumericStatement: function(variable, start, end, step, body) {
return {
type: 'ForNumericStatement'
, variable: variable
, start: start
, end: end
, step: step
, body: body
};
}
, forGenericStatement: function(variables, iterators, body) {
return {
type: 'ForGenericStatement'
, variables: variables
, iterators: iterators
, body: body
};
}
, chunk: function(body) {
return {
type: 'Chunk'
, body: body
};
}
, identifier: function(name) {
return {
type: 'Identifier'
, name: name
};
}
// `rawInterrupted`: when a longstring was interrupted by other section(s),
// contains the actual content seen as raw in PICO-8 Lua.
, literal: function(type, value, raw, rawInterrupted) {
type = (type === StringLiteral) ? 'StringLiteral'
: (type === NumericLiteral) ? 'NumericLiteral'
: (type === BooleanLiteral) ? 'BooleanLiteral'
: (type === NilLiteral) ? 'NilLiteral'
: 'VarargLiteral';
var r = {
type: type
, value: value
, raw: raw
};
if (rawInterrupted) r.rawInterrupted = rawInterrupted;
return r;
}
, tableKey: function(key, value) {
return {
type: 'TableKey'
, key: key
, value: value
};
}
, tableKeyString: function(key, value) {
return {
type: 'TableKeyString'
, key: key
, value: value
};
}
, tableValue: function(value) {
return {
type: 'TableValue'
, value: value
};
}
, tableConstructorExpression: function(fields) {
return {
type: 'TableConstructorExpression'
, fields: fields
};
}
, binaryExpression: function(operator, left, right) {
var type = ('and' === operator || 'or' === operator) ?
'LogicalExpression' :
'BinaryExpression';
return {
type: type
, operator: operator
, left: left
, right: right
};
}
, unaryExpression: function(operator, argument) {
return {
type: 'UnaryExpression'
, operator: operator
, argument: argument
};
}
, memberExpression: function(base, indexer, identifier) {
return {
type: 'MemberExpression'
, indexer: indexer
, identifier: identifier
, base: base
};
}
, indexExpression: function(base, index) {
return {
type: 'IndexExpression'
, base: base
, index: index
};
}
, callExpression: function(base, args) {
return {
type: 'CallExpression'
, base: base
, 'arguments': args
};
}
, tableCallExpression: function(base, argument) {
return {
type: 'TableCallExpression'
, base: base
, argument: argument
};
}
, stringCallExpression: function(base, argument) {
return {
type: 'StringCallExpression'
, base: base
, argument: argument
};
}
// `rawInterrupted`: when a longstring was interrupted by other section(s),
// contains the actual content seen as raw in PICO-8 Lua.
, comment: function(value, raw, rawInterrupted) {
var r = {
type: 'Comment'
, value: value
, raw: raw
};
if (rawInterrupted) r.rawInterrupted = rawInterrupted;
return r;
}
};
// Wrap up the node object.
function finishNode(node) {
// Pop a `Marker` off the location-array and attach its location data.
if (trackLocations) {
var location = locations.pop();
location.complete();
location.bless(node);
}
if (options.onCreateNode) options.onCreateNode(node);
return node;
}
// Helpers
// -------
var slice = Array.prototype.slice
, toString = Object.prototype.toString
;
var indexOf = /* istanbul ignore next */ function (array, element) {
for (var i = 0, length = array.length; i < length; ++i) {
if (array[i] === element) return i;
}
return -1;
};
/* istanbul ignore else */
if (Array.prototype.indexOf)
indexOf = function (array, element) {
return array.indexOf(element);
};
// From https://github.com/behnammodi/polyfill/blob/master/array.polyfill.js
var isArray = /* istanbul ignore next */ function (arg) {
return Object.prototype.toString.call(arg) === '[object Array]';
};
/* istanbul ignore else */
if (Array.isArray)
isArray = function (arg) {
return Array.isArray(arg);
};
// Iterate through an array of objects and return the index of an object
// with a matching property.
function indexOfObject(array, property, element) {
for (var i = 0, length = array.length; i < length; ++i) {
if (array[i][property] === element) return i;
}
return -1;
}
// A sprintf implementation using %index (beginning at 1) to input
// arguments in the format string.
//
// Example:
//
// // Unexpected function in token
// sprintf('Unexpected %2 in %1.', 'token', 'function');
function sprintf(format) {
var args = slice.call(arguments, 1);
format = format.replace(/%(\d)/g, function (match, index) {
return '' + args[index - 1] || /* istanbul ignore next */ '';
});
return format;
}
// Polyfill for `Object.assign`.
var assign = /* istanbul ignore next */ function (dest) {
var args = slice.call(arguments, 1)
, src, prop;
for (var i = 0, length = args.length; i < length; ++i) {
src = args[i];
for (prop in src)
/* istanbul ignore else */
if (Object.prototype.hasOwnProperty.call(src, prop)) {
dest[prop] = src[prop];
}
}
return dest;
};
/* istanbul ignore else */
if (Object.assign)
assign = Object.assign;
// ### Error functions
exports.SyntaxError = SyntaxError;
// XXX: Eliminate this function and change the error type to be different from SyntaxError.
// This will unfortunately be a breaking change, because some downstream users depend
// on the error thrown being an instance of SyntaxError. For example, the Ace editor:
// <https://github.com/ajaxorg/ace/blob/4c7e5eb3f5d5ca9434847be51834a4e41661b852/lib/ace/mode/lua_worker.js#L55>
function fixupError(e) {
/* istanbul ignore if */
if (!Object.create)
return e;
return Object.create(e, {
'line': { 'writable': true, value: e.line },
'index': { 'writable': true, value: e.index },
'column': { 'writable': true, value: e.column }
});
}
// #### Raise an exception.
//
// Raise an exception by passing a token, a string format and its paramters.
//
// The passed tokens location will automatically be added to the error
// message if it exists, if not it will default to the lexers current
// position.
//
// Example:
//
// // [1:0] expected [ near (
// raise(token, "expected %1 near %2", '[', token.value);
function raise(token) {
var message = sprintf.apply(null, slice.call(arguments, 1))
, error, col;
if (token === null || typeof token.line === 'undefined') {
col = index - lineStart + 1;
error = fixupError(new SyntaxError(sprintf('[%1:%2] %3', line, col, message)));
error.index = index;
error.line = line;
error.column = col;
} else {
col = token.range[0] - token.lineStart;
error = fixupError(new SyntaxError(sprintf('[%1:%2] %3', token.line, col, message)));
error.line = token.line;
error.index = token.range[0];
error.column = col;
}
throw error;
}
function tokenValue(token) {
var raw = input.slice(token.range[0], token.range[1]);
if (raw)
return raw;
return token.value;
}
// #### Raise an unexpected token error.
//
// Example:
//
// // expected <name> near '0'
// raiseUnexpectedToken('<name>', token);
function raiseUnexpectedToken(type, token) {
raise(token, errors.expectedToken, type, tokenValue(token));
}
// #### Raise a general unexpected error
//
// Usage should pass either a token object or a symbol string which was
// expected. We can also specify a nearby token such as <eof>, this will
// default to the currently active token.
//
// Example:
//
// // Unexpected symbol 'end' near '<eof>'
// unexpected(token);
//
// If there's no token in the buffer it means we have reached <eof>.
function unexpected(found) {
var near = 'undefined' !== typeof lookahead ?
tokenValue(lookahead) : '<bof>';
if ('undefined' !== typeof found.type) {
var type;
switch (found.type) {
case StringLiteral: type = 'string'; break;
case Keyword: type = 'keyword'; break;
case Identifier: type = 'identifier'; break;
case NumericLiteral: type = 'number'; break;
case Punctuator: type = 'symbol'; break;
case BooleanLiteral: type = 'boolean'; break;
case NilLiteral:
return raise(found, errors.unexpected, 'symbol', 'nil', near);
case EOF:
return raise(found, errors.unexpectedEOF);
}
return raise(found, errors.unexpected, type, tokenValue(found), near);
}
return raise(found, errors.unexpected, 'symbol', found, near);
}
// Lexer
// -----
//
// The lexer, or the tokenizer reads the input string character by character
// and derives a token left-right. To be as efficient as possible the lexer
// prioritizes the common cases such as identifiers. It also works with
// character codes instead of characters as string comparisons was the
// biggest bottleneck of the parser.
//
// If `options.comments` is enabled, all comments encountered will be stored
// in an array which later will be appended to the chunk object. If disabled,
// they will simply be disregarded.
//
// When the lexer has derived a valid token, it will be returned as an object
// containing its value and as well as its position in the input string (this
// is always enabled to provide proper debug messages).
//
// `lex()` starts lexing and returns the following token in the stream.
var index
, token
, previousToken
, lookahead
, fakeToken
, comments
, tokenStart
, line
, lineStart
, currentP8Section
, newLineIsEnd
, foundEndIsNewLine
, newLineIsClose;
exports.lex = lex;
function lex() {
skipWhiteSpace();
if (features.strictP8FileFormat && '__lua__' !== currentP8Section) {
do {
skipP8Section();
} while ('__lua__' !== currentP8Section && index < length);
skipWhiteSpace();
}
var charCode = input.charCodeAt(index)
, next = input.charCodeAt(index + 1);
// Skip comments beginning with -- and, if the feature is enabled, with //
while (45 === charCode && 45 === next ||
features.traditionalComments &&
47 === charCode && 47 === next) {
scanComment();
skipWhiteSpace();
charCode = input.charCodeAt(index);
next = input.charCodeAt(index + 1);
}
if (index >= length && !fakeToken) return consumeEOF();
// Memorize the range index where the token begins.
tokenStart = index;
if (features.strictP8FileFormat &&
95 === charCode && 95 === next &&
isLineTerminator(input.charCodeAt(index - 1))) {
var sequence = scanP8SectionStart();
if (null !== sequence) {
currentP8Section = sequence;
return lex();
}
}
if (isIdentifierStart(charCode)) return scanIdentifierOrKeyword();
if (isStringQuote(charCode)) return scanStringLiteral();
if (isDecDigit(charCode) || 46 === charCode && isDecDigit(next)) return scanNumericLiteral();
// Will try to scan for VarargLiteral, Punctuator and the '?' "operator";
// if it does not appear to match any, returns null.
var other = scanOther(charCode, next);
if (null !== other) return other;
return unexpected(input.charAt(index));
}
// Whitespace has no semantic meaning in lua so simply skip ahead while
// tracking the encountered newlines. Any kind of eol sequence is counted as a
// single line.
function consumeEOL() {
var charCode = input.charCodeAt(index)
, peekCharCode = input.charCodeAt(index + 1);
if (isLineTerminator(charCode)) {
// Count \n\r and \r\n as one newline.
if (10 === charCode && 13 === peekCharCode) ++index;
if (13 === charCode && 10 === peekCharCode) ++index;
++line;
lineStart = ++index;
return true;
}
return false;
}
function consumeEOF() {
// From a single line statement, any dangling `newLineIsEnd`
// makes the EOF a valid 'end' token, but this is not optional
// and will be an syntax error under certain circumstances.
if (newLineIsEnd && token && EOF === token.type) {
newLineIsEnd = false;
token = {
type: Keyword
, value: 'end'
, line: line
, lineStart: lineStart
, range: [index, index]
};
}
return {
type : EOF
, value: '<eof>'
, line: line
, lineStart: lineStart
, range: [index, index]
};
}
// "Whitespace has no semantic meaning in lua..." except when it is given one,
// see comments above the following functions:
// - skipWhiteSpace
// - isBlockFollow
// - isEnd
//
// This will deal well enough with any dangling `newLineIsEnd`.
function consumeEnd() {
if (isEnd(token)) {
if (foundEndIsNewLine) {
// "consumes" the newline (which sits between the previousToken and current token)
newLineIsEnd = false;
return true;
}
// Consumes an actual 'end' character sequence
return consume('end');
}
return false;
}
// Skips until the next section-starting sequence or EOF
function skipP8Section() {
var sequence;
while (index < length) {
while (isLineTerminator(input.charCodeAt(index))) consumeEOL();
if (isLineTerminator(input.charCodeAt(index-1)) && '_' === input.charAt(lineStart)) {
sequence = scanP8SectionStart();
if (null !== sequence) break;
}
index++;
}
currentP8Section = sequence;
}
// XXX: (move to appropriate doc please)
// Lua PICO-8 introduced 3 (janky) whitespace-dependent syntaxes: singleLineIf,
// singleLineWhile and singleLinePrint (P.S. and #include). While they all require an ending newline,
// singleLineIf and singleLineWhile may start with any blank character, singleLinePrint
// must be on its own line (so starts with a newline sequence).
//
// singleLineIf and singleLineWhile actually have a more complicated relation with
// leading blank character; if the token preceding the 'if' or 'while' keyword is
// a numeral (not just a digit character, hex is fine too) then the blank character
// is not necessary (notice how 7 to 10 behave):
//
// 1 - a = 0xFFif (a) print(a)
// 2 - a = "42"if (a) print(a) -- FAIL
// 3 - a = "42" if (a) print(a)
// 4 - a = 0xFF;if (a) print(a) -- FAIL
// 5 - a = 0xFF; if (a) print(a)
// 6 - a = 0xFF.if (a) print(a)
// 7 - a = 10--[[..]]if (a) print(a)
// 8 - a = ""--[[..]]if (a) print(a) -- FAIL
// 9 - a = "" --[[..]]if (a) print(a) -- FAIL
// 10 - a = ""--[[..]] if (a) print(a)
function skipWhiteSpace() {
while (index < length) {
var charCode = input.charCodeAt(index);
if (isWhiteSpace(charCode)) {
++index;
} else if (!consumeEOL()) {
break;
}
}
}
// Identifiers, keywords, booleans and nil all look the same syntax wise. We
// simply go through them one by one and defaulting to an identifier if no
// previous case matched.
function scanIdentifierOrKeyword() {
var value, type;
// Slicing the input string is preferred before string concatenation in a
// loop for performance reasons.
while (isIdentifierPart(input.charCodeAt(++index)));
value = encodingMode.fixup(input.slice(tokenStart, index));
// Decide on the token type and possibly cast the value.
if (isKeyword(value)) {
type = Keyword;
} else if ('true' === value || 'false' === value) {
type = BooleanLiteral;
value = ('true' === value);
} else if ('nil' === value) {
type = NilLiteral;
value = null;
} else {
type = Identifier;
}
return {
type: type
, value: value
, line: line
, lineStart: lineStart
, range: [tokenStart, index]
};
}
// Will also consume until the next EOL/EOF and increase line accordingly.
// It should be ensured when this is called that this can indeed be a valid p8
// section start (specifically must be preceded by an EOL)
function scanP8SectionStart() {
for (var k = 0; k < features.p8Sections.length; k++) {
var section = features.p8Sections[k];
if (input.slice(index, index+section.length) === section) {
index += section.length;
while (index < length && !isLineTerminator(input.charCodeAt(index))) index++;
if (isLineTerminator(input.charCodeAt(index))) consumeEOL();
return section;
}
}
return null;
}
// Will try to scan for VarargLiteral and Punctuator;
// if it does not appear to match any, returns null.
//
// charCode = input.charCodeAt(index);
// next = input.charCodeAt(index + 1);
function scanOther(charCode, next) {
switch (charCode) {
case 46: // .
if (46 === next) {
if (46 === input.charCodeAt(index + 2)) return scanVarargLiteral();
return scanPunctuatorMaybeAssignmentOperator('..');
}
return scanPunctuator('.');
case 61: // =
if (61 === next) return scanPunctuator('==');
return scanPunctuator('=');
case 62: // >
if (features.bitwiseOperators && 62 === next) {
if (features.bitshiftAdditionalOperators) {
switch (input.charCodeAt(index + 2)) {
case 62: return scanPunctuatorMaybeAssignmentOperator('>>>');
case 60: return scanPunctuatorMaybeAssignmentOperator('>><');
}
}
return scanPunctuatorMaybeAssignmentOperator('>>');
}
if (61 === next) return scanPunctuator('>=');
return scanPunctuator('>');
case 60: // <
if (features.bitwiseOperators && 60 === next) {
if (features.bitshiftAdditionalOperators && 62 === input.charCodeAt(index + 2))
return scanPunctuatorMaybeAssignmentOperator('<<>');
return scanPunctuatorMaybeAssignmentOperator('<<');
}
if (61 === next) return scanPunctuator('<=');
return scanPunctuator('<');
case 126: // ~
if (61 === next) return scanPunctuator('~=');
if (!features.bitwiseOperators)
break;
return scanPunctuator('~');
case 33: // !
// when traditionalNotEqual is truthy, both syntaxes are accepted:
// "!=" token are disguised as "~=" (takes advantage of the fact
// that scanPunctuator does not care about what's actually there
// and most importantly that they are the same length)
if (features.traditionalNotEqual && 61 === next) return scanPunctuator('~=');
break;
case 58: // :
if (features.labels && 58 === next) return scanPunctuator('::');
return scanPunctuator(':');
case 91: // [
// Check for a multiline string, they begin with [= or [[
if (91 === next || 61 === next) return scanLongStringLiteral();
return scanPunctuator('[');
case 47: // /
// Check for integer division op (//)
if (features.integerDivision && 47 === next)
return scanPunctuator('//');
return scanPunctuatorMaybeAssignmentOperator('/');
case 92: // \
if (!features.backslashIntegerDivision)
break;
return scanPunctuatorMaybeAssignmentOperator('\\');
case 94: // ^
if (features.smileyBitwiseXor && 94 === next)
return scanPunctuatorMaybeAssignmentOperator('^^');
return scanPunctuatorMaybeAssignmentOperator('^');
case 38: case 124: // & |
if (!features.bitwiseOperators)
break;
return scanPunctuatorMaybeAssignmentOperator(input.charAt(index));
case 64: case 36: // @ $
if (!features.peekPokeOperators)
break;
return scanPunctuator(input.charAt(index));
case 42: case 37: case 45: case 43: // * % - +
return scanPunctuatorMaybeAssignmentOperator(input.charAt(index));
case 63: // ?
if (!features.singleLinePrint)
break;
// The '?' "operator" must be preceded by no token on the same
// line, otherwise it is not recognized (prior to PICO-8-0.2.3).
if (!features.singleLinePrintNoLineDependency && token && token.line === line)
break;
// The '?' token essentially correspond to 2 token directly
// and 1 more later: the identifier 'print', a '(' punctuator
// and eventually a ')' punctuator on line end.
fakeToken = {
type: Punctuator
, value: '('
, line: line
, lineStart: lineStart
, range: [tokenStart, index]
};
newLineIsClose = true;
return {
type: Identifier
, value: 'print'
, line: line
, lineStart: lineStart
, range: [tokenStart, index++]
};
case 44: case 123: case 125: case 93:
case 40: case 41: case 59: case 35: // , { } ] ( ) ; #
return scanPunctuator(input.charAt(index));
}
return null;
}
// Once a punctuator reaches this function it should already have been
// validated so we simply return it as a token.
function scanPunctuator(value) {
index += value.length;
return {
type: Punctuator
, value: value
, line: line
, lineStart: lineStart
, range: [tokenStart, index]
};
}
// If the reached punctuator can also be the beginning of an assignment
// operators (and if they are enabled in the features) this tests for the
// ending '='; if such is found the punctuator is 1 longer, otherwise
// defaults to `scanPunctuator()`.
function scanPunctuatorMaybeAssignmentOperator(valuePunctuator) {
if (features.assignmentOperators) {
if (61 === input.charCodeAt(index + valuePunctuator.length)) // op=
return scanPunctuator(valuePunctuator + '=');
}
return scanPunctuator(valuePunctuator);
}
// A vararg literal consists of three dots.
function scanVarargLiteral() {
index += 3;
return {
type: VarargLiteral
, value: '...'
, line: line
, lineStart: lineStart
, range: [tokenStart, index]
};
}
// Find the string literal by matching the delimiter marks used.
function scanStringLiteral() {
var delimiter = input.charCodeAt(index++)
, beginLine = line
, beginLineStart = lineStart
, stringStart = index
, string = encodingMode.discardStrings ? null : ''
, charCode;
for (;;) {
charCode = input.charCodeAt(index++);
if (delimiter === charCode) break;
// EOF or `\n` terminates a string literal. If we haven't found the
// ending delimiter by now, raise an exception.
if (index > length || isLineTerminator(charCode)) {
string += input.slice(stringStart, index - 1);
raise(null, errors.unfinishedString, input.slice(tokenStart, index - 1));
}
if (92 === charCode) { // backslash
if (!encodingMode.discardStrings) {
var beforeEscape = input.slice(stringStart, index - 1);
string += encodingMode.fixup(beforeEscape);
}
var escapeValue = readEscapeSequence();
if (!encodingMode.discardStrings)
string += escapeValue;
stringStart = index;
}
}
if (!encodingMode.discardStrings) {
string += encodingMode.encodeByte(null);
string += encodingMode.fixup(input.slice(stringStart, index - 1));
}
return {
type: StringLiteral
, value: string
, line: beginLine
, lineStart: beginLineStart
, lastLine: line
, lastLineStart: lineStart
, range: [tokenStart, index]
};
}
// Expect a multiline string literal and return it as a regular string
// literal, if it doesn't validate into a valid multiline string, throw an
// exception.
function scanLongStringLiteral() {
var beginLine = line
, beginLineStart = lineStart
, string = readLongString(false);
// Fail if it's not a multiline literal.
if (false === string) raise(token, errors.expected, '[', tokenValue(token));
var r = {
type: StringLiteral
, value: encodingMode.discardStrings ? null : encodingMode.fixup(string)
, line: beginLine
, lineStart: beginLineStart
, lastLine: line
, lastLineStart: lineStart
, range: [tokenStart, index]
};
if (features.strictP8FileFormat) { // v
var delimLength = tokenStart + 1; // a = [==[content]==]
while ('[' !== input.charAt(delimLength)) delimLength++;
delimLength = delimLength-tokenStart + 1;
// This can only be true when a longstring was interrupted by one (or more)
// non-lua sections; but in this case, 'raw' of the node is not really
// the slice of input defined by the range... _somehow_
if (string.length !== index - tokenStart - 2*delimLength)
r.rawInterrupted = input.slice(tokenStart, tokenStart + delimLength) +
string +
input.slice(index - delimLength, index);
}
return r;
}
// Numeric literals will be returned as floating-point numbers instead of
// strings. The raw value should be retrieved from slicing the input string
// later on in the process.
//
// If a hexadecimal number is encountered, it will be converted.
function scanNumericLiteral() {
var character = input.charAt(index)
, next = input.charAt(index + 1);
var literal = (features.binLiteral && '0' === character && 'bB'.indexOf(next || null) >= 0) ?
readBinLiteral() : ('0' === character && 'xX'.indexOf(next || null) >= 0) ?
readHexLiteral() : readDecLiteral();
var foundImaginaryUnit = readImaginaryUnitSuffix()
, foundInt64Suffix = readInt64Suffix();
if (foundInt64Suffix && (foundImaginaryUnit || literal.hasFractionPart)) {
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
}
return {
type: NumericLiteral
, value: literal.value
, line: line
, lineStart: lineStart
, range: [tokenStart, index]
};
}
function readImaginaryUnitSuffix() {
if (!features.imaginaryNumbers) return;
// Imaginary unit number suffix is optional.
// See http://luajit.org/ext_ffi_api.html#literals
if ('iI'.indexOf(input.charAt(index) || null) >= 0) {
++index;
return true;
} else {
return false;
}
}
function readInt64Suffix() {
if (!features.integerSuffixes) return;
// Int64/uint64 number suffix is optional.
// See http://luajit.org/ext_ffi_api.html#literals
if ('uU'.indexOf(input.charAt(index) || null) >= 0) {
++index;
if ('lL'.indexOf(input.charAt(index) || null) >= 0) {
++index;
if ('lL'.indexOf(input.charAt(index) || null) >= 0) {
++index;
return 'ULL';
} else {
// UL but no L
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
}
} else {
// U but no L
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
}
} else if ('lL'.indexOf(input.charAt(index) || null) >= 0) {
++index;
if ('lL'.indexOf(input.charAt(index) || null) >= 0) {
++index;
return 'LL';
} else {
// First L but no second L
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
}
}
}
// Lua hexadecimals have an optional fraction part and an optional binary
// exponent part. These are not included in JavaScript so we will compute
// all three parts separately and then sum them up at the end of the function
// with the following algorithm.
//
// Digit := toDec(digit)
// Fraction := toDec(fraction) / 16 ^ fractionCount
// BinaryExp := 2 ^ binaryExp
// Number := ( Digit + Fraction ) * BinaryExp
function readHexLiteral() {
var fraction = 0 // defaults to 0 as it gets summed
, binaryExponent = 1 // defaults to 1 as it gets multiplied
, binarySign = 1 // positive
, digit, fractionStart, exponentStart, digitStart;
digitStart = index += 2; // Skip 0x part
// A minimum of one hex digit is required.
// "0x.A" is valid if noTrailingDotInHexNumeral (from Lua 5.2 onward)
if (!isHexDigit(input.charCodeAt(index)))
if (features.noTrailingDotInHexNumeral || '.' !== input.charAt(index))
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
while (isHexDigit(input.charCodeAt(index))) ++index;
// Convert the hexadecimal digit to base 10.
if (digitStart < index)
digit = parseInt(input.slice(digitStart, index), 16);
else digit = 0; // No decimal part.
// Fraction part is optional.
var foundFraction = false;
if ('.' === input.charAt(index)) {
foundFraction = true;
fractionStart = ++index;
while (isHexDigit(input.charCodeAt(index))) ++index;
fraction = input.slice(fractionStart, index);
// Empty fraction parts should default to 0, others should be converted
// 0.x form so we can use summation at the end.
fraction = (fractionStart === index) ? 0
: parseInt(fraction, 16) / Math.pow(16, index - fractionStart);
}
// Binary exponents are optional
//
// Things like "a = 0x1p = 16" are valid in Lua PICO-8 in which case this just return normally
// (yes it assumes noExponentLiteral implies this behavior above...)
var foundBinaryExponent = false;
if (!features.noExponentLiteral && 'pP'.indexOf(input.charAt(index) || null) >= 0) {
foundBinaryExponent = true;
++index;
// Sign part is optional and defaults to 1 (positive).
if ('+-'.indexOf(input.charAt(index) || null) >= 0)
binarySign = ('+' === input.charAt(index++)) ? 1 : -1;
exponentStart = index;
// The binary exponent sign requires a decimal digit.
if (!isDecDigit(input.charCodeAt(index)))
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
while (isDecDigit(input.charCodeAt(index))) ++index;
binaryExponent = input.slice(exponentStart, index);
// Calculate the binary exponent of the number.
binaryExponent = Math.pow(2, binaryExponent * binarySign);
}
return {
value: (digit + fraction) * binaryExponent,
hasFractionPart: foundFraction || foundBinaryExponent,
hasExponentPart: foundBinaryExponent
};
}
// PICO-8 binaries acts similarly to hexadecimals (optional fraction part).
// Because this is only used by PICO-8 which does not support number suffixes,
// this is a simplified algorithm (eg. no BinaryExp, assumes !noTrailingDotInBinNumeral..).
//
// Digit := toDec(digit)
// Fraction := toDec(fraction) / 2 ^ fractionCount
// Number := Digit + Fraction
function readBinLiteral() {
var fraction = 0 // defaults to 0 as it gets summed
, digit, fractionStart, digitStart;
digitStart = index += 2; // Skip 0b part
// A minimum of one bin digit is required.
// "0x.1" is valid (will assume so as only PICO-8-xyz get there)
if (!isBinDigit(input.charCodeAt(index)) && '.' !== input.charAt(index))
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
while (isBinDigit(input.charCodeAt(index))) ++index;
// Convert the binary digit to base 10.
if (digitStart < index)
digit = parseInt(input.slice(digitStart, index), 2);
else digit = 0; // No decimal part.
// Fraction part is optional.
var foundFraction = false;
if ('.' === input.charAt(index)) {
foundFraction = true;
fractionStart = ++index;
while (isBinDigit(input.charCodeAt(index))) ++index;
fraction = input.slice(fractionStart, index);
// Empty fraction parts should default to 0, others should be converted
// 0.x form so we can use summation at the end.
fraction = (fractionStart === index) ? 0
: parseInt(fraction, 2) / Math.pow(2, index - fractionStart);
}
// No binary exponents.
return {
value: digit + fraction,
hasFractionPart: foundFraction,
hasExponentPart: false
};
}
// Decimal numbers are exactly the same in Lua and in JavaScript, because of
// this we check where the token ends and then parse it with native
// functions.
function readDecLiteral() {
while (isDecDigit(input.charCodeAt(index))) ++index;
// Fraction part is optional
var foundFraction = false;
if ('.' === input.charAt(index)) {
foundFraction = true;
++index;
// Fraction part defaults to 0
while (isDecDigit(input.charCodeAt(index))) ++index;
}
// Exponent part is optional.
//
// Things like "a = 1e = 5" are valid in Lua PICO-8 in which case this just return normally
// (yes it assumes noExponentLiteral implies this behavior above...)
var foundExponent = false;
if (!features.noExponentLiteral && 'eE'.indexOf(input.charAt(index) || null) >= 0) {
foundExponent = true;
++index;
// Sign part is optional.
if ('+-'.indexOf(input.charAt(index) || null) >= 0) ++index;
// An exponent is required to contain at least one decimal digit.
if (!isDecDigit(input.charCodeAt(index)))
raise(null, errors.malformedNumber, input.slice(tokenStart, index));
while (isDecDigit(input.charCodeAt(index))) ++index;
}
return {
value: parseFloat(input.slice(tokenStart, index)),
hasFractionPart: foundFraction || foundExponent,
hasExponentPart: foundExponent
};
}
function readUnicodeEscapeSequence() {
var sequenceStart = index++;
if (input.charAt(index++) !== '{')
raise(null, errors.braceExpected, '{', '\\' + input.slice(sequenceStart, index));
if (!isHexDigit(input.charCodeAt(index)))
raise(null, errors.hexadecimalDigitExpected, '\\' + input.slice(sequenceStart, index));
while (input.charCodeAt(index) === 0x30) ++index;
var escStart = index;
while (isHexDigit(input.charCodeAt(index))) {
++index;
if (index - escStart > 6)
raise(null, errors.tooLargeCodepoint, '\\' + input.slice(sequenceStart, index));
}
var b = input.charAt(index++);
if (b !== '}') {
if ((b === '"') || (b === "'"))
raise(null, errors.braceExpected, '}', '\\' + input.slice(sequenceStart, index--));
else
raise(null, errors.hexadecimalDigitExpected, '\\' + input.slice(sequenceStart, index));
}
var codepoint = parseInt(input.slice(escStart, index - 1) || '0', 16);
var frag = '\\' + input.slice(sequenceStart, index);
if (codepoint > 0x10ffff) {
raise(null, errors.tooLargeCodepoint, frag);
}
return encodingMode.encodeUTF8(codepoint, frag);
}
// Translate escape sequences to the actual characters.
function readEscapeSequence() {
var sequenceStart = index
, escapedChar = input.charAt(index);
switch (escapedChar) {
// Lua allow the following escape sequences.
case 'a': ++index; return '\x07';
case 'n': ++index; return '\n';
case 'r': ++index; return '\r';
case 't': ++index; return '\t';
case 'v': ++index; return '\x0b';
case 'b': ++index; return '\b';
case 'f': ++index; return '\f';
// Backslash at the end of the line. We treat all line endings as equivalent,
// and as representing the [LF] character (code 10). Lua 5.1 through 5.3
// have been verified to behave the same way.
case '\r':
case '\n':
consumeEOL();
return '\n';
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
// \ddd, where ddd is a sequence of up to three decimal digits.
while (isDecDigit(input.charCodeAt(index)) && index - sequenceStart < 3) ++index;
var frag = input.slice(sequenceStart, index);
var ddd = parseInt(frag, 10);
if (ddd > 255) {
raise(null, errors.decimalEscapeTooLarge, '\\' + ddd);
}
return encodingMode.encodeByte(ddd, '\\' + frag);
case 'z':
if (features.skipWhitespaceEscape) {
++index;
skipWhiteSpace();
return '';
}
break;
case 'x':
if (features.hexEscapes) {
// \xXX, where XX is a sequence of exactly two hexadecimal digits
if (isHexDigit(input.charCodeAt(index + 1)) &&
isHexDigit(input.charCodeAt(index + 2))) {
index += 3;
return encodingMode.encodeByte(parseInt(input.slice(sequenceStart + 1, index), 16), '\\' + input.slice(sequenceStart, index));
}
raise(null, errors.hexadecimalDigitExpected, '\\' + input.slice(sequenceStart, index + 2));
}
break;
case 'u':
if (features.unicodeEscapes)
return readUnicodeEscapeSequence();
break;
case '\\': case '"': case "'":
return input.charAt(index++);
}
if (features.p8scii) {
if (options.ignoreP8scii) return '';
var sequence = readEscapeSequenceP8scii(escapedChar, sequenceStart);
if (null !== sequence) return sequence;
}
if (features.strictEscapes)
raise(null, errors.invalidEscape, '\\' + input.slice(sequenceStart, index + 1));
return input.charAt(index++);
}
function readEscapeSequenceP8scii(escapedChar, sequenceStart) {
// Some escape sequences might be wrongly parsed/modified/replaced
// be it here or in the switch above (maybe)
var p0 = index+1 < length ? input.charAt(++index) : null
, p1 = index+1 < length ? input.charAt(++index) : null
, p0CharCode = null === p0 ? -1 : p0.charCodeAt(0)
, p1CharCode = null === p1 ? -1 : p1.charCodeAt(0)
, params = p0;
switch (escapedChar) {
case '*': // Repeat next character P0 times. ?"\*3a" --> aaa
// This escape sequence needs something after P0 (maybe) (but what?)
if ('"' === p0 || -1 === p1CharCode || isLineTerminator(p1CharCode)) break;
/* fall through */
case '+': // Shift cursor by P0-16, P1-16 pixels
if ('+' === escapedChar && !isValidEscapeParam(p1CharCode)) break;
params += p1;
/* fall through */
case '-': // Shift cursor horizontally by P0-16 pixels
case '|': // Shift cursor vertically by P0-16 pixels
case '#': // Draw solid background with colour P0
// Valid parameter should be a number or lower case character (maybe)
if (!isValidEscapeParam(p0CharCode)) break;
return '\\' + escapedChar + params;
case '^': // Special command
// Special commands param are shifter by 1 (because of the command itself)
if (-1 === p0CharCode || '"' === p0) break;
index = sequenceStart + 1;
var command = input.charAt(index++);
p0 = p1;
p1 = index+1 < length ? input.charAt(++index) : null;
p0CharCode = p1CharCode;
p1CharCode = null === p1 ? -1 : p1.charCodeAt(0);
// 1..9 -- Skip 1,2,4,8,16,32..256 frames
// c -- Cls to colour P0, set cursor to 0,0
// g -- Set cursor position to home
// h -- Set home to cursor position
// j -- Jump to absolute P0*4, P1*4 (in screen pixels)
// s -- Set tab stop width to P0 pixels (used by "\t")
// x -- Set character width (default: 4)
// y -- Set character height (default: 6)
if ("123456789cghjsxy".indexOf(command) >= 0) {
// Check parameter for some commands;
// Valid parameter should be a number or lower case character (maybe)
if ('c' === command || 'j' === command || 's' === command) {
if (!isValidEscapeParam(p0CharCode)) break;
params += p0;
if ('j' === command) {
if (!isValidEscapeParam(p1CharCode)) break;
params += p1;
}
} else index--;
return '\\^' + command + params;
}
}
return null;
}
// Comments begin with -- after which it will be decided if they are
// multiline comments or not.
//
// The multiline functionality works the exact same way as with string
// literals so we reuse the functionality.
//
// If the feature `traditionalComments` is on, this kind of comment cannot
// be multiline.
//
// If the feature `noDeepLongStringComments` is on, a sequence like '--[=*['
// does not start a multiline comment.
function scanComment() {
var canBeMultiline = '-' === input.charAt(index);
tokenStart = index;
index += 2; // --
var character = input.charAt(index)
, content = ''
, isLong = false
, commentStart = index
, lineStartComment = lineStart
, lineComment = line;
if (canBeMultiline && '[' === character) {
content = readLongString(true);
// This wasn't a multiline comment after all.
if (false === content) content = character;
else isLong = true;
}
// Scan until next line as long as it's not a multiline comment.
if (!isLong) {
while (index < length) {
if (isLineTerminator(input.charCodeAt(index))) break;
++index;
}
if (options.comments) content = input.slice(commentStart, index);
}
if (options.comments) {
var rawInterrupted;
if (isLong && features.strictP8FileFormat) { // v
var delimLength = tokenStart + 3; // --[==[comment]==]
// XXX: "ignore next": because ony PICO-8 version get here and all have
// both `strictP8FileFormat` and `noDeepLongStringComments`;
// this will need to be change if one can be present without the other
/* istanbul ignore next */ while ('[' !== input.charAt(delimLength)) delimLength++;
delimLength = delimLength-(tokenStart+2) + 1;
// This can only be true when a longstring was interrupted by one (or more)
// non-lua sections; but in this case, 'raw' of the node is not really
// the slice of input defined by the range... _somehow_
if (content.length !== index - tokenStart - 2*delimLength-2) // -2 here and +2 bellow: the '--'
rawInterrupted = input.slice(tokenStart, tokenStart + delimLength+2) +
content +
input.slice(index - delimLength, index);
}
var node = ast.comment(content, input.slice(tokenStart, index), rawInterrupted);
// `Marker`s depend on tokens available in the parser and as comments are
// intercepted in the lexer all location data is set manually.
if (options.locations) {
node.loc = {
start: { line: lineComment, column: tokenStart - lineStartComment }
, end: { line: line, column: index - lineStart }
};
}
if (options.ranges) {
node.range = [tokenStart, index];
}
if (options.onCreateNode) options.onCreateNode(node);
comments.push(node);
}
}
// Read a multiline string by calculating the depth of `=` characters and
// then appending until an equal depth is found.
function readLongString(isComment) {
var level = 0
, content = ''
, terminator = false
, character, stringStart, firstLine = line
, sequence
, interruptions = []
, interruptionStartIndex = index
, interruptionRange;
++index; // [
// Calculate the depth of the comment.
while ('=' === input.charAt(index + level)) ++level;
// Exit, this is not a long string afterall.
if ('[' !== input.charAt(index + level)) return false;
// Exit, this cannot be a longstring comment.
if (isComment && features.noDeepLongStringComments && 0 !== level)
return false;
index += level + 1;
stringStart = index;
while (index < length) {
character = input.charAt(index++);
// If a line starts with a '_' (and the feature is on), look ahead for a
// section-starting sequence and skip what's needed
if (features.strictP8FileFormat && '_' === character &&
isLineTerminator(input.charCodeAt(index-2))) {
interruptionStartIndex = --index;
sequence = scanP8SectionStart();
// The lua section is interrupted
if (null !== sequence) {
currentP8Section = sequence;
// Note: if at this point, even if the `currentP8Section` is still '__lua__',
// it is indeed discarded (ie. in a longstring, a line cannot start with
// any sequence from the `features.p8Sections`)
while ('__lua__' !== currentP8Section && index < length) {
skipP8Section();
interruptionRange = [interruptionStartIndex, index];
}
if (isArray(interruptionRange)) {
interruptions.push(interruptionRange);
interruptionRange = undefined;
}
character = input.charAt(index++);
} else index++; // Fausse alerte
}
// Once the delimiter is found, iterate through the depth count and see
// if it matches.
if (']' === character) {
terminator = true;
for (var i = 0; i < level; ++i) {
if ('=' !== input.charAt(index + i)) terminator = false;
}
if (']' !== input.charAt(index + level)) terminator = false;
// We reached the end of the multiline string. Get out now.
if (terminator) {
if (!features.strictP8FileFormat)
content += input.slice(stringStart, index - 1);
else {
// Need to discard everything between indexes interruptions[k][0] and
// interruptions[k][1] as it is part of some other(s) section(s).
var jumpingIndex = stringStart;
for (var k = 0; k < interruptions.length; k++) {
content += input.slice(jumpingIndex, interruptions[k][0]);
jumpingIndex = interruptions[k][1];
}
content += input.slice(jumpingIndex, index - 1);
}
index += level + 1;
return content;
}
}
// To keep track of line numbers run the `consumeEOL()` which increments
// its counter.
if (isLineTerminator(character.charCodeAt(0))) { index--; consumeEOL(); }
while (isLineTerminator(input.charCodeAt(index))) consumeEOL();
}
raise(null, isComment ?
errors.unfinishedLongComment :
errors.unfinishedLongString,
firstLine, '<eof>');
}
// ## Lex functions and helpers.
// Read the next token.
//
// This is actually done by setting the current token to the lookahead and
// reading in the new lookahead token.
function next() {
previousToken = token;
token = lookahead;
if (fakeToken) {
lookahead = fakeToken;
fakeToken = undefined;
} else {
var pline = line
, newLineWasClose = newLineIsClose;
lookahead = lex();
if (newLineWasClose && (pline !== line || EOF === lookahead.type)) {
newLineIsClose = false;
fakeToken = lookahead;
lookahead = {
type: Punctuator
, value: ')'
, line: token.line
, lineStart: token.lineStart
, range: [tokenStart, tokenStart]
};
}
}
}
// Consume a token if its value matches. Once consumed or not, return the
// success of the operation.
function consume(value) {
if (value === token.value) {
next();
return true;
}
return false;
}
// Expect the next token value to match. If not, throw an exception.
function expect(value) {
if (value === token.value) next();
else raise(token, errors.expected, value, tokenValue(token));
}
// ### Validation functions
function isWhiteSpace(charCode) {
return 9 === charCode || 32 === charCode || 0xB === charCode || 0xC === charCode;
}
function isLineTerminator(charCode) {
return 10 === charCode || 13 === charCode;
}
function isStringQuote(charCode) {
return 39 === charCode || 34 === charCode;
}
function isDecDigit(charCode) {
return charCode >= 48 && charCode <= 57;
}
function isHexDigit(charCode) {
return (charCode >= 48 && charCode <= 57) || (charCode >= 97 && charCode <= 102) || (charCode >= 65 && charCode <= 70);
}
function isBinDigit(charCode) {
return 48 === charCode || 49 === charCode;
}
// This is used in the `readEscapeSequence()` function when the `feature.p8scii`
// is enabled. It asserts that the given character (pX and its charCode pXCharCode)
// following certain escape sequences is a valid P0/P1.
function isValidEscapeParam(charCode) {
// Valid parameter should be a number or lower case character (maybe)
return charCode >= 48 && charCode <= 57 || charCode >= 97 && charCode <= 122;
}
// From [Lua 5.2](http://www.lua.org/manual/5.2/manual.html#8.1) onwards
// identifiers cannot use 'locale-dependent' letters (i.e. dependent on the C locale).
// On the other hand, LuaJIT allows arbitrary octets ≥ 128 in identifiers.
function isIdentifierStart(charCode) {
if ((charCode >= 65 && charCode <= 90) || (charCode >= 97 && charCode <= 122) || 95 === charCode)
return true;
if (features.extendedIdentifiers && charCode >= 128)
return true;
return false;
}
function isIdentifierPart(charCode) {
if ((charCode >= 65 && charCode <= 90) || (charCode >= 97 && charCode <= 122) || 95 === charCode || (charCode >= 48 && charCode <= 57))
return true;
if (features.extendedIdentifiers && charCode >= 128)
return true;
return false;
}
// [3.1 Lexical Conventions](http://www.lua.org/manual/5.2/manual.html#3.1)
//
// `true`, `false` and `nil` will not be considered keywords, but literals.
function isKeyword(id) {
switch (id.length) {
case 2:
return 'do' === id || 'if' === id || 'in' === id || 'or' === id;
case 3:
return 'and' === id || 'end' === id || 'for' === id || 'not' === id;
case 4:
if ('else' === id || 'then' === id)
return true;
if (features.labels && !features.contextualGoto)
return ('goto' === id);
return false;
case 5:
return 'break' === id || 'local' === id || 'until' === id || 'while' === id;
case 6:
return 'elseif' === id || 'repeat' === id || 'return' === id;
case 8:
return 'function' === id;
}
return false;
}
function isUnary(token) {
if (Punctuator === token.type) {
if (features.peekPokeOperators) return '#-~@%$'.indexOf(token.value) >= 0;
return '#-~'.indexOf(token.value) >= 0;
}
if (Keyword === token.type) return 'not' === token.value;
return false;
}
// Check if the punctuator is a valid assignment operator.
// (eg. excludes '<=', '>=')
//
// No, this is not quite optimized as would only get called every so ofter
// and will most of the time hit for '<=', '>=' as returning false and
// potentially some '+=', '-=', .. (the first list) as returning true
function isAssignmentOperator(token) {
if (1 === token.value.length) return false;
if (Punctuator === token.type && '=' === token.value.charAt(token.value.length-1)) {
// Most common
if ('<=' === token.value || '>=' === token.value) return false;
// Feature independents
if (indexOf(['+=', '-=', '*=', '/=', '%=', '^=', '..='], token.value) >= 0) return true;
// Least common
return indexOf([
features.backslashIntegerDivision && '\\='
, features.bitwiseOperators && '|='
, features.bitwiseOperators && '&='
, features.bitwiseOperators && '<<='
, features.bitwiseOperators && '>>='
, features.bitshiftAdditionalOperators && '>>>='
, features.bitshiftAdditionalOperators && '<<>='
, features.bitshiftAdditionalOperators && '>><='
, features.smileyBitwiseXor && '^^='
// note: no '~=' (as of yet..) //, features.alsoNormalBitwiseXor && '~='?
], token.value) >= 0;
}
return false;
}
// Check if the token syntactically closes a block.
//
// When the block (or one of its parent) is from a single line
// 'if's or 'while's, and no new line has been reached yet, then
// a new line (or EOF) is essentially a 'end' token.
function isBlockFollow(token) {
if (EOF === token.type) return true;
// Sadly with the singleLine syntax, an Identifier token may by
// right after a newline character that should count as a 'end'
//if (Keyword !== token.type) return false;
switch (token.value) {
case 'else': case 'elseif': case 'until':
return true;
default:
return isEnd(token);
}
}
// Complementing the comment above the `isBlockFollow()` function,
// `expect('end')` should never be called as is because under some
// conditions a '<EOL>' is considered as a valid 'end' token
// (despite not beeing one initially).
//
// Prefer using something along
// if (!consumeEnd()) expect('end');
//
// The flag `newLineIsEnd` is set when a potential single line statement
// is encountered and trigger the `isEnd()` and `consumeEnd()`
// function to consider a newline character as a valid 'end' token.
//
// The flag `foundEndIsNewLine` is used in `consumeEnd()` to assess whether
// the found 'end' token was actually a newline character
// (in which case, reset `newLineIsEnd`, any next newline
// character should not be counted as 'end' token until told
// otherwise)
function isEnd(token) {
foundEndIsNewLine = false;
if (true === newLineIsEnd) {
// If previousToken is not on the same line as the current token,
// there is a newline sequence in between (and there can't be a token
// between the 2).
if (EOF === token.type || previousToken && token.line !== previousToken.line) {
// In that case, this test is enough to say that a valid 'end' "token"
// was found (and passed! the `foundEndIsNewLine` flag is set
// not to discard the current token)
foundEndIsNewLine = true;
return true;
}
}
if ('end' === token.value) return true;
return false;
}
// Scope
// -----
// Store each block scope as a an array of identifier names. Each scope is
// stored in an FILO-array.
var scopes
// The current scope index
, scopeDepth
// A list of all global identifier nodes.
, globals;
// Create a new scope inheriting all declarations from the previous scope.
function createScope() {
var scope = scopes[scopeDepth++].slice();
scopes.push(scope);
if (options.onCreateScope) options.onCreateScope();
}
// Exit and remove the current scope.
function destroyScope() {
var scope = scopes.pop();
--scopeDepth;
if (options.onDestroyScope) options.onDestroyScope();
}
// Add identifier name to the current scope if it doesn't already exist.
function scopeIdentifierName(name) {
if (options.onLocalDeclaration) options.onLocalDeclaration(name);
if (-1 !== indexOf(scopes[scopeDepth], name)) return;
scopes[scopeDepth].push(name);
}
// Add identifier to the current scope
function scopeIdentifier(node) {
scopeIdentifierName(node.name);
attachScope(node, true);
}
// Attach scope information to node. If the node is global, store it in the
// globals array so we can return the information to the user.
function attachScope(node, isLocal) {
if (!isLocal && -1 === indexOfObject(globals, 'name', node.name))
globals.push(node);
node.isLocal = isLocal;
}
// Is the identifier name available in this scope.
function scopeHasName(name) {
return (-1 !== indexOf(scopes[scopeDepth], name));
}
// Location tracking
// -----------------
//
// Locations are stored in FILO-array as a `Marker` object consisting of both
// `loc` and `range` data. Once a `Marker` is popped off the list an end
// location is added and the data is attached to a syntax node.
var locations = []
, trackLocations;
function createLocationMarker() {
return new Marker(token);
}
function Marker(token) {
if (options.locations) {
this.loc = {
start: {
line: token.line
, column: token.range[0] - token.lineStart
}
, end: {
line: 0
, column: 0
}
};
}
if (options.ranges) this.range = [token.range[0], 0];
}
// Complete the location data stored in the `Marker` by adding the location
// of the *previous token* as an end location.
//
// If there is no previousToken as of yet, it is assumed to be BOF
Marker.prototype.complete = function() {
if (options.locations) {
this.loc.end.line = previousToken.lastLine || previousToken.line;
this.loc.end.column = previousToken.range[1] - (previousToken.lastLineStart || previousToken.lineStart);
}
if (options.ranges) {
this.range[1] = previousToken.range[1];
}
};
Marker.prototype.bless = function (node) {
if (this.loc) {
var loc = this.loc;
node.loc = {
start: {
line: loc.start.line,
column: loc.start.column
},
end: {
line: loc.end.line,
column: loc.end.column
}
};
}
if (this.range) {
node.range = [
this.range[0],
this.range[1]
];
}
};
// Create a new `Marker` and add it to the FILO-array.
function markLocation() {
if (trackLocations) locations.push(createLocationMarker());
}
// Push an arbitrary `Marker` object onto the FILO-array.
function pushLocation(marker) {
if (trackLocations) locations.push(marker);
}
// Control flow tracking
// ---------------------
// A context object that validates loop breaks and `goto`-based control flow.
function FullFlowContext() {
this.scopes = [];
this.pendingGotos = [];
}
FullFlowContext.prototype.isInLoop = function () {
var i = this.scopes.length;
while (i --> 0) {
if (this.scopes[i].isLoop)
return true;
}
return false;
};
FullFlowContext.prototype.pushScope = function (isLoop) {
var scope = {
labels: {},
locals: [],
deferredGotos: [],
isLoop: !!isLoop
};
this.scopes.push(scope);
};
FullFlowContext.prototype.popScope = function () {
for (var i = 0; i < this.pendingGotos.length; ++i) {
var theGoto = this.pendingGotos[i];
if (theGoto.maxDepth >= this.scopes.length)
if (--theGoto.maxDepth <= 0)
raise(theGoto.token, errors.labelNotVisible, theGoto.target);
}
this.scopes.pop();
};
FullFlowContext.prototype.addGoto = function (target, token) {
var localCounts = [];
for (var i = 0; i < this.scopes.length; ++i) {
var scope = this.scopes[i];
localCounts.push(scope.locals.length);
if (Object.prototype.hasOwnProperty.call(scope.labels, target))
return;
}
this.pendingGotos.push({
maxDepth: this.scopes.length,
target: target,
token: token,
localCounts: localCounts
});
};
FullFlowContext.prototype.addLabel = function (name, token) {
var scope = this.currentScope();
if (Object.prototype.hasOwnProperty.call(scope.labels, name)) {
raise(token, errors.labelAlreadyDefined, name, scope.labels[name].line);
} else {
var newGotos = [];
for (var i = 0; i < this.pendingGotos.length; ++i) {
var theGoto = this.pendingGotos[i];
if (theGoto.maxDepth >= this.scopes.length && theGoto.target === name) {
if (theGoto.localCounts[this.scopes.length - 1] < scope.locals.length) {
scope.deferredGotos.push(theGoto);
}
continue;
}
newGotos.push(theGoto);
}
this.pendingGotos = newGotos;
}
scope.labels[name] = {
localCount: scope.locals.length,
line: token.line
};
};
FullFlowContext.prototype.addLocal = function (name, token) {
this.currentScope().locals.push({
name: name,
token: token
});
};
FullFlowContext.prototype.currentScope = function () {
return this.scopes[this.scopes.length - 1];
};
FullFlowContext.prototype.raiseDeferredErrors = function () {
var scope = this.currentScope();
var bads = scope.deferredGotos;
for (var i = 0; i < bads.length; ++i) {
var theGoto = bads[i];
raise(theGoto.token, errors.gotoJumpInLocalScope, theGoto.target, scope.locals[theGoto.localCounts[this.scopes.length - 1]].name);
}
// Would be dead code currently, but may be useful later
// if (bads.length)
// scope.deferredGotos = [];
};
// Simplified context that only checks the validity of loop breaks.
function LoopFlowContext() {
this.level = 0;
this.loopLevels = [];
}
LoopFlowContext.prototype.isInLoop = function () {
return !!this.loopLevels.length;
};
LoopFlowContext.prototype.pushScope = function (isLoop) {
++this.level;
if (isLoop)
this.loopLevels.push(this.level);
};
LoopFlowContext.prototype.popScope = function () {
var levels = this.loopLevels;
var levlen = levels.length;
if (levlen) {
if (levels[levlen - 1] === this.level)
levels.pop();
}
--this.level;
};
LoopFlowContext.prototype.addGoto =
LoopFlowContext.prototype.addLabel =
/* istanbul ignore next */
function () { throw new Error('This should never happen'); };
LoopFlowContext.prototype.addLocal =
LoopFlowContext.prototype.raiseDeferredErrors =
function () {};
function makeFlowContext() {
return features.labels ? new FullFlowContext() : new LoopFlowContext();
}
// Parse functions
// ---------------
// Chunk is the main program object. Syntactically it's the same as a block.
//
// chunk ::= block
function parseChunk() {
next();
markLocation();
if (options.scope) createScope();
var flowContext = makeFlowContext();
flowContext.allowVararg = true;
flowContext.pushScope();
var body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
if (EOF !== token.type) unexpected(token);
// If the body is empty no previousToken exists when finishNode runs.
if (trackLocations && !body.length) previousToken = token;
return finishNode(ast.chunk(body));
}
// A block contains a list of statements with an optional return statement
// as its last statement.
//
// block ::= {stat} [retstat]
function parseBlock(flowContext) {
var block = []
, statement;
while (!isBlockFollow(token)) {
// Return has to be the last statement in a block.
// Likewise 'break' in Lua older than 5.2
if ('return' === token.value || (!features.relaxedBreak && 'break' === token.value)) {
block.push(parseStatement(flowContext));
break;
}
statement = parseStatement(flowContext);
consume(';');
// Statements are only added if they are returned, this allows us to
// ignore some statements, such as EmptyStatement.
if (statement) block.push(statement);
}
// Doesn't really need an ast node
return block;
}
// There are two types of statements, simple and compound.
//
// statement ::= break | goto | do | while | repeat | return
// | if | for | function | local | label | assignment
// | functioncall | ';'
function parseStatement(flowContext) {
markLocation();
if (Punctuator === token.type) {
if (consume('::')) return parseLabelStatement(flowContext);
}
// When a `;` is encountered, simply eat it without storing it.
if (features.emptyStatement) {
if (consume(';')) {
if (trackLocations) locations.pop();
return;
}
}
flowContext.raiseDeferredErrors();
// XXX: can't find any "good" way of doing it so this will have to;
// due to the note above `skipWhiteSpace()`, the if and while handlers
// need to be aware of the leading token and the leading character
// (prior to the 'if' or 'while' itself)
//
// The taken approach is to not `next()` before calling any handler
// (after all, the 'local' is part of the LocalStatement and so on...)
if (Keyword === token.type) {
switch (token.value) {
case 'local': return parseLocalStatement(flowContext);
case 'if': return parseIfStatement(flowContext);
case 'return': return parseReturnStatement(flowContext);
case 'function':
next();
var name = parseFunctionName();
return parseFunctionDeclaration(name);
case 'while': return parseWhileStatement(flowContext);
case 'for': return parseForStatement(flowContext);
case 'repeat': return parseRepeatStatement(flowContext);
case 'break': return parseBreakStatement(flowContext);
case 'do': return parseDoStatement(flowContext);
case 'goto': return parseGotoStatement(flowContext);
}
}
if (features.contextualGoto &&
token.type === Identifier && token.value === 'goto' &&
lookahead.type === Identifier && lookahead.value !== 'goto') {
return parseGotoStatement(flowContext);
}
// Assignments memorizes the location and pushes it manually for wrapper nodes.
if (trackLocations) locations.pop();
return parseAssignmentOrCallStatement(flowContext);
}
// ## Statements
// label ::= '::' Name '::'
function parseLabelStatement(flowContext) {
var nameToken = token
, label = parseIdentifier();
if (options.scope) {
scopeIdentifierName('::' + nameToken.value + '::');
attachScope(label, true);
}
expect('::');
flowContext.addLabel(nameToken.value, nameToken);
return finishNode(ast.labelStatement(label));
}
// break ::= 'break' [';']
function parseBreakStatement(flowContext) {
expect('break');
if (!flowContext.isInLoop())
raise(token, errors.noLoopToBreak, token.value);
consume(';');
return finishNode(ast.breakStatement());
}
// goto ::= 'goto' Name
function parseGotoStatement(flowContext) {
expect('goto');
var name = token.value
, gotoToken = previousToken
, label = parseIdentifier();
flowContext.addGoto(name, gotoToken);
return finishNode(ast.gotoStatement(label));
}
// do ::= 'do' block 'end'
function parseDoStatement(flowContext) {
expect('do');
if (options.scope) createScope();
flowContext.pushScope();
var body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
if (!consumeEnd()) expect('end');
return finishNode(ast.doStatement(body));
}
// while ::= 'while' exp 'do' block 'end'
function parseWhileStatement(flowContext) {
var canBeSingleLineWhile = features.singleLineWhile
, mustBeSingleLineWhile = false
, canBeEmptySingleLineWhile = features.allowEmptySingleLineWhile;
// Here it _can_ if either:
// - no dangling `newLineIsEnd` (not within a single line statement)
// - no previous token
// - previous token is numeral
// - no character before statement
// - character before statement is whitespace or lineterminator
// - >= PICO-8-0.2.4
if (canBeSingleLineWhile) {
canBeSingleLineWhile = features.allowAnyBeforeSingleLineWhile || !previousToken || NumericLiteral === previousToken.type;
// If the previous token is not a numeral (or beginning of stream), scan backward
// 1 character expecting a blank character (whitespace or lineterminator)
if (!canBeSingleLineWhile) {
var previousCharCode = input.charCodeAt(token.range[0]-1);
canBeSingleLineWhile = isWhiteSpace(previousCharCode) || isLineTerminator(previousCharCode);
}
}
expect('while');
// Here it _can_ if: - the condition is in parentheses
if (canBeSingleLineWhile)
canBeSingleLineWhile = consume('(');
var condition = parseExpectedExpression(flowContext);
if (canBeSingleLineWhile) {
expect(')');
// Here it **must** if: - no 'do' token were found past the condition
mustBeSingleLineWhile = !consume('do');
} else expect('do');
// No 'do' were found: the scope of the 'while' is implicitly opened
if (mustBeSingleLineWhile) {
// The very next EOL is syntactically equivalent to a 'end'
newLineIsEnd = true;
// If the first token of the block is the punctuator ';', it can be the only statement
canBeEmptySingleLineWhile = canBeEmptySingleLineWhile && Punctuator === token.type && ';' === token.value;
}
if (options.scope) createScope();
flowContext.pushScope(true);
var body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
// Single line 'while' cannot be empty, except:
// - if it contains a ';' (>= PICO-8-0.2.3)
if (mustBeSingleLineWhile && 0 === body.length && !canBeEmptySingleLineWhile)
raise(token, errors.expected, 'do', tokenValue(previousToken));
if (!consumeEnd()) expect('end');
return finishNode(ast.whileStatement(condition, body));
}
// repeat ::= 'repeat' block 'until' exp
function parseRepeatStatement(flowContext) {
expect('repeat');
if (options.scope) createScope();
flowContext.pushScope(true);
var body = parseBlock(flowContext);
expect('until');
flowContext.raiseDeferredErrors();
var condition = parseExpectedExpression(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
return finishNode(ast.repeatStatement(condition, body));
}
// retstat ::= 'return' [exp {',' exp}] [';']
function parseReturnStatement(flowContext) {
expect('return');
var expressions = [];
if (!isEnd(token)) {
var expression = parseExpression(flowContext);
if (null != expression) {
expressions.push(expression);
while (!isEnd(token) && consume(',')) {
if (isEnd(token)) raiseUnexpectedToken('<expression>', previousToken);
expression = parseExpectedExpression(flowContext);
expressions.push(expression);
}
}
consume(';'); // grammar tells us ; is optional here.
}
return finishNode(ast.returnStatement(expressions));
}
// if ::= 'if' exp 'then' block {elif} ['else' block] 'end'
// elif ::= 'elseif' exp 'then' block
function parseIfStatement(flowContext) {
var canBeSingleLineIf = features.singleLineIf
, mustBeSingleLineIf = false
, canBeEmptySingleLineIf = features.allowEmptySingleLineIf;
// Here it _can_ if either:
// - no dangling `newLineIsEnd` (not within a single line statement)
// - no previous token
// - previous token is numeral
// - no character before statement
// - character before statement is whitespace or lineterminator
// - >= PICO-8-0.2.4
if (canBeSingleLineIf) {
canBeSingleLineIf = features.allowAnyBeforeSingleLineIf || !previousToken || NumericLiteral === previousToken.type;
// If the previous token is not a numeral (or beginning of stream), scan 1 character
// past the previous token expecting a blank character (whitespace or lineterminator)
if (!canBeSingleLineIf) {
var previousCharCode = input.charCodeAt(token.range[0]-1);
canBeSingleLineIf = isWhiteSpace(previousCharCode) || isLineTerminator(previousCharCode);
}
}
expect('if');
var clauses = []
, condition
, body
, marker;
// IfClauses begin at the same location as the parent IfStatement.
// It ends at the start of `end`, `else`, or `elseif`.
if (trackLocations) {
marker = locations[locations.length - 1];
locations.push(marker);
}
// Here it _can_ if: - the condition is in parentheses
if (canBeSingleLineIf)
canBeSingleLineIf = consume('(');
condition = parseExpectedExpression(flowContext);
if (canBeSingleLineIf) {
expect(')');
// Here it **must** if: - no 'then' token were found past the condition
mustBeSingleLineIf = !consume('then');
} else expect('then');
// No 'then' were found: the scope of the 'if' is implicitly opened
if (mustBeSingleLineIf) {
// The very next EOL is syntactically equivalent to a 'end'
newLineIsEnd = true;
// If the first token of the block is the punctuator ';', it can be the only statement
canBeEmptySingleLineIf = canBeEmptySingleLineIf && Punctuator === token.type && ';' === token.value;
}
if (options.scope) createScope();
flowContext.pushScope();
body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
clauses.push(finishNode(ast.ifClause(condition, body)));
// Single line 'if' does not accept 'elseif' clause.
if (mustBeSingleLineIf && 'elseif' === token.value) unexpected('elseif');
if (trackLocations) marker = createLocationMarker();
while (consume('elseif')) {
pushLocation(marker);
condition = parseExpectedExpression(flowContext);
expect('then');
if (options.scope) createScope();
flowContext.pushScope();
body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
clauses.push(finishNode(ast.elseifClause(condition, body)));
if (trackLocations) marker = createLocationMarker();
}
if (consume('else')) {
// Include the `else` in the location of ElseClause.
if (trackLocations) {
marker = new Marker(previousToken);
locations.push(marker);
}
if (options.scope) createScope();
flowContext.pushScope();
body = parseBlock(flowContext);
flowContext.popScope();
if (options.scope) destroyScope();
clauses.push(finishNode(ast.elseClause(body)));
}
// Single line 'if' cannot be empty, except:
// - if an 'else' clause is present, then it is ok (even if both are empty)
// - if the 'if' clause is closed by a proper 'end', then it may be empty
// - if the 'if' clause contains a ';' (>= PICO-8-0.2.3)
if (mustBeSingleLineIf && 0 === clauses[0].body.length && 1 === clauses.length && !canBeEmptySingleLineIf) {
var validEndToken = 'end' === token.value && index < length;
// This last index check is because `consumeEOF` sends an artificial 'end' token in case
// of dangling `newLineIsEnd`; though it does not count as a valid end here
if (!validEndToken)
raise(token, errors.expected, 'then', tokenValue(previousToken));
}
if (!consumeEnd()) expect('end');
return finishNode(ast.ifStatement(clauses));
}
// There are two types of for statements, generic and numeric.
//
// for ::= 'for' Name '=' exp ',' exp [',' exp] 'do' block 'end'
// for ::= 'for' namelist 'in' explist 'do' block 'end'
// namelist ::= Name {',' Name}
// explist ::= exp {',' exp}
function parseForStatement(flowContext) {
expect('for');
var variable = parseIdentifier()
, body;
// The start-identifier is local.
if (options.scope) {
createScope();
scopeIdentifier(variable);
}
// If the first expression is followed by a `=` punctuator, this is a
// Numeric For Statement.
if (consume('=')) {
// Start expression
var start = parseExpectedExpression(flowContext);
expect(',');
// End expression
var end = parseExpectedExpression(flowContext);
// Optional step expression
var step = consume(',') ? parseExpectedExpression(flowContext) : null;
expect('do');
flowContext.pushScope(true);
body = parseBlock(flowContext);
flowContext.popScope();
if (!consumeEnd()) expect('end');
if (options.scope) destroyScope();
return finishNode(ast.forNumericStatement(variable, start, end, step, body));
}
// If not, it's a Generic For Statement
else {
// The namelist can contain one or more identifiers.
var variables = [variable];
while (consume(',')) {
variable = parseIdentifier();
// Each variable in the namelist is locally scoped.
if (options.scope) scopeIdentifier(variable);
variables.push(variable);
}
expect('in');
var iterators = [];
// One or more expressions in the explist.
do {
var expression = parseExpectedExpression(flowContext);
iterators.push(expression);
} while (consume(','));
expect('do');
flowContext.pushScope(true);
body = parseBlock(flowContext);
flowContext.popScope();
if (!consumeEnd()) expect('end');
if (options.scope) destroyScope();
return finishNode(ast.forGenericStatement(variables, iterators, body));
}
}
// Local statements can either be variable assignments or function
// definitions. If a function definition is found, it will be delegated to
// `parseFunctionDeclaration()` with the isLocal flag.
//
// This AST structure might change into a local assignment with a function
// child.
//
// local ::= 'local' 'function' Name funcdecl
// | 'local' Name {',' Name} ['=' exp {',' exp}]
function parseLocalStatement(flowContext) {
expect('local');
var name
, declToken = previousToken;
if (Identifier === token.type) {
var variables = []
, init = [];
do {
name = parseIdentifier();
variables.push(name);
flowContext.addLocal(name.name, declToken);
} while (consume(','));
if (consume('=')) {
do {
var expression = parseExpectedExpression(flowContext);
init.push(expression);
} while (consume(','));
}
// Declarations doesn't exist before the statement has been evaluated.
// Therefore assignments can't use their declarator. And the identifiers
// shouldn't be added to the scope until the statement is complete.
if (options.scope) {
for (var i = 0, l = variables.length; i < l; ++i) {
scopeIdentifier(variables[i]);
}
}
return finishNode(ast.localStatement(variables, init));
}
if (consume('function')) {
name = parseIdentifier();
flowContext.addLocal(name.name, declToken);
if (options.scope) {
scopeIdentifier(name);
createScope();
}
// MemberExpressions are not allowed in local function statements.
return parseFunctionDeclaration(name, true);
} else {
raiseUnexpectedToken('<name>', token);
}
}
// assignment ::= varlist '=' explist
// var ::= Name | prefixexp '[' exp ']' | prefixexp '.' Name
// varlist ::= var {',' var}
// explist ::= exp {',' exp}
//
// call ::= callexp
// callexp ::= prefixexp args | prefixexp ':' Name args
function parseAssignmentOrCallStatement(flowContext) {
// Keep a reference to the previous token for better error messages in case
// of invalid statement
var previous = token
, marker, startMarker;
var lvalue, base, name;
var targets = [];
if (trackLocations) startMarker = createLocationMarker();
do {
if (trackLocations) marker = createLocationMarker();
if (Identifier === token.type) {
name = token.value;
base = parseIdentifier();
// Set the parent scope.
if (options.scope) attachScope(base, scopeHasName(name));
lvalue = true;
} else if ('(' === token.value) {
next();
base = parseExpectedExpression(flowContext);
expect(')');
lvalue = false;
} else {
return unexpected(token);
}
both: for (;;) {
var newBase;
switch (StringLiteral === token.type ? '"' : token.value) {
case '.':
case '[':
lvalue = true;
break;
case ':':
case '(':
case '{':
case '"':
lvalue = null;
break;
default:
break both;
}
base = parsePrefixExpressionPart(base, marker, flowContext);
}
targets.push(base);
if (',' !== token.value)
break;
if (!lvalue) {
return unexpected(token);
}
next();
} while (true);
if (targets.length === 1 && lvalue === null) {
pushLocation(marker);
return finishNode(ast.callStatement(targets[0]));
} else if (!lvalue) {
return unexpected(token);
}
var assignmentOperator = false;
// Try to find the operator if this is really an assignment operator statement
// XXX: not sure this should be done like this...
if (features.assignmentOperators && isAssignmentOperator(token)) {
assignmentOperator = token.value.slice(0, token.value.length-1);
next();
} else expect('=');
var values = [];
do {
values.push(parseExpectedExpression(flowContext));
} while (consume(','));
pushLocation(startMarker);
var assignmentNode = assignmentOperator ?
ast.assignmentOperatorStatement(assignmentOperator, targets, values)
: ast.assignmentStatement(targets, values);
return finishNode(assignmentNode);
}
// ### Non-statements
// Identifier ::= Name
function parseIdentifier() {
markLocation();
var identifier = token.value;
if (Identifier !== token.type) raiseUnexpectedToken('<name>', token);
next();
return finishNode(ast.identifier(identifier));
}
// Parse the functions parameters and body block. The name should already
// have been parsed and passed to this declaration function. By separating
// this we allow for anonymous functions in expressions.
//
// For local functions there's a boolean parameter which needs to be set
// when parsing the declaration.
//
// funcdecl ::= '(' [parlist] ')' block 'end'
// parlist ::= Name {',' Name} | [',' '...'] | '...'
function parseFunctionDeclaration(name, isLocal) {
var flowContext = makeFlowContext();
flowContext.pushScope();
var parameters = [];
expect('(');
// The declaration has arguments
if (!consume(')')) {
// Arguments are a comma separated list of identifiers, optionally ending
// with a vararg.
while (true) {
if (Identifier === token.type) {
var parameter = parseIdentifier();
// Function parameters are local.
if (options.scope) scopeIdentifier(parameter);
parameters.push(parameter);
if (consume(',')) continue;
}
// No arguments are allowed after a vararg.
else if (VarargLiteral === token.type) {
flowContext.allowVararg = true;
parameters.push(parsePrimaryExpression(flowContext));
} else {
raiseUnexpectedToken('<name> or \'...\'', token);
}
expect(')');
break;
}
}
var body = parseBlock(flowContext);
flowContext.popScope();
if (!consumeEnd()) expect('end');
if (options.scope) destroyScope();
isLocal = isLocal || false;
return finishNode(ast.functionStatement(name, parameters, isLocal, body));
}
// Parse the function name as identifiers and member expressions.
//
// Name {'.' Name} [':' Name]
function parseFunctionName() {
var base, name, marker;
if (trackLocations) marker = createLocationMarker();
base = parseIdentifier();
if (options.scope) {
attachScope(base, scopeHasName(base.name));
createScope();
}
while (consume('.')) {
pushLocation(marker);
name = parseIdentifier();
base = finishNode(ast.memberExpression(base, '.', name));
}
if (consume(':')) {
pushLocation(marker);
name = parseIdentifier();
base = finishNode(ast.memberExpression(base, ':', name));
if (options.scope) scopeIdentifierName('self');
}
return base;
}
// tableconstructor ::= '{' [fieldlist] '}'
// fieldlist ::= field {fieldsep field} fieldsep
// field ::= '[' exp ']' '=' exp | Name = 'exp' | exp
//
// fieldsep ::= ',' | ';'
function parseTableConstructor(flowContext) {
var fields = []
, key, value;
while (true) {
markLocation();
if (Punctuator === token.type && consume('[')) {
key = parseExpectedExpression(flowContext);
expect(']');
expect('=');
value = parseExpectedExpression(flowContext);
fields.push(finishNode(ast.tableKey(key, value)));
} else if (Identifier === token.type) {
if ('=' === lookahead.value) {
key = parseIdentifier();
next();
value = parseExpectedExpression(flowContext);
fields.push(finishNode(ast.tableKeyString(key, value)));
} else {
value = parseExpectedExpression(flowContext);
fields.push(finishNode(ast.tableValue(value)));
}
} else {
if (null == (value = parseExpression(flowContext))) {
locations.pop();
break;
}
fields.push(finishNode(ast.tableValue(value)));
}
if (',;'.indexOf(token.value) >= 0) {
next();
continue;
}
break;
}
expect('}');
return finishNode(ast.tableConstructorExpression(fields));
}
// Expression parser
// -----------------
//
// Expressions are evaluated and always return a value. If nothing is
// matched null will be returned.
//
// exp ::= (unop exp | primary | prefixexp ) { binop exp }
//
// primary ::= nil | false | true | Number | String | '...'
// | functiondef | tableconstructor
//
// prefixexp ::= (Name | '(' exp ')' ) { '[' exp ']'
// | '.' Name | ':' Name args | args }
//
function parseExpression(flowContext) {
var expression = parseSubExpression(0, flowContext);
return expression;
}
// Parse an expression expecting it to be valid.
function parseExpectedExpression(flowContext) {
var expression = parseExpression(flowContext);
if (null == expression) raiseUnexpectedToken('<expression>', token);
else return expression;
}
// Return the precedence priority of the operator.
//
// As unary `-` can't be distinguished from binary `-`, unary precedence
// isn't described in this table but in `parseSubExpression()` itself.
//
// As this function gets hit on every expression it's been optimized due to
// the expensive CompareICStub which took ~8% of the parse time.
function binaryPrecedence(operator) {
var charCode = operator.charCodeAt(0)
, length = operator.length;
if (1 === length) {
switch (charCode) {
case 94: return 12; // ^
case 92: return 10; // \
case 42: case 47: case 37: return 10; // * / %
case 43: case 45: return 9; // + -
case 38: return 6; // &
case 126: return features.smileyBitwiseXor && !features.alsoNormalBitwiseXor ? 0 : 5; // ~
case 124: return 4; // |
case 60: case 62: return 3; // < >
}
} else if (2 === length) {
switch (charCode) {
case 47: return 10; // //
case 46: return 8; // ..
case 60: case 62:
if ('<<' === operator || '>>' === operator) return 7; // << >>
return 3; // <= >=
case 94: return 12; // ^^
case 61: case 126: return 3; // == ~=
case 111: return 1; // or
} // Other 3-length token that can get here: 'end', 'and'
} else if (3 === length && (60 === charCode || 62 === charCode)) {
// The only operators that can make it here are '>>>', '<<>' and '>><'
return 7;
} else if (97 === charCode && 'and' === operator) return 2;
return 0;
}
// Implement an operator-precedence parser to handle binary operator
// precedence.
//
// We use this algorithm because it's compact, it's fast and Lua core uses
// the same so we can be sure our expressions are parsed in the same manner
// without excessive amounts of tests.
//
// exp ::= (unop exp | primary | prefixexp ) { binop exp }
function parseSubExpression(minPrecedence, flowContext) {
var operator = token.value
// The left-hand side in binary operations.
, expression, marker;
if (trackLocations) marker = createLocationMarker();
// UnaryExpression
if (isUnary(token)) {
markLocation();
next();
var argument = parseSubExpression(10, flowContext);
if (argument == null) raiseUnexpectedToken('<expression>', token);
expression = finishNode(ast.unaryExpression(operator, argument));
}
if (null == expression) {
// PrimaryExpression
expression = parsePrimaryExpression(flowContext);
// PrefixExpression
if (null == expression) {
expression = parsePrefixExpression(flowContext);
}
}
// This is not a valid left hand expression.
if (null == expression) return null;
var precedence;
while (true) {
operator = token.value;
precedence = (Punctuator === token.type || Keyword === token.type) ?
binaryPrecedence(operator) : 0;
if (precedence === 0 || precedence <= minPrecedence) break;
// Right-hand precedence operators
if ('^' === operator || '..' === operator) --precedence;
next();
var right = parseSubExpression(precedence, flowContext);
if (null == right) raiseUnexpectedToken('<expression>', token);
// Push in the marker created before the loop to wrap its entirety.
if (trackLocations) locations.push(marker);
expression = finishNode(ast.binaryExpression(operator, expression, right));
}
return expression;
}
// prefixexp ::= prefix {suffix}
// prefix ::= Name | '(' exp ')'
// suffix ::= '[' exp ']' | '.' Name | ':' Name args | args
//
// args ::= '(' [explist] ')' | tableconstructor | String
function parsePrefixExpressionPart(base, marker, flowContext) {
var expression, identifier;
if (Punctuator === token.type) {
switch (token.value) {
case '[':
pushLocation(marker);
next();
expression = parseExpectedExpression(flowContext);
expect(']');
return finishNode(ast.indexExpression(base, expression));
case '.':
pushLocation(marker);
next();
identifier = parseIdentifier();
return finishNode(ast.memberExpression(base, '.', identifier));
case ':':
pushLocation(marker);
next();
identifier = parseIdentifier();
base = finishNode(ast.memberExpression(base, ':', identifier));
// Once a : is found, this has to be a CallExpression, otherwise
// throw an error.
pushLocation(marker);
return parseCallExpression(base, flowContext);
case '(': case '{': // args
pushLocation(marker);
return parseCallExpression(base, flowContext);
}
} else if (StringLiteral === token.type) {
pushLocation(marker);
return parseCallExpression(base, flowContext);
}
return null;
}
function parsePrefixExpression(flowContext) {
var base, name, marker;
if (trackLocations) marker = createLocationMarker();
// The prefix
if (Identifier === token.type) {
name = token.value;
base = parseIdentifier();
// Set the parent scope.
if (options.scope) attachScope(base, scopeHasName(name));
} else if (consume('(')) {
base = parseExpectedExpression(flowContext);
expect(')');
} else {
return null;
}
// The suffix
for (;;) {
var newBase = parsePrefixExpressionPart(base, marker, flowContext);
if (newBase === null)
break;
base = newBase;
}
return base;
}
// args ::= '(' [explist] ')' | tableconstructor | String
function parseCallExpression(base, flowContext) {
if (Punctuator === token.type) {
switch (token.value) {
case '(':
if (!features.emptyStatement) {
if (token.line !== previousToken.line)
raise(null, errors.ambiguousSyntax, token.value);
}
next();
// List of expressions
var expressions = [];
var expression = parseExpression(flowContext);
if (null != expression) {
expressions.push(expression);
while (consume(',')) {
expression = parseExpectedExpression(flowContext);
expressions.push(expression);
}
}
expect(')');
return finishNode(ast.callExpression(base, expressions));
case '{':
markLocation();
next();
var table = parseTableConstructor(flowContext);
return finishNode(ast.tableCallExpression(base, table));
}
} else if (StringLiteral === token.type) {
return finishNode(ast.stringCallExpression(base, parsePrimaryExpression(flowContext)));
}
raiseUnexpectedToken('function arguments', token);
}
// primary ::= String | Numeric | nil | true | false
// | functiondef | tableconstructor | '...'
function parsePrimaryExpression(flowContext) {
var literals = StringLiteral | NumericLiteral | BooleanLiteral | NilLiteral | VarargLiteral
, value = token.value
, type = token.type
, marker;
if (trackLocations) marker = createLocationMarker();
if (type === VarargLiteral && !flowContext.allowVararg) {
raise(token, errors.cannotUseVararg, token.value);
}
if (type & literals) {
pushLocation(marker);
var raw = input.slice(token.range[0], token.range[1])
, rawInterrupted = token.rawInterrupted;
next();
return finishNode(ast.literal(type, value, raw, rawInterrupted));
} else if (Keyword === type && 'function' === value) {
pushLocation(marker);
next();
if (options.scope) createScope();
return parseFunctionDeclaration(null);
} else if (consume('{')) {
pushLocation(marker);
return parseTableConstructor(flowContext);
}
}
// Parser
// ------
// Export the main parser.
//
// - `wait` Hold parsing until end() is called. Defaults to false
// - `comments` Store comments. Defaults to true.
// - `scope` Track identifier scope. Defaults to false.
// - `locations` Store location information. Defaults to false.
// - `ranges` Store the start and end character locations. Defaults to
// false.
// - `onCreateNode` Callback which will be invoked when a syntax node is
// created.
// - `onCreateScope` Callback which will be invoked when a new scope is
// created.
// - `onDestroyScope` Callback which will be invoked when the current scope
// is destroyed.
//
// Example:
//
// var parser = require('pico8parse');
// parser.parse('i = 0');
exports.parse = parse;
var versionFeatures = {
'5.1': {
// Lua supports trailing "." in hex numerals from 5.2 onward; this "feature" keep
// from parsing that as correct for Lua 5.1
noTrailingDotInHexNumeral: true
}
, '5.2': {
labels: true
, emptyStatement: true
, hexEscapes: true
, skipWhitespaceEscape: true
, strictEscapes: true
, relaxedBreak: true
}
, '5.3': {
_inherits: ['5.2']
, unicodeEscapes: true
, bitwiseOperators: true
, integerDivision: true
}
, 'LuaJIT': {
// XXX: LuaJIT language features may depend on compilation options; may need to
// rethink how to handle this. Specifically, there is a LUAJIT_ENABLE_LUA52COMPAT
// that removes contextual goto. Maybe add 'LuaJIT-5.2compat' as well?
labels: true
, hexEscapes: true
, skipWhitespaceEscape: true
, strictEscapes: true
, unicodeEscapes: true
, contextualGoto: true
, imaginaryNumbers: true
, integerSuffixes: true
}
// NOTE: p8 file format layout (not the png.p8 but the text p8)
, 'PICO-8': {
strictP8FileFormat: true
, p8Sections: [
'__lua__'
, '__gfx__'
, '__gff__'
, '__label__'
, '__map__'
, '__sfx__'
, '__music__'
]
}
// NOTE: first implemented version (some features may have existed before 0.2.1)
, 'PICO-8-0.2.1': {
_inherits: ['5.2', 'PICO-8']
, integerSuffixes: false
, imaginaryNumbers: false
, bitwiseOperators: true
, integerDivision: false
, extendedIdentifiers: true
// Below rules were added for PICO-8
, binLiteral: true // eg. 0b101010
, noExponentLiteral: true // eg. 1e-1
, singleLineIf: true // if ::= 'if' '(' exp ')' block ['else' block] '\n'
, singleLineWhile: true // while ::= 'while' '(' exp ')' block '\n'
, singleLinePrint: true // slprint ::= '\n' '?' [explist] '\n' the result is a CallStatement node
, assignmentOperators: true // a += b
, traditionalNotEqual: true // a != b
, traditionalComments: true // '//' is a comment (this would take precedence on the int div)
, noDeepLongStringComments: true // '--[=*[' does not start a multiline (longstring) comment
, bitshiftAdditionalOperators: true // a >>> b a <<> b a >>< b (there assignment operators are added by "assignmentOperators: true")
, peekPokeOperators: true // @a %a $a
, backslashIntegerDivision: true // a \ b (also disables a // b ie. **makes it invalid** (maybe -- see "integerDivision: false" above), same about assignment operators)
, smileyBitwiseXor: true // a ^^ b (also disables a ~ b ie. **makes it invalid** (maybe), same about assignment operators)
}
, 'PICO-8-0.2.2': {
_inherits: ['PICO-8-0.2.1']
, p8scii: true // additional string escape sequences
}
, 'PICO-8-0.2.3': {
_inherits: ['PICO-8-0.2.2']
, singleLinePrintNoLineDependency: true // '?' shorthand can appear same line as an single line if/while
, allowEmptySingleLineIf: true // 'if' single line syntax may be empty of statement using a ';'
, allowEmptySingleLineWhile: true // 'while' single line syntax may be empty of statement using a ';'
}
, 'PICO-8-0.2.4': {
_inherits: ['PICO-8-0.2.3']
, allowAnyBeforeSingleLineIf: true // 'if' single line no longer needs to be preceded by a blank or number
, allowAnyBeforeSingleLineWhile: true // 'while' single line no longer needs to be preceded by a blank or number
}
, 'PICO-8-0.2.4c': {
_inherits: ['PICO-8-0.2.4']
, p8Sections: [
'__lua__'
, '__gfx__'
, '__gff__'
, '__label__'
, '__map__'
, '__sfx__'
, '__music__'
, '__meta:' // (officially:) << with a heading of '__meta:somestring__' are preserved by, but not (yet?) utilised by PICO-8 itself >>
]
}
, 'PICO-8-0.2.5': {
_inherits: ['PICO-8-0.2.4c']
, alsoNormalBitwiseXor: true // re-enables a ~ b (i hate you)
}
};
// Expand the '_inherits' of each version (recursively).
/* istanbul ignore next */ function expandInherited(_versionId) {
if ('undefined' !== typeof _versionId) {
var features = versionFeatures[_versionId];
if (Object.hasOwnProperty.call(features, '_inherits') && isArray(features._inherits)) {
for (var k = 0; k < features._inherits.length; k++) {
var inherited = expandInherited(features._inherits[k]);
// Entries in "features" (child) will override inherited ones (that are in "inherited")
features = assign({}, inherited, features);
}
features._inherits = [];
}
return features;
}
// No version provided, expand all inplace
for (var versionId in versionFeatures)
if (Object.hasOwnProperty.call(versionFeatures, versionId))
versionFeatures[versionId] = expandInherited(versionId);
}
expandInherited();
exports.versionFeatures = versionFeatures;
function parse(_input, _options) {
if ('undefined' === typeof _options && 'object' === typeof _input) {
_options = _input;
_input = undefined;
}
if (!_options) _options = {};
input = _input || '';
options = assign({}, defaultOptions, _options);
// Rewind the lexer
index = 0;
line = 1;
lineStart = 0;
length = input.length;
previousToken = undefined;
token = undefined;
lookahead = undefined;
fakeToken = undefined;
comments = undefined;
tokenStart = undefined;
currentP8Section = undefined;
newLineIsEnd = false;
foundEndIsNewLine = false;
newLineIsClose = false;
// When tracking identifier scope, initialize with an empty scope.
scopes = [[]];
scopeDepth = 0;
globals = [];
locations = [];
if (!Object.prototype.hasOwnProperty.call(versionFeatures, options.luaVersion)) {
throw new Error(sprintf("Lua version '%1' not supported", options.luaVersion));
}
features = assign({}, versionFeatures[options.luaVersion]);
if (options.extendedIdentifiers !== void 0)
features.extendedIdentifiers = !!options.extendedIdentifiers;
if (!Object.prototype.hasOwnProperty.call(encodingModes, options.encodingMode)) {
throw new Error(sprintf("Encoding mode '%1' not supported", options.encodingMode));
}
encodingMode = encodingModes[options.encodingMode];
if (options.comments) comments = [];
if (!options.wait) return end();
return exports;
}
// Write to the source code buffer without beginning the parse.
exports.write = write;
function write(_input) {
input += String(_input);
length = input.length;
return exports;
}
// Send an EOF and begin parsing.
exports.end = end;
function end(_input) {
if ('undefined' !== typeof _input) write(_input);
var revertStrictP8FileFormat = false;
if (!features.strictP8FileFormat) {
// Ignore shebangs.
if (input && input.substr(0, 2) === '#!')
while (index < length && !isLineTerminator(input.charCodeAt(++index)));
} else {
if (!options.ignoreStrictP8FileFormat) {
// Check for header
index = input.indexOf('p');
if (input.indexOf('\n') < index || "pico-8 cartridge" !== input.slice(index, index+16)) raise(null, errors.missingHeader, "pico-8 cartridge");
index += 15;
// Ignore the header line
while (index < length && !isLineTerminator(input.charCodeAt(++index)));
consumeEOL();
// Ignore the following line
while (index < length && !isLineTerminator(input.charCodeAt(index))) index++;
// Ignore until first valid p8Section
var match;
do {
match = input.slice(++index).match(/^__.*?__/m);
if (null === match) break;
index += match.index;
currentP8Section = scanP8SectionStart();
} while (null === currentP8Section);
// Reaching the end of stream before finding anything is fine (content is just discarded)
if (!match) index = input.length;
// Count any newline that were passed (the slice [0:index] ends with a EOL)
else line = input.slice(0, index).split('\n').length;
} else {
revertStrictP8FileFormat = true;
features.strictP8FileFormat = false;
}
if (!currentP8Section) currentP8Section = '__lua__';
}
length = input.length;
trackLocations = options.locations || options.ranges;
// Initialize with a lookahead token.
lookahead = lex();
var chunk = parseChunk();
if (options.comments) chunk.comments = comments;
if (options.scope) chunk.globals = globals;
if (revertStrictP8FileFormat) features.strictP8FileFormat = true;
/* istanbul ignore if */
if (locations.length > 0)
throw new Error('Location tracking failed. This is most likely a bug in pico8parse.');
return chunk;
}
exports['default'] = exports;
}));
/* vim: set sw=2 ts=2 et tw=79 : */
|