Module: LambdaCalculus

Includes:
Arithmetic, Treetop::Runtime
Included in:
LambdaCalculusParser
Defined in:
lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb,
lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus_node_classes.rb

Defined Under Namespace

Modules: Application0, Application1, Conditional0, Conditional1, Definition0, Definition1, Function0, Function1, Keyword0, NonSpaceChar0, Program0, Program1, Program2, Variable0, Variable1 Classes: Application

Instance Method Summary collapse

Methods included from Arithmetic

#_nt_additive, #_nt_additive_op, #_nt_comparative, #_nt_equality_op, #_nt_multitive, #_nt_multitive_op, #_nt_number

Instance Method Details

#_nt_application ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 387

def _nt_application
  start_index = index
  cached = node_cache[:application][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = _nt_operator
  s0 << r1
  if r1.success?
    r2 = _nt_space
    s0 << r2
    if r2.success?
      r3 = _nt_expression
      s0 << r3
    end
  end
  if s0.last.success?
    r0 = (Application).new(input, i0...index, s0)
    r0.extend(Application0)
    r0.extend(Application1)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:application][start_index] = r0
  
  return r0
end

#_nt_conditional ⇒ Object 



255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 255

def _nt_conditional
  start_index = index
  cached = node_cache[:conditional][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = parse_terminal('if', SyntaxNode)
  s0 << r1
  if r1.success?
    r2 = _nt_space
    s0 << r2
    if r2.success?
      r3 = parse_terminal('(', SyntaxNode)
      s0 << r3
      if r3.success?
        r4 = _nt_space
        s0 << r4
        if r4.success?
          r5 = _nt_expression
          s0 << r5
          if r5.success?
            r6 = _nt_space
            s0 << r6
            if r6.success?
              r7 = parse_terminal(')', SyntaxNode)
              s0 << r7
              if r7.success?
                r8 = _nt_space
                s0 << r8
                if r8.success?
                  r9 = _nt_expression
                  s0 << r9
                  if r9.success?
                    r10 = _nt_space
                    s0 << r10
                    if r10.success?
                      r11 = parse_terminal('else', SyntaxNode)
                      s0 << r11
                      if r11.success?
                        r12 = _nt_space
                        s0 << r12
                        if r12.success?
                          r13 = _nt_expression
                          s0 << r13
                        end
                      end
                    end
                  end
                end
              end
            end
          end
        end
      end
    end
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Conditional0)
    r0.extend(Conditional1)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:conditional][start_index] = r0
  
  return r0
end

#_nt_definition ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 166

def _nt_definition
  start_index = index
  cached = node_cache[:definition][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = parse_terminal('def', SyntaxNode)
  s0 << r1
  if r1.success?
    r2 = _nt_space
    s0 << r2
    if r2.success?
      r3 = _nt_variable
      s0 << r3
      if r3.success?
        r4 = _nt_space
        s0 << r4
        if r4.success?
          r5 = _nt_expression
          s0 << r5
        end
      end
    end
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Definition0)
    r0.extend(Definition1)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:definition][start_index] = r0
  
  return r0
end

#_nt_expression ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 100

def _nt_expression
  start_index = index
  cached = node_cache[:expression][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_definition
  if r1.success?
    r0 = r1
  else
    r2 = _nt_conditional
    if r2.success?
      r0 = r2
    else
      r3 = _nt_application
      if r3.success?
        r0 = r3
      else
        r4 = _nt_function
        if r4.success?
          r0 = r4
        else
          r5 = super
          if r5.success?
            r0 = r5
          else
            self.index = i0
            r0 = ParseFailure.new(input, i0)
          end
        end
      end
    end
  end
  
  node_cache[:expression][start_index] = r0
  
  return r0
end

#_nt_function ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 512

def _nt_function
  start_index = index
  cached = node_cache[:function][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = parse_terminal('\\', SyntaxNode)
  s0 << r1
  if r1.success?
    r2 = _nt_variable
    s0 << r2
    if r2.success?
      r3 = parse_terminal('(', SyntaxNode)
      s0 << r3
      if r3.success?
        r4 = _nt_expression
        s0 << r4
        if r4.success?
          r5 = parse_terminal(')', SyntaxNode)
          s0 << r5
        end
      end
    end
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Function0)
    r0.extend(Function1)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:function][start_index] = r0
  
  return r0
