summaryrefslogtreecommitdiff
path: root/test/rlhc.d/case/scan3_c.c-C-G2--goto-backend.exp
blob: de0e9f627c1fe505c37750a1e650d465f5e31225 (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
#include <string.h>
#include <stdio.h>

char * ts ;
char * te ;
int act ;
int token ;





static const int  scanner_start  = 1;
static const int  scanner_first_final  = 1;
static const int  scanner_error  = 0;
static const int  scanner_en_main  = 1;
static const char  _scanner_nfa_targs [] = { 0, 0 ,  };
static const char  _scanner_nfa_offsets [] = { 0, 0, 0, 0 ,  };
static const char  _scanner_nfa_push_actions [] = { 0, 0 ,  };
static const char  _scanner_nfa_pop_trans [] = { 0, 0 ,  };
int cs;
int blen;
char buffer[1024];

void init()
{

	{
		cs = ( int ) scanner_start;
		ts = 0;
		te = 0;
		act = 0;
	}
}

void exec( char *data, int len )
{
	char *p = data;
	char *pe = data + len;
	char *eof = pe;
	
	{
		if ( p == pe  )
		goto _test_eof;
		
		switch ( cs  ) {
			case 1:
			goto st_case_1;
			case 0:
			goto st_case_0;
			case 2:
			goto st_case_2;
			
		}
		goto st_out;
		ctr4:
		{
			{
				switch ( act  ) {
					case 1 :
					p = ((te))-1;
					{
						printf( "%s", "pat1\n" );
						
					}
					
					break;
					case 2 :
					p = ((te))-1;
					{
						printf( "%s", "pat2\n" );
						
					}
					
					break;
					case 3 :
					p = ((te))-1;
					{
						printf( "%s", "pat3\n" );
						
					}
					
					break;
					
				}
				
			}
			
			
		}
		
		
		goto st1;
		st1:
		{
			{
				ts = 0;
				
			}
			
		}
		
		p+= 1;
		if ( p == pe  )
		goto _test_eof1;
		
		st_case_1:
		{
			{
				ts = p;
				
			}
			
		}
		switch ( ((*( p  ))
		) ) {
			case 97:
			{
				goto ctr0;
			}
			case 98:
			{
				goto ctr2;
			}
			
		}
		{
			goto st0;
		}
		st_case_0:
		st0:
		cs = 0;
		goto _out;
		ctr0:
		{
			{
				te = p+1;
				
			}
			
		}
		{
			{
				act = 1;
				
			}
			
		}
		
		
		goto st2;
		ctr2:
		{
			{
				te = p+1;
				
			}
			
		}
		{
			{
				act = 2;
				
			}
			
		}
		
		
		goto st2;
		ctr5:
		{
			{
				te = p+1;
				
			}
			
		}
		{
			{
				act = 3;
				
			}
			
		}
		
		
		goto st2;
		st2:
		p+= 1;
		if ( p == pe  )
		goto _test_eof2;
		
		st_case_2:
		{
			goto ctr5;
		}
		st_out:
		_test_eof1: cs = 1;
		goto _test_eof; 
		_test_eof2: cs = 2;
		goto _test_eof; 
		
		_test_eof: {}
		if ( p == eof  )
		{
			switch ( cs  ) {
				case 2:
				goto ctr4;
				
			}
		}
		
		
		_out: {}
	}
}

void finish( )
{
	if ( cs >= scanner_first_final )
	printf( "ACCEPT\n" );
	else
	printf( "FAIL\n" );
}

char *inp[] = {
	"ab89",
};

int inplen = 1;

int main( )
{
	int i;
	for ( i = 0; i < inplen; i++ ) {
		init();
		exec( inp[i], strlen(inp[i]) );
		finish();
	}
	return 0;
}