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
|
// ---------------------------------------------------------------------------
// Copyright (C) 2006 Microsoft Corporation All Rights Reserved
// ---------------------------------------------------------------------------
#define CODE_ANALYSIS
using System.CodeDom;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
using System.Reflection;
using System.Workflow.ComponentModel;
using System.Workflow.ComponentModel.Compiler;
using System.Workflow.Activities.Common;
#region Grammar
//
// Grammar (left-factored with empty productions removed):
// ----------------------------------------------------------
//
// condition --> binary-expression
//
// binary-expression --> unary-expresssion binary-expression-tail
// --> unary-expression
//
// binary-expression-tail --> binary-operator-precedence unary-expression binary-expression-tail
// --> binary-operator-precedence unary-expression
//
// binary-operator-precedence --> 0:{ || OR }
// --> 1:{ && AND }
// --> 2:{ | }
// --> 3:{ & }
// --> 4:{ == != }
// --> 5:{ < > <= >= }
// --> 6:{ + - }
// --> 7:{ * / % MOD }
//
// unary-expression --> unary-operator unary-expression
// --> postfix-expression
//
// unary-operator --> -
// --> !
// --> NOT
// --> ( type-spec )
//
// postfix-expression --> primary-expression postfix-expression-tail
// --> primary-expression
//
// postfix-expression-tail --> postfix-operator postfix-expression-tail
// --> postfix-operator
//
// postfix-operator --> member-operator
// --> element-operator
//
// member-operator --> . IDENTIFIER method-call-arguments
// --> . IDENTIFIER
//
// element-operator --> [ expression-list ]
//
// expression-list --> logical-expression expression-list-tail
// --> logical-expression
//
// expression-list-tail --> , logical-expression expression-list-tail
// --> , logical-expression
//
// method-call-arguments --> ( argument-list )
// --> ( )
//
// argument-list --> argument argument-list-tail
// --> argument
//
// argument-list-tail --> , argument argument-list-tail
// --> , argument
//
// argument --> direction logical-expression
// --> logical-expression
//
// direction --> IN
// --> OUT
// --> REF
//
// primary-expression --> ( logical-expression )
// --> IDENTIFIER
// --> IDENTIFIER method-call-arguments
// --> type-name
// --> object-creation-expression
// --> array-creation-expression
// --> THIS
// --> integer-constant
// --> decimal-constant
// --> float-constant
// --> character-constant
// --> string-constant
// --> TRUE
// --> FALSE
// --> NULL
//
// object-creation-expression --> NEW type-name method-call-arguments
//
// array-creation-expression --> NEW array-spec
// --> NEW array-spec array-initializer
//
// array-spec --> type-name array-rank-specifiers
//
// array-rank-specifiers --> [ binary-expression ]
// --> [ ]
//
// array-initializer --> { variable-initializer-list }
// { }
//
// variable-initializer-list --> variable-initializer variable-initializer-list-tail
// --> variable-initializer
//
// variable-initializer-list-tail --> , variable-initializer variable-initializer-list-tail
// --> , variable-initializer
//
// variable-initializer --> binary-expression
//
// type-spec --> type-name
// --> type-name rank-specifiers
//
// rank-specifiers --> rank-specifier rank-specifier-tail
// --> rank-specifier
//
// rank-specifier-tail --> rank-specifier rank-specifier-tail
//
// rank-specifier --> [ dim-separators ]
// --> [ ]
//
// dim-separators --> , dim-separators-tail
// --> ,
//
// dim-separators-tail --> , dim-separators-tail
//
// type-name --> CHAR
// --> BYTE
// --> SBYTE
// --> SHORT
// --> USHORT
// --> INT
// --> UINT
// --> LONG
// --> ULONG
// --> FLOAT
// --> DOUBLE
// --> DECIMAL
// --> BOOL
// --> STRING
// --> namespace-qualified-type-name
//
// namespace-qualified-type-name --> NAMESPACE-NAME namespace-qualifier-tail . TYPE-NAME
// --> NAMESPACE-NAME . TYPE-NAME
// --> TYPE-NAME
//
// namespace-qualifier-tail --> . NAMESPACE-NAME namespace-qualifier-tail
//
// statement-list --> statement statement-list-tail
// --> statement
//
// statement-list-tail --> statement statement-list-tail
// --> statement
//
// statement --> assign-statement
// --> update-statement
// --> HALT
//
// assign-statement --> postfix-expression ASSIGN logical-expression
// --> postfix-expression
//
// update-statement --> UPDATE ( "path" )
// --> UPDATE postfix-expression
#endregion
namespace System.Workflow.Activities.Rules
{
#region ParserContext class
internal class ParserContext
{
private List<Token> tokens;
private int currentToken;
internal Dictionary<object, int> exprPositions = new Dictionary<object, int>();
internal bool provideIntellisense;
internal ICollection completions;
internal ParserContext(string expressionString)
{
Scanner scanner = new Scanner(expressionString);
tokens = new List<Token>();
scanner.Tokenize(tokens);
}
internal ParserContext(List<Token> tokens)
{
this.provideIntellisense = true;
this.tokens = tokens;
}
#region Token methods
internal Token CurrentToken
{
get { return (currentToken < tokens.Count) ? tokens[currentToken] : null; }
}
internal Token NextToken()
{
if (currentToken == tokens.Count - 1)
{
++currentToken; // point one past the end.
return null;
}
++currentToken;
return tokens[currentToken];
}
internal int SaveCurrentToken()
{
return currentToken;
}
internal void RestoreCurrentToken(int tokenValue)
{
currentToken = tokenValue;
}
#endregion
#region Intellisense methods
internal void SetNamespaceCompletions(NamespaceSymbol nsSym)
{
completions = nsSym.GetMembers();
}
[SuppressMessage("Microsoft.Maintainability", "CA1502:AvoidExcessiveComplexity")]
internal void SetTypeMemberCompletions(Type computedType, Type thisType, bool isStatic, RuleValidation validation)
{
BindingFlags flags = BindingFlags.Public;
if (isStatic)
flags |= BindingFlags.Static | BindingFlags.FlattenHierarchy;
else
flags |= BindingFlags.Instance;
if (computedType.Assembly == thisType.Assembly)
flags |= BindingFlags.NonPublic;
// Initialize the list with the computed type's members.
List<MemberInfo> members = new List<MemberInfo>(computedType.GetMembers(flags));
if (computedType.IsInterface)
{
// If it's an interface, we need to chase up the parents and add their members too.
List<Type> baseInterfaces = new List<Type>(computedType.GetInterfaces());
for (int i = 0; i < baseInterfaces.Count; ++i)
{
Type baseInterface = baseInterfaces[i];
baseInterfaces.AddRange(baseInterface.GetInterfaces());
members.AddRange(baseInterface.GetMembers(flags));
}
// Finally, we need to add members of System.Object, since all types intrinsically
// derive from that.
members.AddRange(typeof(object).GetMembers(flags));
}
// add in any extension methods that may be applicable to this type
List<ExtensionMethodInfo> ext = validation.ExtensionMethods;
foreach (ExtensionMethodInfo extension in ext)
{
ValidationError error;
if (RuleValidation.TypesAreAssignable(computedType, extension.AssumedDeclaringType, null, out error))
{
members.Add(extension);
}
}
// Filter out the duplicates & special names.
Dictionary<string, MemberInfo> filteredMembers = new Dictionary<string, MemberInfo>();
foreach (MemberInfo member in members)
{
if (member == null)
continue;
switch (member.MemberType)
{
case MemberTypes.Method:
MethodInfo method = (MethodInfo)member;
// If method, exclude special names & generic methods.
if (!method.IsSpecialName && !method.IsGenericMethod)
{
// Add all members of this's type, but only non-private members
// of other types.
if (method.DeclaringType == thisType || IsNonPrivate(method, thisType) || (method is ExtensionMethodInfo))
filteredMembers[member.Name] = member;
}
break;
case MemberTypes.NestedType:
case MemberTypes.TypeInfo:
// Only add nested types if "isStatic" is true.
if (isStatic)
{
if (member.DeclaringType == thisType || IsNonPrivate((Type)member, thisType))
{
filteredMembers[member.Name] = member;
}
}
break;
case MemberTypes.Field:
// Add all members of this's type, but only non-private members
// of other types.
if (member.DeclaringType == thisType || IsNonPrivate((FieldInfo)member, thisType))
filteredMembers[member.Name] = member;
break;
case MemberTypes.Property:
PropertyInfo prop = (PropertyInfo)member;
ParameterInfo[] propParams = prop.GetIndexParameters();
if (propParams != null && propParams.Length > 0)
{
// If the property has arguments, it can only be accessed by directly calling
// its accessor methods.
MethodInfo[] accessors = prop.GetAccessors((flags & BindingFlags.NonPublic) != 0);
foreach (MethodInfo accessor in accessors)
{
if (accessor.DeclaringType == thisType || IsNonPrivate(accessor, thisType))
filteredMembers[accessor.Name] = accessor;
}
}
else
{
if (member.DeclaringType == thisType)
{
// It's a property on "this", so add it even if it's private.
filteredMembers[member.Name] = member;
}
else
{
// Add the property if at least one of its accessors is non-private.
MethodInfo[] accessors = prop.GetAccessors((flags & BindingFlags.NonPublic) != 0);
foreach (MethodInfo accessor in accessors)
{
if (IsNonPrivate(accessor, thisType))
{
filteredMembers[member.Name] = member;
break;
}
}
}
}
break;
default:
// Don't add constructors or other non-method/field/property things
// to the completion list.
break;
}
}
completions = filteredMembers.Values;
}
internal void SetConstructorCompletions(Type computedType, Type thisType)
{
BindingFlags flags = BindingFlags.Public | BindingFlags.FlattenHierarchy | BindingFlags.Instance;
if (computedType.Assembly == thisType.Assembly)
flags |= BindingFlags.NonPublic;
// Initialize the list with the computed type's members.
List<Type> types = new List<Type>(1);
types.Add(computedType);
completions = RuleValidation.GetConstructors(types, flags);
}
internal void SetNestedClassCompletions(Type computedType, Type thisType)
{
BindingFlags flags = BindingFlags.Public | BindingFlags.FlattenHierarchy | BindingFlags.Instance;
if (computedType.Assembly == thisType.Assembly)
flags |= BindingFlags.NonPublic;
// Initialize the list with the computed type's members (no need for interfaces or extension methods)
List<MemberInfo> members = new List<MemberInfo>(computedType.GetMembers(flags));
// Filter out the duplicates & special names.
Dictionary<string, MemberInfo> filteredMembers = new Dictionary<string, MemberInfo>();
foreach (MemberInfo member in members)
{
if (member == null)
continue;
switch (member.MemberType)
{
case MemberTypes.NestedType:
case MemberTypes.TypeInfo:
if (member.DeclaringType == thisType || IsNonPrivate((Type)member, thisType))
{
filteredMembers[member.Name] = member;
}
break;
default:
// Don't add constructors/method/field/property things to the completion list.
break;
}
}
completions = filteredMembers.Values;
}
internal void SetMethodCompletions(Type computedType, Type thisType, string methodName, bool includeStatic, bool includeInstance, RuleValidation validation)
{
BindingFlags flags = BindingFlags.Public;
if (computedType.Assembly == thisType.Assembly)
flags |= BindingFlags.NonPublic;
if (includeInstance)
flags |= BindingFlags.Instance;
if (includeStatic)
flags |= BindingFlags.Static | BindingFlags.FlattenHierarchy;
List<MemberInfo> candidateMethods = new List<MemberInfo>();
MemberInfo[] methods = computedType.GetMember(methodName, MemberTypes.Method, flags);
AddCandidates(candidateMethods, methods);
if (computedType.IsInterface)
{
List<Type> parentInterfaces = new List<Type>();
parentInterfaces.AddRange(computedType.GetInterfaces());
for (int i = 0; i < parentInterfaces.Count; ++i)
{
methods = parentInterfaces[i].GetMember(methodName, MemberTypes.Method, flags);
AddCandidates(candidateMethods, methods);
Type[] pInterfaces = parentInterfaces[i].GetInterfaces();
if (pInterfaces.Length > 0)
parentInterfaces.AddRange(pInterfaces);
}
// Add members from System.Object as well.
methods = typeof(object).GetMember(methodName, MemberTypes.Method, flags);
AddCandidates(candidateMethods, methods);
}
// add in any extension methods
List<ExtensionMethodInfo> ext = validation.ExtensionMethods;
foreach (ExtensionMethodInfo extension in ext)
{
// does it have the right name and is the type compatible
ValidationError error;
if ((extension.Name == methodName) &&
(RuleValidation.TypesAreAssignable(computedType, extension.AssumedDeclaringType, null, out error)))
{
candidateMethods.Add(extension);
}
}
completions = candidateMethods;
}
private static void AddCandidates(List<MemberInfo> candidateMethods, MemberInfo[] methods)
{
if (methods != null)
{
for (int m = 0; m < methods.Length; ++m)
{
System.Diagnostics.Debug.Assert(methods[m].MemberType == MemberTypes.Method, "expect methods only");
MethodInfo method = (MethodInfo)methods[m];
if (!method.IsGenericMethod) // Skip generic methods.
candidateMethods.Add(method);
}
}
}
internal static bool IsNonPrivate(
MethodInfo methodInfo, Type thisType)
{
return methodInfo.IsPublic
|| methodInfo.IsFamily
|| methodInfo.IsFamilyOrAssembly
|| (methodInfo.IsAssembly || methodInfo.IsFamilyAndAssembly)
&& (methodInfo.DeclaringType.Assembly == thisType.Assembly);
}
internal static bool IsNonPrivate(
FieldInfo fieldInfo, Type thisType)
{
return fieldInfo.IsPublic
|| fieldInfo.IsFamily
|| fieldInfo.IsFamilyOrAssembly
|| (fieldInfo.IsAssembly || fieldInfo.IsFamilyAndAssembly)
&& (fieldInfo.DeclaringType.Assembly == thisType.Assembly);
}
internal static bool IsNonPrivate(
Type type, Type thisType)
{
return (type.IsPublic || type.IsNestedPublic
|| (type.IsNestedAssembly || type.IsNestedFamANDAssem || type.IsNestedFamORAssem)
&& (type.Assembly == thisType.Assembly));
}
internal int NumTokens
{
get { return tokens.Count; }
}
#endregion
}
#endregion
internal class Parser
{
#region Binary Operator Precedence-Parsing Descriptors
private class BinaryOperationDescriptor
{
private TokenID token;
private CodeBinaryOperatorType codeDomOperator;
internal BinaryOperationDescriptor(TokenID token, CodeBinaryOperatorType codeDomOperator)
{
this.token = token;
this.codeDomOperator = codeDomOperator;
}
internal TokenID Token { get { return token; } }
internal virtual CodeBinaryOperatorExpression CreateBinaryExpression(CodeExpression left, CodeExpression right, int operatorPosition, Parser parser, ParserContext parserContext, bool assignIsEquality)
{
CodeBinaryOperatorExpression binaryExpr = new CodeBinaryOperatorExpression(left, codeDomOperator, right);
parserContext.exprPositions[binaryExpr] = operatorPosition;
parser.ValidateExpression(parserContext, binaryExpr, assignIsEquality, ValueCheck.Read);
return binaryExpr;
}
}
private class NotEqualOperationDescriptor : BinaryOperationDescriptor
{
internal NotEqualOperationDescriptor(TokenID token)
: base(token, CodeBinaryOperatorType.IdentityInequality) // kludge
{
}
internal override CodeBinaryOperatorExpression CreateBinaryExpression(CodeExpression left, CodeExpression right, int operatorPosition, Parser parser, ParserContext parserContext, bool assignIsEquality)
{
CodePrimitiveExpression falseExpr = new CodePrimitiveExpression(false);
parserContext.exprPositions[falseExpr] = operatorPosition;
// Compare the comperands using "value-equality"
CodeBinaryOperatorExpression binaryExpr = new CodeBinaryOperatorExpression(left, CodeBinaryOperatorType.ValueEquality, right);
parserContext.exprPositions[binaryExpr] = operatorPosition;
// Compare the result of that with false to simulate "value-inequality"
binaryExpr = new CodeBinaryOperatorExpression(binaryExpr, CodeBinaryOperatorType.ValueEquality, falseExpr);
parserContext.exprPositions[binaryExpr] = operatorPosition;
parser.ValidateExpression(parserContext, binaryExpr, assignIsEquality, ValueCheck.Read);
return binaryExpr;
}
}
private class BinaryPrecedenceDescriptor
{
private BinaryOperationDescriptor[] operations;
internal BinaryPrecedenceDescriptor(params BinaryOperationDescriptor[] operations)
{
this.operations = operations;
}
internal BinaryOperationDescriptor FindOperation(TokenID token)
{
foreach (BinaryOperationDescriptor operation in operations)
{
if (operation.Token == token)
return operation;
}
return null;
}
}
private static readonly BinaryPrecedenceDescriptor[] precedences = new BinaryPrecedenceDescriptor[] {
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.Or, CodeBinaryOperatorType.BooleanOr)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.And, CodeBinaryOperatorType.BooleanAnd)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.BitOr, CodeBinaryOperatorType.BitwiseOr)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.BitAnd, CodeBinaryOperatorType.BitwiseAnd)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.Equal, CodeBinaryOperatorType.ValueEquality),
new BinaryOperationDescriptor(TokenID.Assign, CodeBinaryOperatorType.ValueEquality),
new NotEqualOperationDescriptor(TokenID.NotEqual)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.Less, CodeBinaryOperatorType.LessThan),
new BinaryOperationDescriptor(TokenID.LessEqual, CodeBinaryOperatorType.LessThanOrEqual),
new BinaryOperationDescriptor(TokenID.Greater, CodeBinaryOperatorType.GreaterThan),
new BinaryOperationDescriptor(TokenID.GreaterEqual, CodeBinaryOperatorType.GreaterThanOrEqual)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.Plus, CodeBinaryOperatorType.Add),
new BinaryOperationDescriptor(TokenID.Minus, CodeBinaryOperatorType.Subtract)),
new BinaryPrecedenceDescriptor(new BinaryOperationDescriptor(TokenID.Multiply, CodeBinaryOperatorType.Multiply),
new BinaryOperationDescriptor(TokenID.Divide, CodeBinaryOperatorType.Divide),
new BinaryOperationDescriptor(TokenID.Modulus, CodeBinaryOperatorType.Modulus))
};
#endregion
// Data members
private RuleValidation validation;
private Dictionary<string, Symbol> globalUniqueSymbols = new Dictionary<string, Symbol>();
private Dictionary<string, Symbol> localUniqueSymbols = new Dictionary<string, Symbol>();
[Flags]
enum ValueCheck
{
Unknown = 0,
Read = 1,
Write = 2
}
#region Constructor
[SuppressMessage("Microsoft.Performance", "CA1800:DoNotCastUnnecessarily")]
[SuppressMessage("Microsoft.Maintainability", "CA1502:AvoidExcessiveComplexity")]
internal Parser(RuleValidation validation)
{
this.validation = validation;
Type[] allTypes = null;
ITypeProvider provider = validation.GetTypeProvider();
if (provider == null)
{
// No type provider. The only type we know about is "This".
//allTypes = new Type[] { validation.ThisType };
try
{
allTypes = validation.ThisType.Assembly.GetTypes();
}
catch (ReflectionTypeLoadException e)
{
// problems loading all the types, take what we can get
allTypes = e.Types;
}
}
else
{
allTypes = provider.GetTypes();
}
// Go through all the known types and gather namespace information.
// Also note which types are uniquely named; these can be looked up without
// qualification.
Dictionary<string, NamespaceSymbol> rootNamespaces = new Dictionary<string, NamespaceSymbol>();
Dictionary<string, object> duplicateNames = new Dictionary<string, object>();
NamespaceSymbol nsSym = null;
Symbol existingSymbol = null;
NamespaceSymbol globalNS = null; // In case we encounter a type without a namespace
for (int i = 0; i < allTypes.Length; ++i)
{
Type type = allTypes[i];
// If we got a ReflectionTypeLoadException, some types may be null, so skip them
if (type == null)
continue;
// Skip types that are not visible.
// (If type.Assembly == null, we assume it's a design-time type, and let it through.)
if (type.IsNotPublic && (type.Assembly != null && type.Assembly != validation.ThisType.Assembly))
continue;
// Skip nested types.
if (type.IsNested)
continue;
// Add the namespaces.
string typeNamespace = type.Namespace;
if (string.IsNullOrEmpty(typeNamespace))
{
if (globalNS == null)
{
globalNS = new NamespaceSymbol();
rootNamespaces.Add("", globalNS);
}
nsSym = globalNS;
}
else
{
string[] namespaces = typeNamespace.Split('.');
System.Diagnostics.Debug.Assert(namespaces.Length > 0);
if (!rootNamespaces.TryGetValue(namespaces[0], out nsSym))
{
nsSym = new NamespaceSymbol(namespaces[0], null);
rootNamespaces.Add(namespaces[0], nsSym);
// Also add the root namespace to the global unique symbol dictionary.
// Replace anything that was there. I.e., we had MS.Test.Foo,
// and this current one is Test.Bar. It wins.
globalUniqueSymbols[namespaces[0]] = nsSym;
}
if (namespaces.Length > 1)
{
for (int j = 1; j < namespaces.Length; ++j)
{
nsSym = nsSym.AddNamespace(namespaces[j]);
if (globalUniqueSymbols.TryGetValue(namespaces[j], out existingSymbol))
{
// This sub-namespace is already in global unique symbols.
// If it's the same one as what's there, no problem.
NamespaceSymbol existingNS = existingSymbol as NamespaceSymbol;
if (existingNS != null && existingNS.Parent != nsSym.Parent)
{
// It was different. If the levels are the same, it's a duplicate name.
if (existingNS.Level == nsSym.Level)
{
duplicateNames[namespaces[j]] = null;
}
else
{
// If the new one is at a lower level than the existing one,
// replace it. Otherwise, leave the existing one there.
if (nsSym.Level < existingNS.Level)
globalUniqueSymbols[namespaces[j]] = nsSym;
}
}
}
else
{
globalUniqueSymbols.Add(namespaces[j], nsSym);
}
}
}
}
// Add the type to its namespace.
nsSym.AddType(type);
}
// Remove non-unique namespaces.
foreach (string name in duplicateNames.Keys)
globalUniqueSymbols.Remove(name);
Queue<NamespaceSymbol> nsQueue = new Queue<NamespaceSymbol>();
foreach (NamespaceSymbol rootNS in rootNamespaces.Values)
nsQueue.Enqueue(rootNS);
// Add the unique types as well.
duplicateNames.Clear();
while (nsQueue.Count > 0)
{
nsSym = nsQueue.Dequeue();
foreach (Symbol nestedSym in nsSym.NestedSymbols.Values)
{
NamespaceSymbol nestedNS = nestedSym as NamespaceSymbol;
if (nestedNS != null)
{
nsQueue.Enqueue(nestedNS);
}
else
{
string name = nestedSym.Name;
if (globalUniqueSymbols.TryGetValue(name, out existingSymbol))
{
// Found an existing one with the same name.
if (existingSymbol is NamespaceSymbol)
{
// A type name matches a namespace name... namespace wins.
continue;
}
else
{
TypeSymbolBase existingTypeSymBase = (TypeSymbolBase)existingSymbol;
TypeSymbolBase typeSymBase = (TypeSymbolBase)nestedSym;
OverloadedTypeSymbol overloadSym = existingTypeSymBase.OverloadType(typeSymBase);
if (overloadSym == null)
duplicateNames[name] = null; // Couldn't overload it.
else
globalUniqueSymbols[name] = overloadSym;
}
}
else
{
globalUniqueSymbols.Add(name, nestedSym);
}
}
}
}
// Remove non-unique types.
foreach (string name in duplicateNames.Keys)
globalUniqueSymbols.Remove(name);
// Finally, deal with the members of "this".
//
// Nested types override/hide items in the global unique symbols list.
//
// All other members get added to the local unique symbols list. In most
// contexts, these will override (replace, hide) any global symbols with the same name.
// In contexts where the parser is only looking for types and/or namespaces, local
// symbols do NOT hide global ones.
Type thisType = validation.ThisType;
MemberInfo[] members = thisType.GetMembers(BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.Instance | BindingFlags.Static | BindingFlags.FlattenHierarchy);
foreach (MemberInfo mi in members)
{
switch (mi.MemberType)
{
case MemberTypes.Field:
if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate((FieldInfo)mi, thisType))
localUniqueSymbols[mi.Name] = new MemberSymbol(mi);
break;
case MemberTypes.Property:
PropertyInfo prop = (PropertyInfo)mi;
ParameterInfo[] propParams = prop.GetIndexParameters();
if (propParams != null && propParams.Length > 0)
{
// If the property has arguments, it can only be accessed by directly calling
// its accessor methods.
MethodInfo[] accessors = prop.GetAccessors(true);
foreach (MethodInfo accessor in accessors)
{
if (accessor.DeclaringType == thisType || ParserContext.IsNonPrivate(accessor, thisType))
localUniqueSymbols[mi.Name] = new MemberSymbol(accessor);
}
}
else
{
if (mi.DeclaringType == thisType)
{
// It's a property on "this", so add it even if it's private.
localUniqueSymbols[mi.Name] = new MemberSymbol(mi);
}
else
{
// Add the property if at least one of its accessors is non-private.
MethodInfo[] accessors = prop.GetAccessors(true);
foreach (MethodInfo accessor in accessors)
{
if (ParserContext.IsNonPrivate(accessor, thisType))
{
localUniqueSymbols[mi.Name] = new MemberSymbol(mi);
break;
}
}
}
}
break;
case MemberTypes.Method:
MethodInfo method = (MethodInfo)mi;
if (!method.IsSpecialName && !method.IsGenericMethod)
{
if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate(method, thisType))
{
// These simply hide anything else of the same name.
localUniqueSymbols[mi.Name] = new MemberSymbol(mi);
}
}
break;
case MemberTypes.NestedType:
case MemberTypes.TypeInfo: // Same thing but only happens with DesignTimeTypes
// These can overload or hide global unique symbols.
Type miType = (Type)mi;
TypeSymbol memberSym = new TypeSymbol(miType);
if (globalUniqueSymbols.TryGetValue(memberSym.Name, out existingSymbol))
{
TypeSymbolBase existingTypeSymBase = existingSymbol as TypeSymbolBase;
if (existingTypeSymBase != null)
{
// Try to overload.
OverloadedTypeSymbol overloadSym = existingTypeSymBase.OverloadType(memberSym);
if (overloadSym == null)
{
if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate(miType, thisType))
{
// We couldn't overload it, so hide it.
globalUniqueSymbols[memberSym.Name] = memberSym;
}
}
else if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate(miType, thisType))
{
globalUniqueSymbols[memberSym.Name] = overloadSym;
}
}
else
{
// The name clashed with something that wasn't a type name.
// Hide the outer one.
if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate((Type)mi, thisType))
globalUniqueSymbols[memberSym.Name] = memberSym;
}
}
else
{
if (mi.DeclaringType == thisType || ParserContext.IsNonPrivate(miType, thisType))
{
globalUniqueSymbols[memberSym.Name] = memberSym;
}
}
break;
default:
break;
}
}
}
#endregion
private RuleValidation Validator
{
get { return validation; }
}
#region Intellisense Methods
internal ICollection GetExpressionCompletions(string expressionString)
{
try
{
IntellisenseParser intellisenseParser = new IntellisenseParser(expressionString);
ParserContext parserContext = intellisenseParser.BackParse();
if (parserContext != null)
{
Token token = parserContext.CurrentToken;
// Check to see if the only relevant token (there's always an EndOfInput padded
// at the end) is an identifier with only one character.
if (parserContext.NumTokens == 2 && token.TokenID == TokenID.Identifier)
{
string ident = (string)token.Value;
System.Diagnostics.Debug.Assert(parserContext.NextToken().TokenID == TokenID.EndOfInput);
if (ident.Length == 1)
{
// The postfix expression consisted of a single character which was the beginning
// of an identifier or keyword. Don't parse anything; just return all the root completions.
return GetRootCompletions(ident[0]);
}
// Otherwise, we don't do anything.
}
else
{
// We have a set of tokens we need to parse to figure out what's going on.
validation.Errors.Clear();
ParsePostfixExpression(parserContext, true, ValueCheck.Read);
return parserContext.completions;
}
}
}
catch (RuleSyntaxException ex)
{
// Just ignore these, but when this happens, the completion list will be null.
if (ex.ErrorNumber != 0)
return null;
}
return null;
}
private ICollection GetRootCompletions(char firstCharacter)
{
ArrayList rootCompletions = new ArrayList();
char upperFirstCharacter = char.ToUpper(firstCharacter, CultureInfo.InvariantCulture);
// Find all the global namespaces & types that start with the first character.
foreach (KeyValuePair<string, Symbol> kvp in globalUniqueSymbols)
{
string key = kvp.Key;
if (char.ToUpper(key[0], CultureInfo.InvariantCulture) == upperFirstCharacter)
{
// Add this to the root completions, but only if it is NOT in the 'local' unique
// symbols.
Symbol localSym = null;
if (!localUniqueSymbols.TryGetValue(key, out localSym))
kvp.Value.RecordSymbol(rootCompletions);
}
}
// Now add all local symbols that start with the first character.
foreach (KeyValuePair<string, Symbol> kvp in localUniqueSymbols)
{
string key = kvp.Key;
if (char.ToUpper(key[0], CultureInfo.InvariantCulture) == upperFirstCharacter)
kvp.Value.RecordSymbol(rootCompletions);
}
// Also add keywords.
Scanner.AddKeywordsStartingWith(upperFirstCharacter, rootCompletions);
return rootCompletions;
}
#endregion
#region Condition & action parsing methods
// Parse:
// condition --> logical-expression
internal RuleExpressionCondition ParseCondition(string expressionString)
{
validation.Errors.Clear();
ParserContext parserContext = new ParserContext(expressionString);
if (parserContext.CurrentToken.TokenID == TokenID.EndOfInput)
throw new RuleSyntaxException(ErrorNumbers.Error_EmptyExpression, Messages.Parser_EmptyExpression, parserContext.CurrentToken.StartPosition);
CodeExpression exprResult = ParseBinaryExpression(parserContext, 0, true, ValueCheck.Read); //ParseLogicalExpression();
if (parserContext.CurrentToken.TokenID != TokenID.EndOfInput)
throw new RuleSyntaxException(ErrorNumbers.Error_ExtraCharactersIgnored, Messages.Parser_ExtraCharactersIgnored, parserContext.CurrentToken.StartPosition);
if (exprResult == null)
return null;
RuleExpressionInfo exprInfo = validation.ExpressionInfo(exprResult);
if (exprInfo == null)
return null;
Type resultType = exprInfo.ExpressionType;
if (!RuleValidation.IsValidBooleanResult(resultType))
throw new RuleSyntaxException(ErrorNumbers.Error_ConditionMustBeBoolean, Messages.ConditionMustBeBoolean, 0);
return new RuleExpressionCondition(exprResult);
}
// Parse a single statement.
[SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
internal RuleAction ParseSingleStatement(string statementString)
{
validation.Errors.Clear();
ParserContext parserContext = new ParserContext(statementString);
RuleAction result = ParseStatement(parserContext);
if (parserContext.CurrentToken.TokenID != TokenID.EndOfInput)
throw new RuleSyntaxException(ErrorNumbers.Error_ExtraCharactersIgnored, Messages.Parser_ExtraCharactersIgnored, parserContext.CurrentToken.StartPosition);
return result;
}
internal List<RuleAction> ParseStatementList(string statementString)
{
validation.Errors.Clear();
ParserContext parserContext = new ParserContext(statementString);
return ParseStatements(parserContext);
}
#endregion
// Parse:
// statement-list --> statement statement-list-tail
// --> statement
//
// statement-list-tail --> statement statement-list-tail
// --> statement
private List<RuleAction> ParseStatements(ParserContext parserContext)
{
List<RuleAction> statements = new List<RuleAction>();
while (parserContext.CurrentToken.TokenID != TokenID.EndOfInput)
{
RuleAction statement = ParseStatement(parserContext);
if (statement == null)
break;
statements.Add(statement);
// Eat any (optional) semi-colons. They aren't necessary but are comfortable
// for a lot of programmers.
while (parserContext.CurrentToken.TokenID == TokenID.Semicolon)
parserContext.NextToken();
}
return statements;
}
// Parse:
// statement --> assign-statement
// --> update-statement
// --> HALT
//
// update-statement --> UPDATE ( "path" )
// --> UPDATE ( postfix-expr )
private RuleAction ParseStatement(ParserContext parserContext)
{
RuleAction action = null;
Token statementToken = parserContext.CurrentToken;
if (statementToken.TokenID == TokenID.Halt)
{
parserContext.NextToken(); // eat the "halt"
action = new RuleHaltAction();
parserContext.exprPositions[action] = statementToken.StartPosition;
ValidateAction(parserContext, action);
}
else if (statementToken.TokenID == TokenID.Update)
{
string message;
parserContext.NextToken(); // eat the "update"
if (parserContext.CurrentToken.TokenID != TokenID.LParen)
{
message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_MissingLparenAfterCommand, "UPDATE");
throw new RuleSyntaxException(ErrorNumbers.Error_MissingLparenAfterCommand, message, parserContext.CurrentToken.StartPosition);
}
parserContext.NextToken(); // Eat the "("
string pathString = null;
Token updateArgToken = parserContext.CurrentToken;
if (updateArgToken.TokenID == TokenID.StringLiteral)
{
// Treat UPDATE("foo/bar") as a literal path.
pathString = (string)updateArgToken.Value;
parserContext.NextToken(); // Eat the path string.
}
else
{
CodeExpression pathExpr = ParsePostfixExpression(parserContext, true, ValueCheck.Read);
RuleAnalysis analysis = new RuleAnalysis(validation, true);
RuleExpressionWalker.AnalyzeUsage(analysis, pathExpr, false, true, null);
ICollection<string> paths = analysis.GetSymbols();
if (paths.Count == 0 || paths.Count > 1)
{
// The expression did not modify anything, or it modified more than one.
throw new RuleSyntaxException(ErrorNumbers.Error_InvalidUpdateExpression, Messages.Parser_InvalidUpdateExpression, updateArgToken.StartPosition);
}
else
{
IEnumerator<string> enumerator = paths.GetEnumerator();
enumerator.MoveNext();
pathString = enumerator.Current;
}
}
if (parserContext.CurrentToken.TokenID != TokenID.RParen)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingRParenAfterArgumentList, Messages.Parser_MissingRParenAfterArgumentList, parserContext.CurrentToken.StartPosition);
parserContext.NextToken(); // Eat the ")"
action = new RuleUpdateAction((string)pathString);
parserContext.exprPositions[action] = statementToken.StartPosition;
ValidateAction(parserContext, action);
}
else
{
// Try to parse a custom RuleAction.
int savedTokenState = parserContext.SaveCurrentToken();
Type type = TryParseTypeSpecifier(parserContext, false);
if (type != null &&
parserContext.CurrentToken.TokenID == TokenID.LParen &&
TypeProvider.IsAssignable(typeof(RuleAction), type))
{
// The statement started with a "type (", and the type derived from RuleAction.
// This is a custom rule action.
int lparenPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken(); // Eat the '('
List<CodeExpression> arguments = ParseArgumentList(parserContext);
action = (RuleAction)ConstructCustomType(type, arguments, lparenPosition);
parserContext.exprPositions[action] = statementToken.StartPosition;
ValidateAction(parserContext, action);
}
else
{
// It wasn't a custom action.
// In some cases it may have looked like one up to a point, such as:
//
// MyType.MyMember(
//
// but "MyMember" is a static method.
// Reset the scanner state, and re-parse as an assignment.
parserContext.RestoreCurrentToken(savedTokenState);
CodeStatement statement = ParseAssignmentStatement(parserContext);
if (statement != null)
{
// Create a rule statement action around it. No need to validate it, as
// the underlying CodeDom statement has been validated already.
action = new RuleStatementAction(statement);
}
}
}
return action;
}
// Parse:
// assign-statement --> postfix-expression ASSIGN logical-expression
// --> postfix-expression
private CodeStatement ParseAssignmentStatement(ParserContext parserContext)
{
CodeStatement result = null;
// Parse the postfix-expression
CodeExpression postfixExpr = ParsePostfixExpression(parserContext, false, ValueCheck.Read);
// See if we need to parse the assignment statement.
Token token = parserContext.CurrentToken;
if (token.TokenID == TokenID.Assign)
{
int assignPosition = token.StartPosition;
parserContext.NextToken(); // eat the '='
CodeExpression rhsExpr = ParseBinaryExpression(parserContext, 0, true, ValueCheck.Read);
result = new CodeAssignStatement(postfixExpr, rhsExpr);
parserContext.exprPositions[result] = assignPosition;
}
else
{
result = new CodeExpressionStatement(postfixExpr);
parserContext.exprPositions[result] = parserContext.exprPositions[postfixExpr];
}
ValidateStatement(parserContext, result);
return result;
}
// Parse:
//
// binary-expression --> unary-expresssion binary-expression-tail
// --> unary-expression
//
// binary-expression-tail --> binary-operator-precedence unary-expression binary-expression-tail
// --> binary-operator-precedence unary-expression
//
// binary-operator-precedence --> 0:{ || OR }
// --> 1:{ && AND }
// --> 2:{ | }
// --> 3:{ & }
// --> 4:{ = == != }
// --> 5:{ < > <= >= }
// --> 6:{ + - }
// --> 7:{ * / % MOD }
//
// This method is still recursive descent, but parses each precedence group by using the operator precedence
// tables defined in this class.
private CodeExpression ParseBinaryExpression(ParserContext parserContext, int precedence, bool assignIsEquality, ValueCheck check)
{
// Must parse at least one left-hand operand.
CodeExpression leftResult = (precedence == precedences.Length - 1) ? ParseUnaryExpression(parserContext, assignIsEquality, check) : ParseBinaryExpression(parserContext, precedence + 1, assignIsEquality, check);
if (leftResult != null)
{
for (;;)
{
Token operatorToken = parserContext.CurrentToken;
BinaryPrecedenceDescriptor precedenceDescriptor = precedences[precedence];
BinaryOperationDescriptor operationDescriptor = precedenceDescriptor.FindOperation(operatorToken.TokenID);
if (operationDescriptor == null)
break; // we're finished; no applicable binary operator token at this precedence level.
parserContext.NextToken();
// Parse the right-hand side now.
CodeExpression rightResult = (precedence == precedences.Length - 1) ? ParseUnaryExpression(parserContext, true, check) : ParseBinaryExpression(parserContext, precedence + 1, true, check);
leftResult = operationDescriptor.CreateBinaryExpression(leftResult, rightResult, operatorToken.StartPosition, this, parserContext, assignIsEquality);
}
}
return leftResult;
}
// Parse:
// unary-expression --> unary-operator unary-expression
// --> postfix-expression
private CodeExpression ParseUnaryExpression(ParserContext parserContext, bool assignIsEquality, ValueCheck check)
{
Token currentToken = parserContext.CurrentToken;
CodeExpression unaryResult = null;
if (currentToken.TokenID == TokenID.Not)
{
int notPosition = currentToken.StartPosition;
parserContext.NextToken();
unaryResult = ParseUnaryExpression(parserContext, true, check);
// This becomes "subExpr == false"
unaryResult = new CodeBinaryOperatorExpression(unaryResult, CodeBinaryOperatorType.ValueEquality, new CodePrimitiveExpression(false));
parserContext.exprPositions[unaryResult] = notPosition;
ValidateExpression(parserContext, unaryResult, assignIsEquality, check);
}
else if (currentToken.TokenID == TokenID.Minus)
{
int negativePosition = currentToken.StartPosition;
parserContext.NextToken();
unaryResult = ParseUnaryExpression(parserContext, true, check);
// This becomes "0 - subExpr"
unaryResult = new CodeBinaryOperatorExpression(new CodePrimitiveExpression(0), CodeBinaryOperatorType.Subtract, unaryResult);
parserContext.exprPositions[unaryResult] = negativePosition;
ValidateExpression(parserContext, unaryResult, assignIsEquality, check);
}
else if (currentToken.TokenID == TokenID.LParen)
{
int lparenPosition = currentToken.StartPosition;
// Save the state. This may actually be a parenthesized subexpression.
int savedTokenState = parserContext.SaveCurrentToken();
currentToken = parserContext.NextToken(); // Eat the '('
Type type = TryParseTypeSpecifier(parserContext, assignIsEquality);
if (type == null || parserContext.CurrentToken.TokenID != TokenID.RParen)
{
// It wasn't a cast.
// In some cases it may have looked like a cast up to a point, such as:
//
// (MyType.MyMember
//
// but "MyMember" is a static field, property, or enum.
// Reset the scanner state, and re-parse as a postfix-expr
parserContext.RestoreCurrentToken(savedTokenState);
unaryResult = ParsePostfixExpression(parserContext, assignIsEquality, check);
}
else
{
// It is a cast. It must have a balancing ')'.
if (parserContext.CurrentToken.TokenID != TokenID.RParen)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingRParenInSubexpression, Messages.Parser_MissingRParenInSubexpression, parserContext.CurrentToken.StartPosition);
parserContext.NextToken();
unaryResult = ParseUnaryExpression(parserContext, true, check);
CodeTypeReference typeRef = new CodeTypeReference(type);
validation.AddTypeReference(typeRef, type);
unaryResult = new CodeCastExpression(typeRef, unaryResult);
parserContext.exprPositions[unaryResult] = lparenPosition;
ValidateExpression(parserContext, unaryResult, assignIsEquality, check);
}
}
else
{
unaryResult = ParsePostfixExpression(parserContext, assignIsEquality, check);
}
return unaryResult;
}
// Parse:
// postfix-expression --> primary-expression postfix-expression-tail
// --> primary-expression
//
// postfix-expression-tail --> postfix-operator postfix-expression-tail
// --> postfix-operator
//
// postfix-operator --> member-operator
// --> element-operator
private CodeExpression ParsePostfixExpression(ParserContext parserContext, bool assignIsEquality, ValueCheck check)
{
CodeExpression resultExpr = ParsePrimaryExpression(parserContext, assignIsEquality);
CodeExpression postfixExpr = TryParsePostfixOperator(parserContext, resultExpr, assignIsEquality, check);
while (postfixExpr != null)
{
resultExpr = postfixExpr;
postfixExpr = TryParsePostfixOperator(parserContext, resultExpr, assignIsEquality, check);
}
return resultExpr;
}
// Parse:
// postfix-operator --> member-operator
// --> element-operator
private CodeExpression TryParsePostfixOperator(ParserContext parserContext, CodeExpression primaryExpr, bool assignIsEquality, ValueCheck check)
{
CodeExpression postfixExpr = null;
if (parserContext.CurrentToken.TokenID == TokenID.Dot)
{
postfixExpr = ParseMemberOperator(parserContext, primaryExpr, assignIsEquality, check);
}
else if (parserContext.CurrentToken.TokenID == TokenID.LBracket)
{
postfixExpr = ParseElementOperator(parserContext, primaryExpr, assignIsEquality);
}
return postfixExpr;
}
// Parse:
// element-operator --> [ expression-list ]
private CodeExpression ParseElementOperator(ParserContext parserContext, CodeExpression primaryExpr, bool assignIsEquality)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.LBracket);
int lbracketPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken(); // Consume the '['
List<CodeExpression> indexList = ParseIndexList(parserContext);
CodeExpression[] indices = indexList.ToArray();
CodeExpression resultExpr = null;
RuleExpressionInfo primaryExprInfo = validation.ExpressionInfo(primaryExpr);
if (primaryExprInfo.ExpressionType.IsArray)
{
// The primary is an array type, so create an array indexer expression.
resultExpr = new CodeArrayIndexerExpression(primaryExpr, indices);
}
else
{
// The primary isn't an array, so assume it has an indexer property.
resultExpr = new CodeIndexerExpression(primaryExpr, indices);
}
parserContext.exprPositions[resultExpr] = lbracketPosition;
ValidateExpression(parserContext, resultExpr, assignIsEquality, ValueCheck.Read);
return resultExpr;
}
// Parse:
// expression-list --> logical-expression expression-list-tail
// --> logical-expression
//
// expression-list-tail --> , logical-expression expression-list-tail
// --> , logical-expression
private List<CodeExpression> ParseIndexList(ParserContext parserContext)
{
List<CodeExpression> indexList = new List<CodeExpression>();
CodeExpression indexExpr = ParseBinaryExpression(parserContext, 0, true, ValueCheck.Read); //ParseLogicalExpression();
indexList.Add(indexExpr);
while (parserContext.CurrentToken.TokenID == TokenID.Comma)
{
parserContext.NextToken(); // eat the comma
indexExpr = ParseBinaryExpression(parserContext, 0, true, ValueCheck.Read); //ParseLogicalExpression();
indexList.Add(indexExpr);
}
if (parserContext.CurrentToken.TokenID != TokenID.RBracket)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingCloseSquareBracket, Messages.Parser_MissingCloseSquareBracket, parserContext.CurrentToken.StartPosition);
parserContext.NextToken(); // consume the ']'
return indexList;
}
// Parse:
// member-operator --> . IDENTIFIER method-call-arguments
// --> . IDENTIFIER
//
// method-call-arguments --> ( argument-list )
// --> ( )
//
// argument-list --> argument argument-list-tail
// --> argument
//
// argument-list-tail --> , argument argument-list-tail
// --> , argument
private CodeExpression ParseMemberOperator(ParserContext parserContext, CodeExpression primaryExpr, bool assignIsEquality, ValueCheck check)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.Dot);
Token token = parserContext.NextToken(); // Consume the '.'
if (token.TokenID != TokenID.Identifier)
{
if (parserContext.provideIntellisense && token.TokenID == TokenID.EndOfInput)
{
parserContext.SetTypeMemberCompletions(validation.ExpressionInfo(primaryExpr).ExpressionType, validation.ThisType, primaryExpr is CodeTypeReferenceExpression, validation);
return null;
}
else
{
throw new RuleSyntaxException(ErrorNumbers.Error_MissingIdentifierAfterDot, Messages.Parser_MissingIdentifierAfterDot, parserContext.CurrentToken.StartPosition);
}
}
string idName = (string)token.Value;
int idPosition = token.StartPosition;
CodeExpression postfixExpr = null;
if (parserContext.NextToken().TokenID == TokenID.LParen)
{
postfixExpr = ParseMethodInvoke(parserContext, primaryExpr, idName, true);
}
else
{
postfixExpr = ParseFieldOrProperty(parserContext, primaryExpr, idName, idPosition, assignIsEquality, check);
}
return postfixExpr;
}
private CodeExpression ParseMethodInvoke(ParserContext parserContext, CodeExpression postfixExpr, string methodName, bool assignIsEquality)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.LParen);
// Start of a method call parameter list.
int lparenPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken();
if (parserContext.CurrentToken.TokenID == TokenID.EndOfInput && parserContext.provideIntellisense)
{
bool isStatic = postfixExpr is CodeTypeReferenceExpression;
parserContext.SetMethodCompletions(validation.ExpressionInfo(postfixExpr).ExpressionType, validation.ThisType, methodName, isStatic, !isStatic, validation);
return null;
}
List<CodeExpression> arguments = ParseArgumentList(parserContext);
postfixExpr = new CodeMethodInvokeExpression(postfixExpr, methodName, arguments.ToArray());
parserContext.exprPositions[postfixExpr] = lparenPosition;
ValidateExpression(parserContext, postfixExpr, assignIsEquality, ValueCheck.Read);
return postfixExpr;
}
private List<CodeExpression> ParseArgumentList(ParserContext parserContext)
{
List<CodeExpression> argList = new List<CodeExpression>();
if (parserContext.CurrentToken.TokenID != TokenID.RParen)
{
CodeExpression argResult = ParseArgument(parserContext, true);
argList.Add(argResult);
while (parserContext.CurrentToken.TokenID == TokenID.Comma)
{
parserContext.NextToken(); // eat the comma
argResult = ParseArgument(parserContext, true);
argList.Add(argResult);
}
if (parserContext.CurrentToken.TokenID != TokenID.RParen)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingRParenAfterArgumentList, Messages.Parser_MissingRParenAfterArgumentList, parserContext.CurrentToken.StartPosition);
}
parserContext.NextToken(); // consume the ')'
return argList;
}
private CodeExpression ParseFieldOrProperty(ParserContext parserContext, CodeExpression postfixExpr, string name, int namePosition, bool assignIsEquality, ValueCheck check)
{
CodeExpression fieldOrPropExpr = null;
Type postFixExprType = Validator.ExpressionInfo(postfixExpr).ExpressionType;
MemberInfo member = Validator.ResolveFieldOrProperty(postFixExprType, name);
if (member == null)
{
// We could not find the field or property.
Type type = Validator.ExpressionInfo(postfixExpr).ExpressionType;
string message = string.Format(CultureInfo.CurrentCulture, Messages.UnknownFieldOrProperty, name, RuleDecompiler.DecompileType(type));
throw new RuleSyntaxException(ErrorNumbers.Error_UnknownFieldOrProperty, message, namePosition);
}
else
{
if (member.MemberType == MemberTypes.Field)
fieldOrPropExpr = new CodeFieldReferenceExpression(postfixExpr, name);
else
fieldOrPropExpr = new CodePropertyReferenceExpression(postfixExpr, name);
parserContext.exprPositions[fieldOrPropExpr] = namePosition;
ValidateExpression(parserContext, fieldOrPropExpr, assignIsEquality, check);
}
return fieldOrPropExpr;
}
private CodeExpression ParseUnadornedFieldOrProperty(ParserContext parserContext, string name, int namePosition, bool assignIsEquality)
{
Type thisType = Validator.ThisType;
// Resolve the field or property relative to the type of "this". This will find all static & non-static
// fields and properties.
MemberInfo member = Validator.ResolveFieldOrProperty(thisType, name);
if (member == null)
{
// We could not find the field or property.
string message = string.Format(CultureInfo.CurrentCulture, Messages.UnknownFieldOrProperty, name, RuleDecompiler.DecompileType(thisType));
throw new RuleSyntaxException(ErrorNumbers.Error_UnknownFieldOrProperty, message, namePosition);
}
bool isStatic = false;
FieldInfo fieldInfo = member as FieldInfo;
if (fieldInfo != null)
{
isStatic = fieldInfo.IsStatic;
}
else
{
PropertyInfo propInfo = member as PropertyInfo;
if (propInfo != null)
{
// Q: I wonder why I can't just ask "propInfo.IsStatic"?
MethodInfo[] accessors = propInfo.GetAccessors(true);
for (int i = 0; i < accessors.Length; ++i)
{
if (accessors[i].IsStatic)
{
isStatic = true;
break;
}
}
}
}
// If static, implicitly prefix with the type name; else implicitly prefix with "this".
CodeExpression primaryExpr = null;
if (isStatic)
primaryExpr = new CodeTypeReferenceExpression(thisType);
else
primaryExpr = new CodeThisReferenceExpression();
// Create field or property reference expression, as appropriate.
CodeExpression fieldOrPropExpr = null;
if (fieldInfo != null)
fieldOrPropExpr = new CodeFieldReferenceExpression(primaryExpr, name);
else
fieldOrPropExpr = new CodePropertyReferenceExpression(primaryExpr, name);
parserContext.exprPositions[fieldOrPropExpr] = namePosition;
ValidateExpression(parserContext, fieldOrPropExpr, assignIsEquality, ValueCheck.Read);
return fieldOrPropExpr;
}
private CodeExpression ParseUnadornedMethodInvoke(ParserContext parserContext, string methodName, bool assignIsEquality)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.LParen);
Type thisType = Validator.ThisType;
// Start of a method call parameter list.
int lparenPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken();
if (parserContext.CurrentToken.TokenID == TokenID.EndOfInput && parserContext.provideIntellisense)
{
parserContext.SetMethodCompletions(thisType, thisType, methodName, true, true, validation);
return null;
}
List<CodeExpression> arguments = ParseArgumentList(parserContext);
// Binding flags include all public & non-public, all instance, and all static.
// All are possible candidates for unadorned method references.
BindingFlags bindingFlags = BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.Static | BindingFlags.FlattenHierarchy | BindingFlags.Instance;
ValidationError error = null;
RuleMethodInvokeExpressionInfo methodInvokeInfo = validation.ResolveMethod(thisType, methodName, bindingFlags, arguments, out error);
if (methodInvokeInfo == null)
throw new RuleSyntaxException(error.ErrorNumber, error.ErrorText, lparenPosition);
MethodInfo mi = methodInvokeInfo.MethodInfo;
CodeExpression primaryExpr = null;
if (mi.IsStatic)
primaryExpr = new CodeTypeReferenceExpression(thisType);
else
primaryExpr = new CodeThisReferenceExpression();
CodeExpression postfixExpr = new CodeMethodInvokeExpression(primaryExpr, methodName, arguments.ToArray());
parserContext.exprPositions[postfixExpr] = lparenPosition;
ValidateExpression(parserContext, postfixExpr, assignIsEquality, ValueCheck.Read);
return postfixExpr;
}
// Parse:
// argument --> direction logical-expression
// --> logical-expression
//
// direction --> IN
// --> OUT
// --> REF
private CodeExpression ParseArgument(ParserContext parserContext, bool assignIsEquality)
{
CodeExpression argResult = null;
Token token = parserContext.CurrentToken;
int directionPosition = token.StartPosition;
FieldDirection? direction = null;
ValueCheck check = ValueCheck.Read;
switch (token.TokenID)
{
case TokenID.In:
direction = FieldDirection.In;
parserContext.NextToken(); // eat the direction token
break;
case TokenID.Out:
direction = FieldDirection.Out;
parserContext.NextToken();
check = ValueCheck.Write;
break;
case TokenID.Ref:
direction = FieldDirection.Ref;
parserContext.NextToken();
check = ValueCheck.Read | ValueCheck.Write;
break;
}
argResult = ParseBinaryExpression(parserContext, 0, true, check);
if (direction != null)
{
argResult = new CodeDirectionExpression(direction.Value, argResult);
parserContext.exprPositions[argResult] = directionPosition;
ValidateExpression(parserContext, argResult, assignIsEquality, ValueCheck.Read);
}
return argResult;
}
// Parse:
// primary-expression --> ( logical-expression )
// --> IDENTIFIER
// --> IDENTIFIER method-call-arguments
// --> type-name
// --> object-creation-expression
// --> array-creation-expression
// --> integer-constant
// --> decimal-constant
// --> float-constant
// --> character-constant
// --> string-constant
// --> NULL
// --> THIS
// --> TRUE
// --> FALSE
private CodeExpression ParsePrimaryExpression(ParserContext parserContext, bool assignIsEquality)
{
CodeExpression primaryExpr = null;
Token token = parserContext.CurrentToken;
switch (token.TokenID)
{
case TokenID.LParen:
// A parenthesized subexpression
parserContext.NextToken();
primaryExpr = ParseBinaryExpression(parserContext, 0, assignIsEquality, ValueCheck.Read);
parserContext.exprPositions[primaryExpr] = token.StartPosition;
token = parserContext.CurrentToken;
if (token.TokenID != TokenID.RParen)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingRParenInSubexpression, Messages.Parser_MissingRParenInSubexpression, parserContext.CurrentToken.StartPosition);
parserContext.NextToken(); // eat the ')'
break;
case TokenID.Identifier:
primaryExpr = ParseRootIdentifier(parserContext, assignIsEquality);
break;
case TokenID.This:
parserContext.NextToken(); // eat "this"
primaryExpr = new CodeThisReferenceExpression();
parserContext.exprPositions[primaryExpr] = token.StartPosition;
ValidateExpression(parserContext, primaryExpr, assignIsEquality, ValueCheck.Read);
break;
case TokenID.TypeName:
parserContext.NextToken(); // eat the type name
Type type = (Type)token.Value;
CodeTypeReference typeRef = new CodeTypeReference(type);
validation.AddTypeReference(typeRef, type);
primaryExpr = new CodeTypeReferenceExpression(typeRef);
parserContext.exprPositions[primaryExpr] = token.StartPosition;
ValidateExpression(parserContext, primaryExpr, assignIsEquality, ValueCheck.Read);
break;
case TokenID.New:
parserContext.NextToken(); // eat "new"
primaryExpr = ParseObjectCreation(parserContext, assignIsEquality);
break;
case TokenID.IntegerLiteral:
case TokenID.FloatLiteral:
case TokenID.DecimalLiteral:
case TokenID.CharacterLiteral:
case TokenID.StringLiteral:
case TokenID.True:
case TokenID.False:
case TokenID.Null:
parserContext.NextToken(); // eat the literal
primaryExpr = new CodePrimitiveExpression(token.Value);
parserContext.exprPositions[primaryExpr] = token.StartPosition;
ValidateExpression(parserContext, primaryExpr, assignIsEquality, ValueCheck.Read);
break;
case TokenID.EndOfInput:
throw new RuleSyntaxException(ErrorNumbers.Error_MissingOperand, Messages.Parser_MissingOperand, token.StartPosition);
default:
throw new RuleSyntaxException(ErrorNumbers.Error_UnknownLiteral, Messages.Parser_UnknownLiteral, token.StartPosition);
}
return primaryExpr;
}
// Parse:
// object-creation-expression --> NEW type-name method-call-arguments
// array-creation-expression --> NEW array-spec
// --> NEW array-spec array-initializer
private CodeExpression ParseObjectCreation(ParserContext parserContext, bool assignIsEquality)
{
CodeExpression primaryExpr = null;
Token token = parserContext.CurrentToken;
CodeExpression size;
Type type = TryParseTypeSpecifierWithOptionalSize(parserContext, assignIsEquality, out size);
// handle intellisense, regardless of whether we get a type back or not
if (parserContext.provideIntellisense && parserContext.CurrentToken.TokenID == TokenID.EndOfInput)
{
// if we have a type, get only nested classes for it
// if we don't have a type, then take whatever is already set for completions
if (type != null)
parserContext.SetNestedClassCompletions(type, validation.ThisType);
return null;
}
if (type == null)
throw new RuleSyntaxException(ErrorNumbers.Error_InvalidTypeArgument, Messages.Parser_InvalidTypeArgument, token.StartPosition);
if (size == null)
{
// must be an object-creation-expression
if (parserContext.CurrentToken.TokenID != TokenID.LParen)
{
// [] are already handled by TryParseTypeSpecifierWithOptionalSize
throw new RuleSyntaxException(ErrorNumbers.Error_InvalidTypeArgument, Messages.Parser_InvalidNew, token.StartPosition);
}
primaryExpr = ParseConstructorArguments(parserContext, type, assignIsEquality);
}
else
{
// it's an array
List<CodeExpression> initializers = ParseArrayCreationArguments(parserContext);
if (initializers != null)
{
if (size == defaultSize)
primaryExpr = new CodeArrayCreateExpression(type, initializers.ToArray());
else
{
// both specified
primaryExpr = new CodeArrayCreateExpression(type, size);
((CodeArrayCreateExpression)primaryExpr).Initializers.AddRange(initializers.ToArray());
}
}
else
{
// no initializers, so size matters
if (size != defaultSize)
primaryExpr = new CodeArrayCreateExpression(type, size);
else
{
// neither specified, so error
throw new RuleSyntaxException(ErrorNumbers.Error_NoArrayCreationSize,
Messages.Parser_NoArrayCreationSize,
parserContext.CurrentToken.StartPosition);
}
}
ValidateExpression(parserContext, primaryExpr, assignIsEquality, ValueCheck.Read);
}
return primaryExpr;
}
private CodeExpression ParseConstructorArguments(ParserContext parserContext, Type type, bool assignIsEquality)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.LParen);
// Start of a constructor parameter list.
int lparenPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken();
if (parserContext.CurrentToken.TokenID == TokenID.EndOfInput && parserContext.provideIntellisense)
{
parserContext.SetConstructorCompletions(type, Validator.ThisType);
return null;
}
List<CodeExpression> arguments = ParseArgumentList(parserContext);
if ((type.IsValueType) && (arguments.Count == 0))
{
// this is always allowed
}
else if (type.IsAbstract)
{
// this is not allowed
string message = string.Format(CultureInfo.CurrentCulture,
Messages.UnknownConstructor,
RuleDecompiler.DecompileType(type));
throw new RuleSyntaxException(ErrorNumbers.Error_MethodNotExists, message, lparenPosition);
}
else
{
// Binding flags include all public & non-public, all instance, and all static.
// All are possible candidates for unadorned method references.
BindingFlags bindingFlags = BindingFlags.Public | BindingFlags.FlattenHierarchy | BindingFlags.Instance;
if (type.Assembly == validation.ThisType.Assembly)
bindingFlags |= BindingFlags.NonPublic;
ValidationError error = null;
RuleConstructorExpressionInfo constructorInvokeInfo = validation.ResolveConstructor(type, bindingFlags, arguments, out error);
if (constructorInvokeInfo == null)
throw new RuleSyntaxException(error.ErrorNumber, error.ErrorText, lparenPosition);
}
CodeExpression postfixExpr = new CodeObjectCreateExpression(type, arguments.ToArray());
parserContext.exprPositions[postfixExpr] = lparenPosition;
ValidateExpression(parserContext, postfixExpr, assignIsEquality, ValueCheck.Read);
return postfixExpr;
}
// Parse:
// array-initializer --> { variable-initializer-list }
// { }
// variable-initializer-list --> variable-initializer variable-initializer-list-tail
// --> variable-initializer
// variable-initializer-list-tail --> , variable-initializer variable-initializer-list-tail
// --> , variable-initializer
private List<CodeExpression> ParseArrayCreationArguments(ParserContext parserContext)
{
// if there are no initializers, return null
if (parserContext.CurrentToken.TokenID != TokenID.LCurlyBrace)
return null;
List<CodeExpression> initializers = new List<CodeExpression>();
parserContext.NextToken(); // skip '{'
if (parserContext.CurrentToken.TokenID != TokenID.RCurlyBrace)
{
initializers.Add(ParseInitializer(parserContext, true));
while (parserContext.CurrentToken.TokenID == TokenID.Comma)
{
parserContext.NextToken(); // eat the comma
initializers.Add(ParseInitializer(parserContext, true));
}
if (parserContext.CurrentToken.TokenID != TokenID.RCurlyBrace)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingRCurlyAfterInitializers,
Messages.Parser_MissingRCurlyAfterInitializers,
parserContext.CurrentToken.StartPosition);
}
parserContext.NextToken(); // eat the '}'
return initializers;
}
// Parse:
// variable-initializer --> logical-expression
private CodeExpression ParseInitializer(ParserContext parserContext, bool assignIsEquality)
{
// size we only handle 1 level arrays, initializers must be regular expressions
return ParseBinaryExpression(parserContext, 0, assignIsEquality, ValueCheck.Read);
}
// Parse a root identifier which may be:
// 1. A field/property/method with an implicit "this." prepended to it.
// 2. A nested type within the type of this.
// 2. An unqualified type name
// 3. A namespace name.
private CodeExpression ParseRootIdentifier(ParserContext parserContext, bool assignIsEquality)
{
Token token = parserContext.CurrentToken;
string name = (string)token.Value;
Symbol sym = null;
// Consult the local unique symbol list first. If we find a symbol here, that's the one.
if (!localUniqueSymbols.TryGetValue(name, out sym))
{
// Wasn't found in the local unique symbols, try the global unique symbols.
globalUniqueSymbols.TryGetValue(name, out sym);
}
if (sym == null)
{
// We couldn't find it in either location. This is an error.
string message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_UnknownIdentifier, name);
throw new RuleSyntaxException(ErrorNumbers.Error_UnknownIdentifier, message, token.StartPosition);
}
return sym.ParseRootIdentifier(this, parserContext, assignIsEquality);
}
// Parser:
// primary-expr --> ...
// --> IDENTIFIER
// --> IDENTIFIER method-call-arguments
// --> ...
internal CodeExpression ParseUnadornedMemberIdentifier(ParserContext parserContext, MemberSymbol symbol, bool assignIsEquality)
{
// This is an implicit member reference off "this", so add the "this". (Or an implicit
// static member reference of the type of "this", so add the type name.)
Token token = parserContext.CurrentToken;
int namePosition = token.StartPosition;
parserContext.NextToken(); // eat the identifier
CodeExpression primaryExpr = null;
if (parserContext.CurrentToken.TokenID == TokenID.LParen)
primaryExpr = ParseUnadornedMethodInvoke(parserContext, symbol.Name, true);
else
primaryExpr = ParseUnadornedFieldOrProperty(parserContext, symbol.Name, namePosition, assignIsEquality);
return primaryExpr;
}
// Parse:
// namespace-qualified-type-name --> NAMESPACE-NAME namespace-qualifier-tail . TYPE-NAME
// --> NAMESPACE-NAME . TYPE-NAME
// --> TYPE-NAME
//
// namespace-qualifier-tail --> . NAMESPACE-NAME namespace-qualifier-tail
internal CodeExpression ParseRootNamespaceIdentifier(ParserContext parserContext, NamespaceSymbol nsSym, bool assignIsEquality)
{
// Loop through all the namespace qualifiers until we find something that's not a namespace.
Symbol nestedSym = null;
while (nsSym != null)
{
Token token = parserContext.NextToken();
if (token.TokenID != TokenID.Dot)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingDotAfterNamespace, Messages.Parser_MissingDotAfterNamespace, token.StartPosition);
token = parserContext.NextToken();
if (token.TokenID != TokenID.Identifier)
{
if (parserContext.provideIntellisense && token.TokenID == TokenID.EndOfInput)
{
parserContext.SetNamespaceCompletions(nsSym);
return null;
}
else
{
throw new RuleSyntaxException(ErrorNumbers.Error_MissingIdentifierAfterDot, Messages.Parser_MissingIdentifierAfterDot, token.StartPosition);
}
}
string name = (string)token.Value;
nestedSym = nsSym.FindMember(name);
if (nestedSym == null)
{
string message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_UnknownNamespaceMember, name, nsSym.GetQualifiedName());
throw new RuleSyntaxException(ErrorNumbers.Error_UnknownNamespaceMember, message, token.StartPosition);
}
nsSym = nestedSym as NamespaceSymbol;
}
// We are sitting at a type (or overloaded type).
return nestedSym.ParseRootIdentifier(this, parserContext, assignIsEquality);
}
internal CodeExpression ParseRootTypeIdentifier(ParserContext parserContext, TypeSymbol typeSym, bool assignIsEquality)
{
string message = null;
int typePosition = parserContext.CurrentToken.StartPosition;
Token token = parserContext.NextToken();
if (typeSym.GenericArgCount > 0 && token.TokenID != TokenID.Less)
{
// This is a generic type, but no argument list was provided.
message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_MissingTypeArguments, typeSym.Name);
throw new RuleSyntaxException(ErrorNumbers.Error_MissingTypeArguments, message, token.StartPosition);
}
Type type = typeSym.Type;
if (token.TokenID == TokenID.Less)
{
// Start of a generic argument list... the type had better be generic.
if (typeSym.GenericArgCount == 0)
{
message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_NotAGenericType, RuleDecompiler.DecompileType(type));
throw new RuleSyntaxException(ErrorNumbers.Error_NotAGenericType, message, token.StartPosition);
}
Type[] typeArgs = ParseGenericTypeArgList(parserContext);
if (typeArgs.Length != typeSym.GenericArgCount)
{
message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_BadTypeArgCount, RuleDecompiler.DecompileType(type));
throw new RuleSyntaxException(ErrorNumbers.Error_BadTypeArgCount, message, parserContext.CurrentToken.StartPosition);
}
// if we are creating generics with design-time types, then the generic needs to be
// a wrapped type to create the generic properly, so we look up the generic to get back the wrapper
type = Validator.ResolveType(type.AssemblyQualifiedName);
type = type.MakeGenericType(typeArgs);
}
token = parserContext.CurrentToken;
if (token.TokenID == TokenID.Dot)
{
Type nestedType = ParseNestedType(parserContext, type);
if (nestedType != null)
type = nestedType;
}
return ParseTypeRef(parserContext, type, typePosition, assignIsEquality);
}
internal CodeExpression ParseRootOverloadedTypeIdentifier(ParserContext parserContext, List<TypeSymbol> candidateTypeSymbols, bool assignIsEquality)
{
Token token = parserContext.CurrentToken;
string typeName = (string)token.Value;
int namePosition = token.StartPosition;
// Get the next token after the identifier.
token = parserContext.NextToken();
Type type = null;
if (token.TokenID == TokenID.Less)
{
// Choose from the generic candidates.
List<Type> candidateTypes = new List<Type>(candidateTypeSymbols.Count);
foreach (TypeSymbol typeSym in candidateTypeSymbols)
{
if (typeSym.GenericArgCount > 0)
candidateTypes.Add(typeSym.Type);
}
type = ParseGenericType(parserContext, candidateTypes, typeName);
}
else
{
// See if there's a non-generic candidate.
TypeSymbol typeSym = candidateTypeSymbols.Find(delegate(TypeSymbol s) { return s.GenericArgCount == 0; });
if (typeSym == null)
{
// No argument list was provided, but there's no non-generic overload.
string message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_MissingTypeArguments, typeName);
throw new RuleSyntaxException(ErrorNumbers.Error_MissingTypeArguments, message, namePosition);
}
type = typeSym.Type;
}
if (parserContext.CurrentToken.TokenID == TokenID.Dot)
{
Type nestedType = ParseNestedType(parserContext, type);
if (nestedType != null)
type = nestedType;
}
return ParseTypeRef(parserContext, type, namePosition, assignIsEquality);
}
private CodeExpression ParseTypeRef(ParserContext parserContext, Type type, int typePosition, bool assignIsEquality)
{
CodeExpression result = null;
if (parserContext.CurrentToken.TokenID == TokenID.LParen)
{
// A '(' after a typename is only valid if it's an IRuleExpression.
if (TypeProvider.IsAssignable(typeof(IRuleExpression), type))
{
int lparenPosition = parserContext.CurrentToken.StartPosition;
parserContext.NextToken(); // Eat the '('
List<CodeExpression> arguments = ParseArgumentList(parserContext);
result = (CodeExpression)ConstructCustomType(type, arguments, lparenPosition);
parserContext.exprPositions[result] = lparenPosition;
ValidateExpression(parserContext, result, assignIsEquality, ValueCheck.Read);
return result;
}
}
CodeTypeReference typeRef = new CodeTypeReference(type);
validation.AddTypeReference(typeRef, type);
result = new CodeTypeReferenceExpression(typeRef);
parserContext.exprPositions[result] = typePosition;
ValidateExpression(parserContext, result, assignIsEquality, ValueCheck.Read);
return result;
}
// Parse nested types.
private Type ParseNestedType(ParserContext parserContext, Type currentType)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.Dot);
Type nestedType = null;
while (parserContext.CurrentToken.TokenID == TokenID.Dot)
{
// Save the state of the scanner. Since we can't tell if we're parsing a nested
// type or a member, we'll need to backtrack if we go too far.
int savedTokenState = parserContext.SaveCurrentToken();
Token token = parserContext.NextToken();
if (token.TokenID != TokenID.Identifier)
{
if (parserContext.provideIntellisense && token.TokenID == TokenID.EndOfInput)
{
parserContext.SetTypeMemberCompletions(currentType, validation.ThisType, true, validation);
return null;
}
else
{
throw new RuleSyntaxException(ErrorNumbers.Error_MissingIdentifierAfterDot, Messages.Parser_MissingIdentifierAfterDot, parserContext.CurrentToken.StartPosition);
}
}
string name = (string)token.Value;
BindingFlags bindingFlags = BindingFlags.Public;
if (currentType.Assembly == validation.ThisType.Assembly)
bindingFlags |= BindingFlags.NonPublic;
if (parserContext.NextToken().TokenID == TokenID.Less)
{
// Might be a generic type.
List<Type> candidateGenericTypes = new List<Type>();
Type[] nestedTypes = currentType.GetNestedTypes(bindingFlags);
string prefix = name + "`";
for (int i = 0; i < nestedTypes.Length; ++i)
{
Type candidateType = nestedTypes[i];
if (candidateType.Name.StartsWith(prefix, StringComparison.Ordinal))
candidateGenericTypes.Add(candidateType);
}
if (candidateGenericTypes.Count == 0)
{
// It wasn't a generic type. Reset the scanner to the saved state.
parserContext.RestoreCurrentToken(savedTokenState);
// Also reset the deepenst nested type.
nestedType = currentType;
break;
}
nestedType = ParseGenericType(parserContext, candidateGenericTypes, name);
currentType = nestedType;
}
else
{
// Might be a non-generic type.
MemberInfo[] mi = currentType.GetMember(name, bindingFlags);
if (mi == null || mi.Length != 1 || (mi[0].MemberType != MemberTypes.NestedType && mi[0].MemberType != MemberTypes.TypeInfo))
{
// We went too far, reset the state.
parserContext.RestoreCurrentToken(savedTokenState);
// Also reset the deepest nested type.
nestedType = currentType;
break;
}
nestedType = (Type)mi[0];
if (currentType.IsGenericType && nestedType.IsGenericTypeDefinition)
{
// The outer type was generic (and bound), but the nested type is not. We have
// to re-bind the generic arguments.
nestedType = nestedType.MakeGenericType(currentType.GetGenericArguments());
}
currentType = nestedType;
}
}
return nestedType;
}
private Type ParseGenericType(ParserContext parserContext, List<Type> candidateGenericTypes, string typeName)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.Less);
Type[] typeArgs = ParseGenericTypeArgList(parserContext);
foreach (Type candidateType in candidateGenericTypes)
{
Type[] genericArgs = candidateType.GetGenericArguments();
if (genericArgs.Length == typeArgs.Length)
return candidateType.MakeGenericType(typeArgs);
}
// No valid candidate found.
string message = string.Format(CultureInfo.CurrentCulture, Messages.Parser_BadTypeArgCount, typeName);
throw new RuleSyntaxException(ErrorNumbers.Error_BadTypeArgCount, message, parserContext.CurrentToken.StartPosition);
}
private Type[] ParseGenericTypeArgList(ParserContext parserContext)
{
System.Diagnostics.Debug.Assert(parserContext.CurrentToken.TokenID == TokenID.Less);
List<Type> typeArgs = new List<Type>();
Token token;
do
{
// Eat the opening '<' or ','.
token = parserContext.NextToken();
Type type = TryParseTypeSpecifier(parserContext, true);
if (type == null)
throw new RuleSyntaxException(ErrorNumbers.Error_InvalidTypeArgument, Messages.Parser_InvalidTypeArgument, token.StartPosition);
typeArgs.Add(type);
} while (parserContext.CurrentToken.TokenID == TokenID.Comma);
if (parserContext.CurrentToken.TokenID != TokenID.Greater)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingCloseAngleBracket, Messages.Parser_MissingCloseAngleBracket, parserContext.CurrentToken.StartPosition);
parserContext.NextToken(); // Eat the '>'
return typeArgs.ToArray();
}
// Parse:
// type-spec --> type-name
// --> type-name rank-specifiers
private Type TryParseTypeSpecifier(ParserContext parserContext, bool assignIsEquality)
{
Type type = TryParseTypeName(parserContext, assignIsEquality);
if (type != null)
type = ParseArrayType(parserContext, type);
return type;
}
private Type TryParseTypeName(ParserContext parserContext, bool assignIsEquality)
{
Type type = null;
Token currentToken = parserContext.CurrentToken;
if (currentToken.TokenID == TokenID.TypeName)
{
type = (Type)currentToken.Value;
parserContext.NextToken(); // eat the type name
}
else if (currentToken.TokenID == TokenID.Identifier)
{
Symbol sym = null;
if (globalUniqueSymbols.TryGetValue((string)currentToken.Value, out sym))
{
CodeExpression identExpr = sym.ParseRootIdentifier(this, parserContext, assignIsEquality);
if (identExpr is CodeTypeReferenceExpression)
type = validation.ExpressionInfo(identExpr).ExpressionType;
}
}
return type;
}
// size returned if array-rank-specifier is empty (e.g. [])
private static CodeExpression defaultSize = new CodePrimitiveExpression(0);
// Parse:
// array-spec --> type-name
// --> type-name array-rank-specifiers
// array-rank-specifiers --> [ binary-expression ]
// --> [ ]
private Type TryParseTypeSpecifierWithOptionalSize(ParserContext parserContext, bool assignIsEquality, out CodeExpression size)
{
Type type = null;
size = null;
Token currentToken = parserContext.CurrentToken;
type = TryParseTypeName(parserContext, assignIsEquality);
// see if size specified
if ((type != null) && (parserContext.CurrentToken.TokenID == TokenID.LBracket))
{
Token next = parserContext.NextToken(); // skip '['
// get the size, if specified
if (next.TokenID != TokenID.RBracket)
size = ParseBinaryExpression(parserContext, 0, false, ValueCheck.Read);
else
size = defaultSize;
if (parserContext.CurrentToken.TokenID != TokenID.RBracket)
throw new RuleSyntaxException(ErrorNumbers.Error_MissingCloseSquareBracket,
Messages.Parser_MissingCloseSquareBracket1,
parserContext.CurrentToken.StartPosition);
parserContext.NextToken(); // Eat the ']'
}
return type;
}
// Parse:
// rank-specifiers --> rank-specifier rank-specifier-tail
// --> rank-specifier
//
// rank-specifier-tail --> rank-specifier rank-specifier-tail
//
// rank-specifier --> [ dim-separators ]
// --> [ ]
//
// dim-separators --> , dim-separators-tail
// --> ,
//
// dim-separators-tail --> , dim-separators-tail
private static Type ParseArrayType(ParserContext parserContext, Type baseType)
{
Type type = baseType;
while (parserContext.CurrentToken.TokenID == TokenID.LBracket)
{
int rank = 1;
while (parserContext.NextToken().TokenID == TokenID.Comma)
++rank;
if (parserContext.CurrentToken.TokenID == TokenID.RBracket)
parserContext.NextToken(); // Eat the ']'
else
throw new RuleSyntaxException(ErrorNumbers.Error_MissingCloseSquareBracket, Messages.Parser_MissingCloseSquareBracket, parserContext.CurrentToken.StartPosition);
if (rank == 1)
type = type.MakeArrayType();
else
type = type.MakeArrayType(rank);
}
return type;
}
#region Constructor overloading for custom types
private class CandidateConstructor
{
private ConstructorInfo ctor;
private object[] ctorArgs;
private bool isExpandedMatch;
internal CandidateConstructor(ConstructorInfo ctor, object[] ctorArgs, bool isExpandedMatch)
{
this.ctor = ctor;
this.ctorArgs = ctorArgs;
this.isExpandedMatch = isExpandedMatch;
}
internal int CompareConstructor(CandidateConstructor other)
{
int better = 1;
int worse = -1;
int equal = 0;
// Try some disambiguating rules for expanded signatures vs normal signatures.
if (!this.isExpandedMatch && other.isExpandedMatch)
{
// This candidate matched in its normal form, but the other one matched only after
// expansion of a params array. This one is better.
return better;
}
else if (this.isExpandedMatch && !other.isExpandedMatch)
{
// This candidate matched in its expanded form, but the other one matched in its
// normal form. The other one was better.
return worse;
}
else if (this.isExpandedMatch && other.isExpandedMatch)
{
// Both candidates matched in their expanded forms.
int thisParameterCount = this.ctor.GetParameters().Length;
int otherParameterCount = other.ctor.GetParameters().Length;
if (thisParameterCount > otherParameterCount)
{
// This candidate had more declared parameters, so it is better.
return better;
}
else if (otherParameterCount > thisParameterCount)
{
// The other candidate had more declared parameters, so it was better.
return worse;
}
}
// Nothing worked, the two candidates are equally applicable.
return equal;
}
internal object InvokeConstructor()
{
return ctor.Invoke(ctorArgs);
}
}
private object MatchArgument(Type parameterType, CodeExpression arg)
{
Type argExprType = arg.GetType();
if (TypeProvider.IsAssignable(parameterType, argExprType))
{
// The argument expression type is assignable to the parameter type,
// so it goes through unscathed.
return arg;
}
else
{
// See if the argument is a constant value, whose type is compatible with
// the parameter.
CodePrimitiveExpression argPrimitive = arg as CodePrimitiveExpression;
if (argPrimitive != null)
{
ValidationError error = null;
Type argPrimitiveType = validation.ExpressionInfo(argPrimitive).ExpressionType;
if (RuleValidation.TypesAreAssignable(argPrimitiveType, parameterType, argPrimitive, out error))
{
// The constant expression's type matched the parameter, so
// use the actual primitive's value as the argument.
return argPrimitive.Value;
}
}
}
return null;
}
private List<CandidateConstructor> GetCandidateConstructors(ConstructorInfo[] allCtors, List<CodeExpression> arguments)
{
if (allCtors == null || allCtors.Length == 0)
return null;
int numArgs = arguments.Count;
List<CandidateConstructor> candidates = new List<CandidateConstructor>(allCtors.Length);
for (int c = 0; c < allCtors.Length; ++c)
{
ConstructorInfo ctor = allCtors[c];
ParameterInfo[] parms = ctor.GetParameters();
if (parms.Length == 0)
{
if (numArgs == 0)
{
// Trivial match...
candidates.Add(new CandidateConstructor(ctor, new object[0], false));
break; // No other candidates will match.
}
}
else
{
int parameterCount = parms.Length;
int fixedParameterCount = parameterCount;
ParameterInfo lastParm = parms[parameterCount - 1];
if (lastParm.ParameterType.IsArray)
{
object[] attrs = lastParm.GetCustomAttributes(typeof(ParamArrayAttribute), false);
if (attrs != null && attrs.Length > 0)
fixedParameterCount -= 1;
}
if (numArgs < fixedParameterCount)
{
// Too few arguments to match
continue;
}
else if (fixedParameterCount == parameterCount && numArgs != parameterCount)
{
// Too many arguments were passed for this to be a candidate.
continue;
}
object[] ctorArgs = new object[parameterCount];
// Make sure all the fixed arguments match the fixed parameters.
int p;
for (p = 0; p < fixedParameterCount; ++p)
{
object matchedArg = MatchArgument(parms[p].ParameterType, arguments[p]);
if (matchedArg == null)
break;
ctorArgs[p] = matchedArg;
}
if (p != fixedParameterCount)
{
// At least one of the fixed arguments didn't match the corresponding parameter, so this
// can't be a candidate.
continue;
}
if (fixedParameterCount == parameterCount)
{
// We had a match, and there was no params expansion.
candidates.Add(new CandidateConstructor(ctor, ctorArgs, false));
}
else
{
// Handle the 'params' portion.
if (numArgs == fixedParameterCount)
{
// We have a match, in its expanded form, with nothing being passed as the last
// argument.
candidates.Add(new CandidateConstructor(ctor, ctorArgs, true));
}
else
{
if (numArgs == fixedParameterCount + 1 && validation.ExpressionInfo(arguments[p]).ExpressionType == typeof(NullLiteral))
{
// Another special case. The last argument, which matches the "params" array,
// is the null literal. That's all it is allowed to be, since we allow no other
// way to pass an 'array literal'. The constructor matches WITHOUT expansion.
candidates.Add(new CandidateConstructor(ctor, ctorArgs, false));
}
else
{
Type paramType = parms[p].ParameterType;
System.Diagnostics.Debug.Assert(paramType.IsArray, "last parameter in 'params' list must have an array type");
Type elementType = paramType.GetElementType();
Array paramsArgs = (Array)paramType.InvokeMember(paramType.Name, BindingFlags.CreateInstance, null, null, new object[] { numArgs - fixedParameterCount }, CultureInfo.CurrentCulture);
ctorArgs[fixedParameterCount] = paramsArgs;
// Try matching the rest of the arguments to the params array element type.
for (; p < numArgs; ++p)
{
object matchedArg = MatchArgument(elementType, arguments[p]);
if (matchedArg == null)
break;
paramsArgs.SetValue(matchedArg, p - fixedParameterCount);
}
if (p != numArgs)
{
// At least one of the params arguments didn't match the last parameter's element type, so this
// can't be a candidate.
continue;
}
// We passed all the tests, it's a candidate.
candidates.Add(new CandidateConstructor(ctor, ctorArgs, fixedParameterCount != parameterCount));
}
}
}
}
}
return candidates;
}
static CandidateConstructor FindBestConstructor(List<CandidateConstructor> candidates)
{
int numCandidates = candidates.Count;
System.Diagnostics.Debug.Assert(numCandidates > 0, "expected at least one candidate");
// Start by assuming the first candidate is the best one.
List<CandidateConstructor> bestCandidates = new List<CandidateConstructor>(1);
bestCandidates.Add(candidates[0]);
// Go through the rest of the candidates and try to find a better one. (If
// there are no more candidates, then there was only one, and that's the right
// one.)
for (int i = 1; i < numCandidates; ++i)
{
CandidateConstructor newCandidate = candidates[i];
// Compare this new candidate one if the current "best" ones. (If there
// is currently more than one best candidate, then so far its ambiguous, which
// means all the best ones are equally good. Thus if this new candidate
// is better than one, it's better than all.
CandidateConstructor bestCandidate = bestCandidates[0];
int comparison = newCandidate.CompareConstructor(bestCandidate);
if (comparison > 0)
{
// The new one was better than at least one of the best ones. It
// becomes the new best one.
bestCandidates.Clear();
bestCandidates.Add(newCandidate);
}
else if (comparison == 0)
{
// The new one was no better, so add it to the list of current best.
// (Unless we find a better one, it's ambiguous so far.)
bestCandidates.Add(newCandidate);
}
}
if (bestCandidates.Count == 1)
{
// Good, there was exactly one best match.
return bestCandidates[0];
}
// Otherwise, it must have been ambiguous.
return null;
}
private object ConstructCustomType(Type type, List<CodeExpression> arguments, int lparenPosition)
{
string message;
// Build a list of candidate constructors.
ConstructorInfo[] ctors = type.GetConstructors(BindingFlags.Public | BindingFlags.Instance);
List<CandidateConstructor> candidates = GetCandidateConstructors(ctors, arguments);
if (candidates == null || candidates.Count == 0)
{
message = string.Format(CultureInfo.CurrentCulture, Messages.UnknownMethod, type.Name, RuleDecompiler.DecompileType(type));
throw new RuleSyntaxException(ErrorNumbers.Error_MethodNotExists, message, lparenPosition);
}
// Select the best constructor from the list of candidates.
CandidateConstructor bestCandidate = FindBestConstructor(candidates);
if (bestCandidate == null)
{
// It was ambiguous.
message = string.Format(CultureInfo.CurrentCulture, Messages.AmbiguousConstructor, type.Name);
throw new RuleSyntaxException(ErrorNumbers.Error_CannotResolveMember, message, lparenPosition);
}
// Invoke the constructor.
object result = null;
try
{
result = bestCandidate.InvokeConstructor();
}
catch (TargetInvocationException invokeEx)
{
if (invokeEx.InnerException == null)
throw; // just rethrow this one in the unlikely case the inner one is null.
// Rethrow the inner exception's message as a RuleSyntaxException.
throw new RuleSyntaxException(ErrorNumbers.Error_MethodNotExists, invokeEx.InnerException.Message, lparenPosition);
}
return result;
}
#endregion
#region Validation Helpers
private void ValidateExpression(ParserContext parserContext, CodeExpression expression, bool assignIsEquality, ValueCheck check)
{
// If the current token is an assignment operator, then make sure the expression is validated
// correctly (written-to). Note that because we allow "=" (Token.Assign) as a synonym for
// "==" (Token.Equal), we need to distinguish whether we're parsing a condition vs an action.
// In other words, we need to be sure that the "=" really is an "=".
if (parserContext.CurrentToken.TokenID == TokenID.Assign && !assignIsEquality)
check = ValueCheck.Write;
// use value in check
RuleExpressionInfo exprInfo = null;
if ((check & ValueCheck.Read) != 0)
{
exprInfo = RuleExpressionWalker.Validate(Validator, expression, false);
// check write if set and first validate succeeded
if ((exprInfo != null) && ((check & ValueCheck.Write) != 0))
exprInfo = RuleExpressionWalker.Validate(Validator, expression, true);
}
else if ((check & ValueCheck.Write) != 0)
exprInfo = RuleExpressionWalker.Validate(Validator, expression, true);
if (exprInfo == null && Validator.Errors.Count > 0)
{
// Choose the first one and throw it.
ValidationError error = Validator.Errors[0];
// Try to get the position, or just use zero if we can't.
object errorObject = error.UserData[RuleUserDataKeys.ErrorObject];
int position = 0;
parserContext.exprPositions.TryGetValue(errorObject, out position);
throw new RuleSyntaxException(error.ErrorNumber, error.ErrorText, position);
}
}
private void ValidateStatement(ParserContext parserContext, CodeStatement statement)
{
if (!CodeDomStatementWalker.Validate(Validator, statement) && Validator.Errors.Count > 0)
{
// Choose the first one and throw it.
ValidationError error = Validator.Errors[0];
// Try to get the position, or just use zero if we can't.
object errorObject = error.UserData[RuleUserDataKeys.ErrorObject];
int position = 0;
parserContext.exprPositions.TryGetValue(errorObject, out position);
throw new RuleSyntaxException(error.ErrorNumber, error.ErrorText, position);
}
}
private void ValidateAction(ParserContext parserContext, RuleAction action)
{
if (!action.Validate(validation))
{
// Choose the first one and throw it.
ValidationError error = Validator.Errors[0];
// Try to get the position, or just use zero if we can't.
object errorObject = error.UserData[RuleUserDataKeys.ErrorObject];
int position = 0;
parserContext.exprPositions.TryGetValue(errorObject, out position);
throw new RuleSyntaxException(error.ErrorNumber, error.ErrorText, position);
}
}
#endregion
}
}
|