Module: Heist::Scheme

Includes:
Treetop::Runtime
Included in:
SchemeParser
Defined in:
lib/heist/parser/nodes.rb,
lib/heist/parser/scheme.rb

Overview

:nodoc:

Defined Under Namespace

Modules: Boolean0, Cell0, Cell1, Cells0, Cells1, Cells2, Character0, Comment0, Comment1, Complex0, Datum0, Datum1, Identifier, Identifier0, Identifier1, Identifier2, Identifier3, Ignore0, Ignore1, Integer0, Integer1, List, List0, List1, Program0, Rational0, Real0, Real1, Shebang0, Shebang1, String0, Vector, Vector0, Vector1 Classes: Boolean, Cell, Character, Complex, Datum, Integer, Program, QuotedCell, Rational, Real, String

Constant Summary collapse

SHORTHANDS =

Any list-generating shorthands present in the grammar should be listed here. In Scheme, this list includes the various quoting symbols that can be used as shorthands for calling quoting functions.

{
  "'"   => 'quote',
  "`"   => 'quasiquote',
  ","   => 'unquote',
  ",@"  => 'unquote-splicing'
}

Instance Method Summary collapse

Instance Method Details

#_nt_atom ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 712

def _nt_atom
  start_index = index
  if node_cache[:atom].has_key?(index)
    cached = node_cache[:atom][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  r1 = _nt_datum
  if r1
    r0 = r1
  else
    r2 = _nt_identifier
    if r2
      r0 = r2
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:atom][start_index] = r0

  return r0
end

#_nt_boolean ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 835

