/***********************************************************************/ /* Open Visualization Data Explorer */ /* (C) Copyright IBM Corp. 1989,1999 */ /* ALL RIGHTS RESERVED */ /* This code licensed under the */ /* "IBM PUBLIC LICENSE - Open Visualization Data Explorer" */ /***********************************************************************/ /* A lexical scanner generated by flex */ #include /* Scanner skeleton version: * $Header: /home/gda/dxcvs/dx/src/ui++/dxuilib/netlex.h,v 1.3 1999/05/10 15:46:23 gda Exp $ */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #include /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #include #include /* Use prototypes in function declarations. */ #define YY_USE_PROTOS /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ #if __STDC__ #define YY_USE_PROTOS #define YY_USE_CONST #endif /* __STDC__ */ #endif /* ! __cplusplus */ #ifdef __TURBOC__ #pragma warn -rch #pragma warn -use #include #include #define YY_USE_CONST #define YY_USE_PROTOS #endif #ifdef YY_USE_CONST #define yyconst const #else #define yyconst #endif #ifdef YY_USE_PROTOS #define YY_PROTO(proto) proto #else #define YY_PROTO(proto) () #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN yy_start = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The YYSTATE alias is for lex * compatibility. */ #define YY_START ((yy_start - 1) / 2) #define YYSTATE YY_START /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define YY_NEW_FILE yyrestart( yyin ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #define YY_BUF_SIZE 16384 typedef struct yy_buffer_state *YY_BUFFER_STATE; extern int yyleng; extern FILE *yyin, *yyout; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 /* The funky do-while in the following #define is used to turn the definition * int a single C statement (which needs a semi-colon terminator). This * avoids problems with code like: * * if ( condition_holds ) * yyless( 5 ); * else * do_something_else(); * * Prior to using the do-while the compiler would get upset at the * "else" because it interpreted the "if" statement as being all * done when it reached the ';' after the yyless() call. */ /* Return all but the first 'n' matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ *yy_cp = yy_hold_char; \ YY_RESTORE_YY_MORE_OFFSET \ yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, yytext_ptr ) /* The following is because we cannot portably get our hands on size_t * (without autoconf's help, which isn't available because we want * flex-generated scanners to compile on their own). */ typedef unsigned int yy_size_t; struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ yy_size_t yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int yy_n_chars; /* Whether we "own" the buffer - i.e., we know we created it, * and can realloc() it to grow it, and should free() it to * delete it. */ int yy_is_our_buffer; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int yy_is_interactive; /* Whether we're considered to be at the beginning of a line. * If so, '^' rules will be active on the next match, otherwise * not. */ int yy_at_bol; /* Whether to try to fill the input buffer when we reach the * end of it. */ int yy_fill_buffer; int yy_buffer_status; #define YY_BUFFER_NEW 0 #define YY_BUFFER_NORMAL 1 /* When an EOF's been seen but there's still some text to process * then we mark the buffer as YY_EOF_PENDING, to indicate that we * shouldn't try reading from the input source any more. We might * still have a bunch of tokens to match, though, because of * possible backing-up. * * When we actually see the EOF, we change the status to "new" * (via yyrestart()), so that the user can continue scanning by * just pointing yyin at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; static YY_BUFFER_STATE yy_current_buffer = 0; /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". */ #define YY_CURRENT_BUFFER yy_current_buffer /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 1; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void yyrestart YY_PROTO(( FILE *input_file )); void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); void yy_load_buffer_state YY_PROTO(( void )); YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); static void *yy_flex_alloc YY_PROTO(( yy_size_t )); static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); static void yy_flex_free YY_PROTO(( void * )); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (yy_current_buffer->yy_at_bol) typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern char *yytext; #define yytext_ptr yytext static yy_state_type yy_get_previous_state YY_PROTO(( void )); static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); static int yy_get_next_buffer YY_PROTO(( void )); static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ yytext_ptr = yy_bp; \ yyleng = (int) (yy_cp - yy_bp); \ yy_hold_char = *yy_cp; \ *yy_cp = '\0'; \ yy_c_buf_p = yy_cp; #define YY_NUM_RULES 122 #define YY_END_OF_BUFFER 123 static yyconst short int yy_accept[320] = { 0, 0, 0, 123, 122, 121, 21, 122, 119, 120, 41, 122, 49, 50, 39, 37, 58, 38, 122, 40, 113, 113, 59, 60, 34, 55, 35, 108, 107, 107, 107, 107, 107, 107, 107, 107, 53, 54, 46, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 51, 48, 52, 121, 31, 0, 117, 0, 119, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 13, 47, 61, 0, 113, 62, 63, 64, 115, 0, 0, 0, 0, 0, 0, 0, 0, 0, 118, 114, 112, 0, 0, 56, 57, 32, 36, 30, 33, 109, 107, 110, 107, 107, 107, 107, 107, 107, 107, 6, 17, 107, 107, 107, 107, 107, 107, 107, 107, 70, 107, 107, 107, 107, 107, 107, 5, 18, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 14, 117, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 118, 114, 0, 0, 116, 111, 15, 45, 107, 43, 22, 107, 8, 107, 16, 107, 107, 44, 107, 107, 68, 107, 107, 107, 42, 23, 7, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 0, 115, 0, 24, 27, 29, 26, 28, 25, 0, 11, 0, 0, 12, 0, 0, 114, 107, 75, 2, 107, 107, 67, 107, 107, 107, 72, 107, 107, 107, 107, 80, 81, 107, 107, 107, 85, 86, 107, 88, 1, 107, 107, 9, 19, 10, 20, 0, 114, 4, 107, 107, 3, 107, 107, 73, 107, 107, 79, 107, 107, 107, 107, 89, 90, 107, 66, 107, 107, 74, 107, 82, 83, 107, 107, 107, 69, 71, 107, 107, 87, 65, 107, 84, 107, 78, 0 } ; static yyconst int yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 20, 20, 20, 20, 20, 20, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 30, 31, 32, 33, 34, 28, 35, 28, 28, 36, 37, 38, 39, 28, 40, 41, 42, 43, 44, 45, 28, 46, 28, 28, 47, 48, 49, 50, 28, 1, 51, 52, 53, 54, 55, 56, 28, 57, 58, 28, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 46, 72, 28, 73, 74, 75, 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, 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, 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, 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, 1, 1 } ; static yyconst int yy_meta[76] = { 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 1, 1, 1, 1, 1, 3, 3, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1 } ; static yyconst short int yy_base[328] = { 0, 0, 0, 595, 596, 74, 569, 73, 0, 28, 596, 584, 596, 596, 579, 73, 596, 80, 105, 573, 96, 91, 565, 596, 93, 564, 563, 0, 560, 64, 100, 76, 93, 106, 120, 111, 596, 596, 596, 87, 80, 103, 102, 109, 113, 121, 128, 130, 132, 136, 139, 135, 145, 146, 151, 143, 152, 596, 512, 596, 172, 596, 175, 596, 177, 0, 0, 532, 533, 532, 516, 518, 518, 128, 30, 131, 130, 596, 596, 596, 191, 199, 596, 596, 596, 207, 541, 538, 181, 189, 190, 536, 514, 512, 508, 0, 214, 221, 229, 0, 596, 596, 596, 596, 596, 596, 0, 546, 0, 220, 210, 225, 229, 144, 230, 203, 545, 544, 231, 217, 232, 236, 237, 238, 240, 243, 543, 241, 245, 246, 247, 138, 250, 542, 541, 251, 252, 254, 255, 253, 260, 257, 259, 256, 261, 263, 596, 284, 508, 513, 497, 498, 497, 236, 500, 506, 507, 492, 496, 502, 489, 493, 499, 314, 522, 535, 534, 533, 532, 531, 530, 503, 528, 490, 475, 525, 0, 317, 325, 276, 331, 0, 514, 513, 275, 512, 511, 304, 510, 315, 509, 289, 300, 508, 299, 316, 286, 328, 329, 331, 332, 507, 506, 333, 335, 334, 336, 337, 338, 339, 341, 346, 347, 350, 340, 342, 343, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 359, 365, 515, 596, 596, 596, 596, 596, 596, 514, 596, 513, 512, 596, 399, 402, 405, 344, 501, 496, 360, 354, 488, 362, 348, 363, 484, 367, 369, 371, 387, 480, 477, 389, 400, 401, 475, 474, 407, 472, 468, 408, 409, 596, 596, 596, 596, 418, 424, 466, 414, 419, 458, 420, 421, 456, 422, 424, 455, 423, 425, 426, 427, 454, 449, 428, 447, 430, 432, 446, 431, 433, 355, 439, 436, 442, 283, 266, 440, 443, 264, 180, 444, 158, 445, 157, 596, 505, 509, 513, 515, 517, 521, 100, 523 } ; static yyconst short int yy_def[328] = { 0, 319, 1, 319, 319, 319, 319, 320, 321, 322, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 323, 324, 324, 324, 324, 324, 324, 324, 324, 319, 319, 319, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 319, 319, 319, 319, 319, 320, 319, 320, 321, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 325, 319, 319, 319, 326, 319, 319, 319, 319, 319, 319, 323, 324, 327, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 319, 320, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 325, 319, 319, 319, 319, 326, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 322, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 319, 319, 319, 319, 319, 319, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 0, 319, 319, 319, 319, 319, 319, 319, 319 } ; static yyconst short int yy_nxt[672] = { 0, 4, 5, 5, 6, 7, 8, 9, 10, 11, 4, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 28, 30, 28, 31, 28, 28, 28, 32, 33, 34, 28, 28, 28, 35, 28, 28, 28, 36, 4, 37, 38, 39, 40, 41, 42, 43, 44, 28, 45, 28, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 28, 56, 28, 57, 58, 59, 60, 60, 63, 67, 68, 156, 69, 70, 71, 157, 72, 79, 73, 74, 80, 108, 81, 81, 81, 75, 82, 80, 76, 81, 81, 81, 109, 108, 181, 111, 83, 108, 96, 101, 81, 81, 81, 96, 108, 97, 97, 81, 102, 103, 108, 64, 84, 98, 85, 85, 85, 108, 98, 108, 108, 120, 112, 108, 86, 110, 108, 87, 108, 88, 108, 89, 99, 90, 91, 113, 98, 108, 108, 119, 114, 98, 118, 115, 121, 108, 92, 108, 116, 108, 122, 117, 108, 108, 124, 108, 108, 93, 94, 123, 108, 108, 108, 108, 60, 60, 125, 126, 108, 108, 63, 129, 147, 127, 108, 108, 154, 186, 161, 158, 135, 128, 132, 130, 155, 131, 162, 159, 133, 136, 138, 139, 134, 160, 137, 144, 201, 108, 142, 145, 85, 85, 85, 166, 140, 141, 96, 143, 81, 81, 81, 168, 170, 64, 167, 64, 85, 85, 85, 171, 108, 98, 169, 177, 177, 177, 188, 108, 96, 163, 97, 97, 81, 179, 108, 179, 178, 108, 180, 180, 180, 182, 108, 98, 98, 183, 108, 108, 108, 108, 185, 184, 163, 108, 108, 108, 187, 108, 108, 178, 108, 190, 108, 108, 108, 189, 98, 108, 108, 108, 108, 108, 108, 108, 108, 191, 108, 108, 108, 63, 108, 108, 222, 108, 197, 180, 180, 180, 192, 199, 195, 200, 108, 205, 223, 194, 202, 193, 198, 196, 108, 203, 206, 108, 213, 210, 108, 250, 209, 207, 204, 216, 208, 211, 212, 214, 108, 108, 233, 215, 233, 108, 64, 234, 234, 234, 177, 177, 177, 248, 251, 248, 108, 108, 249, 249, 249, 252, 253, 247, 180, 180, 180, 254, 255, 108, 108, 257, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 247, 108, 108, 108, 282, 108, 234, 234, 234, 108, 108, 256, 234, 234, 234, 108, 258, 108, 108, 262, 266, 259, 108, 273, 108, 260, 108, 286, 274, 261, 263, 275, 265, 269, 264, 267, 268, 284, 270, 271, 272, 280, 108, 280, 108, 285, 281, 281, 281, 249, 249, 249, 249, 249, 249, 108, 108, 289, 288, 283, 287, 290, 108, 108, 108, 281, 281, 281, 292, 108, 291, 281, 281, 281, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 294, 108, 108, 108, 108, 293, 295, 108, 297, 298, 108, 108, 296, 108, 108, 108, 108, 108, 108, 301, 108, 302, 303, 299, 305, 108, 108, 108, 309, 108, 300, 310, 306, 307, 313, 304, 312, 108, 308, 108, 314, 311, 316, 108, 318, 108, 108, 315, 108, 317, 62, 108, 62, 62, 65, 108, 65, 65, 66, 108, 66, 66, 106, 106, 107, 107, 176, 108, 176, 176, 108, 108, 108, 279, 278, 277, 276, 108, 108, 108, 108, 108, 108, 108, 108, 108, 246, 245, 244, 243, 242, 241, 240, 239, 238, 237, 236, 235, 232, 231, 230, 229, 228, 227, 226, 225, 224, 221, 220, 219, 218, 217, 108, 108, 108, 108, 108, 108, 175, 174, 173, 172, 165, 164, 153, 152, 151, 150, 149, 148, 146, 108, 105, 104, 100, 95, 78, 77, 61, 319, 3, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319 } ; static yyconst short int yy_chk[672] = { 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 7, 9, 9, 74, 9, 9, 9, 74, 9, 15, 9, 9, 15, 29, 15, 15, 15, 9, 17, 17, 9, 17, 17, 17, 29, 31, 326, 31, 17, 40, 21, 24, 21, 21, 21, 20, 39, 20, 20, 20, 24, 24, 32, 7, 18, 21, 18, 18, 18, 30, 20, 42, 41, 40, 32, 33, 18, 30, 43, 18, 35, 18, 44, 18, 20, 18, 18, 33, 21, 34, 45, 39, 33, 20, 35, 34, 41, 46, 18, 47, 34, 48, 42, 34, 51, 49, 44, 131, 50, 18, 18, 43, 55, 113, 52, 53, 60, 60, 44, 45, 54, 56, 62, 47, 64, 45, 318, 316, 73, 113, 76, 75, 50, 46, 49, 47, 73, 48, 76, 75, 49, 50, 52, 53, 49, 75, 51, 55, 131, 314, 54, 56, 80, 80, 80, 88, 53, 53, 81, 54, 81, 81, 81, 89, 90, 62, 88, 64, 85, 85, 85, 90, 115, 81, 89, 96, 96, 96, 115, 110, 97, 85, 97, 97, 97, 98, 119, 98, 96, 109, 98, 98, 98, 109, 111, 97, 81, 110, 112, 114, 118, 120, 112, 111, 85, 121, 122, 123, 114, 124, 127, 96, 125, 119, 128, 129, 130, 118, 97, 132, 135, 136, 139, 137, 138, 143, 141, 120, 142, 140, 144, 147, 145, 313, 153, 310, 127, 179, 179, 179, 121, 129, 124, 130, 184, 136, 153, 123, 132, 122, 128, 125, 309, 135, 137, 196, 142, 140, 191, 184, 139, 138, 135, 145, 138, 140, 141, 143, 194, 192, 163, 144, 163, 187, 147, 163, 163, 163, 177, 177, 177, 178, 187, 178, 189, 195, 178, 178, 178, 189, 191, 177, 180, 180, 180, 192, 194, 197, 198, 196, 199, 200, 203, 205, 204, 206, 207, 208, 209, 214, 210, 215, 216, 250, 177, 211, 212, 257, 250, 213, 233, 233, 233, 254, 305, 195, 234, 234, 234, 253, 197, 256, 258, 203, 207, 198, 260, 214, 261, 199, 262, 257, 215, 200, 204, 216, 206, 210, 205, 208, 209, 254, 211, 212, 213, 247, 263, 247, 266, 256, 247, 247, 247, 248, 248, 248, 249, 249, 249, 267, 268, 261, 260, 253, 258, 262, 271, 274, 275, 280, 280, 280, 266, 283, 263, 281, 281, 281, 284, 286, 287, 289, 292, 290, 293, 294, 295, 298, 268, 300, 303, 301, 304, 267, 271, 307, 275, 283, 306, 311, 274, 308, 312, 315, 317, 302, 299, 287, 297, 289, 290, 284, 293, 296, 291, 288, 300, 285, 286, 301, 294, 295, 307, 292, 306, 282, 298, 273, 308, 303, 312, 272, 317, 270, 269, 311, 265, 315, 320, 264, 320, 320, 321, 259, 321, 321, 322, 255, 322, 322, 323, 323, 324, 324, 325, 252, 325, 325, 327, 327, 251, 245, 244, 242, 235, 202, 201, 193, 190, 188, 186, 185, 183, 182, 175, 174, 173, 172, 171, 170, 169, 168, 167, 166, 165, 164, 162, 161, 160, 159, 158, 157, 156, 155, 154, 152, 151, 150, 149, 148, 134, 133, 126, 117, 116, 107, 94, 93, 92, 91, 87, 86, 72, 71, 70, 69, 68, 67, 58, 28, 26, 25, 22, 19, 14, 11, 6, 3, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319, 319 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; #line 1 "net.lex" #define INITIAL 0 #line 2 "net.lex" /*****************************************************************************/ /* uin.lex - */ /* Contains symbols for the SVS script language grammar. */ /*****************************************************************************/ /* * $Header: /home/gda/dxcvs/dx/src/ui++/dxuilib/netlex.h,v 1.3 1999/05/10 15:46:23 gda Exp $ * $Log: netlex.h,v $ * Revision 1.3 1999/05/10 15:46:23 gda * Copyright message * * Revision 1.2 1999/05/03 14:08:56 gda * dxconfig.h, plus other post-new-shapshot fixes * * Revision 1.1.1.1 1999/03/24 15:18:19 gda * Initial CVS Version * Revision 9.1 1997/05/22 19:46:49 svs Copy of release 3.1.4 code Revision 8.2 1996/01/24 21:48:38 dawood mbsinvalid defined as null for NT also (for ajay). Revision 8.1 1995/12/14 19:10:59 dawood Added support for \r as a white space character, which helps us to better support the NT and OS/2 ports which right out their .nets with CR and LF instead of just LF. Revision 8.0 1995/10/03 19:24:41 nsc Copy of release 3.1 code Revision 7.5 1995/03/24 22:33:50 dawood Add NULL as a keyword (K_NULL) so that we can support static macros which have input values inside the macro def. Sometimes these values are NULL. Revision 7.4 1994/05/12 22:31:10 suits Include string.h instead of single prototype of strcpy Revision 7.3 1994/04/18 16:10:35 suits OS2 definition of mbsinvalid Revision 7.2 94/04/05 11:23:57 dawood Change union to contain a string buffer, and change net.lex to do strcpy() instead of strdup(). This fixes a memory leak such that the strdup()'d string was not being freed. Revision 7.1 94/01/18 19:20:01 svs changes since release 2.0.1 Revision 6.1 93/11/16 11:09:17 svs ship level code, release 2.0 Revision 1.3 93/10/07 15:52:07 cpv Fixed the $command comment handling. Revision 1.2 93/10/07 15:40:38 cpv Accept "$.*" as an empty comment. Revision 1.1 93/01/08 13:22:31 cpv Initial revision Revision 5.0 92/11/17 17:03:42 svs ship level code, internal rev 1.2.2 Revision 4.0 92/08/18 15:54:50 svs ship level code, rev 1.2 Revision 3.1 92/06/01 15:56:53 jgv HP port. Revision 3.0 91/11/27 17:02:50 svs ship level code, rev 1.0 Revision 1.5 91/11/07 19:00:35 rbk Added the latest exec's reserved keywords to the language. Revision 1.4 91/11/06 17:52:28 rbk Removed obsolete keywords. Revision 1.3 91/08/20 16:39:11 rbk Changed "UM" (unary minus) to "US" (unary sign), allowing unary "+"'s. Revision 1.2 91/04/17 16:55:51 rbk Added support for the new list constructor syntax. Revision 1.1 91/03/19 15:55:27 rbk Initial revision Revision 1.4 91/03/18 16:26:35 rbk Modified code to correctly parse long comment strings. Revision 1.3 91/01/23 10:10:03 rbk Removed K_FRAME token and added unary minus to numeric constants. Revision 1.2 90/12/10 15:37:03 rbk Added "@FRAME" and "@frame" to list of keywords to be lex'd. Revision 1.1 90/10/11 18:32:48 rbk Initial revision */ #include #if defined(OS2) || defined(DXD_WIN) #define mbsinvalid(x) 0 #endif #include #ifdef YYLMAX #undef YYLMAX #endif #define YYLMAX 4096 #line 743 "lex.yy.c" /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap YY_PROTO(( void )); #else extern int yywrap YY_PROTO(( void )); #endif #endif #ifndef YY_NO_UNPUT static void yyunput YY_PROTO(( int c, char *buf_ptr )); #endif #ifndef yytext_ptr static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen YY_PROTO(( yyconst char * )); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput YY_PROTO(( void )); #else static int input YY_PROTO(( void )); #endif #endif #if YY_STACK_USED static int yy_start_stack_ptr = 0; static int yy_start_stack_depth = 0; static int *yy_start_stack = 0; #ifndef YY_NO_PUSH_STATE static void yy_push_state YY_PROTO(( int new_state )); #endif #ifndef YY_NO_POP_STATE static void yy_pop_state YY_PROTO(( void )); #endif #ifndef YY_NO_TOP_STATE static int yy_top_state YY_PROTO(( void )); #endif #else #define YY_NO_PUSH_STATE 1 #define YY_NO_POP_STATE 1 #define YY_NO_TOP_STATE 1 #endif #ifdef YY_MALLOC_DECL YY_MALLOC_DECL #else #if __STDC__ #ifndef __cplusplus #include #endif #else /* Just try to get by without declaring the routines. This will fail * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) * or sizeof(void*) != sizeof(int). */ #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #define YY_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) #endif /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( yy_current_buffer->yy_is_interactive ) \ { \ int c = '*', n; \ for ( n = 0; n < max_size && \ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); #endif /* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef yyterminate #define yyterminate() return YY_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef YY_START_STACK_INCR #define YY_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) #endif /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL int yylex YY_PROTO(( void )) #endif /* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */ #ifndef YY_USER_ACTION #define YY_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef YY_BREAK #define YY_BREAK break; #endif #define YY_RULE_SETUP \ YY_USER_ACTION YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; #line 139 "net.lex" #line 897 "lex.yy.c" if ( yy_init ) { yy_init = 0; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! yy_start ) yy_start = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_load_buffer_state(); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = yy_c_buf_p; /* Support of yytext. */ *yy_cp = yy_hold_char; /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = yy_start; yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 320 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 596 ); yy_find_action: yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = yy_hold_char; yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; goto yy_find_action; case 1: YY_RULE_SETUP #line 141 "net.lex" { return (V_TRUE); } YY_BREAK case 2: YY_RULE_SETUP #line 142 "net.lex" { return (V_TRUE); } YY_BREAK case 3: YY_RULE_SETUP #line 143 "net.lex" { return (V_FALSE); } YY_BREAK case 4: YY_RULE_SETUP #line 144 "net.lex" { return (V_FALSE); } YY_BREAK case 5: YY_RULE_SETUP #line 145 "net.lex" { return (V_TRUE); } YY_BREAK case 6: YY_RULE_SETUP #line 146 "net.lex" { return (V_TRUE); } YY_BREAK case 7: YY_RULE_SETUP #line 147 "net.lex" { return (V_FALSE); } YY_BREAK case 8: YY_RULE_SETUP #line 148 "net.lex" { return (V_FALSE); } YY_BREAK case 9: YY_RULE_SETUP #line 150 "net.lex" { return (L_AND); } YY_BREAK case 10: YY_RULE_SETUP #line 151 "net.lex" { return (L_AND); } YY_BREAK case 11: YY_RULE_SETUP #line 152 "net.lex" { return (L_OR); } YY_BREAK case 12: YY_RULE_SETUP #line 153 "net.lex" { return (L_OR); } YY_BREAK case 13: YY_RULE_SETUP #line 154 "net.lex" { return (L_AND); } YY_BREAK case 14: YY_RULE_SETUP #line 155 "net.lex" { return (L_OR); } YY_BREAK case 15: YY_RULE_SETUP #line 156 "net.lex" { return (L_AND); } YY_BREAK case 16: YY_RULE_SETUP #line 157 "net.lex" { return (L_AND); } YY_BREAK case 17: YY_RULE_SETUP #line 158 "net.lex" { return (L_OR); } YY_BREAK case 18: YY_RULE_SETUP #line 159 "net.lex" { return (L_OR); } YY_BREAK case 19: YY_RULE_SETUP #line 161 "net.lex" { return (L_NOT); } YY_BREAK case 20: YY_RULE_SETUP #line 162 "net.lex" { return (L_NOT); } YY_BREAK case 21: YY_RULE_SETUP #line 163 "net.lex" { return (L_NOT); } YY_BREAK case 22: YY_RULE_SETUP #line 164 "net.lex" { return (L_NOT); } YY_BREAK case 23: YY_RULE_SETUP #line 165 "net.lex" { return (L_NOT); } YY_BREAK case 24: YY_RULE_SETUP #line 167 "net.lex" { return (L_EQ); } YY_BREAK case 25: YY_RULE_SETUP #line 168 "net.lex" { return (L_NEQ); } YY_BREAK case 26: YY_RULE_SETUP #line 169 "net.lex" { return (L_LEQ); } YY_BREAK case 27: YY_RULE_SETUP #line 170 "net.lex" { return (L_GEQ); } YY_BREAK case 28: YY_RULE_SETUP #line 171 "net.lex" { return (L_LT); } YY_BREAK case 29: YY_RULE_SETUP #line 172 "net.lex" { return (L_GT); } YY_BREAK case 30: YY_RULE_SETUP #line 173 "net.lex" { return (L_EQ); } YY_BREAK case 31: YY_RULE_SETUP #line 174 "net.lex" { return (L_NEQ); } YY_BREAK case 32: YY_RULE_SETUP #line 175 "net.lex" { return (L_LEQ); } YY_BREAK case 33: YY_RULE_SETUP #line 176 "net.lex" { return (L_GEQ); } YY_BREAK case 34: YY_RULE_SETUP #line 177 "net.lex" { return (L_LT); } YY_BREAK case 35: YY_RULE_SETUP #line 178 "net.lex" { return (L_GT); } YY_BREAK case 36: YY_RULE_SETUP #line 179 "net.lex" { return (L_NEQ); } YY_BREAK case 37: YY_RULE_SETUP #line 181 "net.lex" { return (A_PLUS); } YY_BREAK case 38: YY_RULE_SETUP #line 182 "net.lex" { return (A_MINUS); } YY_BREAK case 39: YY_RULE_SETUP #line 183 "net.lex" { return (A_TIMES); } YY_BREAK case 40: YY_RULE_SETUP #line 184 "net.lex" { return (A_DIV); } YY_BREAK case 41: YY_RULE_SETUP #line 185 "net.lex" { return (A_MOD); } YY_BREAK case 42: YY_RULE_SETUP #line 186 "net.lex" { return (A_MOD); } YY_BREAK case 43: YY_RULE_SETUP #line 187 "net.lex" { return (A_MOD); } YY_BREAK case 44: YY_RULE_SETUP #line 188 "net.lex" { return (A_IDIV); } YY_BREAK case 45: YY_RULE_SETUP #line 189 "net.lex" { return (A_IDIV); } YY_BREAK case 46: YY_RULE_SETUP #line 190 "net.lex" { return (A_EXP); } YY_BREAK case 47: YY_RULE_SETUP #line 191 "net.lex" { return (A_EXP); } YY_BREAK case 48: YY_RULE_SETUP #line 193 "net.lex" { return (T_BAR); } YY_BREAK case 49: YY_RULE_SETUP #line 194 "net.lex" { return (T_LPAR); } YY_BREAK case 50: YY_RULE_SETUP #line 195 "net.lex" { return (T_RPAR); } YY_BREAK case 51: YY_RULE_SETUP #line 196 "net.lex" { return (T_LBRA); } YY_BREAK case 52: YY_RULE_SETUP #line 197 "net.lex" { return (T_RBRA); } YY_BREAK case 53: YY_RULE_SETUP #line 198 "net.lex" { return (T_LSQB); } YY_BREAK case 54: YY_RULE_SETUP #line 199 "net.lex" { return (T_RSQB); } YY_BREAK case 55: YY_RULE_SETUP #line 200 "net.lex" { return (T_ASSIGN); } YY_BREAK case 56: YY_RULE_SETUP #line 201 "net.lex" { return (T_ASSIGN); } YY_BREAK case 57: YY_RULE_SETUP #line 202 "net.lex" { return (T_ASSIGN); } YY_BREAK case 58: YY_RULE_SETUP #line 203 "net.lex" { return (T_COMMA); } YY_BREAK case 59: YY_RULE_SETUP #line 204 "net.lex" { return (T_COLON); } YY_BREAK case 60: YY_RULE_SETUP #line 205 "net.lex" { return (T_SEMI); } YY_BREAK case 61: YY_RULE_SETUP #line 206 "net.lex" { return (T_PP); } YY_BREAK case 62: YY_RULE_SETUP #line 207 "net.lex" { return (T_MM); } YY_BREAK case 63: YY_RULE_SETUP #line 208 "net.lex" { return (T_RA); } YY_BREAK case 64: YY_RULE_SETUP #line 209 "net.lex" { return (T_DOTDOT); } YY_BREAK case 65: YY_RULE_SETUP #line 211 "net.lex" { return (K_BACKWARD); } YY_BREAK case 66: YY_RULE_SETUP #line 212 "net.lex" { return (K_CANCEL); } YY_BREAK case 67: YY_RULE_SETUP #line 213 "net.lex" { return (K_ELSE); } YY_BREAK case 68: YY_RULE_SETUP #line 214 "net.lex" { return (K_FOR); } YY_BREAK case 69: YY_RULE_SETUP #line 215 "net.lex" { return (K_FORWARD); } YY_BREAK case 70: YY_RULE_SETUP #line 216 "net.lex" { return (K_IF); } YY_BREAK case 71: YY_RULE_SETUP #line 217 "net.lex" { return (K_INCLUDE); } YY_BREAK case 72: YY_RULE_SETUP #line 218 "net.lex" { return (K_LOOP); } YY_BREAK case 73: YY_RULE_SETUP #line 219 "net.lex" { return (K_MACRO); } YY_BREAK case 74: YY_RULE_SETUP #line 220 "net.lex" { return (K_MODULE); } YY_BREAK case 75: YY_RULE_SETUP #line 221 "net.lex" { return (K_NULL); } YY_BREAK case 76: YY_RULE_SETUP #line 222 "net.lex" { return (K_OFF); } YY_BREAK case 77: YY_RULE_SETUP #line 223 "net.lex" { return (K_ON); } YY_BREAK case 78: YY_RULE_SETUP #line 224 "net.lex" { return (K_PALINDROME); } YY_BREAK case 79: YY_RULE_SETUP #line 225 "net.lex" { return (K_PAUSE); } YY_BREAK case 80: YY_RULE_SETUP #line 226 "net.lex" { return (K_PLAY); } YY_BREAK case 81: YY_RULE_SETUP #line 227 "net.lex" { return (K_QUIT); } YY_BREAK case 82: YY_RULE_SETUP #line 228 "net.lex" { return (K_REPEAT); } YY_BREAK case 83: YY_RULE_SETUP #line 229 "net.lex" { return (K_RESUME); } YY_BREAK case 84: YY_RULE_SETUP #line 230 "net.lex" { return (K_SEQUENCE); } YY_BREAK case 85: YY_RULE_SETUP #line 231 "net.lex" { return (K_STEP); } YY_BREAK case 86: YY_RULE_SETUP #line 232 "net.lex" { return (K_STOP); } YY_BREAK case 87: YY_RULE_SETUP #line 233 "net.lex" { return (K_SUSPEND); } YY_BREAK case 88: YY_RULE_SETUP #line 234 "net.lex" { return (K_THEN); } YY_BREAK case 89: YY_RULE_SETUP #line 235 "net.lex" { return (K_UNTIL); } YY_BREAK case 90: YY_RULE_SETUP #line 236 "net.lex" { return (K_WHILE); } YY_BREAK case 91: YY_RULE_SETUP #line 239 "net.lex" { return (P_ACK); } YY_BREAK case 92: YY_RULE_SETUP #line 240 "net.lex" { return (P_BACKGROUND); } YY_BREAK case 93: YY_RULE_SETUP #line 241 "net.lex" { return (P_DATA); } YY_BREAK case 94: YY_RULE_SETUP #line 242 "net.lex" { return (P_ERROR); } YY_BREAK case 95: YY_RULE_SETUP #line 243 "net.lex" { return (P_FOREGROUND); } YY_BREAK case 96: YY_RULE_SETUP #line 244 "net.lex" { return (P_INFO); } YY_BREAK case 97: YY_RULE_SETUP #line 245 "net.lex" { return (P_INTERRUPT); } YY_BREAK case 98: YY_RULE_SETUP #line 246 "net.lex" { return (P_LINQ); } YY_BREAK case 99: YY_RULE_SETUP #line 247 "net.lex" { return (P_LRESP); } YY_BREAK case 100: YY_RULE_SETUP #line 248 "net.lex" { return (P_MACRO); } YY_BREAK case 101: YY_RULE_SETUP #line 249 "net.lex" { return (P_MESSAGE); } YY_BREAK case 102: YY_RULE_SETUP #line 250 "net.lex" { return (P_SINQ); } YY_BREAK case 103: YY_RULE_SETUP #line 251 "net.lex" { return (P_SRESP); } YY_BREAK case 104: YY_RULE_SETUP #line 252 "net.lex" { return (P_SYSTEM); } YY_BREAK case 105: YY_RULE_SETUP #line 253 "net.lex" { return (P_VINQ); } YY_BREAK case 106: YY_RULE_SETUP #line 254 "net.lex" { return (P_VRESP); } YY_BREAK case 107: YY_RULE_SETUP #line 257 "net.lex" { strcpy (yylval.s, yytext); return (T_ID); } YY_BREAK case 108: #line 263 "net.lex" case 109: #line 264 "net.lex" case 110: YY_RULE_SETUP #line 264 "net.lex" { /* $$$$$ Reduce the expression */ strcpy (yylval.s, yytext); return (T_EXID); } YY_BREAK case 111: #line 271 "net.lex" case 112: #line 272 "net.lex" case 113: YY_RULE_SETUP #line 272 "net.lex" { yylval.i = strtol (yytext, NULL, 0); return (T_INT); } YY_BREAK case 114: #line 278 "net.lex" case 115: #line 279 "net.lex" case 116: YY_RULE_SETUP #line 279 "net.lex" { yylval.f = (float) atof (yytext); return (T_FLOAT); } YY_BREAK case 117: YY_RULE_SETUP #line 284 "net.lex" { /* Strips off enclosing quotes */ /* $$$$$ still need to process the string */ yytext[strlen (yytext) - 1] = '\000'; strcpy (yylval.s, yytext+1); return (T_STRING); } YY_BREAK case 118: YY_RULE_SETUP #line 292 "net.lex" { strcpy (yylval.s, yytext+2); return (T_COMMENT); } YY_BREAK case 119: YY_RULE_SETUP #line 296 "net.lex" { strcpy (yylval.s, yytext+1); return (T_COMMENT); } YY_BREAK case 120: YY_RULE_SETUP #line 301 "net.lex" { strcpy (yylval.s, ""); return (T_COMMENT); } YY_BREAK case 121: YY_RULE_SETUP #line 305 "net.lex" { } YY_BREAK case 122: YY_RULE_SETUP #line 307 "net.lex" ECHO; YY_BREAK #line 1600 "lex.yy.c" case YY_STATE_EOF(INITIAL): yyterminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = yy_hold_char; YY_RESTORE_YY_MORE_OFFSET if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) { /* We're scanning a new file or input source. It's * possible that this happened because the user * just pointed yyin at a new source and called * yylex(). If so, then we have to assure * consistency between yy_current_buffer and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ yy_n_chars = yy_current_buffer->yy_n_chars; yy_current_buffer->yy_input_file = yyin; yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; } /* Note that here we test for yy_c_buf_p "<=" to the position * of the first EOB in the buffer, since yy_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) { /* This was really a NUL. */ yy_state_type yy_next_state; yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state ); yy_bp = yytext_ptr + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++yy_c_buf_p; yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = yy_c_buf_p; goto yy_find_action; } } else switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { yy_did_buffer_switch_on_eof = 0; if ( yywrap() ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: yy_c_buf_p = &yy_current_buffer->yy_ch_buf[yy_n_chars]; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_find_action; } break; } default: YY_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer() { register char *dest = yy_current_buffer->yy_ch_buf; register char *source = yytext_ptr; register int number_to_move, i; int ret_val; if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( yy_current_buffer->yy_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) { /* We matched a single character, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ yy_current_buffer->yy_n_chars = yy_n_chars = 0; else { int num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ #ifdef YY_USES_REJECT YY_FATAL_ERROR( "input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); #else /* just a shorter name for the current buffer */ YY_BUFFER_STATE b = yy_current_buffer; int yy_c_buf_p_offset = (int) (yy_c_buf_p - b->yy_ch_buf); if ( b->yy_is_our_buffer ) { int new_size = b->yy_buf_size * 2; if ( new_size <= 0 ) b->yy_buf_size += b->yy_buf_size / 8; else b->yy_buf_size *= 2; b->yy_ch_buf = (char *) /* Include room in for 2 EOB chars. */ yy_flex_realloc( (void *) b->yy_ch_buf, b->yy_buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->yy_ch_buf = 0; if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; #endif } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), yy_n_chars, num_to_read ); yy_current_buffer->yy_n_chars = yy_n_chars; } if ( yy_n_chars == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart( yyin ); } else { ret_val = EOB_ACT_LAST_MATCH; yy_current_buffer->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; yy_n_chars += number_to_move; yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; return ret_val; } /* yy_get_previous_state - get the state just before the EOB char was reached */ static yy_state_type yy_get_previous_state() { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = yy_start; for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 320 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ #ifdef YY_USE_PROTOS static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) #else static yy_state_type yy_try_NUL_trans( yy_current_state ) yy_state_type yy_current_state; #endif { register int yy_is_jam; register char *yy_cp = yy_c_buf_p; register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 320 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 319); return yy_is_jam ? 0 : yy_current_state; } #ifndef YY_NO_UNPUT #ifdef YY_USE_PROTOS static void yyunput( int c, register char *yy_bp ) #else static void yyunput( c, yy_bp ) int c; register char *yy_bp; #endif { register char *yy_cp = yy_c_buf_p; /* undo effects of setting up yytext */ *yy_cp = yy_hold_char; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = yy_n_chars + 2; register char *dest = &yy_current_buffer->yy_ch_buf[ yy_current_buffer->yy_buf_size + 2]; register char *source = &yy_current_buffer->yy_ch_buf[number_to_move]; while ( source > yy_current_buffer->yy_ch_buf ) *--dest = *--source; yy_cp += (int) (dest - source); yy_bp += (int) (dest - source); yy_current_buffer->yy_n_chars = yy_n_chars = yy_current_buffer->yy_buf_size; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--yy_cp = (char) c; yytext_ptr = yy_bp; yy_hold_char = *yy_cp; yy_c_buf_p = yy_cp; } #endif /* ifndef YY_NO_UNPUT */ #ifdef __cplusplus static int yyinput() #else static int input() #endif { int c; *yy_c_buf_p = yy_hold_char; if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) { /* yy_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) /* This was really a NUL. */ *yy_c_buf_p = '\0'; else { /* need more input */ int offset = yy_c_buf_p - yytext_ptr; ++yy_c_buf_p; switch ( yy_get_next_buffer() ) { case EOB_ACT_LAST_MATCH: /* This happens because yy_g_n_b() * sees that we've accumulated a * token and flags that we need to * try matching the token before * proceeding. But for input(), * there's no matching to consider. * So convert the EOB_ACT_LAST_MATCH * to EOB_ACT_END_OF_FILE. */ /* Reset buffer status. */ yyrestart( yyin ); /* fall through */ case EOB_ACT_END_OF_FILE: { if ( yywrap() ) return EOF; if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + offset; break; } } } c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ *yy_c_buf_p = '\0'; /* preserve yytext */ yy_hold_char = *++yy_c_buf_p; return c; } #ifdef YY_USE_PROTOS void yyrestart( FILE *input_file ) #else void yyrestart( input_file ) FILE *input_file; #endif { if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_init_buffer( yy_current_buffer, input_file ); yy_load_buffer_state(); } #ifdef YY_USE_PROTOS void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) #else void yy_switch_to_buffer( new_buffer ) YY_BUFFER_STATE new_buffer; #endif { if ( yy_current_buffer == new_buffer ) return; if ( yy_current_buffer ) { /* Flush out information for old buffer. */ *yy_c_buf_p = yy_hold_char; yy_current_buffer->yy_buf_pos = yy_c_buf_p; yy_current_buffer->yy_n_chars = yy_n_chars; } yy_current_buffer = new_buffer; yy_load_buffer_state(); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ yy_did_buffer_switch_on_eof = 1; } #ifdef YY_USE_PROTOS void yy_load_buffer_state( void ) #else void yy_load_buffer_state() #endif { yy_n_chars = yy_current_buffer->yy_n_chars; yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; yyin = yy_current_buffer->yy_input_file; yy_hold_char = *yy_c_buf_p; } #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) #else YY_BUFFER_STATE yy_create_buffer( file, size ) FILE *file; int size; #endif { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_buf_size = size; /* yy_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer( b, file ); return b; } #ifdef YY_USE_PROTOS void yy_delete_buffer( YY_BUFFER_STATE b ) #else void yy_delete_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; if ( b == yy_current_buffer ) yy_current_buffer = (YY_BUFFER_STATE) 0; if ( b->yy_is_our_buffer ) yy_flex_free( (void *) b->yy_ch_buf ); yy_flex_free( (void *) b ); } #ifndef YY_ALWAYS_INTERACTIVE #ifndef YY_NEVER_INTERACTIVE extern int isatty YY_PROTO(( int )); #endif #endif #ifdef YY_USE_PROTOS void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) #else void yy_init_buffer( b, file ) YY_BUFFER_STATE b; FILE *file; #endif { yy_flush_buffer( b ); b->yy_input_file = file; b->yy_fill_buffer = 1; #if YY_ALWAYS_INTERACTIVE b->yy_is_interactive = 1; #else #if YY_NEVER_INTERACTIVE b->yy_is_interactive = 0; #else b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; #endif #endif } #ifdef YY_USE_PROTOS void yy_flush_buffer( YY_BUFFER_STATE b ) #else void yy_flush_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; b->yy_n_chars = 0; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->yy_buf_pos = &b->yy_ch_buf[0]; b->yy_at_bol = 1; b->yy_buffer_status = YY_BUFFER_NEW; if ( b == yy_current_buffer ) yy_load_buffer_state(); } #ifndef YY_NO_SCAN_BUFFER #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) #else YY_BUFFER_STATE yy_scan_buffer( base, size ) char *base; yy_size_t size; #endif { YY_BUFFER_STATE b; if ( size < 2 || base[size-2] != YY_END_OF_BUFFER_CHAR || base[size-1] != YY_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; yy_switch_to_buffer( b ); return b; } #endif #ifndef YY_NO_SCAN_STRING #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) #else YY_BUFFER_STATE yy_scan_string( yy_str ) yyconst char *yy_str; #endif { int len; for ( len = 0; yy_str[len]; ++len ) ; return yy_scan_bytes( yy_str, len ); } #endif #ifndef YY_NO_SCAN_BYTES #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) #else YY_BUFFER_STATE yy_scan_bytes( bytes, len ) yyconst char *bytes; int len; #endif { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = len + 2; buf = (char *) yy_flex_alloc( n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < len; ++i ) buf[i] = bytes[i]; buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer( buf, n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #endif #ifndef YY_NO_PUSH_STATE #ifdef YY_USE_PROTOS static void yy_push_state( int new_state ) #else static void yy_push_state( new_state ) int new_state; #endif { if ( yy_start_stack_ptr >= yy_start_stack_depth ) { yy_size_t new_size; yy_start_stack_depth += YY_START_STACK_INCR; new_size = yy_start_stack_depth * sizeof( int ); if ( ! yy_start_stack ) yy_start_stack = (int *) yy_flex_alloc( new_size ); else yy_start_stack = (int *) yy_flex_realloc( (void *) yy_start_stack, new_size ); if ( ! yy_start_stack ) YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); } yy_start_stack[yy_start_stack_ptr++] = YY_START; BEGIN(new_state); } #endif #ifndef YY_NO_POP_STATE static void yy_pop_state() { if ( --yy_start_stack_ptr < 0 ) YY_FATAL_ERROR( "start-condition stack underflow" ); BEGIN(yy_start_stack[yy_start_stack_ptr]); } #endif #ifndef YY_NO_TOP_STATE static int yy_top_state() { return yy_start_stack[yy_start_stack_ptr - 1]; } #endif #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif #ifdef YY_USE_PROTOS static void yy_fatal_error( yyconst char msg[] ) #else static void yy_fatal_error( msg ) char msg[]; #endif { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ yytext[yyleng] = yy_hold_char; \ yy_c_buf_p = yytext + n; \ yy_hold_char = *yy_c_buf_p; \ *yy_c_buf_p = '\0'; \ yyleng = n; \ } \ while ( 0 ) /* Internal utility routines. */ #ifndef yytext_ptr #ifdef YY_USE_PROTOS static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) #else static void yy_flex_strncpy( s1, s2, n ) char *s1; yyconst char *s2; int n; #endif { register int i; for ( i = 0; i < n; ++i ) s1[i] = s2[i]; } #endif #ifdef YY_NEED_STRLEN #ifdef YY_USE_PROTOS static int yy_flex_strlen( yyconst char *s ) #else static int yy_flex_strlen( s ) yyconst char *s; #endif { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif #ifdef YY_USE_PROTOS static void *yy_flex_alloc( yy_size_t size ) #else static void *yy_flex_alloc( size ) yy_size_t size; #endif { return (void *) malloc( size ); } #ifdef YY_USE_PROTOS static void *yy_flex_realloc( void *ptr, yy_size_t size ) #else static void *yy_flex_realloc( ptr, size ) void *ptr; yy_size_t size; #endif { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } #ifdef YY_USE_PROTOS static void yy_flex_free( void *ptr ) #else static void yy_flex_free( ptr ) void *ptr; #endif { free( ptr ); } #if YY_MAIN int main() { yylex(); return 0; } #endif #line 307 "net.lex" int yywrap() { return (1); }