Module: Arithmetic

Includes:
Treetop::Runtime
Included in:
ArithmeticParser, LambdaCalculus
Defined in:
lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/arithmetic.rb,
lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/arithmetic_node_classes.rb

Defined Under Namespace

Modules: Additive0, AdditiveOp0, AdditiveOp1, Comparative0, EqualityOp0, Multitive0, MultitiveOp0, MultitiveOp1, Number0, Number1, Primary0, Primary1, Variable0 Classes: BinaryOperation

Instance Method Summary collapse

Instance Method Details

#_nt_additive ⇒ Object 



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

def _nt_additive
  start_index = index
  cached = node_cache[:additive][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  i1, s1 = index, []
  r2 = _nt_multitive
  s1 << r2
  if r2.success?
    r3 = _nt_space
    s1 << r3
    if r3.success?
      r4 = _nt_additive_op
      s1 << r4
      if r4.success?
        r5 = _nt_space
        s1 << r5
        if r5.success?
          r6 = _nt_additive
          s1 << r6
        end
      end
    end
  end
  if s1.last.success?
    r1 = (BinaryOperation).new(input, i1...index, s1)
    r1.extend(Additive0)
  else
    self.index = i1
    r1 = ParseFailure.new(input, i1)
  end
  if r1.success?
    r0 = r1
  else
    r7 = _nt_multitive
    if r7.success?
      r0 = r7
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:additive][start_index] = r0
  
  return r0
end

#_nt_additive_op ⇒ Object 



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

def _nt_additive_op
  start_index = index
  cached = node_cache[:additive_op][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = parse_terminal('+', SyntaxNode, AdditiveOp0)
  if r1.success?
    r0 = r1
  else
    r2 = parse_terminal('-', SyntaxNode, AdditiveOp1)
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:additive_op][start_index] = r0
  
  return r0
end

#_nt_comparative ⇒ Object 



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

def _nt_comparative
  start_index = index
  cached = node_cache[:comparative][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0, s0 = index, []
  r1 = _nt_additive
  s0 << r1
  if r1.success?
    r2 = _nt_space
    s0 << r2
    if r2.success?
      r3 = _nt_equality_op
      s0 << r3
      if r3.success?
        r4 = _nt_space
        s0 << r4
        if r4.success?
          r5 = _nt_additive
          s0 << r5
        end
      end
    end
  end
  if s0.last.success?
    r0 = (BinaryOperation).new(input, i0...index, s0)
    r0.extend(Comparative0)
  else
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  end
  
  node_cache[:comparative][start_index] = r0
  
  return r0
end

#_nt_equality_op ⇒ Object 



103
104
105
106
107
108
109
110
111
112
113
114
115
116
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/arithmetic.rb', line 103

def _nt_equality_op
  start_index = index
  cached = node_cache[:equality_op][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  r0 = parse_terminal('==', SyntaxNode, EqualityOp0)
  
  node_cache[:equality_op][start_index] = r0
  
  return r0
end

#_nt_expression ⇒ Object 



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

def _nt_expression
  start_index = index
  cached = node_cache[:expression][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_comparative
  if r1.success?
    r0 = r1
  else
    r2 = _nt_additive
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:expression][start_index] = r0
  
  return r0
end

#_nt_multitive ⇒ Object 



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

def _nt_multitive
  start_index = index
  cached = node_cache[:multitive][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  i1, s1 = index, []
  r2 = _nt_primary
  s1 << r2
  if r2.success?
    r3 = _nt_space
    s1 << r3
    if r3.success?
      r4 = _nt_multitive_op
      s1 << r4
      if r4.success?
        r5 = _nt_space
        s1 << r5
        if r5.success?
          r6 = _nt_multitive
          s1 << r6
        end
      end
    end
  end
  if s1.last.success?
    r1 = (BinaryOperation).new(input, i1...index, s1)
    r1.extend(Multitive0)
  else
    self.index = i1
    r1 = ParseFailure.new(input, i1)
  end
  if r1.success?
    r0 = r1
  else
    r7 = _nt_primary
    if r7.success?
      r0 = r7
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:multitive][start_index] = r0
  
  return r0
end

#_nt_multitive_op ⇒ Object 



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

def _nt_multitive_op
  start_index = index
  cached = node_cache[:multitive_op][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = parse_terminal('*', SyntaxNode, MultitiveOp0)
  if r1.success?
    r0 = r1
  else
    r2 = parse_terminal('/', SyntaxNode, MultitiveOp1)
    if r2.success?
      r0 = r2
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:multitive_op][start_index] = r0
  
  return r0
end

#_nt_number ⇒ Object 



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

def _nt_number
  start_index = index
  cached = node_cache[:number][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  i1, s1 = index, []
  r2 = parse_char_class(/[1-9]/, '1-9', SyntaxNode)
  s1 << r2
  if r2.success?
    s3, i3 = [], index
    loop do
      r4 = parse_char_class(/[0-9]/, '0-9', SyntaxNode)
      if r4.success?
        s3 << r4
      else
        break
      end
    end
    r3 = SyntaxNode.new(input, i3...index, s3)
    s1 << r3
  end
  if s1.last.success?
    r1 = (SyntaxNode).new(input, i1...index, s1)
    r1.extend(Number0)
  else
    self.index = i1
    r1 = ParseFailure.new(input, i1)
  end
  if r1.success?
    r0 = r1
    r0.extend(Number1)
  else
    r5 = parse_terminal('0', SyntaxNode)
    if r5.success?
      r0 = r5
      r0.extend(Number1)
    else
      self.index = i0
      r0 = ParseFailure.new(input, i0)
    end
  end
  
  node_cache[:number][start_index] = r0
  
  return r0
end

#_nt_primary ⇒ Object 



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

def _nt_primary
  start_index = index
  cached = node_cache[:primary][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  i0 = index
  r1 = _nt_variable
  if r1.success?
    r0 = r1
  else
    r2 = _nt_number
    if r2.success?
      r0 = r2
    else
      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
          if r6.success?
            r7 = _nt_space
            s3 << r7
            if r7.success?
              r8 = parse_terminal(')', SyntaxNode)
              s3 << r8
            end
          end
        end
      end
      if s3.last.success?
        r3 = (SyntaxNode).new(input, i3...index, s3)
        r3.extend(Primary0)
        r3.extend(Primary1)
      else
        self.index = i3
        r3 = ParseFailure.new(input, i3)
      end
      if r3.success?
        r0 = r3
      else
        self.index = i0
        r0 = ParseFailure.new(input, i0)
      end
    end
  end
  
  node_cache[:primary][start_index] = r0
  
  return r0
end

#_nt_space ⇒ Object 



523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
 
# File 'lib/mail/vendor/treetop-1.4.3/examples/lambda_calculus/arithmetic.rb', line 523

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_terminal(' ', 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 



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

def _nt_variable
  start_index = index
  cached = node_cache[:variable][index]
  if cached
    @index = cached.interval.end
    return cached
  end
  
  s0, i0 = [], index
  loop do
    r1 = parse_char_class(/[a-z]/, 'a-z', SyntaxNode)
    if r1.success?
      s0 << r1
    else
      break
    end
  end
  if s0.empty?
    self.index = i0
    r0 = ParseFailure.new(input, i0)
  else
    r0 = SyntaxNode.new(input, i0...index, s0)
    r0.extend(Variable0)
  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/arithmetic.rb', line 4

def root
  @root || :expression
end