summaryrefslogtreecommitdiff
path: root/test/rlhc.d/case/scan2_ruby.rb-R-F0--var-backend.exp
blob: f9c74c9cb1e9109b15d60107ed92fbf5b47f979f (plain)
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
#
# @LANG: ruby
# @GENERATED: true
#






class << self
	attr_accessor :_scanner_actions 
	private :_scanner_actions, :_scanner_actions=
end
self._scanner_actions = [
0, 1, 0, 1, 1, 1, 5, 1, 6, 1, 7, 2, 2, 3, 2, 2, 4, 0 , 
]

class << self
	attr_accessor :_scanner_trans_keys 
	private :_scanner_trans_keys, :_scanner_trans_keys=
end
self._scanner_trans_keys = [
0, 2, 0, 1, 0, 2, 0 , 
]

class << self
	attr_accessor :_scanner_char_class 
	private :_scanner_char_class, :_scanner_char_class=
end
self._scanner_char_class = [
0, 1, 2, 0 , 
]

class << self
	attr_accessor :_scanner_index_offsets 
	private :_scanner_index_offsets, :_scanner_index_offsets=
end
self._scanner_index_offsets = [
0, 3, 5, 0 , 
]

class << self
	attr_accessor :_scanner_indices 
	private :_scanner_indices, :_scanner_indices=
end
self._scanner_indices = [
1, 1, 2, 4, 5, 1, 1, 2, 0 , 
]

class << self
	attr_accessor :_scanner_index_defaults 
	private :_scanner_index_defaults, :_scanner_index_defaults=
end
self._scanner_index_defaults = [
0, 3, 0, 0 , 
]

class << self
	attr_accessor :_scanner_trans_cond_spaces 
	private :_scanner_trans_cond_spaces, :_scanner_trans_cond_spaces=
end
self._scanner_trans_cond_spaces = [
-1, -1, -1, -1, -1, -1, 0 , 
]

class << self
	attr_accessor :_scanner_cond_targs 
	private :_scanner_cond_targs, :_scanner_cond_targs=
end
self._scanner_cond_targs = [
1, 0, 1, 1, 2, 2, 0 , 
]

class << self
	attr_accessor :_scanner_cond_actions 
	private :_scanner_cond_actions, :_scanner_cond_actions=
end
self._scanner_cond_actions = [
9, 0, 5, 7, 11, 14, 0 , 
]

class << self
	attr_accessor :_scanner_to_state_actions 
	private :_scanner_to_state_actions, :_scanner_to_state_actions=
end
self._scanner_to_state_actions = [
0, 1, 0, 0 , 
]

class << self
	attr_accessor :_scanner_from_state_actions 
	private :_scanner_from_state_actions, :_scanner_from_state_actions=
end
self._scanner_from_state_actions = [
0, 3, 0, 0 , 
]

class << self
	attr_accessor :_scanner_eof_trans 
	private :_scanner_eof_trans, :_scanner_eof_trans=
end
self._scanner_eof_trans = [
1, 0, 1, 0 , 
]

class << self
	attr_accessor :_scanner_nfa_targs 
	private :_scanner_nfa_targs, :_scanner_nfa_targs=
end
self._scanner_nfa_targs = [
0, 0 , 
]

class << self
	attr_accessor :_scanner_nfa_offsets 
	private :_scanner_nfa_offsets, :_scanner_nfa_offsets=
end
self._scanner_nfa_offsets = [
0, 0, 0, 0 , 
]

class << self
	attr_accessor :_scanner_nfa_push_actions 
	private :_scanner_nfa_push_actions, :_scanner_nfa_push_actions=
end
self._scanner_nfa_push_actions = [
0, 0 , 
]

class << self
	attr_accessor :_scanner_nfa_pop_trans 
	private :_scanner_nfa_pop_trans, :_scanner_nfa_pop_trans=
end
self._scanner_nfa_pop_trans = [
0, 0 , 
]

class << self
	attr_accessor :scanner_start 
end
self.scanner_start  = 1;

class << self
	attr_accessor :scanner_first_final 
end
self.scanner_first_final  = 1;

class << self
	attr_accessor :scanner_error 
end
self.scanner_error  = -1;

class << self
	attr_accessor :scanner_en_main 
end
self.scanner_en_main  = 1;