def _nt_boolean
  start_index = index
  if node_cache[:boolean].has_key?(index)
    cached = node_cache[:boolean][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  r1 = _nt_hash
  s0 << r1
  if r1
    if input.index(Regexp.new('[tf]'), index) == index
      r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      r2 = nil
    end
    s0 << r2
  end
  if s0.last
    r0 = instantiate_node(Boolean,input, i0...index, s0)
    r0.extend(Boolean0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:boolean][start_index] = r0

  return r0
end

#_nt_cell ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 171

def _nt_cell
  start_index = index
  if node_cache[:cell].has_key?(index)
    cached = node_cache[:cell][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  i1, s1 = index, []
  r2 = _nt_ignore
  s1 << r2
  if r2
    r3 = _nt_quote
    s1 << r3
    if r3
      r4 = _nt_cell
      s1 << r4
    end
  end
  if s1.last
    r1 = instantiate_node(QuotedCell,input, i1...index, s1)
    r1.extend(Cell0)
  else
    self.index = i1
    r1 = nil
  end
  if r1
    r0 = r1
  else
    i5, s5 = index, []
    r6 = _nt_ignore
    s5 << r6
    if r6
      i7 = index
      r8 = _nt_list
      if r8
        r7 = r8
      else
        r9 = _nt_vector
        if r9
          r7 = r9
        else
          r10 = _nt_atom
          if r10
            r7 = r10
          else
            self.index = i7
            r7 = nil
          end
        end
      end
      s5 << r7
      if r7
        r11 = _nt_ignore
        s5 << r11
      end
    end
    if s5.last
      r5 = instantiate_node(Cell,input, i5...index, s5)
      r5.extend(Cell1)
    else
      self.index = i5
      r5 = nil
    end
    if r5
      r0 = r5
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:cell][start_index] = r0

  return r0
end

#_nt_cells ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 476

def _nt_cells
  start_index = index
  if node_cache[:cells].has_key?(index)
    cached = node_cache[:cells][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  i1, s1 = index, []
  s2, i2 = [], index
  loop do
    r3 = _nt_cell
    if r3
      s2 << r3
    else
      break
    end
  end
  if s2.empty?
    self.index = i2
    r2 = nil
  else
    r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
  end
  s1 << r2
  if r2
    i4, s4 = index, []
    r5 = _nt_dot
    s4 << r5
    if r5
      r6 = _nt_space
      s4 << r6
      if r6
        r7 = _nt_cell
        s4 << r7
      end
    end
    if s4.last
      r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
      r4.extend(Cells0)
    else
      self.index = i4
      r4 = nil
    end
    s1 << r4
  end
  if s1.last
    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
    r1.extend(Cells1)
  else
    self.index = i1
    r1 = nil
  end
  if r1
    r0 = r1
  else
    i8, s8 = index, []
    s9, i9 = [], index
    loop do
      r10 = _nt_cell
      if r10
        s9 << r10
      else
        break
      end
    end
    r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
    s8 << r9
    if r9
      r11 = _nt_ignore
      s8 << r11
    end
    if s8.last
      r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
      r8.extend(Cells2)
    else
      self.index = i8
      r8 = nil
    end
    if r8
      r0 = r8
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:cells][start_index] = r0

  return r0
end

#_nt_character ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1203

def _nt_character
  start_index = index
  if node_cache[:character].has_key?(index)
    cached = node_cache[:character][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  if input.index("#\\", index) == index
    r1 = instantiate_node(SyntaxNode,input, index...(index + 2))
    @index += 2
  else
    terminal_parse_failure("#\\")
    r1 = nil
  end
  s0 << r1
  if r1
    i2 = index
    r3 = _nt_identifier
    if r3
      r2 = r3
    else
      if index < input_length
        r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure("any character")
        r4 = nil
      end
      if r4
        r2 = r4
      else
        self.index = i2
        r2 = nil
      end
    end
    s0 << r2
  end
  if s0.last
    r0 = instantiate_node(Character,input, i0...index, s0)
    r0.extend(Character0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:character][start_index] = r0

  return r0
end

#_nt_comment ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1678

def _nt_comment
  start_index = index
  if node_cache[:comment].has_key?(index)
    cached = node_cache[:comment][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  if input.index(";", index) == index
    r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure(";")
    r1 = nil
  end
  s0 << r1
  if r1
    s2, i2 = [], index
    loop do
      i3, s3 = index, []
      i4 = index
      if input.index(Regexp.new('[\\n\\r]'), index) == index
        r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        r5 = nil
      end
      if r5
        r4 = nil
      else
        self.index = i4
        r4 = instantiate_node(SyntaxNode,input, index...index)
      end
      s3 << r4
      if r4
        if index < input_length
          r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          terminal_parse_failure("any character")
          r6 = nil
        end
        s3 << r6
      end
      if s3.last
        r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
        r3.extend(Comment0)
      else
        self.index = i3
        r3 = nil
      end
      if r3
        s2 << r3
      else
        break
      end
    end
    r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
    s0 << r2
  end
  if s0.last
    r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
    r0.extend(Comment1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:comment][start_index] = r0

  return r0
end

#_nt_complex ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 916

def _nt_complex
  start_index = index
  if node_cache[:complex].has_key?(index)
    cached = node_cache[:complex][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  i1 = index
  r2 = _nt_real
  if r2
    r1 = r2
  else
    r3 = _nt_integer
    if r3
      r1 = r3
    else
      self.index = i1
      r1 = nil
    end
  end
  s0 << r1
  if r1
    if input.index("+", index) == index
      r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("+")
      r4 = nil
    end
    s0 << r4
    if r4
      i5 = index
      r6 = _nt_real
      if r6
        r5 = r6
      else
        r7 = _nt_integer
        if r7
          r5 = r7
        else
          self.index = i5
          r5 = nil
        end
      end
      s0 << r5
      if r5
        if input.index("i", index) == index
          r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          terminal_parse_failure("i")
          r8 = nil
        end
        s0 << r8
      end
    end
  end
  if s0.last
    r0 = instantiate_node(Complex,input, i0...index, s0)
    r0.extend(Complex0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:complex][start_index] = r0

  return r0
end

#_nt_datum ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 745

def _nt_datum
  start_index = index
  if node_cache[:datum].has_key?(index)
    cached = node_cache[:datum][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  i1 = index
  r2 = _nt_boolean
  if r2
    r1 = r2
  else
    r3 = _nt_number
    if r3
      r1 = r3
    else
      r4 = _nt_character
      if r4
        r1 = r4
      else
        r5 = _nt_string
        if r5
          r1 = r5
        else
          self.index = i1
          r1 = nil
        end
      end
    end
  end
  s0 << r1
  if r1
    i6 = index
    i7, s7 = index, []
    i8 = index
    r9 = _nt_delimiter
    if r9
      r8 = nil
    else
      self.index = i8
      r8 = instantiate_node(SyntaxNode,input, index...index)
    end
    s7 << r8
    if r8
      if index < input_length
        r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure("any character")
        r10 = nil
      end
      s7 << r10
    end
    if s7.last
      r7 = instantiate_node(SyntaxNode,input, i7...index, s7)
      r7.extend(Datum0)
    else
      self.index = i7
      r7 = nil
    end
    if r7
      r6 = nil
    else
      self.index = i6
      r6 = instantiate_node(SyntaxNode,input, index...index)
    end
    s0 << r6
  end
  if s0.last
    r0 = instantiate_node(Datum,input, i0...index, s0)
    r0.extend(Datum1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:datum][start_index] = r0

  return r0
end

#_nt_delimiter ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1527

def _nt_delimiter
  start_index = index
  if node_cache[:delimiter].has_key?(index)
    cached = node_cache[:delimiter][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  r1 = _nt_quote
  if r1
    r0 = r1
  else
    r2 = _nt_hash
    if r2
      r0 = r2
    else
      r3 = _nt_paren
      if r3
        r0 = r3
      else
        r4 = _nt_space
        if r4
          r0 = r4
        else
          self.index = i0
          r0 = nil
        end
      end
    end
  end

  node_cache[:delimiter][start_index] = r0

  return r0
end

#_nt_digit ⇒ Object 



1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
 
# File 'lib/heist/parser/scheme.rb', line 1480

def _nt_digit
  start_index = index
  if node_cache[:digit].has_key?(index)
    cached = node_cache[:digit][index]
    @index = cached.interval.end if cached
    return cached
  end

  if input.index(Regexp.new('[0-9]'), index) == index
    r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    r0 = nil
  end

  node_cache[:digit][start_index] = r0

  return r0
end

#_nt_dot ⇒ Object 



310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
 
# File 'lib/heist/parser/scheme.rb', line 310

def _nt_dot
  start_index = index
  if node_cache[:dot].has_key?(index)
    cached = node_cache[:dot][index]
    @index = cached.interval.end if cached
    return cached
  end

  if input.index(".", index) == index
    r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure(".")
    r0 = nil
  end

  node_cache[:dot][start_index] = r0

  return r0
end

#_nt_hash ⇒ Object 



331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
 
# File 'lib/heist/parser/scheme.rb', line 331

def _nt_hash
  start_index = index
  if node_cache[:hash].has_key?(index)
    cached = node_cache[:hash][index]
    @index = cached.interval.end if cached
    return cached
  end

  if input.index("#", index) == index
    r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure("#")
    r0 = nil
  end

  node_cache[:hash][start_index] = r0

  return r0
end

#_nt_identifier ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1346

def _nt_identifier
  start_index = index
  if node_cache[:identifier].has_key?(index)
    cached = node_cache[:identifier][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  i1, s1 = index, []
  i2, s2 = index, []
  i3 = index
  r4 = _nt_delimiter
  if r4
    r3 = nil
  else
    self.index = i3
    r3 = instantiate_node(SyntaxNode,input, index...index)
  end
  s2 << r3
  if r3
    if index < input_length
      r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("any character")
      r5 = nil
    end
    s2 << r5
  end
  if s2.last
    r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
    r2.extend(Identifier0)
  else
    self.index = i2
    r2 = nil
  end
  s1 << r2
  if r2
    s6, i6 = [], index
    loop do
      i7, s7 = index, []
      i8 = index
      r9 = _nt_delimiter
      if r9
        r8 = nil
      else
        self.index = i8
        r8 = instantiate_node(SyntaxNode,input, index...index)
      end
      s7 << r8
      if r8
        if index < input_length
          r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          terminal_parse_failure("any character")
          r10 = nil
        end
        s7 << r10
      end
      if s7.last
        r7 = instantiate_node(SyntaxNode,input, i7...index, s7)
        r7.extend(Identifier1)
      else
        self.index = i7
        r7 = nil
      end
      if r7
        s6 << r7
      else
        break
      end
    end
    if s6.empty?
      self.index = i6
      r6 = nil
    else
      r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
    end
    s1 << r6
  end
  if s1.last
    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
    r1.extend(Identifier2)
  else
    self.index = i1
    r1 = nil
  end
  if r1
    r0 = r1
    r0.extend(Identifier)
  else
    i11, s11 = index, []
    i12 = index
    r13 = _nt_reserved
    if r13
      r12 = nil
    else
      self.index = i12
      r12 = instantiate_node(SyntaxNode,input, index...index)
    end
    s11 << r12
    if r12
      if index < input_length
        r14 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure("any character")
        r14 = nil
      end
      s11 << r14
    end
    if s11.last
      r11 = instantiate_node(SyntaxNode,input, i11...index, s11)
      r11.extend(Identifier3)
    else
      self.index = i11
      r11 = nil
    end
    if r11
      r0 = r11
      r0.extend(Identifier)
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:identifier][start_index] = r0

  return r0
end

#_nt_ignore ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1617

def _nt_ignore
  start_index = index
  if node_cache[:ignore].has_key?(index)
    cached = node_cache[:ignore][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  s1, i1 = [], index
  loop do
    r2 = _nt_space
    if r2
      s1 << r2
    else
      break
    end
  end
  r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
  s0 << r1
  if r1
    i4, s4 = index, []
    r5 = _nt_comment
    s4 << r5
    if r5
      r6 = _nt_ignore
      s4 << r6
    end
    if s4.last
      r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
      r4.extend(Ignore0)
    else
      self.index = i4
      r4 = nil
    end
    if r4
      r3 = r4
    else
      r3 = instantiate_node(SyntaxNode,input, index...index)
    end
    s0 << r3
  end
  if s0.last
    r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
    r0.extend(Ignore1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:ignore][start_index] = r0

  return r0
end

#_nt_integer ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1113

def _nt_integer
  start_index = index
  if node_cache[:integer].has_key?(index)
    cached = node_cache[:integer][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  if input.index("-", index) == index
    r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure("-")
    r2 = nil
  end
  if r2
    r1 = r2
  else
    r1 = instantiate_node(SyntaxNode,input, index...index)
  end
  s0 << r1
  if r1
    i3 = index
    if input.index("0", index) == index
      r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("0")
      r4 = nil
    end
    if r4
      r3 = r4
    else
      i5, s5 = index, []
      if input.index(Regexp.new('[1-9]'), index) == index
        r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        r6 = nil
      end
      s5 << r6
      if r6
        s7, i7 = [], index
        loop do
          r8 = _nt_digit
          if r8
            s7 << r8
          else
            break
          end
        end
        r7 = instantiate_node(SyntaxNode,input, i7...index, s7)
        s5 << r7
      end
      if s5.last
        r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
        r5.extend(Integer0)
      else
        self.index = i5
        r5 = nil
      end
      if r5
        r3 = r5
      else
        self.index = i3
        r3 = nil
      end
    end
    s0 << r3
  end
  if s0.last
    r0 = instantiate_node(Integer,input, i0...index, s0)
    r0.extend(Integer1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:integer][start_index] = r0

  return r0
end

#_nt_list ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 366

def _nt_list
  start_index = index
  if node_cache[:list].has_key?(index)
    cached = node_cache[:list][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  i1, s1 = index, []
  if input.index("(", index) == index
    r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure("(")
    r2 = nil
  end
  s1 << r2
  if r2
    r3 = _nt_cells
    s1 << r3
    if r3
      if input.index(")", index) == index
        r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure(")")
        r4 = nil
      end
      s1 << r4
    end
  end
  if s1.last
    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
    r1.extend(List0)
  else
    self.index = i1
    r1 = nil
  end
  if r1
    r0 = r1
    r0.extend(List)
  else
    i5, s5 = index, []
    if input.index("[", index) == index
      r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("[")
      r6 = nil
    end
    s5 << r6
    if r6
      r7 = _nt_cells
      s5 << r7
      if r7
        if input.index("]", index) == index
          r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          terminal_parse_failure("]")
          r8 = nil
        end
        s5 << r8
      end
    end
    if s5.last
      r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
      r5.extend(List1)
    else
      self.index = i5
      r5 = nil
    end
    if r5
      r0 = r5
      r0.extend(List)
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:list][start_index] = r0

  return r0
end

#_nt_number ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 868

def _nt_number
  start_index = index
  if node_cache[:number].has_key?(index)
    cached = node_cache[:number][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  r1 = _nt_complex
  if r1
    r0 = r1
  else
    r2 = _nt_real
    if r2
      r0 = r2
    else
      r3 = _nt_rational
      if r3
        r0 = r3
      else
        r4 = _nt_integer
        if r4
          r0 = r4
        else
          self.index = i0
          r0 = nil
        end
      end
    end
  end

  node_cache[:number][start_index] = r0

  return r0
end

#_nt_paren ⇒ Object 



1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
 
# File 'lib/heist/parser/scheme.rb', line 1564

def _nt_paren
  start_index = index
  if node_cache[:paren].has_key?(index)
    cached = node_cache[:paren][index]
    @index = cached.interval.end if cached
    return cached
  end

  if input.index(Regexp.new('[\\(\\)\\[\\]]'), index) == index
    r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    r0 = nil
  end

  node_cache[:paren][start_index] = r0

  return r0
end

#_nt_program ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 12

def _nt_program
  start_index = index
  if node_cache[:program].has_key?(index)
    cached = node_cache[:program][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  r2 = _nt_shebang
  if r2
    r1 = r2
  else
    r1 = instantiate_node(SyntaxNode,input, index...index)
  end
  s0 << r1
  if r1
    s3, i3 = [], index
    loop do
      r4 = _nt_cell
      if r4
        s3 << r4
      else
        break
      end
    end
    r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
    s0 << r3
  end
  if s0.last
    r0 = instantiate_node(Program,input, i0...index, s0)
    r0.extend(Program0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:program][start_index] = r0

  return r0
end

#_nt_quote ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 249

def _nt_quote
  start_index = index
  if node_cache[:quote].has_key?(index)
    cached = node_cache[:quote][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  if input.index("'", index) == index
    r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure("'")
    r1 = nil
  end
  if r1
    r0 = r1
  else
    if input.index("`", index) == index
      r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("`")
      r2 = nil
    end
    if r2
      r0 = r2
    else
      if input.index(",@", index) == index
        r3 = instantiate_node(SyntaxNode,input, index...(index + 2))
        @index += 2
      else
        terminal_parse_failure(",@")
        r3 = nil
      end
      if r3
        r0 = r3
      else
        if input.index(",", index) == index
          r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          terminal_parse_failure(",")
          r4 = nil
        end
        if r4
          r0 = r4
        else
          self.index = i0
          r0 = nil
        end
      end
    end
  end

  node_cache[:quote][start_index] = r0

  return r0
end

#_nt_rational ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1069

def _nt_rational
  start_index = index
  if node_cache[:rational].has_key?(index)
    cached = node_cache[:rational][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  r1 = _nt_integer
  s0 << r1
  if r1
    if input.index("/", index) == index
      r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("/")
      r2 = nil
    end
    s0 << r2
    if r2
      r3 = _nt_integer
      s0 << r3
    end
  end
  if s0.last
    r0 = instantiate_node(Rational,input, i0...index, s0)
    r0.extend(Rational0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:rational][start_index] = r0

  return r0
end

#_nt_real ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 998

def _nt_real
  start_index = index
  if node_cache[:real].has_key?(index)
    cached = node_cache[:real][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  r1 = _nt_integer
  s0 << r1
  if r1
    i2, s2 = index, []
    if input.index(".", index) == index
      r3 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure(".")
      r3 = nil
    end
    s2 << r3
    if r3
      s4, i4 = [], index
      loop do
        r5 = _nt_digit
        if r5
          s4 << r5
        else
          break
        end
      end
      if s4.empty?
        self.index = i4
        r4 = nil
      else
        r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
      end
      s2 << r4
    end
    if s2.last
      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
      r2.extend(Real0)
    else
      self.index = i2
      r2 = nil
    end
    s0 << r2
  end
  if s0.last
    r0 = instantiate_node(Real,input, i0...index, s0)
    r0.extend(Real1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:real][start_index] = r0

  return r0
end

#_nt_reserved ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1500

def _nt_reserved
  start_index = index
  if node_cache[:reserved].has_key?(index)
    cached = node_cache[:reserved][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  r1 = _nt_dot
  if r1
    r0 = r1
  else
    r2 = _nt_delimiter
    if r2
      r0 = r2
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:reserved][start_index] = r0

  return r0
end

#_nt_shebang ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 60

def _nt_shebang
  start_index = index
  if node_cache[:shebang].has_key?(index)
    cached = node_cache[:shebang][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  s1, i1 = [], index
  loop do
    r2 = _nt_space
    if r2
      s1 << r2
    else
      break
    end
  end
  r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
  s0 << r1
  if r1
    if input.index("#!", index) == index
      r3 = instantiate_node(SyntaxNode,input, index...(index + 2))
      @index += 2
    else
      terminal_parse_failure("#!")
      r3 = nil
    end
    s0 << r3
    if r3
      s4, i4 = [], index
      loop do
        i5, s5 = index, []
        i6 = index
        if input.index(Regexp.new('[\\n\\r]'), index) == index
          r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          r7 = nil
        end
        if r7
          r6 = nil
        else
          self.index = i6
          r6 = instantiate_node(SyntaxNode,input, index...index)
        end
        s5 << r6
        if r6
          if index < input_length
            r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
            @index += 1
          else
            terminal_parse_failure("any character")
            r8 = nil
          end
          s5 << r8
        end
        if s5.last
          r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
          r5.extend(Shebang0)
        else
          self.index = i5
          r5 = nil
        end
        if r5
          s4 << r5
        else
          break
        end
      end
      r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
      s0 << r4
    end
  end
  if s0.last
    r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
    r0.extend(Shebang1)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:shebang][start_index] = r0

  return r0
end

#_nt_space ⇒ Object 



1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
 
# File 'lib/heist/parser/scheme.rb', line 1584

def _nt_space
  start_index = index
  if node_cache[:space].has_key?(index)
    cached = node_cache[:space][index]
    @index = cached.interval.end if cached
    return cached
  end

  if input.index(Regexp.new('[\\s\\n\\r\\t]'), index) == index
    r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    r0 = nil
  end

  node_cache[:space][start_index] = r0

  return r0
end

#_nt_string ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 1258

def _nt_string
  start_index = index
  if node_cache[:string].has_key?(index)
    cached = node_cache[:string][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0, s0 = index, []
  if input.index('"', index) == index
    r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
    @index += 1
  else
    terminal_parse_failure('"')
    r1 = nil
  end
  s0 << r1
  if r1
    s2, i2 = [], index
    loop do
      i3 = index
      if input.index('\\"', index) == index
        r4 = instantiate_node(SyntaxNode,input, index...(index + 2))
        @index += 2
      else
        terminal_parse_failure('\\"')
        r4 = nil
      end
      if r4
        r3 = r4
      else
        if input.index(Regexp.new('[^"]'), index) == index
          r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
          @index += 1
        else
          r5 = nil
        end
        if r5
          r3 = r5
        else
          self.index = i3
          r3 = nil
        end
      end
      if r3
        s2 << r3
      else
        break
      end
    end
    r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
    s0 << r2
    if r2
      if input.index('"', index) == index
        r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure('"')
        r6 = nil
      end
      s0 << r6
    end
  end
  if s0.last
    r0 = instantiate_node(String,input, i0...index, s0)
    r0.extend(String0)
  else
    self.index = i0
    r0 = nil
  end

  node_cache[:string][start_index] = r0

  return r0
end

#_nt_vector ⇒ Object 



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
 
# File 'lib/heist/parser/scheme.rb', line 591

def _nt_vector
  start_index = index
  if node_cache[:vector].has_key?(index)
    cached = node_cache[:vector][index]
    @index = cached.interval.end if cached
    return cached
  end

  i0 = index
  i1, s1 = index, []
  r2 = _nt_hash
  s1 << r2
  if r2
    if input.index("(", index) == index
      r3 = instantiate_node(SyntaxNode,input, index...(index + 1))
      @index += 1
    else
      terminal_parse_failure("(")
      r3 = nil
    end
    s1 << r3
    if r3
      s4, i4 = [], index
      loop do
        r5 = _nt_cell
        if r5
          s4 << r5
        else
          break
        end
      end
      r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
      s1 << r4
      if r4
        r6 = _nt_ignore
        s1 << r6
        if r6
          if input.index(")", index) == index
            r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
            @index += 1
          else
            terminal_parse_failure(")")
            r7 = nil
          end
          s1 << r7
        end
      end
    end
  end
  if s1.last
    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
    r1.extend(Vector0)
  else
    self.index = i1
    r1 = nil
  end
  if r1
    r0 = r1
    r0.extend(Vector)
  else
    i8, s8 = index, []
    r9 = _nt_hash
    s8 << r9
    if r9
      if input.index("[", index) == index
        r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
        @index += 1
      else
        terminal_parse_failure("[")
        r10 = nil
      end
      s8 << r10
      if r10
        s11, i11 = [], index
        loop do
          r12 = _nt_cell
          if r12
            s11 << r12
          else
            break
          end
        end
        r11 = instantiate_node(SyntaxNode,input, i11...index, s11)
        s8 << r11
        if r11
          r13 = _nt_ignore
          s8 << r13
          if r13
            if input.index("]", index) == index
              r14 = instantiate_node(SyntaxNode,input, index...(index + 1))
              @index += 1
            else
              terminal_parse_failure("]")
              r14 = nil
            end
            s8 << r14
          end
        end
      end
    end
    if s8.last
      r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
      r8.extend(Vector1)
    else
      self.index = i8
      r8 = nil
    end
    if r8
      r0 = r8
      r0.extend(Vector)
    else
      self.index = i0
      r0 = nil
    end
  end

  node_cache[:vector][start_index] = r0

  return r0
end

#root ⇒ Object 



5
6
7
 
# File 'lib/heist/parser/scheme.rb', line 5

def root
  @root || :program
end