Module: Treetop::Compiler::Metagrammar
Defined Under Namespace
Modules: CharacterClass0, CharacterClass1, CharacterClass2, CharacterClass3, CharacterClass4, Choice0, Choice1, Choice2, CommentToEol0, CommentToEol1, DeclarationSequence0, DeclarationSequence1, DeclarationSequence2, DeclarationSequence3, DoubleQuotedString0, DoubleQuotedString1, Grammar0, Grammar1, GrammarName0, IncludeDeclaration0, IncludeDeclaration1, InlineModule0, InlineModule1, KeywordInsideGrammar0, Label0, Label1, Label2, Label3, LabeledSequencePrimary0, LabeledSequencePrimary1, ModuleDeclaration0, ModuleDeclaration1, ModuleDeclaration2, ModuleDeclaration3, NodeClassDeclarations0, NodeClassDeclarations1, NodeClassExpression0, NodeClassExpression1, NodeClassExpression2, NodeClassExpression3, NonSpaceChar0, Nonterminal0, Nonterminal1, ParenthesizedExpression0, ParenthesizedExpression1, ParsingRule0, ParsingRule1, Primary0, Primary1, Primary2, Primary3, Primary4, Primary5, QuotedString0, RequireStatement0, Sequence0, Sequence1, Sequence2, SequencePrimary0, SequencePrimary1, SequencePrimary2, SequencePrimary3, SingleQuotedString0, SingleQuotedString1, TrailingInlineModule0, TrailingInlineModule1, TrailingInlineModule2, TreetopFile0, TreetopFile1, TreetopFile2
Instance Method Summary
collapse
Instance Method Details
#_nt_alpha_char ⇒ Object
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2896
def _nt_alpha_char
start_index = index
if node_cache[:alpha_char].has_key?(index)
cached = node_cache[:alpha_char][index]
@index = cached.interval.end if cached
return cached
end
if input.index(Regexp.new('[A-Za-z_]'), index) == index
r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r0 = nil
end
node_cache[:alpha_char][start_index] = r0
return r0
end
|
#_nt_alphanumeric_char ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2916
def _nt_alphanumeric_char
start_index = index
if node_cache[:alphanumeric_char].has_key?(index)
cached = node_cache[:alphanumeric_char][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_alpha_char
if r1
r0 = r1
else
if input.index(Regexp.new('[0-9]'), index) == index
r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r2 = nil
end
if r2
r0 = r2
else
self.index = i0
r0 = nil
end
end
node_cache[:alphanumeric_char][start_index] = r0
return r0
end
|
#_nt_alternative ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1119
def _nt_alternative
start_index = index
if node_cache[:alternative].has_key?(index)
cached = node_cache[:alternative][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_sequence
if r1
r0 = r1
else
r2 = _nt_primary
if r2
r0 = r2
else
self.index = i0
r0 = nil
end
end
node_cache[:alternative][start_index] = r0
return r0
end
|
#_nt_anything_symbol ⇒ Object
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2449
def _nt_anything_symbol
start_index = index
if node_cache[:anything_symbol].has_key?(index)
cached = node_cache[:anything_symbol][index]
@index = cached.interval.end if cached
return cached
end
if input.index('.', index) == index
r0 = instantiate_node(AnythingSymbol,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('.')
r0 = nil
end
node_cache[:anything_symbol][start_index] = r0
return r0
end
|
#_nt_atomic ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1783
def _nt_atomic
start_index = index
if node_cache[:atomic].has_key?(index)
cached = node_cache[:atomic][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_terminal
if r1
r0 = r1
else
r2 = _nt_nonterminal
if r2
r0 = r2
else
r3 = _nt_parenthesized_expression
if r3
r0 = r3
else
self.index = i0
r0 = nil
end
end
end
node_cache[:atomic][start_index] = r0
return r0
end
|
#_nt_character_class ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2295
def _nt_character_class
start_index = index
if node_cache[:character_class].has_key?(index)
cached = node_cache[:character_class][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(']', index) == index
r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure(']')
r5 = nil
end
if r5
r4 = nil
else
self.index = i4
r4 = instantiate_node(SyntaxNode,input, index...index)
end
s3 << r4
if r4
i6 = index
i7, s7 = index, []
if input.index('\\', index) == index
r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('\\')
r8 = nil
end
s7 << r8
if r8
if index < input_length
r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("any character")
r9 = nil
end
s7 << r9
end
if s7.last
r7 = instantiate_node(SyntaxNode,input, i7...index, s7)
r7.extend(CharacterClass0)
else
self.index = i7
r7 = nil
end
if r7
r6 = r7
else
i10, s10 = index, []
i11 = index
if input.index('\\', index) == index
r12 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('\\')
r12 = nil
end
if r12
r11 = nil
else
self.index = i11
r11 = instantiate_node(SyntaxNode,input, index...index)
end
s10 << r11
if r11
if index < input_length
r13 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("any character")
r13 = nil
end
s10 << r13
end
if s10.last
r10 = instantiate_node(SyntaxNode,input, i10...index, s10)
r10.extend(CharacterClass1)
else
self.index = i10
r10 = nil
end
if r10
r6 = r10
else
self.index = i6
r6 = nil
end
end
s3 << r6
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(CharacterClass2)
else
self.index = i3
r3 = nil
end
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
s0 << r2
if r2
if input.index(']', index) == index
r14 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure(']')
r14 = nil
end
s0 << r14
end
end
if s0.last
r0 = instantiate_node(CharacterClass,input, i0...index, s0)
r0.extend(CharacterClass3)
r0.extend(CharacterClass4)
else
self.index = i0
r0 = nil
end
node_cache[:character_class][start_index] = r0
return r0
end
|
#_nt_choice ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 935
def _nt_choice
start_index = index
if node_cache[:choice].has_key?(index)
cached = node_cache[:choice][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
r1 = _nt_alternative
s0 << r1
if r1
s2, i2 = [], index
loop do
i3, s3 = index, []
r5 = _nt_space
if r5
r4 = r5
else
r4 = instantiate_node(SyntaxNode,input, index...index)
end
s3 << r4
if r4
if input.index('/', index) == index
r6 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('/')
r6 = nil
end
s3 << r6
if r6
r8 = _nt_space
if r8
r7 = r8
else
r7 = instantiate_node(SyntaxNode,input, index...index)
end
s3 << r7
if r7
r9 = _nt_alternative
s3 << r9
end
end
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(Choice0)
else
self.index = i3
r3 = nil
end
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
s0 << r2
end
if s0.last
r0 = instantiate_node(Choice,input, i0...index, s0)
r0.extend(Choice1)
r0.extend(Choice2)
else
self.index = i0
r0 = nil
end
node_cache[:choice][start_index] = r0
return r0
end
|
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2995
def
start_index = index
if node_cache[:comment_to_eol].has_key?(index)
cached = node_cache[:comment_to_eol][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("\n", index) == index
r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("\n")
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(CommentToEol0)
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(CommentToEol1)
else
self.index = i0
r0 = nil
end
node_cache[:comment_to_eol][start_index] = r0
return r0
end
|
#_nt_declaration ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 641
def _nt_declaration
start_index = index
if node_cache[:declaration].has_key?(index)
cached = node_cache[:declaration][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_parsing_rule
if r1
r0 = r1
else
r2 = _nt_include_declaration
if r2
r0 = r2
else
self.index = i0
r0 = nil
end
end
node_cache[:declaration][start_index] = r0
return r0
end
|
#_nt_declaration_sequence ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 571
def _nt_declaration_sequence
start_index = index
if node_cache[:declaration_sequence].has_key?(index)
cached = node_cache[:declaration_sequence][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_declaration
s1 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_space
s4 << r5
if r5
r6 = _nt_declaration
s4 << r6
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(DeclarationSequence0)
else
self.index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s1 << r3
end
if s1.last
r1 = instantiate_node(DeclarationSequence,input, i1...index, s1)
r1.extend(DeclarationSequence1)
r1.extend(DeclarationSequence2)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
if input.index('', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 0))
r7.extend(DeclarationSequence3)
@index += 0
else
terminal_parse_failure('')
r7 = nil
end
if r7
r0 = r7
else
self.index = i0
r0 = nil
end
end
node_cache[:declaration_sequence][start_index] = r0
return r0
end
|
#_nt_double_quoted_string ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2035
def _nt_double_quoted_string
start_index = index
if node_cache[:double_quoted_string].has_key?(index)
cached = node_cache[:double_quoted_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, s3 = index, []
i4 = index
if input.index('"', index) == index
r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('"')
r5 = nil
end
if r5
r4 = nil
else
self.index = i4
r4 = instantiate_node(SyntaxNode,input, index...index)
end
s3 << r4
if r4
i6 = index
if input.index("\\\\", index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure("\\\\")
r7 = nil
end
if r7
r6 = r7
else
if input.index('\"', index) == index
r8 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure('\"')
r8 = nil
end
if r8
r6 = r8
else
if index < input_length
r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("any character")
r9 = nil
end
if r9
r6 = r9
else
self.index = i6
r6 = nil
end
end
end
s3 << r6
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(DoubleQuotedString0)
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
if r2
if input.index('"', index) == index
r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('"')
r10 = nil
end
s0 << r10
end
end
if s0.last
r0 = instantiate_node(Terminal,input, i0...index, s0)
r0.extend(DoubleQuotedString1)
else
self.index = i0
r0 = nil
end
node_cache[:double_quoted_string][start_index] = r0
return r0
end
|
#_nt_grammar ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 398
def _nt_grammar
start_index = index
if node_cache[:grammar].has_key?(index)
cached = node_cache[:grammar][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
if input.index('grammar', index) == index
r1 = instantiate_node(SyntaxNode,input, index...(index + 7))
@index += 7
else
terminal_parse_failure('grammar')
r1 = nil
end
s0 << r1
if r1
r2 = _nt_space
s0 << r2
if r2
r3 = _nt_grammar_name
s0 << r3
if r3
r4 = _nt_space
s0 << r4
if r4
i6, s6 = index, []
if input.index('do', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure('do')
r7 = nil
end
s6 << r7
if r7
r8 = _nt_space
s6 << r8
end
if s6.last
r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
r6.extend(Grammar0)
else
self.index = i6
r6 = nil
end
if r6
r5 = r6
else
r5 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r5
if r5
r9 = _nt_declaration_sequence
s0 << r9
if r9
r11 = _nt_space
if r11
r10 = r11
else
r10 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r10
if r10
if input.index('end', index) == index
r12 = instantiate_node(SyntaxNode,input, index...(index + 3))
@index += 3
else
terminal_parse_failure('end')
r12 = nil
end
s0 << r12
end
end
end
end
end
end
end
if s0.last
r0 = instantiate_node(Grammar,input, i0...index, s0)
r0.extend(Grammar1)
else
self.index = i0
r0 = nil
end
node_cache[:grammar][start_index] = r0
return r0
end
|
#_nt_grammar_name ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 494
def _nt_grammar_name
start_index = index
if node_cache[:grammar_name].has_key?(index)
cached = node_cache[:grammar_name][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
if input.index(Regexp.new('[A-Z]'), index) == index
r1 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r1 = nil
end
s0 << r1
if r1
s2, i2 = [], index
loop do
r3 = _nt_alphanumeric_char
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(GrammarName0)
else
self.index = i0
r0 = nil
end
node_cache[:grammar_name][start_index] = r0
return r0
end
|
#_nt_include_declaration ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 681
def _nt_include_declaration
start_index = index
if node_cache[:include_declaration].has_key?(index)
cached = node_cache[:include_declaration][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
if input.index('include', index) == index
r1 = instantiate_node(SyntaxNode,input, index...(index + 7))
@index += 7
else
terminal_parse_failure('include')
r1 = nil
end
s0 << r1
if r1
r2 = _nt_space
s0 << r2
if r2
if input.index(Regexp.new('[A-Z]'), index) == index
r3 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r3 = nil
end
s0 << r3
if r3
s4, i4 = [], index
loop do
i5 = index
r6 = _nt_alphanumeric_char
if r6
r5 = r6
else
if input.index('::', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure('::')
r7 = nil
end
if r7
r5 = r7
else
self.index = i5
r5 = nil
end
end
if r5
s4 << r5
else
break
end
end
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
s0 << r4
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(IncludeDeclaration0)
r0.extend(IncludeDeclaration1)
else
self.index = i0
r0 = nil
end
node_cache[:include_declaration][start_index] = r0
return r0
end
|
#_nt_inline_module ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2694
def _nt_inline_module
start_index = index
if node_cache[:inline_module].has_key?(index)
cached = node_cache[:inline_module][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
r4 = _nt_inline_module
if r4
r3 = r4
else
i5, s5 = index, []
i6 = index
if input.index(Regexp.new('[{}]'), 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(InlineModule0)
else
self.index = i5
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
r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('}')
r9 = nil
end
s0 << r9
end
end
if s0.last
r0 = instantiate_node(InlineModule,input, i0...index, s0)
r0.extend(InlineModule1)
else
self.index = i0
r0 = nil
end
node_cache[:inline_module][start_index] = r0
return r0
end
|
#_nt_keyword_inside_grammar ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2793
def _nt_keyword_inside_grammar
start_index = index
if node_cache[:keyword_inside_grammar].has_key?(index)
cached = node_cache[:keyword_inside_grammar][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
i1 = index
if input.index('rule', index) == index
r2 = instantiate_node(SyntaxNode,input, index...(index + 4))
@index += 4
else
terminal_parse_failure('rule')
r2 = nil
end
if r2
r1 = r2
else
if input.index('end', index) == index
r3 = instantiate_node(SyntaxNode,input, index...(index + 3))
@index += 3
else
terminal_parse_failure('end')
r3 = nil
end
if r3
r1 = r3
else
self.index = i1
r1 = nil
end
end
s0 << r1
if r1
i4 = index
r5 = _nt_non_space_char
if r5
r4 = nil
else
self.index = i4
r4 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r4
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(KeywordInsideGrammar0)
else
self.index = i0
r0 = nil
end
node_cache[:keyword_inside_grammar][start_index] = r0
return r0
end
|
#_nt_label ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1397
def _nt_label
start_index = index
if node_cache[:label].has_key?(index)
cached = node_cache[:label][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
i2, s2 = index, []
r3 = _nt_alpha_char
s2 << r3
if r3
s4, i4 = [], index
loop do
r5 = _nt_alphanumeric_char
if r5
s4 << r5
else
break
end
end
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
s2 << r4
end
if s2.last
r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
r2.extend(Label0)
else
self.index = i2
r2 = nil
end
s1 << 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
s1 << r6
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(Label1)
r1.extend(Label2)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
if input.index('', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 0))
r7.extend(Label3)
@index += 0
else
terminal_parse_failure('')
r7 = nil
end
if r7
r0 = r7
else
self.index = i0
r0 = nil
end
end
node_cache[:label][start_index] = r0
return r0
end
|
#_nt_labeled_sequence_primary ⇒ 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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1346
def _nt_labeled_sequence_primary
start_index = index
if node_cache[:labeled_sequence_primary].has_key?(index)
cached = node_cache[:labeled_sequence_primary][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
r1 = _nt_label
s0 << r1
if r1
r2 = _nt_sequence_primary
s0 << r2
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(LabeledSequencePrimary0)
r0.extend(LabeledSequencePrimary1)
else
self.index = i0
r0 = nil
end
node_cache[:labeled_sequence_primary][start_index] = r0
return r0
end
|
#_nt_module_declaration ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 264
def _nt_module_declaration
start_index = index
if node_cache[:module_declaration].has_key?(index)
cached = node_cache[:module_declaration][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
i1, s1 = index, []
if input.index('module', index) == index
r2 = instantiate_node(SyntaxNode,input, index...(index + 6))
@index += 6
else
terminal_parse_failure('module')
r2 = nil
end
s1 << r2
if r2
r3 = _nt_space
s1 << r3
if r3
if input.index(Regexp.new('[A-Z]'), index) == index
r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r4 = nil
end
s1 << r4
if r4
s5, i5 = [], index
loop do
r6 = _nt_alphanumeric_char
if r6
s5 << r6
else
break
end
end
r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
s1 << r5
if r5
r7 = _nt_space
s1 << r7
end
end
end
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(ModuleDeclaration0)
else
self.index = i1
r1 = nil
end
s0 << r1
if r1
i8 = index
r9 = _nt_module_declaration
if r9
r8 = r9
else
r10 = _nt_grammar
if r10
r8 = r10
else
self.index = i8
r8 = nil
end
end
s0 << r8
if r8
i11, s11 = index, []
r12 = _nt_space
s11 << r12
if r12
if input.index('end', index) == index
r13 = instantiate_node(SyntaxNode,input, index...(index + 3))
@index += 3
else
terminal_parse_failure('end')
r13 = nil
end
s11 << r13
end
if s11.last
r11 = instantiate_node(SyntaxNode,input, i11...index, s11)
r11.extend(ModuleDeclaration1)
else
self.index = i11
r11 = nil
end
s0 << r11
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(ModuleDeclaration2)
r0.extend(ModuleDeclaration3)
else
self.index = i0
r0 = nil
end
node_cache[:module_declaration][start_index] = r0
return r0
end
|
#_nt_node_class_declarations ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1665
def _nt_node_class_declarations
start_index = index
if node_cache[:node_class_declarations].has_key?(index)
cached = node_cache[:node_class_declarations][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
r1 = _nt_node_class_expression
s0 << r1
if r1
r2 = _nt_trailing_inline_module
s0 << r2
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(NodeClassDeclarations0)
r0.extend(NodeClassDeclarations1)
else
self.index = i0
r0 = nil
end
node_cache[:node_class_declarations][start_index] = r0
return r0
end
|
#_nt_node_class_expression ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2492
def _nt_node_class_expression
start_index = index
if node_cache[:node_class_expression].has_key?(index)
cached = node_cache[:node_class_expression][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_space
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
i5, s5 = index, []
i6 = index
if input.index('>', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('>')
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(NodeClassExpression0)
else
self.index = i5
r5 = nil
end
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
s1 << r4
if r4
if input.index('>', index) == index
r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('>')
r9 = nil
end
s1 << r9
end
end
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(NodeClassExpression1)
r1.extend(NodeClassExpression2)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
if input.index('', index) == index
r10 = instantiate_node(SyntaxNode,input, index...(index + 0))
r10.extend(NodeClassExpression3)
@index += 0
else
terminal_parse_failure('')
r10 = nil
end
if r10
r0 = r10
else
self.index = i0
r0 = nil
end
end
node_cache[:node_class_expression][start_index] = r0
return r0
end
|
#_nt_non_space_char ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2855
def _nt_non_space_char
start_index = index
if node_cache[:non_space_char].has_key?(index)
cached = node_cache[:non_space_char][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
i1 = index
r2 = _nt_space
if r2
r1 = nil
else
self.index = i1
r1 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r1
if r1
if index < input_length
r3 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("any character")
r3 = nil
end
s0 << r3
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(NonSpaceChar0)
else
self.index = i0
r0 = nil
end
node_cache[:non_space_char][start_index] = r0
return r0
end
|
#_nt_nonterminal ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1901
def _nt_nonterminal
start_index = index
if node_cache[:nonterminal].has_key?(index)
cached = node_cache[:nonterminal][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
i1 = index
r2 = _nt_keyword_inside_grammar
if r2
r1 = nil
else
self.index = i1
r1 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r1
if r1
i3, s3 = index, []
r4 = _nt_alpha_char
s3 << r4
if r4
s5, i5 = [], index
loop do
r6 = _nt_alphanumeric_char
if r6
s5 << r6
else
break
end
end
r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
s3 << r5
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(Nonterminal0)
else
self.index = i3
r3 = nil
end
s0 << r3
end
if s0.last
r0 = instantiate_node(Nonterminal,input, i0...index, s0)
r0.extend(Nonterminal1)
else
self.index = i0
r0 = nil
end
node_cache[:nonterminal][start_index] = r0
return r0
end
|
#_nt_optional_suffix ⇒ Object
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1616
def _nt_optional_suffix
start_index = index
if node_cache[:optional_suffix].has_key?(index)
cached = node_cache[:optional_suffix][index]
@index = cached.interval.end if cached
return cached
end
if input.index('?', index) == index
r0 = instantiate_node(Optional,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('?')
r0 = nil
end
node_cache[:optional_suffix][start_index] = r0
return r0
end
|
#_nt_parenthesized_expression ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1828
def _nt_parenthesized_expression
start_index = index
if node_cache[:parenthesized_expression].has_key?(index)
cached = node_cache[:parenthesized_expression][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
r3 = _nt_space
if r3
r2 = r3
else
r2 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r2
if r2
r4 = _nt_parsing_expression
s0 << r4
if r4
r6 = _nt_space
if r6
r5 = r6
else
r5 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r5
if r5
if input.index(')', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure(')')
r7 = nil
end
s0 << r7
end
end
end
end
if s0.last
r0 = instantiate_node(ParenthesizedExpression,input, i0...index, s0)
r0.extend(ParenthesizedExpression0)
r0.extend(ParenthesizedExpression1)
else
self.index = i0
r0 = nil
end
node_cache[:parenthesized_expression][start_index] = r0
return r0
end
|
#_nt_parsing_expression ⇒ Object
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/treetop/compiler/metagrammar.rb', line 873
def _nt_parsing_expression
start_index = index
if node_cache[:parsing_expression].has_key?(index)
cached = node_cache[:parsing_expression][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_choice
if r1
r0 = r1
else
r2 = _nt_sequence
if r2
r0 = r2
else
r3 = _nt_primary
if r3
r0 = r3
else
self.index = i0
r0 = nil
end
end
end
node_cache[:parsing_expression][start_index] = r0
return r0
end
|
#_nt_parsing_rule ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 785
def _nt_parsing_rule
start_index = index
if node_cache[:parsing_rule].has_key?(index)
cached = node_cache[:parsing_rule][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
if input.index('rule', index) == index
r1 = instantiate_node(SyntaxNode,input, index...(index + 4))
@index += 4
else
terminal_parse_failure('rule')
r1 = nil
end
s0 << r1
if r1
r2 = _nt_space
s0 << r2
if r2
r3 = _nt_nonterminal
s0 << r3
if r3
r4 = _nt_space
s0 << r4
if r4
i6, s6 = index, []
if input.index('do', index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure('do')
r7 = nil
end
s6 << r7
if r7
r8 = _nt_space
s6 << r8
end
if s6.last
r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
r6.extend(ParsingRule0)
else
self.index = i6
r6 = nil
end
if r6
r5 = r6
else
r5 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r5
if r5
r9 = _nt_parsing_expression
s0 << r9
if r9
r10 = _nt_space
s0 << r10
if r10
if input.index('end', index) == index
r11 = instantiate_node(SyntaxNode,input, index...(index + 3))
@index += 3
else
terminal_parse_failure('end')
r11 = nil
end
s0 << r11
end
end
end
end
end
end
end
if s0.last
r0 = instantiate_node(ParsingRule,input, i0...index, s0)
r0.extend(ParsingRule1)
else
self.index = i0
r0 = nil
end
node_cache[:parsing_rule][start_index] = r0
return r0
end
|
#_nt_prefix ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1733
def _nt_prefix
start_index = index
if node_cache[:prefix].has_key?(index)
cached = node_cache[:prefix][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
if input.index('&', index) == index
r1 = instantiate_node(AndPredicate,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(NotPredicate,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(TransientPrefix,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('~')
r3 = nil
end
if r3
r0 = r3
else
self.index = i0
r0 = nil
end
end
end
node_cache[:prefix][start_index] = r0
return r0
end
|
#_nt_primary ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1238
def _nt_primary
start_index = index
if node_cache[:primary].has_key?(index)
cached = node_cache[:primary][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_prefix
s1 << r2
if r2
r3 = _nt_atomic
s1 << r3
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(Primary0)
r1.extend(Primary1)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
i4, s4 = index, []
r5 = _nt_atomic
s4 << r5
if r5
r6 = _nt_suffix
s4 << r6
if r6
r7 = _nt_node_class_declarations
s4 << r7
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(Primary2)
r4.extend(Primary3)
else
self.index = i4
r4 = nil
end
if r4
r0 = r4
else
i8, s8 = index, []
r9 = _nt_atomic
s8 << r9
if r9
r10 = _nt_node_class_declarations
s8 << r10
end
if s8.last
r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
r8.extend(Primary4)
r8.extend(Primary5)
else
self.index = i8
r8 = nil
end
if r8
r0 = r8
else
self.index = i0
r0 = nil
end
end
end
node_cache[:primary][start_index] = r0
return r0
end
|
#_nt_quoted_string ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1996
def _nt_quoted_string
start_index = index
if node_cache[:quoted_string].has_key?(index)
cached = node_cache[:quoted_string][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_single_quoted_string
if r1
r0 = r1
r0.extend(QuotedString0)
else
r2 = _nt_double_quoted_string
if r2
r0 = r2
r0.extend(QuotedString0)
else
self.index = i0
r0 = nil
end
end
node_cache[:quoted_string][start_index] = r0
return r0
end
|
#_nt_repetition_suffix ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1694
def _nt_repetition_suffix
start_index = index
if node_cache[:repetition_suffix].has_key?(index)
cached = node_cache[:repetition_suffix][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
if input.index('+', index) == index
r1 = instantiate_node(OneOrMore,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(ZeroOrMore,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('*')
r2 = nil
end
if r2
r0 = r2
else
self.index = i0
r0 = nil
end
end
node_cache[:repetition_suffix][start_index] = r0
return r0
end
|
#_nt_require_statement ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 133
def _nt_require_statement
start_index = index
if node_cache[:require_statement].has_key?(index)
cached = node_cache[:require_statement][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
r2 = _nt_space
if r2
r1 = r2
else
r1 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r1
if r1
if input.index("require", index) == index
r3 = instantiate_node(SyntaxNode,input, index...(index + 7))
@index += 7
else
terminal_parse_failure("require")
r3 = nil
end
s0 << r3
if r3
s4, i4 = [], index
loop do
if input.index(Regexp.new('[ \\t]'), index) == index
r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r5 = nil
end
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
s0 << r4
if r4
s6, i6 = [], index
loop do
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
s6 << r7
else
break
end
end
if s6.empty?
self.index = i6
r6 = nil
else
r6 = instantiate_node(SyntaxNode,input, i6...index, s6)
end
s0 << r6
if r6
if input.index(Regexp.new('[\\n\\r]'), index) == index
r8 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r8 = nil
end
s0 << r8
end
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(RequireStatement0)
else
self.index = i0
r0 = nil
end
node_cache[:require_statement][start_index] = r0
return r0
end
|
#_nt_sequence ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1059
def _nt_sequence
start_index = index
if node_cache[:sequence].has_key?(index)
cached = node_cache[:sequence][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
r1 = _nt_labeled_sequence_primary
s0 << r1
if r1
s2, i2 = [], index
loop do
i3, s3 = index, []
r4 = _nt_space
s3 << r4
if r4
r5 = _nt_labeled_sequence_primary
s3 << r5
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(Sequence0)
else
self.index = i3
r3 = nil
end
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
s0 << r2
if r2
r6 = _nt_node_class_declarations
s0 << r6
end
end
if s0.last
r0 = instantiate_node(Sequence,input, i0...index, s0)
r0.extend(Sequence1)
r0.extend(Sequence2)
else
self.index = i0
r0 = nil
end
node_cache[:sequence][start_index] = r0
return r0
end
|
#_nt_sequence_primary ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1529
def _nt_sequence_primary
start_index = index
if node_cache[:sequence_primary].has_key?(index)
cached = node_cache[:sequence_primary][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_prefix
s1 << r2
if r2
r3 = _nt_atomic
s1 << r3
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(SequencePrimary0)
r1.extend(SequencePrimary1)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
i4, s4 = index, []
r5 = _nt_atomic
s4 << r5
if r5
r6 = _nt_suffix
s4 << r6
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(SequencePrimary2)
r4.extend(SequencePrimary3)
else
self.index = i4
r4 = nil
end
if r4
r0 = r4
else
r7 = _nt_atomic
if r7
r0 = r7
else
self.index = i0
r0 = nil
end
end
end
node_cache[:sequence_primary][start_index] = r0
return r0
end
|
#_nt_single_quoted_string ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2159
def _nt_single_quoted_string
start_index = index
if node_cache[:single_quoted_string].has_key?(index)
cached = node_cache[:single_quoted_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, s3 = index, []
i4 = index
if input.index("'", index) == index
r5 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("'")
r5 = nil
end
if r5
r4 = nil
else
self.index = i4
r4 = instantiate_node(SyntaxNode,input, index...index)
end
s3 << r4
if r4
i6 = index
if input.index("\\\\", index) == index
r7 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure("\\\\")
r7 = nil
end
if r7
r6 = r7
else
if input.index("\\'", index) == index
r8 = instantiate_node(SyntaxNode,input, index...(index + 2))
@index += 2
else
terminal_parse_failure("\\'")
r8 = nil
end
if r8
r6 = r8
else
if index < input_length
r9 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("any character")
r9 = nil
end
if r9
r6 = r9
else
self.index = i6
r6 = nil
end
end
end
s3 << r6
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(SingleQuotedString0)
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
if r2
if input.index("'", index) == index
r10 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure("'")
r10 = nil
end
s0 << r10
end
end
if s0.last
r0 = instantiate_node(Terminal,input, i0...index, s0)
r0.extend(SingleQuotedString1)
else
self.index = i0
r0 = nil
end
node_cache[:single_quoted_string][start_index] = r0
return r0
end
|
#_nt_space ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2948
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
s0, i0 = [], index
loop do
i1 = index
r2 = _nt_white
if r2
r1 = r2
else
r3 =
if r3
r1 = r3
else
self.index = i1
r1 = nil
end
end
if r1
s0 << r1
else
break
end
end
if s0.empty?
self.index = i0
r0 = nil
else
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
end
node_cache[:space][start_index] = r0
return r0
end
|
#_nt_suffix ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1589
def _nt_suffix
start_index = index
if node_cache[:suffix].has_key?(index)
cached = node_cache[:suffix][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_repetition_suffix
if r1
r0 = r1
else
r2 = _nt_optional_suffix
if r2
r0 = r2
else
self.index = i0
r0 = nil
end
end
node_cache[:suffix][start_index] = r0
return r0
end
|
#_nt_terminal ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 1958
def _nt_terminal
start_index = index
if node_cache[:terminal].has_key?(index)
cached = node_cache[:terminal][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
r1 = _nt_quoted_string
if r1
r0 = r1
else
r2 = _nt_character_class
if r2
r0 = r2
else
r3 = _nt_anything_symbol
if r3
r0 = r3
else
self.index = i0
r0 = nil
end
end
end
node_cache[:terminal][start_index] = r0
return r0
end
|
#_nt_trailing_inline_module ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 2640
def _nt_trailing_inline_module
start_index = index
if node_cache[:trailing_inline_module].has_key?(index)
cached = node_cache[:trailing_inline_module][index]
@index = cached.interval.end if cached
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_space
s1 << r2
if r2
r3 = _nt_inline_module
s1 << r3
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(TrailingInlineModule0)
r1.extend(TrailingInlineModule1)
else
self.index = i1
r1 = nil
end
if r1
r0 = r1
else
if input.index('', index) == index
r4 = instantiate_node(SyntaxNode,input, index...(index + 0))
r4.extend(TrailingInlineModule2)
@index += 0
else
terminal_parse_failure('')
r4 = nil
end
if r4
r0 = r4
else
self.index = i0
r0 = nil
end
end
node_cache[:trailing_inline_module][start_index] = r0
return r0
end
|
#_nt_treetop_file ⇒ Object
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
|
# File 'lib/treetop/compiler/metagrammar.rb', line 40
def _nt_treetop_file
start_index = index
if node_cache[:treetop_file].has_key?(index)
cached = node_cache[:treetop_file][index]
@index = cached.interval.end if cached
return cached
end
i0, s0 = index, []
s1, i1 = [], index
loop do
i2, s2 = index, []
r4 = _nt_space
if r4
r3 = r4
else
r3 = instantiate_node(SyntaxNode,input, index...index)
end
s2 << r3
if r3
r5 = _nt_require_statement
s2 << r5
end
if s2.last
r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
r2.extend(TreetopFile0)
else
self.index = i2
r2 = nil
end
if r2
s1 << r2
else
break
end
end
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
s0 << r1
if r1
r7 = _nt_space
if r7
r6 = r7
else
r6 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r6
if r6
i8 = index
r9 = _nt_module_declaration
if r9
r8 = r9
else
r10 = _nt_grammar
if r10
r8 = r10
else
self.index = i8
r8 = nil
end
end
s0 << r8
if r8
r12 = _nt_space
if r12
r11 = r12
else
r11 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r11
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(TreetopFile1)
r0.extend(TreetopFile2)
else
self.index = i0
r0 = nil
end
node_cache[:treetop_file][start_index] = r0
return r0
end
|
#_nt_white ⇒ Object
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
|
# File 'lib/treetop/compiler/metagrammar.rb', line 3070
def _nt_white
start_index = index
if node_cache[:white].has_key?(index)
cached = node_cache[:white][index]
@index = cached.interval.end if cached
return cached
end
if input.index(Regexp.new('[ \\t\\n\\r]'), index) == index
r0 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
r0 = nil
end
node_cache[:white][start_index] = r0
return r0
end
|
#root ⇒ Object
6
7
8
|
# File 'lib/treetop/compiler/metagrammar.rb', line 6
def root
@root || :treetop_file
end
|