[2782e3]: src / terminal / parser.cc Maximize Restore History

Download this file

parser.cc    3384 lines (2962 with data), 97.4 kB

   1
   2
   3
   4
   5
   6
   7
   8
   9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40
  41
  42
  43
  44
  45
  46
  47
  48
  49
  50
  51
  52
  53
  54
  55
  56
  57
  58
  59
  60
  61
  62
  63
  64
  65
  66
  67
  68
  69
  70
  71
  72
  73
  74
  75
  76
  77
  78
  79
  80
  81
  82
  83
  84
  85
  86
  87
  88
  89
  90
  91
  92
  93
  94
  95
  96
  97
  98
  99
 100
 101
 102
 103
 104
 105
 106
 107
 108
 109
 110
 111
 112
 113
 114
 115
 116
 117
 118
 119
 120
 121
 122
 123
 124
 125
 126
 127
 128
 129
 130
 131
 132
 133
 134
 135
 136
 137
 138
 139
 140
 141
 142
 143
 144
 145
 146
 147
 148
 149
 150
 151
 152
 153
 154
 155
 156
 157
 158
 159
 160
 161
 162
 163
 164
 165
 166
 167
 168
 169
 170
 171
 172
 173
 174
 175
 176
 177
 178
 179
 180
 181
 182
 183
 184
 185
 186
 187
 188
 189
 190
 191
 192
 193
 194
 195
 196
 197
 198
 199
 200
 201
 202
 203
 204
 205
 206
 207
 208
 209
 210
 211
 212
 213
 214
 215
 216
 217
 218
 219
 220
 221
 222
 223
 224
 225
 226
 227
 228
 229
 230
 231
 232
 233
 234
 235
 236
 237
 238
 239
 240
 241
 242
 243
 244
 245
 246
 247
 248
 249
 250
 251
 252
 253
 254
 255
 256
 257
 258
 259
 260
 261
 262
 263
 264
 265
 266
 267
 268
 269
 270
 271
 272
 273
 274
 275
 276
 277
 278
 279
 280
 281
 282
 283
 284
 285
 286
 287
 288
 289
 290
 291
 292
 293
 294
 295
 296
 297
 298
 299
 300
 301
 302
 303
 304
 305
 306
 307
 308
 309
 310
 311
 312
 313
 314
 315
 316
 317
 318
 319
 320
 321
 322
 323
 324
 325
 326
 327
 328
 329
 330
 331
 332
 333
 334
 335
 336
 337
 338
 339
 340
 341
 342
 343
 344
 345
 346
 347
 348
 349
 350
 351
 352
 353
 354
 355
 356
 357
 358
 359
 360
 361
 362
 363
 364
 365
 366
 367
 368
 369
 370
 371
 372
 373
 374
 375
 376
 377
 378
 379
 380
 381
 382
 383
 384
 385
 386
 387
 388
 389
 390
 391
 392
 393
 394
 395
 396
 397
 398
 399
 400
 401
 402
 403
 404
 405
 406
 407
 408
 409
 410
 411
 412
 413
 414
 415
 416
 417
 418
 419
 420
 421
 422
 423
 424
 425
 426
 427
 428
 429
 430
 431
 432
 433
 434
 435
 436
 437
 438
 439
 440
 441
 442
 443
 444
 445
 446
 447
 448
 449
 450
 451
 452
 453
 454
 455
 456
 457
 458
 459
 460
 461
 462
 463
 464
 465
 466
 467
 468
 469
 470
 471
 472
 473
 474
 475
 476
 477
 478
 479
 480
 481
 482
 483
 484
 485
 486
 487
 488
 489
 490
 491
 492
 493
 494
 495
 496
 497
 498
 499
 500
 501
 502
 503
 504
 505
 506
 507
 508
 509
 510
 511
 512
 513
 514
 515
 516
 517
 518
 519
 520
 521
 522
 523
 524
 525
 526
 527
 528
 529
 530
 531
 532
 533
 534
 535
 536
 537
 538
 539
 540
 541
 542
 543
 544
 545
 546
 547
 548
 549
 550
 551
 552
 553
 554
 555
 556
 557
 558
 559
 560
 561
 562
 563
 564
 565
 566
 567
 568
 569
 570
 571
 572
 573
 574
 575
 576
 577
 578
 579
 580
 581
 582
 583
 584
 585
 586
 587
 588
 589
 590
 591
 592
 593
 594
 595
 596
 597
 598
 599
 600
 601
 602
 603
 604
 605
 606
 607
 608
 609
 610
 611
 612
 613
 614
 615
 616
 617
 618
 619
 620
 621
 622
 623
 624
 625
 626
 627
 628
 629
 630
 631
 632
 633
 634
 635
 636
 637
 638
 639
 640
 641
 642
 643
 644
 645
 646
 647
 648
 649
 650
 651
 652
 653
 654
 655
 656
 657
 658
 659
 660
 661
 662
 663
 664
 665
 666
 667
 668
 669
 670
 671
 672
 673
 674
 675
 676
 677
 678
 679
 680
 681
 682
 683
 684
 685
 686
 687
 688
 689
 690
 691
 692
 693
 694
 695
 696
 697
 698
 699
 700
 701
 702
 703
 704
 705
 706
 707
 708
 709
 710
 711
 712
 713
 714
 715
 716
 717
 718
 719
 720
 721
 722
 723
 724
 725
 726
 727
 728
 729
 730
 731
 732
 733
 734
 735
 736
 737
 738
 739
 740
 741
 742
 743
 744
 745
 746
 747
 748
 749
 750
 751
 752
 753
 754
 755
 756
 757
 758
 759
 760
 761
 762
 763
 764
 765
 766
 767
 768
 769
 770
 771
 772
 773
 774
 775
 776
 777
 778
 779
 780
 781
 782
 783
 784
 785
 786
 787
 788
 789
 790
 791
 792
 793
 794
 795
 796
 797
 798
 799
 800
 801
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
/* A Bison parser, made by GNU Bison 2.3. */
/* Skeleton implementation for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.3"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Using locations. */
#define YYLSP_NEEDED 0
/* Substitute the variable and function names. */
#define yyparse zzparse
#define yylex zzlex
#define yyerror zzerror
#define yylval zzlval
#define yychar zzchar
#define yydebug zzdebug
#define yynerrs zznerrs
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
INT = 258,
DOUBLE = 259,
NAME = 260,
STRING = 261,
ENDCMD = 262,
MODEL = 263,
DATA = 264,
IN = 265,
TO = 266,
INITS = 267,
PARAMETERS = 268,
COMPILE = 269,
INITIALIZE = 270,
ADAPT = 271,
UPDATE = 272,
BY = 273,
MONITORS = 274,
MONITOR = 275,
TYPE = 276,
SET = 277,
CLEAR = 278,
THIN = 279,
CODA = 280,
STEM = 281,
EXIT = 282,
NCHAINS = 283,
CHAIN = 284,
LOAD = 285,
SAMPLERS = 286,
LIST = 287,
STRUCTURE = 288,
DIM = 289,
NA = 290,
R_NULL = 291,
DIMNAMES = 292,
ITER = 293,
ARROW = 294,
ENDDATA = 295,
ASINTEGER = 296,
DIRECTORY = 297,
CD = 298,
PWD = 299,
RUN = 300,
ENDSCRIPT = 301
};
#endif
/* Tokens. */
#define INT 258
#define DOUBLE 259
#define NAME 260
#define STRING 261
#define ENDCMD 262
#define MODEL 263
#define DATA 264
#define IN 265
#define TO 266
#define INITS 267
#define PARAMETERS 268
#define COMPILE 269
#define INITIALIZE 270
#define ADAPT 271
#define UPDATE 272
#define BY 273
#define MONITORS 274
#define MONITOR 275
#define TYPE 276
#define SET 277
#define CLEAR 278
#define THIN 279
#define CODA 280
#define STEM 281
#define EXIT 282
#define NCHAINS 283
#define CHAIN 284
#define LOAD 285
#define SAMPLERS 286
#define LIST 287
#define STRUCTURE 288
#define DIM 289
#define NA 290
#define R_NULL 291
#define DIMNAMES 292
#define ITER 293
#define ARROW 294
#define ENDDATA 295
#define ASINTEGER 296
#define DIRECTORY 297
#define CD 298
#define PWD 299
#define RUN 300
#define ENDSCRIPT 301
/* Copy the first part of user declarations. */
#line 2 "../../../JAGS/src/terminal/parser.yy"
#include <config.h>
#include <errno.h>
#include <limits.h>
#include <unistd.h>
#include <dirent.h>
#include <cstdio>
#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <fstream>
#include <list>
#include <Console.h>
#include <compiler/ParseTree.h>
#include <util/nainf.h>
#include <cstdlib>
#include <cstring>
#include <ltdl.h>
#include <cstdio>
#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <fstream>
#include <list>
#include <Console.h>
#include <compiler/ParseTree.h>
#include <util/nainf.h>
#include <cstdlib>
#include <cstring>
#include <ltdl.h>
//Required for warning about masked distributions after module loading
#include <deque>
#include <distribution/Distribution.h>
#include <compiler/Compiler.h>
#include "ReadData.h"
typedef void(*pt2Func)();
int zzerror(const char *);
int zzlex();
#define YYERROR_VERBOSE 0
static Console *console;
std::vector<bool> interactive;
void setName(ParseTree *p, std::string *name);
std::map<std::string, SArray> _data_table;
std::deque<lt_dlhandle> _modules;
bool open_data_buffer(std::string const *name);
bool open_command_buffer(std::string const *name);
void pop_buffer();
void return_to_main_buffer();
void setMonitor(ParseTree const *var, int thin, std::string const &type);
void clearMonitor(ParseTree const *var, std::string const &type);
void setDefaultMonitors(std::string const &type, unsigned int thin);
void doCoda (ParseTree const *var, std::string const &stem);
void doAllCoda (std::string const &stem);
void doDump (std::string const &file, DumpType type, unsigned int chain);
void dumpMonitors(std::string const &file, std::string const &type);
static bool getWorkingDirectory(std::string &name);
static void errordump();
static void updatestar(long niter, long refresh, int width);
static void adaptstar(long niter, long refresh, int width);
static void setParameters(ParseTree *p, ParseTree *param1);
static void setParameters(ParseTree *p, std::vector<ParseTree*> *parameters);
static void setParameters(ParseTree *p, ParseTree *param1, ParseTree *param2);
static void loadModule(std::string const &name);
static void dumpSamplers(std::string const &file);
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
#line 87 "../../../JAGS/src/terminal/parser.yy"
{
int intval;
double val;
std::string *stringptr;
ParseTree *ptree;
std::vector<ParseTree*> *pvec;
std::vector<double> *vec;
std::vector<long> *ivec;
}
/* Line 193 of yacc.c. */
#line 288 "../../../JAGS/src/terminal/parser.cc"
YYSTYPE;
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 216 of yacc.c. */
#line 301 "../../../JAGS/src/terminal/parser.cc"
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#elif (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
typedef signed char yytype_int8;
#else
typedef short int yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int i)
#else
static int
YYID (i)
int i;
#endif
{
return i;
}
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined _STDLIB_H \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss;
YYSTYPE yyvs;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (YYID (0))
# endif
# endif
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (YYID (0))
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 2
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 245
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 58
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 52
/* YYNRULES -- Number of rules. */
#define YYNRULES 126
/* YYNRULES -- Number of states. */
#define YYNSTATES 268
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 301
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const yytype_uint8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
48, 49, 53, 2, 47, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 52, 54,
2, 56, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 50, 2, 51, 2, 2, 55, 2, 2, 57,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 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
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint16 yyprhs[] =
{
0, 0, 3, 4, 7, 9, 12, 15, 17, 20,
22, 24, 26, 28, 30, 32, 34, 36, 38, 40,
42, 44, 46, 48, 50, 52, 54, 56, 58, 62,
65, 69, 71, 75, 79, 82, 86, 95, 97, 101,
110, 114, 118, 120, 127, 129, 132, 140, 143, 151,
153, 155, 160, 162, 166, 168, 172, 174, 176, 178,
182, 191, 194, 202, 210, 222, 234, 245, 256, 263,
267, 276, 280, 289, 291, 293, 296, 304, 307, 315,
318, 322, 324, 327, 331, 335, 339, 343, 345, 349,
356, 358, 360, 364, 368, 372, 374, 376, 381, 383,
388, 390, 394, 396, 398, 402, 404, 408, 410, 414,
416, 421, 423, 428, 433, 435, 437, 442, 444, 448,
450, 455, 457, 461, 463, 466, 468
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yytype_int8 yyrhs[] =
{
59, 0, -1, -1, 59, 60, -1, 7, -1, 61,
7, -1, 1, 7, -1, 109, -1, 46, 7, -1,
62, -1, 63, -1, 64, -1, 66, -1, 67, -1,
68, -1, 70, -1, 71, -1, 72, -1, 73, -1,
79, -1, 82, -1, 84, -1, 85, -1, 74, -1,
108, -1, 106, -1, 107, -1, 86, -1, 8, 10,
83, -1, 8, 23, -1, 65, 87, 40, -1, 65,
-1, 9, 11, 83, -1, 9, 10, 83, -1, 9,
23, -1, 69, 87, 40, -1, 69, 87, 40, 47,
29, 48, 3, 49, -1, 69, -1, 13, 11, 83,
-1, 13, 11, 83, 47, 29, 48, 3, 49, -1,
13, 10, 83, -1, 12, 10, 83, -1, 14, -1,
14, 47, 28, 48, 3, 49, -1, 15, -1, 16,
3, -1, 16, 3, 47, 18, 48, 3, 49, -1,
17, 3, -1, 17, 3, 47, 18, 48, 3, 49,
-1, 27, -1, 5, -1, 5, 50, 76, 51, -1,
77, -1, 76, 47, 77, -1, 78, -1, 78, 52,
78, -1, 3, -1, 80, -1, 81, -1, 20, 22,
75, -1, 20, 22, 75, 47, 24, 48, 3, 49,
-1, 20, 75, -1, 20, 75, 47, 24, 48, 3,
49, -1, 20, 75, 47, 21, 48, 5, 49, -1,
20, 75, 47, 21, 48, 5, 49, 24, 48, 3,
49, -1, 20, 75, 47, 24, 48, 3, 49, 21,
48, 5, 49, -1, 20, 47, 24, 48, 3, 49,
21, 48, 5, 49, -1, 20, 47, 21, 48, 5,
49, 24, 48, 3, 49, -1, 20, 47, 21, 48,
5, 49, -1, 20, 23, 75, -1, 20, 23, 75,
47, 21, 48, 5, 49, -1, 19, 11, 83, -1,
19, 11, 83, 47, 21, 48, 5, 49, -1, 5,
-1, 6, -1, 25, 75, -1, 25, 75, 47, 26,
48, 83, 49, -1, 25, 53, -1, 25, 53, 47,
26, 48, 83, 49, -1, 30, 83, -1, 31, 11,
83, -1, 88, -1, 87, 88, -1, 87, 54, 88,
-1, 89, 39, 90, -1, 89, 39, 93, -1, 89,
39, 6, -1, 6, -1, 55, 5, 55, -1, 33,
48, 93, 47, 91, 49, -1, 92, -1, 98, -1,
91, 47, 98, -1, 91, 47, 92, -1, 34, 56,
93, -1, 94, -1, 95, -1, 41, 48, 95, 49,
-1, 97, -1, 57, 48, 96, 49, -1, 97, -1,
96, 47, 97, -1, 4, -1, 35, -1, 5, 56,
101, -1, 100, -1, 99, 47, 100, -1, 101, -1,
5, 56, 101, -1, 102, -1, 41, 48, 102, 49,
-1, 104, -1, 32, 48, 99, 49, -1, 33, 48,
99, 49, -1, 36, -1, 4, -1, 57, 48, 103,
49, -1, 4, -1, 103, 47, 4, -1, 6, -1,
57, 48, 105, 49, -1, 6, -1, 105, 47, 6,
-1, 44, -1, 43, 83, -1, 42, -1, 45, 83,
-1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 158, 158, 159, 162, 163, 164, 165, 166, 169,
170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
180, 181, 182, 183, 184, 185, 186, 187, 190, 201,
206, 214, 217, 223, 234, 240, 259, 272, 275, 279,
285, 294, 306, 309, 314, 321, 325, 330, 335, 340,
343, 346, 352, 355, 360, 363, 369, 372, 373, 376,
379, 382, 385, 388, 392, 396, 400, 404, 407, 412,
415, 421, 427, 439, 440, 443, 446, 449, 452, 457,
460, 469, 472, 475, 480, 483, 488, 496, 497, 502,
513, 514, 515, 516, 519, 524, 525, 528, 531, 535,
541, 542, 545, 546, 552, 555, 556, 559, 560, 563,
564, 565, 566, 567, 568, 571, 572, 575, 576, 579,
580, 583, 584, 589, 600, 608, 632
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "INT", "DOUBLE", "NAME", "STRING",
"ENDCMD", "MODEL", "DATA", "IN", "TO", "INITS", "PARAMETERS", "COMPILE",
"INITIALIZE", "ADAPT", "UPDATE", "BY", "MONITORS", "MONITOR", "TYPE",
"SET", "CLEAR", "THIN", "CODA", "STEM", "EXIT", "NCHAINS", "CHAIN",
"LOAD", "SAMPLERS", "LIST", "STRUCTURE", "DIM", "NA", "R_NULL",
"DIMNAMES", "ITER", "ARROW", "ENDDATA", "ASINTEGER", "DIRECTORY", "CD",
"PWD", "RUN", "ENDSCRIPT", "','", "'('", "')'", "'['", "']'", "':'",
"'*'", "';'", "'`'", "'='", "'c'", "$accept", "input", "line", "command",
"model", "data_in", "data_to", "data", "data_clear", "parameters_in",
"parameters_to", "parameters", "compile", "initialize", "adapt",
"update", "exit", "var", "range_list", "range_element", "index",
"monitor", "monitor_set", "monitor_clear", "monitors_to", "file_name",
"coda", "load", "samplers_to", "r_assignment_list", "r_assignment",
"r_name", "r_structure", "r_attribute_list", "r_dim", "r_collection",
"r_integer_collection", "r_value_collection", "r_value_list", "r_value",
"r_generic_attribute", "r_generic_list", "r_generic_list_element",
"r_generic_vector", "r_numeric_vector", "r_double_list",
"r_character_vector", "r_string_list", "get_working_dir",
"set_working_dir", "read_dir", "run_script", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const yytype_uint16 yytoknum[] =
{
0, 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, 44, 40, 41,
91, 93, 58, 42, 59, 96, 61, 99
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 58, 59, 59, 60, 60, 60, 60, 60, 61,
61, 61, 61, 61, 61, 61, 61, 61, 61, 61,
61, 61, 61, 61, 61, 61, 61, 61, 62, 62,
63, 63, 64, 65, 66, 67, 67, 67, 68, 68,
69, 69, 70, 70, 71, 72, 72, 73, 73, 74,
75, 75, 76, 76, 77, 77, 78, 79, 79, 80,
80, 80, 80, 80, 80, 80, 80, 80, 80, 81,
81, 82, 82, 83, 83, 84, 84, 84, 84, 85,
86, 87, 87, 87, 88, 88, 88, 89, 89, 90,
91, 91, 91, 91, 92, 93, 93, 94, 95, 95,
96, 96, 97, 97, 98, 99, 99, 100, 100, 101,
101, 101, 101, 101, 101, 102, 102, 103, 103, 104,
104, 105, 105, 106, 107, 108, 109
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 0, 2, 1, 2, 2, 1, 2, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 3, 2,
3, 1, 3, 3, 2, 3, 8, 1, 3, 8,
3, 3, 1, 6, 1, 2, 7, 2, 7, 1,
1, 4, 1, 3, 1, 3, 1, 1, 1, 3,
8, 2, 7, 7, 11, 11, 10, 10, 6, 3,
8, 3, 8, 1, 1, 2, 7, 2, 7, 2,
3, 1, 2, 3, 3, 3, 3, 1, 3, 6,
1, 1, 3, 3, 3, 1, 1, 4, 1, 4,
1, 3, 1, 1, 3, 1, 3, 1, 3, 1,
4, 1, 4, 4, 1, 1, 4, 1, 3, 1,
4, 1, 3, 1, 2, 1, 2
};
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
2, 0, 1, 0, 4, 0, 0, 0, 0, 42,
44, 0, 0, 0, 0, 0, 49, 0, 0, 125,
0, 123, 0, 0, 3, 0, 9, 10, 11, 31,
12, 13, 14, 37, 15, 16, 17, 18, 23, 19,
57, 58, 20, 21, 22, 27, 25, 26, 24, 7,
6, 0, 29, 0, 0, 34, 0, 0, 0, 0,
45, 47, 0, 50, 0, 0, 0, 61, 77, 75,
73, 74, 79, 0, 124, 126, 8, 5, 87, 0,
0, 81, 0, 0, 28, 33, 32, 41, 40, 38,
0, 0, 0, 71, 0, 59, 69, 0, 0, 0,
0, 0, 80, 0, 30, 0, 82, 0, 35, 0,
0, 0, 0, 0, 56, 0, 52, 54, 0, 0,
0, 0, 0, 0, 0, 0, 88, 83, 102, 86,
0, 103, 0, 0, 84, 85, 95, 96, 98, 0,
0, 0, 0, 0, 0, 0, 51, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 43, 0, 0, 0, 53, 55, 0, 0, 68,
0, 0, 0, 0, 0, 0, 0, 0, 100, 0,
0, 46, 48, 0, 0, 0, 0, 0, 63, 62,
78, 76, 0, 97, 0, 99, 0, 39, 72, 60,
70, 0, 0, 0, 0, 0, 0, 0, 90, 91,
101, 36, 0, 0, 0, 0, 0, 0, 0, 89,
67, 66, 0, 0, 115, 119, 0, 0, 114, 0,
0, 104, 109, 111, 94, 93, 92, 64, 65, 0,
0, 0, 0, 0, 0, 105, 107, 0, 0, 0,
117, 121, 0, 0, 0, 0, 112, 113, 0, 110,
0, 116, 0, 120, 108, 106, 118, 122
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 1, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 67, 115, 116,
117, 39, 40, 41, 42, 72, 43, 44, 45, 80,
81, 82, 134, 207, 208, 135, 136, 137, 177, 138,
209, 244, 245, 246, 232, 252, 233, 253, 46, 47,
48, 49
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -211
static const yytype_int16 yypact[] =
{
-211, 72, -211, 25, -211, 86, 83, 10, 118, -38,
-211, 65, 87, 89, 60, 2, -211, 125, 94, -211,
125, -211, 125, 105, -211, 112, -211, -211, -211, 16,
-211, -211, -211, 16, -211, -211, -211, -211, -211, -211,
-211, -211, -211, -211, -211, -211, -211, -211, -211, -211,
-211, 125, -211, 125, 125, -211, 125, 125, 125, 108,
85, 90, 125, 88, 128, 128, 4, 92, 93, 95,
-211, -211, -211, 125, -211, -211, -211, -211, -211, 136,
21, -211, 106, 23, -211, -211, -211, -211, -211, 96,
98, 126, 129, 101, 146, 103, 107, 109, 110, 80,
127, 130, -211, 97, -211, 16, -211, 17, 113, 122,
152, 111, 114, 140, -211, -33, -211, 115, 139, 143,
160, 163, 120, 121, 123, 124, -211, -211, -211, -211,
131, -211, 132, 133, -211, -211, -211, -211, -211, 141,
134, 135, 170, 171, 137, 146, -211, 146, 138, 142,
144, 145, 172, 173, 125, 125, 0, 12, 63, 147,
175, -211, 148, 149, 178, -211, -211, 184, 183, 151,
168, 150, 153, 154, 155, 158, 157, -23, -211, 188,
159, -211, -211, 161, 162, 164, 166, 167, 176, 180,
-211, -211, 61, -211, 63, -211, 169, -211, -211, -211,
-211, 189, 191, 174, 177, 156, 165, 64, -211, -211,
-211, -211, 179, 181, 204, 211, 13, 0, 61, -211,
-211, -211, 182, 185, -211, -211, 187, 190, -211, 192,
193, -211, -211, -211, -211, -211, -211, -211, -211, 7,
7, -1, 104, 186, 73, -211, -211, 74, 195, 196,
-211, -211, 77, 78, 13, 7, -211, -211, 205, -211,
213, -211, 214, -211, -211, -211, -211, -211
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-211, -211, -211, -211, -211, -211, -211, -211, -211, -211,
-211, -211, -211, -211, -211, -211, -211, -5, -211, 79,
76, -211, -211, -211, -211, -20, -211, -211, -211, 194,
-75, -211, -211, -211, 1, -155, -211, 69, -211, -143,
11, -8, -22, -210, -4, -211, -211, -211, -211, -211,
-211, -211
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -1
static const yytype_uint16 yytable[] =
{
74, 175, 75, 224, 128, 106, 231, 63, 106, 59,
69, 224, 243, 225, 145, 178, 128, 224, 146, 225,
56, 128, 78, 129, 194, 97, 195, 78, 98, 78,
127, 84, 50, 85, 86, 131, 87, 88, 89, 226,
227, 132, 93, 228, 264, 226, 227, 131, 229, 228,
130, 210, 131, 102, 229, 68, 248, 133, 132, 95,
96, 104, 234, 108, 230, 63, 205, 128, 60, 133,
230, 79, 2, 3, 133, 105, 79, 105, 79, 4,
5, 6, 64, 65, 7, 8, 9, 10, 11, 12,
61, 13, 14, 53, 54, 206, 51, 15, 131, 16,
62, 122, 17, 18, 123, 73, 55, 66, 250, 52,
251, 218, 76, 219, 19, 20, 21, 22, 23, 77,
255, 255, 256, 257, 260, 262, 261, 263, 57, 58,
70, 71, 91, 63, 173, 174, 90, 92, 94, 99,
100, 103, 101, 109, 111, 107, 110, 112, 113, 114,
118, 140, 126, 124, 119, 141, 125, 120, 121, 142,
139, 144, 143, 148, 149, 150, 151, 147, 152, 153,
159, 154, 155, 162, 163, 186, 172, 171, 180, 156,
157, 158, 160, 183, 161, 164, 167, 184, 185, 187,
168, 196, 212, 169, 170, 179, 213, 181, 182, 188,
203, 204, 189, 190, 191, 192, 193, 222, 197, 250,
198, 199, 216, 200, 201, 202, 223, 266, 211, 235,
267, 217, 214, 166, 165, 215, 176, 83, 220, 236,
221, 237, 247, 265, 238, 239, 0, 249, 240, 0,
241, 242, 254, 258, 0, 259
};
static const yytype_int16 yycheck[] =
{
20, 156, 22, 4, 4, 80, 216, 5, 83, 47,
15, 4, 5, 6, 47, 158, 4, 4, 51, 6,
10, 4, 6, 6, 47, 21, 49, 6, 24, 6,
105, 51, 7, 53, 54, 35, 56, 57, 58, 32,
33, 41, 62, 36, 254, 32, 33, 35, 41, 36,
33, 194, 35, 73, 41, 53, 57, 57, 41, 64,
65, 40, 217, 40, 57, 5, 5, 4, 3, 57,
57, 55, 0, 1, 57, 54, 55, 54, 55, 7,
8, 9, 22, 23, 12, 13, 14, 15, 16, 17,
3, 19, 20, 10, 11, 34, 10, 25, 35, 27,
11, 21, 30, 31, 24, 11, 23, 47, 4, 23,
6, 47, 7, 49, 42, 43, 44, 45, 46, 7,
47, 47, 49, 49, 47, 47, 49, 49, 10, 11,
5, 6, 47, 5, 154, 155, 28, 47, 50, 47,
47, 5, 47, 47, 18, 39, 48, 18, 47, 3,
47, 29, 55, 26, 47, 3, 26, 48, 48, 48,
47, 21, 48, 24, 21, 5, 3, 52, 48, 48,
29, 48, 48, 3, 3, 24, 3, 5, 3, 48,
48, 48, 48, 5, 49, 48, 48, 3, 5, 21,
48, 3, 3, 49, 49, 48, 5, 49, 49, 49,
24, 21, 49, 49, 49, 47, 49, 3, 49, 4,
49, 49, 56, 49, 48, 48, 5, 4, 49, 218,
6, 56, 48, 147, 145, 48, 157, 33, 49, 218,
49, 49, 240, 255, 49, 48, -1, 241, 48, -1,
48, 48, 56, 48, -1, 49
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 59, 0, 1, 7, 8, 9, 12, 13, 14,
15, 16, 17, 19, 20, 25, 27, 30, 31, 42,
43, 44, 45, 46, 60, 61, 62, 63, 64, 65,
66, 67, 68, 69, 70, 71, 72, 73, 74, 79,
80, 81, 82, 84, 85, 86, 106, 107, 108, 109,
7, 10, 23, 10, 11, 23, 10, 10, 11, 47,
3, 3, 11, 5, 22, 23, 47, 75, 53, 75,
5, 6, 83, 11, 83, 83, 7, 7, 6, 55,
87, 88, 89, 87, 83, 83, 83, 83, 83, 83,
28, 47, 47, 83, 50, 75, 75, 21, 24, 47,
47, 47, 83, 5, 40, 54, 88, 39, 40, 47,
48, 18, 18, 47, 3, 76, 77, 78, 47, 47,
48, 48, 21, 24, 26, 26, 55, 88, 4, 6,
33, 35, 41, 57, 90, 93, 94, 95, 97, 47,
29, 3, 48, 48, 21, 47, 51, 52, 24, 21,
5, 3, 48, 48, 48, 48, 48, 48, 48, 29,
48, 49, 3, 3, 48, 77, 78, 48, 48, 49,
49, 5, 3, 83, 83, 93, 95, 96, 97, 48,
3, 49, 49, 5, 3, 5, 24, 21, 49, 49,
49, 49, 47, 49, 47, 49, 3, 49, 49, 49,
49, 48, 48, 24, 21, 5, 34, 91, 92, 98,
97, 49, 3, 5, 48, 48, 56, 56, 47, 49,
49, 49, 3, 5, 4, 6, 32, 33, 36, 41,
57, 101, 102, 104, 93, 92, 98, 49, 49, 48,
48, 48, 48, 5, 99, 100, 101, 99, 57, 102,
4, 6, 103, 105, 56, 47, 49, 49, 48, 49,
47, 49, 47, 49, 101, 100, 4, 6
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (YYID (N)) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (YYID (0))
#endif
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if YYLTYPE_IS_TRIVIAL
# define YY_LOCATION_PRINT(File, Loc) \
fprintf (File, "%d.%d-%d.%d", \
(Loc).first_line, (Loc).first_column, \
(Loc).last_line, (Loc).last_column)
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
#else
static void
yy_stack_print (bottom, top)
yytype_int16 *bottom;
yytype_int16 *top;
#endif
{
YYFPRINTF (stderr, "Stack now");
for (; bottom <= top; ++bottom)
YYFPRINTF (stderr, " %d", *bottom);
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (YYID (0))
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yyrule)
YYSTYPE *yyvsp;
int yyrule;
#endif
{
int yynrhs = yyr2[yyrule];
int yyi;
unsigned long int yylno = yyrline[yyrule];
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
fprintf (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
fprintf (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
const char *yystr;
#endif
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
#endif
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into YYRESULT an error message about the unexpected token
YYCHAR while in state YYSTATE. Return the number of bytes copied,
including the terminating null byte. If YYRESULT is null, do not
copy anything; just return the number of bytes that would be
copied. As a special case, return 0 if an ordinary "syntax error"
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
size calculation. */
static YYSIZE_T
yysyntax_error (char *yyresult, int yystate, int yychar)
{
int yyn = yypact[yystate];
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
return 0;
else
{
int yytype = YYTRANSLATE (yychar);
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
YYSIZE_T yysize = yysize0;
YYSIZE_T yysize1;
int yysize_overflow = 0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
int yyx;
# if 0
/* This is so xgettext sees the translatable formats that are
constructed on the fly. */
YY_("syntax error, unexpected %s");
YY_("syntax error, unexpected %s, expecting %s");
YY_("syntax error, unexpected %s, expecting %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
# endif
char *yyfmt;
char const *yyf;
static char const yyunexpected[] = "syntax error, unexpected %s";
static char const yyexpecting[] = ", expecting %s";
static char const yyor[] = " or %s";
char yyformat[sizeof yyunexpected
+ sizeof yyexpecting - 1
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
* (sizeof yyor - 1))];
char const *yyprefix = yyexpecting;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yycount = 1;
yyarg[0] = yytname[yytype];
yyfmt = yystpcpy (yyformat, yyunexpected);
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
yyformat[sizeof yyunexpected - 1] = '\0';
break;
}
yyarg[yycount++] = yytname[yyx];
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
yyfmt = yystpcpy (yyfmt, yyprefix);
yyprefix = yyor;
}
yyf = YY_(yyformat);
yysize1 = yysize + yystrlen (yyf);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
if (yysize_overflow)
return YYSIZE_MAXIMUM;
if (yyresult)
{
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
char *yyp = yyresult;
int yyi = 0;
while ((*yyp = *yyf) != '\0')
{
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyf += 2;
}
else
{
yyp++;
yyf++;
}
}
}
return yysize;
}
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yymsg, yytype, yyvaluep)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
#endif
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
/* The look-ahead symbol. */
int yychar;
/* The semantic value of the look-ahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#endif
#endif
{
int yystate;
int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Look-ahead token as an internal (translated) token number. */
int yytoken = 0;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss = yyssa;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp;
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
look-ahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to look-ahead token. */
yyn = yypact[yystate];
if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a look-ahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
if (yyn == YYFINAL)
YYACCEPT;
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the look-ahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 158 "../../../JAGS/src/terminal/parser.yy"
{if (interactive.back()) std::cout << ". " << std::flush;}
break;
case 3:
#line 159 "../../../JAGS/src/terminal/parser.yy"
{if (interactive.back()) std::cout << ". " << std::flush;}
break;
case 4:
#line 162 "../../../JAGS/src/terminal/parser.yy"
{}
break;
case 5:
#line 163 "../../../JAGS/src/terminal/parser.yy"
{}
break;
case 6:
#line 164 "../../../JAGS/src/terminal/parser.yy"
{if(interactive.back()) yyerrok; else exit(1); }
break;
case 7:
#line 165 "../../../JAGS/src/terminal/parser.yy"
{ interactive.push_back(false); }
break;
case 8:
#line 166 "../../../JAGS/src/terminal/parser.yy"
{ interactive.pop_back(); }
break;
case 28:
#line 190 "../../../JAGS/src/terminal/parser.yy"
{
std::FILE *file = std::fopen(((yyvsp[(3) - (3)].stringptr))->c_str(), "r");
if (!file) {
std::cerr << "Failed to open file " << *((yyvsp[(3) - (3)].stringptr)) << std::endl;
}
else {
console->checkModel(file);
std::fclose(file);
}
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 29:
#line 201 "../../../JAGS/src/terminal/parser.yy"
{
console->clearModel();
}
break;
case 30:
#line 206 "../../../JAGS/src/terminal/parser.yy"
{
std::string rngname;
readRData((yyvsp[(2) - (3)].pvec), _data_table, rngname);
if (rngname.size() != 0) {
std::cerr << "WARNING: .RNG.name assignment ignored" << std::endl;
}
delete (yyvsp[(2) - (3)].pvec);
}
break;
case 31:
#line 214 "../../../JAGS/src/terminal/parser.yy"
{}
break;
case 32:
#line 217 "../../../JAGS/src/terminal/parser.yy"
{
doDump(*(yyvsp[(3) - (3)].stringptr), DUMP_DATA, 1);
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 33:
#line 223 "../../../JAGS/src/terminal/parser.yy"
{
if(open_data_buffer((yyvsp[(3) - (3)].stringptr))) {
std::cout << "Reading data file " << *(yyvsp[(3) - (3)].stringptr) << std::endl;
}
else {
std::cerr << "Unable to open file " << *(yyvsp[(3) - (3)].stringptr) << std::endl << std::flush;
}
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 34:
#line 234 "../../../JAGS/src/terminal/parser.yy"
{
std::cout << "Clearing data table " << std::endl;
_data_table.clear();
}
break;
case 35:
#line 241 "../../../JAGS/src/terminal/parser.yy"
{
std::map<std::string, SArray> parameter_table;
std::string rngname;
readRData((yyvsp[(2) - (3)].pvec), parameter_table, rngname);
delete (yyvsp[(2) - (3)].pvec);
/* Set all chains to the same state. If the user sets the
RNG state in addition to the parameter values then all
chains will be identical!
*/
for (unsigned int i = 1; i <= console->nchain(); ++i) {
/* We have to set the name first, because the state or seed
might be embedded in the parameter_table */
if (rngname.size() != 0) {
console->setRNGname(rngname, i);
}
console->setParameters(parameter_table, i);
}
}
break;
case 36:
#line 260 "../../../JAGS/src/terminal/parser.yy"
{
std::map<std::string, SArray> parameter_table;
std::string rngname;
readRData((yyvsp[(2) - (8)].pvec), parameter_table, rngname);
delete (yyvsp[(2) - (8)].pvec);
/* We have to set the name first, because the state or seed
might be embedded in the parameter_table */
if (rngname.size() != 0) {
console->setRNGname(rngname, (yyvsp[(7) - (8)].intval));
}
console->setParameters(parameter_table, (yyvsp[(7) - (8)].intval));
}
break;
case 37:
#line 272 "../../../JAGS/src/terminal/parser.yy"
{}
break;
case 38:
#line 275 "../../../JAGS/src/terminal/parser.yy"
{
doDump(*(yyvsp[(3) - (3)].stringptr), DUMP_PARAMETERS, 1);
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 39:
#line 279 "../../../JAGS/src/terminal/parser.yy"
{
doDump(*(yyvsp[(3) - (8)].stringptr), DUMP_PARAMETERS, (yyvsp[(7) - (8)].intval));
delete (yyvsp[(3) - (8)].stringptr);
}
break;
case 40:
#line 285 "../../../JAGS/src/terminal/parser.yy"
{
if(open_data_buffer((yyvsp[(3) - (3)].stringptr))) {
std::cout << "Reading parameter file " << *(yyvsp[(3) - (3)].stringptr) << std::endl;
}
else {
std::cerr << "Unable to open file " << *(yyvsp[(3) - (3)].stringptr) << std::endl << std::flush;
}
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 41:
#line 294 "../../../JAGS/src/terminal/parser.yy"
{
/* Legacy option to not break existing scripts */
if(open_data_buffer((yyvsp[(3) - (3)].stringptr))) {
std::cout << "Reading initial values file " << *(yyvsp[(3) - (3)].stringptr) << std::endl;
}
else {
std::cerr << "Unable to open file " << *(yyvsp[(3) - (3)].stringptr) << std::endl << std::flush;
}
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 42:
#line 306 "../../../JAGS/src/terminal/parser.yy"
{
console->compile(_data_table, 1, true);
}
break;
case 43:
#line 309 "../../../JAGS/src/terminal/parser.yy"
{
console->compile(_data_table, (yyvsp[(5) - (6)].intval), true);
}
break;
case 44:
#line 314 "../../../JAGS/src/terminal/parser.yy"
{
if (!console->initialize()) {
errordump();
}
}
break;
case 45:
#line 321 "../../../JAGS/src/terminal/parser.yy"
{
long refresh = (yyvsp[(2) - (2)].intval)/40;
adaptstar((yyvsp[(2) - (2)].intval), refresh, 40);
}
break;
case 46:
#line 325 "../../../JAGS/src/terminal/parser.yy"
{
adaptstar((yyvsp[(2) - (7)].intval),(yyvsp[(6) - (7)].intval),40);
}
break;
case 47:
#line 330 "../../../JAGS/src/terminal/parser.yy"
{
//fixme: put refresh option
long refresh = (yyvsp[(2) - (2)].intval)/40;
updatestar((yyvsp[(2) - (2)].intval), refresh, 40);
}
break;
case 48:
#line 335 "../../../JAGS/src/terminal/parser.yy"
{
updatestar((yyvsp[(2) - (7)].intval),(yyvsp[(6) - (7)].intval), 40);
}
break;
case 49:
#line 340 "../../../JAGS/src/terminal/parser.yy"
{return 0;}
break;
case 50:
#line 343 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_VAR); setName((yyval.ptree), (yyvsp[(1) - (1)].stringptr));
}
break;
case 51:
#line 346 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_VAR); setName((yyval.ptree), (yyvsp[(1) - (4)].stringptr));
setParameters((yyval.ptree), (yyvsp[(3) - (4)].pvec));
}
break;
case 52:
#line 352 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.pvec) = new std::vector<ParseTree*>(1, (yyvsp[(1) - (1)].ptree));
}
break;
case 53:
#line 355 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.pvec)=(yyvsp[(1) - (3)].pvec); (yyval.pvec)->push_back((yyvsp[(3) - (3)].ptree));
}
break;
case 54:
#line 360 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_RANGE); setParameters((yyval.ptree),(yyvsp[(1) - (1)].ptree));
}
break;
case 55:
#line 363 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_RANGE); setParameters((yyval.ptree), (yyvsp[(1) - (3)].ptree), (yyvsp[(3) - (3)].ptree));
}
break;
case 56:
#line 369 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree) = new ParseTree(P_VALUE); (yyval.ptree)->setValue((yyvsp[(1) - (1)].intval));}
break;
case 59:
#line 376 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(3) - (3)].ptree), 1, "trace"); delete (yyvsp[(3) - (3)].ptree);
}
break;
case 60:
#line 379 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(3) - (8)].ptree), (yyvsp[(7) - (8)].intval), "trace"); delete (yyvsp[(3) - (8)].ptree);
}
break;
case 61:
#line 382 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(2) - (2)].ptree), 1, "trace"); delete (yyvsp[(2) - (2)].ptree);
}
break;
case 62:
#line 385 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(2) - (7)].ptree), (yyvsp[(6) - (7)].intval), "trace"); delete (yyvsp[(2) - (7)].ptree);
}
break;
case 63:
#line 388 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(2) - (7)].ptree), 1, *(yyvsp[(6) - (7)].stringptr));
delete (yyvsp[(6) - (7)].stringptr);
}
break;
case 64:
#line 392 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(2) - (11)].ptree), (yyvsp[(10) - (11)].intval), *(yyvsp[(6) - (11)].stringptr));
delete (yyvsp[(6) - (11)].stringptr);
}
break;
case 65:
#line 396 "../../../JAGS/src/terminal/parser.yy"
{
setMonitor((yyvsp[(2) - (11)].ptree), (yyvsp[(6) - (11)].intval), *(yyvsp[(10) - (11)].stringptr));
delete (yyvsp[(10) - (11)].stringptr);
}
break;
case 66:
#line 400 "../../../JAGS/src/terminal/parser.yy"
{
setDefaultMonitors(*(yyvsp[(9) - (10)].stringptr), (yyvsp[(5) - (10)].intval));
delete (yyvsp[(9) - (10)].stringptr);
}
break;
case 67:
#line 404 "../../../JAGS/src/terminal/parser.yy"
{
setDefaultMonitors(*(yyvsp[(5) - (10)].stringptr), (yyvsp[(9) - (10)].intval));
}
break;
case 68:
#line 407 "../../../JAGS/src/terminal/parser.yy"
{
setDefaultMonitors(*(yyvsp[(5) - (6)].stringptr), 1);
}
break;
case 69:
#line 412 "../../../JAGS/src/terminal/parser.yy"
{
clearMonitor((yyvsp[(3) - (3)].ptree), "trace"); delete (yyvsp[(3) - (3)].ptree);
}
break;
case 70:
#line 415 "../../../JAGS/src/terminal/parser.yy"
{
clearMonitor((yyvsp[(3) - (8)].ptree), *(yyvsp[(7) - (8)].stringptr));
delete (yyvsp[(7) - (8)].stringptr);
}
break;
case 71:
#line 422 "../../../JAGS/src/terminal/parser.yy"
{
dumpMonitors(*(yyvsp[(3) - (3)].stringptr), "trace");
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 72:
#line 427 "../../../JAGS/src/terminal/parser.yy"
{
dumpMonitors(*(yyvsp[(3) - (8)].stringptr), *(yyvsp[(7) - (8)].stringptr));
delete (yyvsp[(3) - (8)].stringptr);
delete (yyvsp[(7) - (8)].stringptr);
}
break;
case 73:
#line 439 "../../../JAGS/src/terminal/parser.yy"
{ (yyval.stringptr) = (yyvsp[(1) - (1)].stringptr);}
break;
case 74:
#line 440 "../../../JAGS/src/terminal/parser.yy"
{ (yyval.stringptr) = (yyvsp[(1) - (1)].stringptr); }
break;
case 75:
#line 443 "../../../JAGS/src/terminal/parser.yy"
{
doCoda ((yyvsp[(2) - (2)].ptree), "CODA"); delete (yyvsp[(2) - (2)].ptree);
}
break;
case 76:
#line 446 "../../../JAGS/src/terminal/parser.yy"
{
doCoda ((yyvsp[(2) - (7)].ptree), *(yyvsp[(6) - (7)].stringptr)); delete (yyvsp[(2) - (7)].ptree); delete (yyvsp[(6) - (7)].stringptr);
}
break;
case 77:
#line 449 "../../../JAGS/src/terminal/parser.yy"
{
doAllCoda ("CODA");
}
break;
case 78:
#line 452 "../../../JAGS/src/terminal/parser.yy"
{
doAllCoda (*(yyvsp[(6) - (7)].stringptr)); delete (yyvsp[(6) - (7)].stringptr);
}
break;
case 79:
#line 457 "../../../JAGS/src/terminal/parser.yy"
{ loadModule(*(yyvsp[(2) - (2)].stringptr)); }
break;
case 80:
#line 461 "../../../JAGS/src/terminal/parser.yy"
{
dumpSamplers(*(yyvsp[(3) - (3)].stringptr));
delete (yyvsp[(3) - (3)].stringptr);
}
break;
case 81:
#line 469 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.pvec) = new std::vector<ParseTree*>(1, (yyvsp[(1) - (1)].ptree));
}
break;
case 82:
#line 472 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.pvec) = (yyvsp[(1) - (2)].pvec); (yyval.pvec)->push_back((yyvsp[(2) - (2)].ptree));
}
break;
case 83:
#line 475 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.pvec) = (yyvsp[(1) - (3)].pvec); (yyval.pvec)->push_back((yyvsp[(3) - (3)].ptree));
}
break;
case 84:
#line 480 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = (yyvsp[(3) - (3)].ptree); setName((yyval.ptree), (yyvsp[(1) - (3)].stringptr));
}
break;
case 85:
#line 483 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_ARRAY);
setName((yyval.ptree), (yyvsp[(1) - (3)].stringptr));
setParameters((yyval.ptree), (yyvsp[(3) - (3)].ptree));
}
break;
case 86:
#line 488 "../../../JAGS/src/terminal/parser.yy"
{
/* Allow this for setting the NAME of the random number generator */
(yyval.ptree) = new ParseTree(P_VAR); setName((yyval.ptree), (yyvsp[(1) - (3)].stringptr));
ParseTree *p = new ParseTree(P_VAR); setName(p, (yyvsp[(3) - (3)].stringptr));
setParameters((yyval.ptree), p);
}
break;
case 88:
#line 497 "../../../JAGS/src/terminal/parser.yy"
{
/* R >= 2.4.0 uses backticks for quoted names */
(yyval.stringptr) = (yyvsp[(2) - (3)].stringptr);
}
break;
case 89:
#line 502 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_ARRAY);
if ((yyvsp[(5) - (6)].ptree))
setParameters((yyval.ptree), (yyvsp[(3) - (6)].ptree), (yyvsp[(5) - (6)].ptree));
else
setParameters((yyval.ptree), (yyvsp[(3) - (6)].ptree));
}
break;
case 91:
#line 514 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree)=0;}
break;
case 93:
#line 516 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree)=(yyvsp[(3) - (3)].ptree);}
break;
case 94:
#line 519 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = (yyvsp[(3) - (3)].ptree);
}
break;
case 97:
#line 528 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree) = (yyvsp[(3) - (4)].ptree);}
break;
case 98:
#line 531 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_VECTOR);
setParameters((yyval.ptree), (yyvsp[(1) - (1)].ptree));
}
break;
case 99:
#line 535 "../../../JAGS/src/terminal/parser.yy"
{
(yyval.ptree) = new ParseTree(P_VECTOR);
setParameters((yyval.ptree), (yyvsp[(3) - (4)].pvec));
}
break;
case 100:
#line 541 "../../../JAGS/src/terminal/parser.yy"
{(yyval.pvec) = new std::vector<ParseTree*>(1, (yyvsp[(1) - (1)].ptree)); }
break;
case 101:
#line 542 "../../../JAGS/src/terminal/parser.yy"
{(yyval.pvec) = (yyvsp[(1) - (3)].pvec); (yyval.pvec)->push_back((yyvsp[(3) - (3)].ptree));}
break;
case 102:
#line 545 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree) = new ParseTree(P_VALUE); (yyval.ptree)->setValue((yyvsp[(1) - (1)].val));}
break;
case 103:
#line 546 "../../../JAGS/src/terminal/parser.yy"
{(yyval.ptree) = new ParseTree(P_VALUE); (yyval.ptree)->setValue(JAGS_NA);}
break;
case 104:
#line 552 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 105:
#line 555 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 106:
#line 556 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 107:
#line 559 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 108:
#line 560 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 109:
#line 563 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 110:
#line 564 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 111:
#line 565 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 112:
#line 566 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 113:
#line 567 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 114:
#line 568 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 115:
#line 571 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 117:
#line 575 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 118:
#line 576 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 119:
#line 579 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 120:
#line 580 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 121:
#line 583 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 122:
#line 584 "../../../JAGS/src/terminal/parser.yy"
{;}
break;
case 123:
#line 590 "../../../JAGS/src/terminal/parser.yy"
{
std::string name;
if (getWorkingDirectory(name)) {
std::cout << name << std::endl;
}
else {
std::cout << "ERROR: " << name << std::endl;
}
}
break;
case 124:
#line 601 "../../../JAGS/src/terminal/parser.yy"
{
if (chdir(((yyvsp[(2) - (2)].stringptr))->c_str()) == -1) {
std::cout << "ERROR: Cannot change working directory" << std::endl;
}
delete (yyvsp[(2) - (2)].stringptr);
}
break;
case 125:
#line 609 "../../../JAGS/src/terminal/parser.yy"
{
std::string name;
if (!getWorkingDirectory(name)) {
std::cerr << "ERROR: Unable to get working directory name\n"
<< name << std::endl;
return 0;
}
DIR *dir;
struct dirent *de;
if ((dir = opendir(name.c_str())) != 0) {
while ((de = readdir(dir)) != 0) {
if (std::strcmp(de->d_name, ".") && std::strcmp(de->d_name, "..")) {
std::cout << de->d_name << "\n";
}
}
closedir(dir);
}
else {
std::cerr << "Unable to open working directory" << std::endl;
}
}
break;
case 126:
#line 632 "../../../JAGS/src/terminal/parser.yy"
{
if(open_command_buffer((yyvsp[(2) - (2)].stringptr))) {
std::cout << "Running script file " << *(yyvsp[(2) - (2)].stringptr) << std::endl;
}
else {
std::cerr << "Unable to open script file " << *(yyvsp[(2) - (2)].stringptr) << std::endl;
}
delete (yyvsp[(2) - (2)].stringptr);
}
break;
/* Line 1267 of yacc.c. */
#line 2467 "../../../JAGS/src/terminal/parser.cc"
default: break;
}
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now `shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
{
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
{
YYSIZE_T yyalloc = 2 * yysize;
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
yyalloc = YYSTACK_ALLOC_MAXIMUM;
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
if (yymsg)
yymsg_alloc = yyalloc;
else
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
}
}
if (0 < yysize && yysize <= yymsg_alloc)
{
(void) yysyntax_error (yymsg, yystate, yychar);
yyerror (yymsg);
}
else
{
yyerror (YY_("syntax error"));
if (yysize != 0)
goto yyexhaustedlab;
}
}
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse look-ahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse look-ahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule which action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (yyn != YYPACT_NINF)
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
if (yyn == YYFINAL)
YYACCEPT;
*++yyvsp = yylval;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#ifndef yyoverflow
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEOF && yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
/* Do not reclaim the symbols of the rule which action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
/* Make sure YYID is used. */
return YYID (yyresult);
}
#line 643 "../../../JAGS/src/terminal/parser.yy"
int zzerror (const char *s)
{
return_to_main_buffer();
std::cerr << s << std::endl;
return 0;
}
static Range getRange(ParseTree const *var)
{
/*
Blank arguments, e.g. foo[] or bar[,1] are not allowed.
*/
unsigned int size = var->parameters().size();
std::vector<int> ind_lower(size), ind_upper(size);
for (unsigned int i = 0; i < size; ++i) {
ParseTree const *range_element = var->parameters()[i];
switch(range_element->parameters().size()) {
case 1:
ind_lower[i] = (int) (range_element->parameters()[0]->value() + 1.0E-6);
ind_upper[i] = ind_lower[i];
break;
case 2:
ind_lower[i] = (int) (range_element->parameters()[0]->value() + 1.0E-6);
ind_upper[i] = (int) (range_element->parameters()[1]->value() + 1.0E-6);
break;
default:
//Error! FIXME
break;
}
}
return Range(ind_lower, ind_upper);
}
void setMonitor(ParseTree const *var, int thin, std::string const &type)
{
std::string const &name = var->name();
if (var->parameters().empty()) {
/* Requesting the whole node */
console->setMonitor(name, Range(), thin, type);
}
else {
/* Requesting subset of a multivariate node */
console->setMonitor(name, getRange(var), thin, type);
}
}
void clearMonitor(ParseTree const *var, std::string const &type)
{
std::string const &name = var->name();
if (var->parameters().empty()) {
/* Requesting the whole node */
console->clearMonitor(name, Range(), type);
}
else {
/* Requesting subset of a multivariate node */
console->clearMonitor(name, getRange(var), type);
}
}
void setDefaultMonitors(std::string const &type, unsigned int thin)
{
console->setDefaultMonitors(type, thin);
}
/*
void doCoda (ParseTree const *var, std::string const &stem)
{
unsigned int nchain = console->nchain();
for (unsigned int n = 0; n < nchain; ++n) {
std::ostringstream outstream;
outstream << stem << n << ".out";
std::string outname = outstream.str();
std::ofstream out(outname.c_str());
if (!out) {
std::cerr << "Failed to open file " << outname << std::endl;
return;
}
std::ostringstream indstream;
indstream << stem << n << ".ind";
std::string indname = indstream.str();
std::ofstream ind(indname.c_str());
if (!ind) {
std::cerr << "Failed to open file " << indname << std::endl;
out.close();
return;
}
if (var->parameters().empty()) {
console->coda(var->name(), Range(), out, ind, n);
}
else {
console->coda(var->name(), getRange(var), out, ind, n);
}
out.close();
ind.close();
}
}
*/
void doAllCoda (std::string const &stem)
{
/* Open index file */
std::ostringstream indstream;
indstream << stem << "index.txt";
std::string indname = indstream.str();
std::ofstream ind(indname.c_str());
if (!ind) {
std::cerr << "Failed to open file " << indname << std::endl;
return;
}
std::vector<std::ofstream*> output;
for (unsigned int n = 0; n < console->nchain(); ++n) {
/* Open output file */
std::ostringstream outstream;
outstream << stem << "chain" << n + 1 << ".txt";
std::string outname = outstream.str();
std::ofstream *out = new std::ofstream(outname.c_str());
if (*out) {
output.push_back(out);
}
else {
ind.close();
for (unsigned int i = 0; i < output.size(); ++i) {
output[i]->close();
}
std::cerr << "Failed to open file " << outname << std::endl;
return;
}
}
console->coda(ind, output);
ind.close();
for (unsigned int i = 0; i < output.size(); ++i) {
output[i]->close();
delete output[i];
}
}
void doCoda (ParseTree const *var, std::string const &stem)
{
/* Open index file */
std::ostringstream indstream;
indstream << stem << "index.txt";
std::string indname = indstream.str();
std::ofstream ind(indname.c_str());
if (!ind) {
std::cerr << "Failed to open file " << indname << std::endl;
return;
}
std::vector<std::ofstream*> output;
for (unsigned int n = 0; n < console->nchain(); ++n) {
/* Open output file */
std::ostringstream outstream;
outstream << stem << "chain" << n + 1 << ".txt";
std::string outname = outstream.str();
std::ofstream *out = new std::ofstream(outname.c_str());
if (*out) {
output.push_back(out);
}
else {
ind.close();
for (unsigned int i = 0; i < output.size(); ++i) {
output[i]->close();
}
std::cerr << "Failed to open file " << outname << std::endl;
return;
}
}
//FIXME: Allow list of several nodes
std::vector<std::pair<std::string, Range> > dmp;
if (var->parameters().empty()) {
/* Requesting the whole node */
dmp.push_back(std::pair<std::string,Range>(var->name(), Range()));
}
else {
/* Requesting subset of a multivariate node */
dmp.push_back(std::pair<std::string,Range>(var->name(), getRange(var)));
}
console->coda(dmp, ind, output);
ind.close();
for (unsigned int i = 0; i < output.size(); ++i) {
output[i]->close();
delete output[i];
}
}
/* Helper function for doDump that handles all the special cases
(missing values etc) when writing a double value */
static void writeValue(double x, std::ostream &out, bool isdiscrete)
{
using namespace std;
if (x == JAGS_NA) {
out << "NA";
}
else if (jags_isnan(x)) {
out << "NaN";
}
else if (!jags_finite(x)) {
if (x > 0)
out << "Inf";
else
out << "-Inf";
}
else if (isdiscrete) {
out << static_cast<int>(x);
}
else {
out << x;
}
}
void doDump(std::string const &file, DumpType type, unsigned int chain)
{
std::map<std::string,SArray> data_table;
std::string rng_name;
if (!console->dumpState(data_table, rng_name, type, chain)) {
return;
}
/* Open output file */
std::ofstream out(file.c_str());
if (!out) {
std::cerr << "Failed to open file " << file << std::endl;
return;
}
if (rng_name.size() != 0) {
out << "\".RNG.name\" <- \"" << rng_name << "\"\n";
}
for (std::map<std::string, SArray>::const_iterator p = data_table.begin();
p != data_table.end(); ++p) {
std::string const &name = p->first;
SArray const &sarray = p->second;
std::vector<double> const &value = sarray.value();
long length = sarray.length();
out << "\"" << name << "\" <- " << std::endl;
std::vector<unsigned int> const &dim = sarray.dim(false);
bool discrete = sarray.isDiscreteValued();
if (discrete) {
out << "as.integer(";
}
if (dim.size() == 1) {
// Vector
if (dim[0] == 1) {
// Scalar
writeValue(value[0], out, sarray.isDiscreteValued());
}
else {
// Vector of length > 1
out << "c(";
for (int i = 0; i < length; ++i) {
if (i > 0) {
out << ",";
}
writeValue(value[i], out, sarray.isDiscreteValued());
}
out << ")";
}
}
else {
// Array
out << "structure(c(";
for (int i = 0; i < length; ++i) {
if (i > 0) {
out << ",";
}
writeValue(value[i], out, sarray.isDiscreteValued());
}
out << "), .Dim = as.integer(c(";
for (unsigned int j = 0; j < dim.size(); ++j) {
if (j > 0) {
out << ",";
}
out << dim[j];
}
out << ")))";
}
if (discrete)
out << ")";
out << "\n";
}
out.close();
}
void dumpMonitors(std::string const &file, std::string const &type)
{
std::map<std::string,SArray> data_table;
std::map<std::string,unsigned int> weight_table;
if (!console->dumpMonitors(data_table, weight_table, type)) {
return;
}
/* Open output file */
std::ofstream out(file.c_str());
if (!out) {
std::cerr << "Failed to open file " << file << std::endl;
return;
}
out << "`" << type << "` <-\nstructure(list(";
std::map<std::string, SArray>::const_iterator p;
for (p = data_table.begin(); p != data_table.end(); ++p) {
std::string const &name = p->first;
SArray const &sarray = p->second;
std::vector<double> const &value = sarray.value();
long length = sarray.length();
if (p != data_table.begin()) {
out << ", \n";
}
out << "\"" << name << "\" = ";
std::vector<unsigned int> const &dim = sarray.dim(false);
bool discrete = sarray.isDiscreteValued();
if (discrete) {
out << "as.integer(";
}
if (dim.size() == 1) {
// Vector
if (dim[0] == 1) {
// Scalar
writeValue(value[0], out, sarray.isDiscreteValued());
}
else {
// Vector of length > 1
out << "c(";
for (int i = 0; i < length; ++i) {
if (i > 0) {
out << ",";
}
writeValue(value[i], out, sarray.isDiscreteValued());
}
out << ")";
}
}
else {
// Array
out << "structure(c(";
for (int i = 0; i < length; ++i) {
if (i > 0) {
out << ",";
}
writeValue(value[i], out, sarray.isDiscreteValued());
}
out << "), .Dim = as.integer(c(";
for (unsigned int j = 0; j < dim.size(); ++j) {
if (j > 0) {
out << ",";
}
out << dim[j];
}
out << ")))";
}
if (discrete)
out << ")";
}
out << "), \n.Names = c(";
for (p = data_table.begin(); p != data_table.end(); ++p) {
if (p != data_table.begin()) {
out << ", ";
}
std::string const &name = p->first;
out << "\"" << name << "\"";
}
out << "), \nweights = c(";
std::map<std::string, unsigned int>::const_iterator q;
for (q = weight_table.begin(); q != weight_table.end(); ++q) {
if (q != weight_table.begin()) {
out << ", ";
}
out << q->second;
}
out << "))";
out.close();
}
void setParameters(ParseTree *p, std::vector<ParseTree*> *parameters)
{
/*
The parser dynamically allocates vectors of (pointers to)
parameters. These vectors must be deleted when we are done with
them.
*/
p->setParameters(*parameters);
delete parameters;
}
void setParameters(ParseTree *p, ParseTree *param1)
{
/*
Wrapper function that creates a vector containing param1
to be passed to ParseTree::setParameters.
*/
std::vector<ParseTree *> parameters(1, param1);
p->setParameters(parameters);
}
void setParameters(ParseTree *p, ParseTree *param1, ParseTree *param2)
{
/*
Wrapper function that creates a vector containing param1
and param2, to be passed to ParseTree::setParameters
*/
std::vector<ParseTree *> parameters;
parameters.push_back(param1);
parameters.push_back(param2);
p->setParameters(parameters);
}
void setName(ParseTree *p, std::string *name)
{
p->setName(*name);
delete name;
}
static void errordump()
{
if (console->model()) {
std::ostringstream fname;
for (unsigned int i = 1; i <= console->nchain(); ++i) {
fname << "jags.dump" << i << ".R";
std::cout << "Dumping chain " << i << " at iteration "
<< console->iter() << " to file " << fname.str() << std::endl;
doDump(fname.str(), DUMP_ALL, i);
fname.str("");
}
}
}
static void updatestar(long niter, long refresh, int width)
{
bool adapt = console->isAdapting();
if (refresh == 0) {
console->update(niter/2);
bool status = true;
if (adapt && !console->adaptOff(status)) {
errordump();
return;
}
console->update(niter - niter/2);
if (!status) {
std::cerr << "WARNING: Adaptation incomplete\n";
}
return;
}
if (width > niter / refresh + 1)
width = niter / refresh + 1;
std::cout << "Updating " << niter << std::endl;
for (int i = 0; i < width - 1; ++i) {
std::cout << "-";
}
std::cout << "| " << std::min(width * refresh, niter) << std::endl
<< std::flush;
int col = 0;
bool status = true;
for (long n = niter; n > 0; n -= refresh) {
if (adapt && n <= niter/2) {
// Turn off adaptive mode half way through burnin
if (console->adaptOff(status)) {
adapt = false;
}
else {
std::cout << std::endl;
errordump();
return;
}
}
long nupdate = std::min(n, refresh);
if(console->update(nupdate))
std::cout << "*" << std::flush;
else {
std::cout << std::endl;
errordump();
return;
}
col++;
if (col == width || n <= nupdate) {
int percent = 100 - (n-nupdate) * 100/niter;
std::cout << " " << percent << "%" << std::endl;
if (n > nupdate) {
col = 0;
}
}
}
if (!status) {
std::cerr << "WARNING: Adaptation incomplete\n";
}
}
static void adaptstar(long niter, long refresh, int width)
{
if (!console->isAdapting()) {
std::cerr << "ERROR: Model is not in adaptive mode\n";
}
bool status = true;
if (refresh == 0) {
console->update(niter);
if (!console->adaptOff(status)) {
errordump();
return;
}
if (!status) {
std::cerr << "WARNING: Adaptation incomplete\n";
}
return;
}
if (width > niter / refresh + 1)
width = niter / refresh + 1;
std::cout << "Adapting " << niter << std::endl;
for (int i = 0; i < width - 1; ++i) {
std::cout << "-";
}
std::cout << "| " << std::min(width * refresh, niter) << std::endl
<< std::flush;
int col = 0;
for (long n = niter; n > 0; n -= refresh) {
long nupdate = std::min(n, refresh);
if(console->update(nupdate))
std::cout << "+" << std::flush;
else {
std::cout << std::endl;
errordump();
return;
}
col++;
if (col == width || n <= nupdate) {
int percent = 100 - (n-nupdate) * 100/niter;
std::cout << " " << percent << "%" << std::endl;
if (n > nupdate) {
col = 0;
}
}
}
if (!console->adaptOff(status)) {
std::cout << std::endl;
errordump();
return;
}
if (!status) {
std::cerr << "WARNING: Adaptation incomplete\n";
}
}
static void loadModule(std::string const &name)
{
//Record number of masked distributions before loading module
std::list<Distribution const *> const &masked_dist =
Compiler::distTab().masked();
unsigned int n_dist = masked_dist.size();
lt_dlhandle mod = lt_dlopenext(name.c_str());
if (mod == NULL) {
std::cout << lt_dlerror() << std::endl;
}
else {
_modules.push_front(mod);
std::cout << "Loading module: " << name << std::endl;
//Warn about newly masked distributions
if (masked_dist.size() > n_dist) {
std::cerr << "Warning: the following distributions were masked "
<< "by module " << name << ":\n";
std::list<Distribution const *>::const_iterator p =
masked_dist.begin();
for(unsigned int i = masked_dist.size(); i > n_dist; --i, ++p) {
std::cerr << (*p)->name() << "\n";
}
std::cerr << std::endl;
}
}
}
int main (int argc, char **argv)
{
extern std::FILE *zzin;
std::FILE *cmdfile = 0;
if (argc > 2) {
std::cerr << "Too many arguments" << std::endl;
}
else if (argc == 2) {
interactive.push_back(false);
cmdfile = std::fopen(argv[1],"r");
if (cmdfile) {
zzin = cmdfile;
}
else {
std::cerr << "Unable to open command file " << argv[1] << std::endl;
return 1;
}
}
else {
interactive.push_back(true);
}
if(lt_dlinit()) {
std::cerr << lt_dlerror() << std::endl;
return 1;
}
/*
pt2Func load_base = (pt2Func)(lt_dlsym(base, "load"));
if (load_base == NULL) {
std::cout << lt_dlerror() << std::endl;
return 1;
}
else{
(*load_base)();
}
*/
time_t t;
time(&t);
std::cout << "Welcome to " << PACKAGE_STRING << " on " << ctime(&t);
std::cout << "JAGS is free software and comes with ABSOLUTELY NO WARRANTY"
<< std::endl;
loadModule("basemod");
loadModule("bugs");
console = new Console(std::cout, std::cerr);
zzparse();
if (argc==2) {
std::fclose(cmdfile);
}
delete console;
//We have to unload modules *AFTER* deleting the console.
for (unsigned int i = 0; i < _modules.size(); ++i) {
lt_dlclose(_modules[i]);
}
lt_dlexit();
}
static bool getWorkingDirectory(std::string &name)
{
char buf[PATH_MAX];
if (getcwd(buf, PATH_MAX)) {
name = buf;
return true;
}
else {
switch(errno) {
case EACCES:
name = "Access denied";
break;
case ENOENT:
name = "Not found";
break;
case ERANGE:
name = "Directory name too long";
break;
default:
name = "Error in getcwd";
break;
}
return false;
}
}
static void dumpSamplers(std::string const &file)
{
std::ofstream out(file.c_str());
if (!out) {
std::cerr << "Failed to open file " << file << std::endl;
return;
}
std::vector<std::vector<std::string> > sampler_list;
console->dumpSamplers(sampler_list);
for (unsigned int i = 0; i < sampler_list.size(); ++i) {
for (unsigned int j = 1; j < sampler_list[i].size(); ++j) {
out << i + 1 << "\t"
<< sampler_list[i][0] << "\t" //First element is sampler name
<< sampler_list[i][j] << "\n"; //Rest are node names
}
}
out.close();
}