summaryrefslogtreecommitdiff
path: root/test/rlhc.d/case/recdescent5.java-J-F1--var-backend.exp
blob: c69bdd0c87fc733ba76cd40d0fc9a0223e1da031 (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
class recdescent5
{


	private static char  _recdescent_trans_keys [] = { 1, 0, 5, 5, 0, 5, 0, 5, 0, 5, 0,  };
	private static byte  _recdescent_char_class [] = { 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 1, 5, 0 ,  };
	private static byte  _recdescent_index_offsets [] = { 0, 0, 1, 7, 13, 0 ,  };
	private static byte  _recdescent_indices [] = { 0, 0, 1, 2, 3, 4, 5, 6, 1, 7, 8, 9, 10, 6, 1, 11, 12, 9, 10, 0 ,  };
	private static byte  _recdescent_index_defaults [] = { 0, 1, 1, 1, 1, 0 ,  };
	private static byte  _recdescent_trans_cond_spaces [] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0 ,  };
	private static byte  _recdescent_cond_targs [] = { 2, 0, 3, 4, 1, 2, 2, 3, 4, 1, 2, 3, 4, 0 ,  };
	private static byte  _recdescent_cond_actions [] = { 0, 0, 1, 1, 2, 3, 4, 0, 5, 6, 7, 5, 0, 0 ,  };
	private static byte  _recdescent_eof_actions [] = { 0, 0, 0, 4, 4, 0 ,  };
	private static byte  _recdescent_nfa_targs [] = { 0, 0 ,  };
	private static byte  _recdescent_nfa_offsets [] = { 0, 0, 0, 0, 0, 0 ,  };
	private static byte  _recdescent_nfa_push_actions [] = { 0, 0 ,  };
	private static byte  _recdescent_nfa_pop_trans [] = { 0, 0 ,  };
	private static int  recdescent_start  = 2;
	private static int  recdescent_first_final  = 2;
	private static int  recdescent_error  = 0;
	private static int  recdescent_en_main  = 2;
	static void test( char data[] )
	{
		int cs, p = 0, pe = data.length, eof = data.length, item = 0;
		int stack[] = new int[1024];
		int stack_size = 1;
		int top;
		
		{
			cs = (int)recdescent_start;
			top = 0;
			
		}
		{
			int _trans = 0;
			int _have = 0;
			int _cont = 1;
			int _keys;
			int _inds;
			while ( _cont == 1  )
			{
				if ( cs == 0  )
				_cont = 0;
				
				_have = 0;
				if ( p == pe  )
				{
					if ( p == eof  )
					{
						if ( _have == 0  )
						{
							switch ( _recdescent_eof_actions[cs]  ) {
								case 4 :
								{
									String item_data = new String ( data, item, p-item );
									System.out.print( "item: " );
									System.out.print( item_data );
									System.out.print( "\n" );
									
								}
								
								break;
								
							}
							
						}
						
						
					}
					
					if ( _have == 0  )
					_cont = 0;
					
					
				}
				
				if ( _cont == 1  )
				{
					if ( _have == 0  )
					{
						_keys = (cs<<1) ;
						_inds = _recdescent_index_offsets[cs] ;
						if ( ( data[p ]) <= 125 && ( data[p ]) >= 9  )
						{
							int _ic = (int)_recdescent_char_class[(int)( data[p ]) - 9];
							if ( _ic <= (int)_recdescent_trans_keys[_keys+1 ]&& _ic >= (int)_recdescent_trans_keys[_keys ] )
							_trans = (int )_recdescent_indices[_inds + (int)( _ic - (int)_recdescent_trans_keys[_keys ])  ];
							
							else
							_trans = (int )_recdescent_index_defaults[cs];
							
							
						}
						
						else
						{
							_trans = (int )_recdescent_index_defaults[cs];
							
						}
						
						
					}
					
					if ( _cont == 1  )
					{
						cs = (int)_recdescent_cond_targs[_trans];
						switch ( _recdescent_cond_actions[_trans]  ) {
							case 1 :
							{
								item = p; 
							}
							
							break;
							case 4 :
							{
								String item_data = new String ( data, item, p-item );
								System.out.print( "item: " );
								System.out.print( item_data );
								System.out.print( "\n" );
								
							}
							
							break;
							case 2 :
							{
								System.out.print( "calling main\n" );
								{
									{
										if ( top == stack_size ) {
											System.out.print( "growing stack\n" );
											stack_size = top * 2;
											// Don't actually bother to resize here, but we do print messages.
											//stack = (int*)realloc( stack, sizeof(int)*stack_size );
										}
										
									}
									stack[top] = cs;
									top += 1;
									cs = 2;
									
								}
								
							}
							
							break;
							case 3 :
							{
								if ( top == 0 ) {
									System.out.print( "STRAY CLOSE\n" );
									{
										p+= 1;
										_cont = 0;
										
									}
									
								}
								else {
									System.out.print( "returning from main\n" );
									{
										p = p - 1;
										
									}
									
									{
										top-= 1;
										cs = stack[top];
										{
											if ( stack_size > (top * 4) ) {
												stack_size = top * 2;
												// Don't actually bother to resize here, but we do print messages.
												//stack = (int*)realloc( stack, sizeof(int)*stack_size );
												System.out.print( "shrinking stack\n" );
											}
											
										}
										
									}
									
								}
								
							}
							
							break;
							case 5 :
							{
								String item_data = new String ( data, item, p-item );
								System.out.print( "item: " );
								System.out.print( item_data );
								System.out.print( "\n" );
								
							}
							{
								item = p; 
							}
							
							break;
							case 6 :
							{
								String item_data = new String ( data, item, p-item );
								System.out.print( "item: " );
								System.out.print( item_data );
								System.out.print( "\n" );
								
							}
							{
								System.out.print( "calling main\n" );
								{
									{
										if ( top == stack_size ) {
											System.out.print( "growing stack\n" );
											stack_size = top * 2;
											// Don't actually bother to resize here, but we do print messages.
											//stack = (int*)realloc( stack, sizeof(int)*stack_size );
										}
										
									}
									stack[top] = cs;
									top += 1;
									cs = 2;
									
								}
								
							}
							
							break;
							case 7 :
							{
								String item_data = new String ( data, item, p-item );
								System.out.print( "item: " );
								System.out.print( item_data );
								System.out.print( "\n" );
								
							}
							{
								if ( top == 0 ) {
									System.out.print( "STRAY CLOSE\n" );
									{
										p+= 1;
										_cont = 0;
										
									}
									
								}
								else {
									System.out.print( "returning from main\n" );
									{
										p = p - 1;
										
									}
									
									{
										top-= 1;
										cs = stack[top];
										{
											if ( stack_size > (top * 4) ) {
												stack_size = top * 2;
												// Don't actually bother to resize here, but we do print messages.
												//stack = (int*)realloc( stack, sizeof(int)*stack_size );
												System.out.print( "shrinking stack\n" );
											}
											
										}
										
									}
									
								}
								
							}
							
							break;
							
						}
						if ( cs == 0  )
						_cont = 0;
						
						if ( _cont == 1  )
						p += 1;
						
						
					}
					
					
				}
				
				
			}
			
			
		}
		if ( cs == recdescent_error )
		System.out.println( "SCANNER ERROR" );
	}
	
	public static void main( String args[] )
	{
		test( "88 foo { 99 {{{{}}}}{ } }".toCharArray() );
		test( "76 } sadf".toCharArray() );
	}
}