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
|
# Autogenerated from a Treetop grammar. Edits may be lost.
module Arithmetic
include Treetop::Runtime
def root
@root || :expr
end
module Expr0
def op
elements[0]
end
def right
elements[1]
end
end
module Expr1
def left
elements[0]
end
def right_opt
elements[1]
end
end
module Expr2
def value
right_opt.elements.inject(left.value) {|acc, plus_and_right|
acc.send \
plus_and_right.op.text_value,
plus_and_right.right.value
}
end
end
def _nt_expr
start_index = index
if node_cache[:expr].has_key?(index)
cached = node_cache[:expr][index]
if cached
cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_term
s0 << r1
if r1
s2, i2 = [], index
loop do
i3, s3 = index, []
if has_terminal?('\G[\\+\\-]', true, index)
r4 = true
@index += 1
else
r4 = nil
end
s3 << r4
if r4
r5 = _nt_term
s3 << r5
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(Expr0)
else
@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(Expr1)
r0.extend(Expr2)
else
@index = i0
r0 = nil
end
node_cache[:expr][start_index] = r0
r0
end
module Term0
def op
elements[0]
end
def right
elements[1]
end
end
module Term1
def left
elements[0]
end
def right_opt
elements[1]
end
end
module Term2
def value
right_opt.elements.inject(left.value) {|acc, mul_and_right|
acc.send \
mul_and_right.op.text_value,
mul_and_right.right.value
}
end
end
def _nt_term
start_index = index
if node_cache[:term].has_key?(index)
cached = node_cache[:term][index]
if cached
cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_factor
s0 << r1
if r1
s2, i2 = [], index
loop do
i3, s3 = index, []
if has_terminal?('\G[\\*\\/]', true, index)
r4 = true
@index += 1
else
r4 = nil
end
s3 << r4
if r4
r5 = _nt_factor
s3 << r5
end
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(Term0)
else
@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(Term1)
r0.extend(Term2)
else
@index = i0
r0 = nil
end
node_cache[:term][start_index] = r0
r0
end
module Factor0
def expr
elements[1]
end
end
module Factor1
def value
expr.value
end
end
def _nt_factor
start_index = index
if node_cache[:factor].has_key?(index)
cached = node_cache[:factor][index]
if cached
cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
i1, s1 = index, []
if has_terminal?('(', false, index)
r2 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure('(')
r2 = nil
end
s1 << r2
if r2
r3 = _nt_expr
s1 << r3
if r3
if has_terminal?(')', false, index)
r4 = instantiate_node(SyntaxNode,input, index...(index + 1))
@index += 1
else
terminal_parse_failure(')')
r4 = nil
end
s1 << r4
end
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(Factor0)
r1.extend(Factor1)
else
@index = i1
r1 = nil
end
if r1
r0 = r1
else
r5 = _nt_number
if r5
r0 = r5
else
@index = i0
r0 = nil
end
end
node_cache[:factor][start_index] = r0
r0
end
module Number0
end
module Number1
def value
text_value.to_f
end
end
def _nt_number
start_index = index
if node_cache[:number].has_key?(index)
cached = node_cache[:number][index]
if cached
cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
if has_terminal?('\G[1-9]', true, index)
r1 = true
@index += 1
else
r1 = nil
end
s0 << r1
if r1
s2, i2 = [], index
loop do
if has_terminal?('\G[0-9]', true, index)
r3 = true
@index += 1
else
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(Number0)
r0.extend(Number1)
else
@index = i0
r0 = nil
end
node_cache[:number][start_index] = r0
r0
end
end
class ArithmeticParser < Treetop::Runtime::CompiledParser
include Arithmetic
end
|