def run_machine( data )
	p = 0
	pe = data.length
	eof = data.length
	cs = 0;
	_m = 
	_a = 
	buffer = Array.new
	blen = 0
	ts = 1
	te = 1
	act = 1
	token = 1
	begin
		cs = scanner_start;
		ts = 0;
		te = 0;
		act = 0;
		
	end
	begin
		_trans = 0;
		_have = 0;
		_cont = 1;
		_acts = 0;
		_nacts= 0
		;
		_keys = 0;
		_inds = 0;
		while ( _cont == 1  )
			begin
				_have = 0;
				if ( p == pe  )
					begin
						if ( p == eof  )
							begin
								if ( _scanner_eof_trans[cs] > 0  )
									begin
										_trans = _scanner_eof_trans[cs] - 1;
										_have = 1;
										
									end
									
								end
								if ( _have == 0  )
									begin
									
									end
									
								end
								
							end
							
						end
						if ( _have == 0  )
							_cont = 0;
							
						end
						
					end
					
				end
				if ( _cont == 1  )
					begin
						if ( _have == 0  )
							begin
								_acts = _scanner_from_state_actions[cs] ;
								_nacts = _scanner_actions[_acts ];
								_acts += 1;
								while ( _nacts > 0  )
									begin
										case  _scanner_actions[_acts ] 
										when -2 then
										begin
										end
										when 1  then
										begin
											begin
												begin
													ts = p;
													
												end
												
											end
											
											
										end
									end
									_nacts -= 1;
									_acts += 1;
									
								end
								
							end
							_keys = (cs<<1) ;
							_inds = _scanner_index_offsets[cs] ;
							if ( ( data[p ].ord) <= 99 && ( data[p ].ord) >= 97  )
								begin
									_ic = _scanner_char_class[( data[p ].ord) - 97];
									if ( _ic <= _scanner_trans_keys[_keys+1 ]&& _ic >= _scanner_trans_keys[_keys ] )
										_trans = _scanner_indices[_inds + ( _ic - _scanner_trans_keys[_keys ])  ];
										
										else
										_trans = _scanner_index_defaults[cs];
										
									end
									
								end
								
								else
								begin
									_trans = _scanner_index_defaults[cs];
									
								end
								
							end
							
						end
						
					end
					if ( _cont == 1  )
						begin
							cs = _scanner_cond_targs[_trans];
							if ( _scanner_cond_actions[_trans] != 0  )
								begin
									_acts = _scanner_cond_actions[_trans] ;
									_nacts = _scanner_actions[_acts ];
									_acts += 1;
									while ( _nacts > 0  )
										begin
											case  _scanner_actions[_acts ] 
											when -2 then
											begin
											end
											when 2  then
											begin
												begin
													begin
														te = p+1;
														
													end
													
												end
												
											end
											when 3  then
											begin
												begin
													begin
														act = 1;
														
													end
													
												end
												
											end
											when 4  then
											begin
												begin
													begin
														act = 3;
														
													end
													
												end
												
											end
											when 5  then
											begin
												begin
													begin
														te = p+1;
														begin
															print( "pat2\n" );
															
														end
														
													end
													
												end
												
											end
											when 6  then
											begin
												begin
													begin
														te = p+1;
														begin
															print( "any\n" );
															
														end
														
													end
													
												end
												
											end
											when 7  then
											begin
												begin
													begin
														case  act  
														when -2 then
														begin
														end
														when 1  then
														begin
															p = ((te))-1;
															begin
																print( "pat1\n" );
																
															end
															
														end
														when 3  then
														begin
															p = ((te))-1;
															begin
																print( "any\n" );
																
															end
															
															
														end
													end
													
												end
												
												
											end
											
											
										end
									end
									_nacts -= 1;
									_acts += 1;
									
								end
								
							end
							
						end
						
					end
					_acts = _scanner_to_state_actions[cs] ;
					_nacts = _scanner_actions[_acts ];
					_acts += 1;
					while ( _nacts > 0  )
						begin
							case  _scanner_actions[_acts ] 
							when -2 then
							begin
							end
							when 0  then
							begin
								begin
									begin
										ts = 0;
										
									end
									
								end
								
								
							end
						end
						_nacts -= 1;
						_acts += 1;
						
					end
					
				end
				if ( _cont == 1  )
					p += 1;
					
				end
				
			end
			
		end
		
	end
	
end

end

end

end
if cs >= scanner_first_final
puts "ACCEPT"
else
puts "FAIL"
end
end

inp = [
"a",
]

inplen = 1

inp.each { |str| run_machine(str) }