end

#_nt_keyword ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 605

def _nt_keyword
  start_index = index
  cached = node_cache[:keyword][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  i1 = index
  r2 = parse_terminal('if', SyntaxNode)
  if r2.success?
    r1 = r2
  else
    r3 = parse_terminal('else', SyntaxNode)
    if r3.success?
      r1 = r3
    else
      self.index = i1
      r1 = ParseFailure.new(input, i1)
    end
  end
  s0 << r1
  if r1.success?
    i4 = index
    r5 = _nt_non_space_char
    if r5.success?
      r4 = ParseFailure.new(input, i4)
    else
      self.index = i4
      r4 = SyntaxNode.new(input, index...index)
    end
    s0 << r4
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Keyword0)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:keyword][start_index] = r0
  
  return r0
end

#_nt_non_application ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 447

def _nt_non_application
  start_index = index
  cached = node_cache[:non_application][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_function
  if r1.success?
    r0 = r1
  else
    r2 = _nt_variable
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:non_application][start_index] = r0
  
  return r0
end

#_nt_non_space_char ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 655

def _nt_non_space_char
  start_index = index
  cached = node_cache[:non_space_char][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  i1 = index
  r2 = parse_char_class(/[ \n]/, ' \n', SyntaxNode)
  if r2.success?
    r1 = ParseFailure.new(input, i1)
  else
    self.index = i1
    r1 = SyntaxNode.new(input, index...index)
  end
  s0 << r1
  if r1.success?
    r3 = parse_anything(SyntaxNode)
    s0 << r3
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(NonSpaceChar0)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:non_space_char][start_index] = r0
  
  return r0
end

#_nt_operator ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 420

def _nt_operator
  start_index = index
  cached = node_cache[:operator][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_function
  if r1.success?
    r0 = r1
  else
    r2 = _nt_variable
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:operator][start_index] = r0
  
  return r0
end

#_nt_primary ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 328

def _nt_primary
  start_index = index
  cached = node_cache[:primary][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_application
  if r1.success?
    r0 = r1
  else
    r2 = super
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:primary][start_index] = r0
  
  return r0
end

#_nt_program ⇒ Object 



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
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 45

def _nt_program
  start_index = index
  cached = node_cache[:program][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = _nt_expression
  s0 << r1
  if r1.success?
    s2, i2 = [], index
    loop do
      i3, s3 = index, []
      r4 = parse_terminal(';', SyntaxNode)
      s3 << r4
      if r4.success?
        r5 = _nt_space
        s3 << r5
        if r5.success?
          r6 = _nt_expression
          s3 << r6
        end
      end
      if s3.last.success?
        r3 = (SyntaxNode).new(input, i3...index, s3)
        r3.extend(Program0)
      else
        self.index = i3
        r3 = ParseFailure.new(input, i3)
      end
      if r3.success?
        s2 << r3
      else
        break
      end
    end
    r2 = SyntaxNode.new(input, i2...index, s2)
    s0 << r2
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Program1)
    r0.extend(Program2)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:program][start_index] = r0
  
  return r0
end

#_nt_space ⇒ Object 



690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 690

def _nt_space
  start_index = index
  cached = node_cache[:space][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  s0, i0 = [], index
  loop do
    r1 = parse_char_class(/[ \n]/, ' \n', SyntaxNode)
    if r1.success?
      s0 << r1
    else
      break
    end
  end
  r0 = SyntaxNode.new(input, i0...index, s0)
  
  node_cache[:space][start_index] = r0
  
  return r0
end

#_nt_variable ⇒ Object 



566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 566

def _nt_variable
  start_index = index
  cached = node_cache[:variable][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  i1 = index
  r2 = _nt_keyword
  if r2.success?
    r1 = ParseFailure.new(input, i1)
  else
    self.index = i1
    r1 = SyntaxNode.new(input, index...index)
  end
  s0 << r1
  if r1.success?
    r3 = super
    r3.extend(Variable0)
    s0 << r3
  end
  if s0.last.success?
    r0 = (SyntaxNode).new(input, i0...index, s0)
    r0.extend(Variable1)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:variable][start_index] = r0
  
  return r0
end

#root ⇒ Object 



4
5
6
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/lambda_calculus.rb', line 4

def root
  @root || :program
end