This file is indexed.

/usr/share/doc/ruby-treetop/examples/lambda_calculus/lambda_calculus.rb is in ruby-treetop 1.4.10-5.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
module LambdaCalculus
  include Treetop::Runtime
  
  def root
    @root || :program
  end
  
  include Arithmetic
  
  module Program0
    def space
      elements[1]
    end
    
    def expression
      elements[2]
    end
  end
  
  module Program1
    def expression
      elements[0]
    end
    
    def more_expressions
      elements[1]
    end
  end
  
  module Program2
    def eval(env={})
      env = env.clone
      last_eval = nil
      expressions.each do |exp|
        last_eval = exp.eval(env)
      end
      last_eval
    end
    
    def expressions
      [expression] + more_expressions.elements.map {|elt| elt.expression}
    end
  end
  
  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
  
  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
  
  module Definition0
    def space
      elements[1]
    end
    
    def variable
      elements[2]
    end
    
    def space
      elements[3]
    end
    
    def expression
      elements[4]
    end
  end
  
  module Definition1
    def eval(env)
      env[variable.name] = expression.eval(env)
    end
  end
  
  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
  
  module Conditional0
    def space
      elements[1]
    end
    
    def space
      elements[3]
    end
    
    def condition
      elements[4]
    end
    
    def space
      elements[5]
    end
    
    def space
      elements[7]
    end
    
    def true_case
      elements[8]
    end
    
    def space
      elements[9]
    end
    
    def space
      elements[11]
    end
    
    def false_case
      elements[12]
    end
  end
  
  module Conditional1
    def eval(env)
      if condition.eval(env)
        true_case.eval(env)
      else
        false_case.eval(env)
      end
    end
  end
  
  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
  
  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
  
  module Application0
    def operator
      elements[0]
    end
    
    def space
      elements[1]
    end
    
    def expression
      elements[2]
    end
  end
  
  module Application1
    def eval(env={})
      left_associative_apply(operator.eval(env), env)
    end
    
    def left_associative_apply(operator, env)
      if expression.instance_of?(Application)
        expression.left_associative_apply(operator.apply(expression.operator.eval(env)), env)
      else
        operator.apply(expression.eval(env))
      end
    end
    
    def to_s(env={})
      operator.to_s(env) + ' ' + expression.to_s(env)
    end
  end
  
  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
  
  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
  
  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
  
  module Function0
    def param
      elements[1]
    end
    
    def body
      elements[3]
    end
    
  end
  
  module Function1
    class Closure
      attr_reader :env, :function
      
      def initialize(function, env)
        @function = function
        @env = env
      end
    
      def apply(arg)
        function.body.eval(function.param.bind(arg, env))
      end
    
      def to_s(other_env={})
        "\\#{function.param.to_s}(#{function.body.to_s(other_env.merge(env))})"
      end
    end
    
    def eval(env={})
      Closure.new(self, env)
    end
    
    def to_s(env={})
      eval(env).to_s
    end
  end
  
  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
  
  module Variable0
    def bind(value, env)
      env.merge(name => value)
    end

    def to_s(env={})
      env.has_key?(name) ? env[name].to_s : name
  end
  end
  
  module Variable1
  end
  
  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
  
  module Keyword0
  end
  
  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
  
  module NonSpaceChar0
  end
  
  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
  
  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
  
end

class LambdaCalculusParser < Treetop::Runtime::CompiledParser
  include LambdaCalculus
end