summaryrefslogtreecommitdiff
path: root/test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp
diff options
context:
space:
mode:
Diffstat (limited to 'test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp')
-rw-r--r--test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp293
1 files changed, 293 insertions, 0 deletions
diff --git a/test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp b/test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp
new file mode 100644
index 00000000..713b2406
--- /dev/null
+++ b/test/rlhc.d/case/curs1_c.c-C-T0--goto-backend.exp
@@ -0,0 +1,293 @@
+#include <string.h>
+#include <stdio.h>
+
+int return_to ;
+
+
+
+
+
+static const char _curs1_actions [] = { 0, 1, 0, 1, 1, 1, 2, 1, 3, 0 , };
+static const char _curs1_key_offsets [] = { 0, 0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 15, 15, 15, 0 , };
+static const char _curs1_trans_keys [] = { 10, 49, 50, 117, 110, 117, 115, 101, 100, 111, 110, 101, 116, 119, 111, 0 , };
+static const char _curs1_single_lengths [] = { 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0 , };
+static const char _curs1_range_lengths [] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , };
+static const char _curs1_index_offsets [] = { 0, 0, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 29, 30, 31, 0 , };
+static const char _curs1_trans_cond_spaces [] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0 , };
+static const char _curs1_trans_offsets [] = { 0, 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, 0 , };
+static const char _curs1_trans_lengths [] = { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 , };
+static const char _curs1_cond_keys [] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , };
+static const char _curs1_cond_targs [] = { 14, 14, 14, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 15, 0, 9, 0, 10, 0, 16, 0, 12, 0, 13, 0, 17, 0, 0, 0, 0, 0, 0 , };
+static const char _curs1_cond_actions [] = { 0, 5, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0 , };
+static const char _curs1_nfa_targs [] = { 0, 0 , };
+static const char _curs1_nfa_offsets [] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , };
+static const char _curs1_nfa_push_actions [] = { 0, 0 , };
+static const char _curs1_nfa_pop_trans [] = { 0, 0 , };
+static const int curs1_start = 1;
+static const int curs1_first_final = 14;
+static const int curs1_error = 0;
+static const int curs1_en_unused = 2;
+static const int curs1_en_one = 8;
+static const int curs1_en_two = 11;
+static const int curs1_en_main = 1;
+int cs;
+int blen;
+char buffer[1024];
+
+void init()
+{
+
+ {
+ cs = ( int ) curs1_start;
+ }
+}
+
+void exec( char *data, int len )
+{
+ char *p = data;
+ char *pe = data + len;
+
+ {
+ int _klen;
+ int _ps;
+ unsigned int _trans = 0;
+ unsigned int _cond = 0;
+ const char *_acts;
+ unsigned int _nacts;
+ const char *_keys;
+ const char *_ckeys;
+ int _cpc;
+ if ( p == pe )
+ goto _test_eof;
+
+ if ( cs == 0 )
+ goto _out;
+
+ _resume :
+ _keys = _curs1_trans_keys + _curs1_key_offsets[cs];
+ _trans = ( unsigned int ) _curs1_index_offsets[cs];
+ _klen = ( int ) _curs1_single_lengths[cs];
+ if ( _klen > 0 )
+ {
+ const char *_lower;
+ const char *_mid;
+ const char *_upper;
+ _lower = _keys;
+ _upper = _keys + _klen - 1;
+ while ( 1 )
+ {
+ if ( _upper < _lower )
+ break;
+
+
+ _mid = _lower + ((_upper-_lower)>> 1);
+ if ( ((*( p ))
+ )< (*( _mid ))
+ )
+ _upper = _mid - 1;
+
+ else if ( ((*( p ))
+ )> (*( _mid ))
+ )
+ _lower = _mid + 1;
+
+ else
+ {
+ _trans += ( unsigned int ) (_mid - _keys);
+ goto _match;
+ }
+
+ }
+
+ _keys += _klen;
+ _trans += ( unsigned int ) _klen;
+ }
+
+
+ _klen = ( int ) _curs1_range_lengths[cs];
+ if ( _klen > 0 )
+ {
+ const char *_lower;
+ const char *_mid;
+ const char *_upper;
+ _lower = _keys;
+ _upper = _keys + (_klen<<1)- 2;
+ while ( 1 )
+ {
+ if ( _upper < _lower )
+ break;
+
+
+ _mid = _lower + (((_upper-_lower)>> 1)& ~1);
+ if ( ((*( p ))
+ )< (*( _mid ))
+ )
+ _upper = _mid - 2;
+
+ else if ( ((*( p ))
+ )> (*( _mid + 1 ))
+ )
+ _lower = _mid + 2;
+
+ else
+ {
+ _trans += ( unsigned int ) ((_mid - _keys)>>1);
+ goto _match;
+ }
+
+ }
+
+ _trans += ( unsigned int ) _klen;
+ }
+
+
+
+ _match :
+ _ckeys = _curs1_cond_keys + _curs1_trans_offsets[_trans];
+ _klen = ( int ) _curs1_trans_lengths[_trans];
+ _cond = ( unsigned int ) _curs1_trans_offsets[_trans];
+ _cpc = 0;
+ {
+ const char *_lower;
+ const char *_mid;
+ const char *_upper;
+ _lower = _ckeys;
+ _upper = _ckeys + _klen - 1;
+ while ( 1 )
+ {
+ if ( _upper < _lower )
+ break;
+
+
+ _mid = _lower + ((_upper-_lower)>> 1);
+ if ( _cpc < ( int ) (*( _mid ))
+ )
+ _upper = _mid - 1;
+
+ else if ( _cpc > ( int ) (*( _mid ))
+ )
+ _lower = _mid + 1;
+
+ else
+ {
+ _cond += ( unsigned int ) (_mid - _ckeys);
+ goto _match_cond;
+ }
+
+ }
+
+ cs = 0;
+ goto _again;
+ }
+
+ _match_cond :
+ _ps = cs;
+ cs = ( int ) _curs1_cond_targs[_cond];
+ if ( _curs1_cond_actions[_cond]== 0 )
+ goto _again;
+
+
+ _acts = _curs1_actions + _curs1_cond_actions[_cond];
+ _nacts = ( unsigned int ) (*( _acts ))
+ ;
+ _acts += 1;
+ while ( _nacts > 0 )
+ {
+ switch ( (*( _acts ))
+ ) {
+ case 0 :
+ {
+ printf( "%s", "one\n" );
+ {
+ cs = (return_to);
+
+ }
+
+ }
+
+ break;
+ case 1 :
+ {
+ printf( "%s", "two\n" );
+ {
+ cs = (return_to);
+
+ }
+
+ }
+
+ break;
+ case 2 :
+ {
+ return_to = (_ps);
+ {
+ cs = 8;
+
+ }
+
+ }
+
+ break;
+ case 3 :
+ {
+ return_to = (_ps);
+ {
+ cs = 11;
+
+ }
+
+ }
+
+ break;
+
+ }
+ _nacts -= 1;
+ _acts += 1;
+ }
+
+
+
+
+ _again :
+ if ( cs == 0 )
+ goto _out;
+
+ p += 1;
+ if ( p != pe )
+ goto _resume;
+
+
+ _test_eof :
+ {}
+
+ _out :
+ {}
+
+ }
+}
+
+void finish( )
+{
+ if ( cs >= curs1_first_final )
+ printf( "ACCEPT\n" );
+ else
+ printf( "FAIL\n" );
+}
+
+char *inp[] = {
+ "1one2two1one\n",
+};
+
+int inplen = 1;
+
+int main( )
+{
+ int i;
+ for ( i = 0; i < inplen; i++ ) {
+ init();
+ exec( inp[i], strlen(inp[i]) );
+ finish();
+ }
+ return 0;
+}
+