#line 2 "scan.c" /* A lexical scanner generated by flex */ /* Scanner skeleton version: * $Header: /cvs/root/flex/flex/skel.c,v 1.2 2004/05/07 00:28:17 jkh 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 67 #define YY_END_OF_BUFFER 68 static yyconst short int yy_accept[171] = { 0, 0, 0, 68, 67, 65, 67, 12, 60, 61, 57, 55, 63, 56, 67, 58, 9, 64, 54, 52, 53, 62, 59, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 0, 11, 0, 12, 8, 7, 0, 9, 5, 50, 49, 51, 0, 1, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 32, 66, 21, 66, 66, 66, 66, 66, 14, 22, 66, 66, 66, 66, 66, 66, 66, 66, 66, 0, 7, 3, 0, 6, 5, 5, 0, 2, 66, 17, 66, 13, 66, 66, 66, 24, 66, 43, 30, 66, 66, 18, 20, 66, 37, 36, 31, 66, 15, 66, 66, 66, 23, 66, 33, 25, 66, 66, 4, 3, 3, 0, 6, 29, 28, 27, 66, 66, 66, 47, 66, 66, 66, 66, 66, 66, 19, 66, 66, 66, 4, 10, 26, 66, 35, 66, 41, 66, 44, 66, 16, 66, 48, 40, 66, 66, 66, 46, 42, 45, 66, 34, 39, 38, 0 } ; static yyconst int yy_ec[256] = { 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, 2, 2, 3, 2, 4, 2, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 14, 15, 14, 14, 14, 14, 14, 14, 14, 16, 2, 17, 18, 19, 2, 20, 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, 31, 2, 2, 2, 21, 1, 2, 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, 31, 2, 1, 2, 2, 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[47] = { 0, 1, 2, 3, 4, 2, 2, 2, 2, 1, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 } ; static yyconst short int yy_base[177] = { 0, 0, 0, 73, 666, 59, 0, 0, 666, 666, 666, 666, 666, 666, 33, 666, 37, 666, 35, 666, 42, 666, 666, 60, 51, 53, 55, 57, 72, 77, 84, 92, 87, 88, 99, 103, 104, 114, 115, 125, 55, 666, 139, 0, 64, 134, 79, 150, 157, 666, 666, 666, 101, 117, 155, 163, 169, 171, 176, 178, 183, 197, 200, 203, 206, 209, 212, 215, 218, 221, 230, 239, 243, 246, 248, 255, 262, 267, 269, 275, 281, 287, 290, 293, 299, 302, 285, 313, 318, 142, 174, 180, 304, 322, 325, 330, 334, 337, 342, 346, 339, 351, 354, 358, 371, 376, 378, 380, 383, 392, 395, 399, 401, 407, 415, 419, 422, 424, 428, 431, 436, 440, 448, 454, 349, 356, 386, 410, 450, 463, 466, 469, 471, 483, 485, 487, 490, 492, 499, 504, 506, 508, 511, 523, 530, 532, 525, 527, 666, 544, 547, 551, 553, 556, 559, 571, 573, 575, 577, 580, 592, 594, 598, 600, 607, 612, 614, 626, 628, 632, 666, 650, 51, 654, 656, 658, 660 } ; static yyconst short int yy_def[177] = { 0, 170, 1, 170, 170, 171, 172, 173, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 174, 174, 174, 174, 174, 174, 174, 174, 174, 31, 31, 31, 31, 31, 31, 31, 31, 171, 170, 175, 173, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 170, 170, 170, 170, 170, 170, 170, 170, 170, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 170, 170, 170, 170, 170, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 170, 170, 170, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 0, 170, 170, 170, 170, 170, 170 } ; static yyconst short int yy_nxt[713] = { 0, 4, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 24, 24, 28, 29, 24, 24, 30, 31, 32, 33, 34, 24, 35, 36, 37, 38, 39, 24, 24, 24, 44, 44, 45, 46, 47, 47, 49, 50, 52, 42, 52, 41, 52, 51, 52, 41, 48, 52, 53, 53, 53, 53, 53, 53, 53, 53, 170, 53, 53, 52, 62, 44, 44, 170, 52, 170, 55, 56, 170, 53, 53, 52, 61, 170, 53, 53, 88, 88, 57, 52, 170, 53, 53, 58, 59, 63, 60, 66, 64, 53, 53, 65, 54, 54, 170, 67, 170, 70, 53, 53, 54, 54, 68, 69, 54, 71, 73, 54, 54, 54, 74, 72, 75, 78, 53, 53, 54, 79, 54, 82, 54, 76, 77, 54, 170, 80, 52, 54, 54, 81, 54, 86, 86, 54, 54, 83, 53, 53, 54, 128, 128, 84, 92, 87, 54, 45, 46, 47, 47, 89, 92, 90, 93, 93, 91, 91, 92, 170, 92, 48, 93, 93, 170, 92, 170, 92, 93, 93, 93, 93, 92, 91, 91, 93, 93, 93, 93, 91, 91, 97, 93, 93, 170, 99, 92, 170, 95, 92, 96, 98, 92, 170, 100, 92, 93, 93, 92, 93, 93, 92, 93, 93, 92, 93, 93, 92, 93, 93, 92, 93, 93, 170, 93, 93, 170, 93, 93, 92, 93, 93, 101, 170, 102, 104, 170, 105, 92, 93, 93, 103, 92, 170, 108, 92, 106, 92, 93, 93, 170, 107, 93, 93, 92, 93, 93, 93, 93, 170, 109, 92, 170, 112, 93, 93, 92, 170, 92, 111, 110, 93, 93, 113, 92, 170, 93, 93, 93, 93, 92, 170, 114, 170, 93, 93, 92, 170, 117, 92, 93, 93, 92, 115, 86, 86, 93, 93, 92, 93, 93, 92, 93, 93, 116, 118, 87, 170, 93, 93, 170, 93, 93, 93, 93, 119, 120, 124, 170, 125, 121, 170, 126, 126, 170, 122, 127, 88, 88, 170, 123, 93, 93, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 146, 146, 170, 170, 170, 170, 170, 126, 126, 170, 170, 129, 170, 170, 130, 132, 170, 170, 131, 170, 170, 170, 170, 170, 170, 170, 133, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 126, 126, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 134, 170, 170, 170, 170, 135, 136, 170, 170, 170, 170, 170, 147, 147, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 137, 170, 170, 170, 170, 170, 170, 138, 170, 170, 170, 170, 170, 170, 170, 139, 140, 170, 170, 141, 170, 170, 170, 128, 128, 143, 170, 170, 170, 170, 170, 142, 170, 144, 170, 170, 170, 170, 170, 170, 170, 170, 170, 148, 170, 170, 170, 170, 170, 145, 170, 170, 149, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 151, 170, 170, 170, 170, 170, 170, 150, 170, 170, 170, 154, 152, 155, 156, 170, 153, 170, 170, 170, 170, 170, 146, 146, 147, 147, 157, 170, 170, 170, 170, 170, 170, 158, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 160, 170, 170, 170, 170, 159, 170, 170, 161, 170, 170, 170, 170, 170, 170, 170, 170, 170, 163, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 162, 170, 170, 170, 170, 170, 170, 165, 170, 170, 170, 170, 170, 170, 170, 170, 170, 164, 170, 170, 170, 170, 170, 170, 170, 170, 170, 167, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 166, 168, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 169, 40, 40, 40, 40, 43, 170, 43, 43, 54, 54, 85, 85, 94, 94, 3, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170 } ; static yyconst short int yy_chk[713] = { 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, 14, 14, 16, 16, 16, 16, 18, 18, 24, 172, 25, 40, 26, 20, 27, 5, 16, 23, 24, 24, 25, 25, 26, 26, 27, 27, 3, 23, 23, 28, 26, 44, 44, 0, 29, 0, 23, 23, 0, 28, 28, 30, 25, 0, 29, 29, 46, 46, 23, 31, 0, 30, 30, 23, 23, 27, 23, 29, 28, 31, 31, 28, 32, 33, 0, 29, 0, 31, 52, 52, 32, 33, 30, 30, 34, 31, 32, 33, 35, 36, 33, 31, 34, 36, 53, 53, 35, 36, 34, 37, 38, 34, 35, 36, 0, 36, 42, 37, 38, 36, 39, 45, 45, 37, 38, 38, 42, 42, 39, 89, 89, 39, 54, 45, 39, 47, 47, 47, 47, 48, 55, 48, 54, 54, 48, 48, 56, 0, 57, 47, 55, 55, 0, 58, 0, 59, 56, 56, 57, 57, 60, 90, 90, 58, 58, 59, 59, 91, 91, 57, 60, 60, 0, 59, 61, 0, 55, 62, 56, 58, 63, 0, 60, 64, 61, 61, 65, 62, 62, 66, 63, 63, 67, 64, 64, 68, 65, 65, 69, 66, 66, 0, 67, 67, 0, 68, 68, 70, 69, 69, 61, 0, 61, 63, 0, 64, 71, 70, 70, 62, 72, 0, 69, 73, 65, 74, 71, 71, 0, 67, 72, 72, 75, 73, 73, 74, 74, 0, 69, 76, 0, 72, 75, 75, 77, 0, 78, 71, 70, 76, 76, 72, 79, 0, 77, 77, 78, 78, 80, 0, 73, 0, 79, 79, 81, 0, 78, 82, 80, 80, 83, 76, 86, 86, 81, 81, 84, 82, 82, 85, 83, 83, 77, 79, 86, 0, 84, 84, 0, 85, 85, 92, 92, 80, 81, 87, 0, 87, 82, 0, 87, 87, 94, 83, 88, 88, 88, 95, 84, 93, 93, 96, 94, 94, 97, 0, 100, 95, 95, 98, 0, 96, 96, 99, 97, 97, 100, 100, 101, 98, 98, 102, 0, 99, 99, 103, 124, 124, 101, 101, 0, 102, 102, 125, 125, 103, 103, 96, 104, 0, 98, 100, 0, 105, 99, 106, 0, 107, 104, 104, 108, 0, 102, 105, 105, 106, 106, 107, 107, 109, 108, 108, 110, 126, 126, 0, 111, 0, 112, 109, 109, 0, 110, 110, 113, 105, 111, 111, 112, 112, 106, 109, 114, 0, 113, 113, 115, 127, 127, 116, 0, 117, 114, 114, 0, 118, 115, 115, 119, 116, 116, 117, 117, 120, 111, 118, 118, 121, 119, 119, 0, 113, 0, 120, 120, 122, 0, 121, 121, 115, 116, 123, 0, 117, 0, 122, 122, 128, 128, 120, 129, 123, 123, 130, 0, 119, 131, 122, 132, 0, 129, 129, 0, 130, 130, 0, 131, 131, 132, 132, 133, 0, 134, 123, 135, 0, 132, 136, 0, 137, 133, 133, 134, 134, 135, 135, 138, 136, 136, 137, 137, 139, 0, 140, 0, 141, 138, 138, 142, 0, 134, 139, 139, 140, 140, 141, 141, 133, 142, 142, 143, 138, 136, 139, 140, 0, 137, 144, 0, 145, 143, 143, 146, 146, 147, 147, 141, 144, 144, 145, 145, 149, 0, 143, 150, 0, 0, 0, 151, 0, 152, 149, 149, 153, 150, 150, 154, 145, 151, 151, 152, 152, 144, 153, 153, 149, 154, 154, 155, 0, 156, 0, 157, 0, 158, 153, 0, 159, 155, 155, 156, 156, 157, 157, 158, 158, 151, 159, 159, 160, 0, 161, 0, 157, 0, 162, 0, 163, 0, 160, 160, 161, 161, 155, 164, 162, 162, 163, 163, 165, 0, 166, 0, 161, 164, 164, 0, 0, 0, 165, 165, 166, 166, 167, 0, 168, 0, 160, 162, 169, 0, 0, 0, 167, 167, 168, 168, 0, 0, 169, 169, 0, 0, 0, 166, 171, 171, 171, 171, 173, 0, 173, 173, 174, 174, 175, 175, 176, 176, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170 } ; 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 "scan.l" #define INITIAL 0 /* $Id: scan.l,v 1.21 1998/10/20 11:12:50 cthulhu Exp $ */ #line 6 "scan.l" /* lex grammar for Abacus expressions */ /* Arlindo Oliveira */ #include #include #include #include "gram.h" #include "yydefines.h" #include "wk1.hh" extern int parse_return_code; #define yywrap() 1 int yylineno = 1; #undef YY_INPUT #define YY_INPUT(buf,result,max_size) \ { \ xxl_input(buf,&result,max_size);\ } #line 603 "scan.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 36 "scan.l" #line 758 "scan.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 >= 171 ) 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] != 666 ); 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 39 "scan.l" {yylval.stval = yysave(yytext); return L_CELL_ID;} YY_BREAK case 2: YY_RULE_SETUP #line 40 "scan.l" {yylval.stval = yysave(yytext); return L_CELL_ID;} YY_BREAK case 3: YY_RULE_SETUP #line 42 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 4: YY_RULE_SETUP #line 43 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 5: YY_RULE_SETUP #line 44 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 6: YY_RULE_SETUP #line 45 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 7: YY_RULE_SETUP #line 46 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 8: YY_RULE_SETUP #line 47 "scan.l" {yylval.fval = atof(yytext); return L_FLOAT; } YY_BREAK case 9: YY_RULE_SETUP #line 48 "scan.l" {yylval.ival = (int)atoi(yytext); return L_INTEGER; } YY_BREAK case 10: YY_RULE_SETUP #line 50 "scan.l" {yylval.fval = gettime(yytext); return L_DATE; } YY_BREAK case 11: YY_RULE_SETUP #line 53 "scan.l" {yylval.stval = yysave(yytext);return L_STRING;} YY_BREAK case 12: YY_RULE_SETUP #line 54 "scan.l" {return L_LABEL;} YY_BREAK case 13: YY_RULE_SETUP #line 56 "scan.l" {return L_AND;}; YY_BREAK case 14: YY_RULE_SETUP #line 57 "scan.l" {return L_OR;}; YY_BREAK case 15: YY_RULE_SETUP #line 58 "scan.l" {return L_NOT;}; YY_BREAK case 16: YY_RULE_SETUP #line 60 "scan.l" {return L_ROUND;}; YY_BREAK case 17: YY_RULE_SETUP #line 61 "scan.l" {return L_ABS;}; YY_BREAK case 18: YY_RULE_SETUP #line 62 "scan.l" {return L_INTF;}; YY_BREAK case 19: YY_RULE_SETUP #line 63 "scan.l" {return L_SQRT;}; YY_BREAK case 20: YY_RULE_SETUP #line 64 "scan.l" {return L_LOG;}; YY_BREAK case 21: YY_RULE_SETUP #line 65 "scan.l" {return L_LN;}; YY_BREAK case 22: YY_RULE_SETUP #line 66 "scan.l" {return L_PI;}; YY_BREAK case 23: YY_RULE_SETUP #line 67 "scan.l" {return L_SIN;}; YY_BREAK case 24: YY_RULE_SETUP #line 68 "scan.l" {return L_COS;}; YY_BREAK case 25: YY_RULE_SETUP #line 69 "scan.l" {return L_TAN;}; YY_BREAK case 26: YY_RULE_SETUP #line 70 "scan.l" {return L_ATAN2;}; YY_BREAK case 27: YY_RULE_SETUP #line 71 "scan.l" {return L_ATAN;}; YY_BREAK case 28: YY_RULE_SETUP #line 72 "scan.l" {return L_ASIN;}; YY_BREAK case 29: YY_RULE_SETUP #line 73 "scan.l" {return L_ACOS;}; YY_BREAK case 30: YY_RULE_SETUP #line 74 "scan.l" {return L_EXP;}; YY_BREAK case 31: YY_RULE_SETUP #line 75 "scan.l" {return L_MOD;}; YY_BREAK case 32: YY_RULE_SETUP #line 77 "scan.l" {return L_IF;}; YY_BREAK case 33: YY_RULE_SETUP #line 78 "scan.l" {return L_SUM;}; YY_BREAK case 34: YY_RULE_SETUP #line 79 "scan.l" {return L_AVG;}; YY_BREAK case 35: YY_RULE_SETUP #line 80 "scan.l" {return L_COUNT;}; YY_BREAK case 36: YY_RULE_SETUP #line 81 "scan.l" {return L_MIN;}; YY_BREAK case 37: YY_RULE_SETUP #line 82 "scan.l" {return L_MAX;}; YY_BREAK case 38: YY_RULE_SETUP #line 83 "scan.l" {return L_VLOOKUP;}; YY_BREAK case 39: YY_RULE_SETUP #line 84 "scan.l" {return L_HLOOKUP;}; YY_BREAK case 40: YY_RULE_SETUP #line 87 "scan.l" {return L_UPPER;}; YY_BREAK case 41: YY_RULE_SETUP #line 88 "scan.l" {return L_LOWER;}; YY_BREAK case 42: YY_RULE_SETUP #line 89 "scan.l" {return L_PROPER;}; YY_BREAK case 43: YY_RULE_SETUP #line 90 "scan.l" {return L_DAY;}; YY_BREAK case 44: YY_RULE_SETUP #line 91 "scan.l" {return L_MONTH;}; YY_BREAK case 45: YY_RULE_SETUP #line 92 "scan.l" {return L_SECOND;}; YY_BREAK case 46: YY_RULE_SETUP #line 93 "scan.l" {return L_MINUTE;}; YY_BREAK case 47: YY_RULE_SETUP #line 94 "scan.l" {return L_HOUR;}; YY_BREAK case 48: YY_RULE_SETUP #line 96 "scan.l" {return L_SUMIF;}; YY_BREAK case 49: YY_RULE_SETUP #line 99 "scan.l" {return L_NEQUAL;} YY_BREAK case 50: YY_RULE_SETUP #line 100 "scan.l" {return L_SMALLEREQ;} YY_BREAK case 51: YY_RULE_SETUP #line 101 "scan.l" {return L_GREATEREQ;} YY_BREAK case 52: YY_RULE_SETUP #line 102 "scan.l" {return L_EQUAL;} YY_BREAK case 53: YY_RULE_SETUP #line 103 "scan.l" {return L_GREATER;} YY_BREAK case 54: YY_RULE_SETUP #line 104 "scan.l" {return L_SMALLER;} YY_BREAK case 55: YY_RULE_SETUP #line 105 "scan.l" {return L_PLUS;} YY_BREAK case 56: YY_RULE_SETUP #line 106 "scan.l" {return L_MINUS;} YY_BREAK case 57: YY_RULE_SETUP #line 107 "scan.l" {return L_TIMES;} YY_BREAK case 58: YY_RULE_SETUP #line 108 "scan.l" {return L_DIVIDE;} YY_BREAK case 59: YY_RULE_SETUP #line 109 "scan.l" {return L_POWER;} YY_BREAK case 60: YY_RULE_SETUP #line 110 "scan.l" {return L_LEFTPAR;} YY_BREAK case 61: YY_RULE_SETUP #line 111 "scan.l" {return L_RIGHTPAR;} YY_BREAK case 62: YY_RULE_SETUP #line 112 "scan.l" {return L_ETA;} YY_BREAK case 63: YY_RULE_SETUP #line 113 "scan.l" {return L_COMMA;} YY_BREAK case 64: YY_RULE_SETUP #line 114 "scan.l" {return L_COLON;} YY_BREAK case 65: YY_RULE_SETUP #line 115 "scan.l" {return L_DOUBLEQUOTE;} YY_BREAK case 66: YY_RULE_SETUP #line 117 "scan.l" {return L_STRING;} YY_BREAK case 67: YY_RULE_SETUP #line 120 "scan.l" ECHO; YY_BREAK #line 1177 "scan.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 >= 171 ) 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 >= 171 ) 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 == 170); 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 120 "scan.l" #define MAX_SAVE 20 #define MAX_LENG 20 char *yysave(char *s) { static char buf[MAX_SAVE][MAX_LENG]; static int i = 0; i++; if (i == MAX_SAVE) i = 0; strcpy(buf[i],s); return(buf[i]); } yyerror(char * s) { #if DEBUG_PARSER fprintf(stderr,"Error parsing expression\n"); #endif parse_return_code = PARSE_ERROR; } /* $Log: scan.l,v $ * Revision 1.21 1998/10/20 11:12:50 cthulhu * Union fields of yytext are nor properly used. * * Revision 1.20 1998/08/06 21:05:30 aml * Released alpha version of Abacus. * * Revision 1.19 1997/01/02 16:15:28 aml * Fixed unsufficient range of colunm width. * First cut of vlookup and hlookup functions. * Fixed bug in display routines. * * Revision 1.18 1996/12/11 21:39:42 aml * Sumif implemented. * Diverse time functions implemented. * Fixed needtoscroll2 to avoid out of control scroll. * * Revision 1.17 1996/10/07 12:35:24 aml * First cut at error handling. * Date formats are in. * Fixed problem with blank cell drawing. * * Revision 1.16 1996/08/28 17:17:11 aml * Load and save now accept string_value for formula cells. * This fixes previous thought problem of formula values not * being stored. * Functions upper,lower and proper created. * Function if can now return labels. * Fixed problem with function count. * Reasonably stable version, very used to manipulate notas.wk1. * * Revision 1.15 1996/08/27 17:18:45 aml * First version of regressive tests created. * Changes were made to allow for string functions. * String function upper created. Raises the problem * that formulas do NOT have a space for string values, * and therefore have to be evaluated upon loading. * * Revision 1.14 1996/08/26 17:22:23 aml * Function round fixed. * Many other functions added, from power to mod. * * Revision 1.13 1996/04/27 11:12:28 aml * Inserted check and delete button. * Font selection widget created. * Fixed bug canvas_information destructor. * * Revision 1.12 1996/03/11 15:47:44 aml * Made redraw more efficient by removing at once all cells before redrawing. * Fixed problem with unsufficient difinition of logical expressions. * Added >=, <=, <>, @and and @or functions. * * Revision 1.11 1996/03/08 19:00:18 aml * Fixed problem in string_single_arg macro * Created if function, boolean evaluations and so on. * * Revision 1.10 1996/03/07 20:32:49 aml * Created print range ability. * Set in gray non-working menus. * Created RangeKill command. * Created round function and macros for single argument functions. * * Revision 1.9 1996/02/19 15:47:31 aml * Fixed abnormality with mouse click. * Variable width columns implemented, but not yet saved. * Labels are now a lex element, fixing some aberrant behavior that existed. * * Revision 1.8 1996/02/13 12:03:23 aml * Fixed bug with range definition via mouse. * Fixed bug in range iterators. * * Revision 1.7 1996/01/11 22:48:41 aml * Range iterators created. * Functions sum, max and min now work properly. * Negative numbers now allowed by flex (oops :-) * * Revision 1.6 1996/01/10 18:53:37 aml * Fixed limited integer range of cells. * Fixed incorrect code in spreadsheet type. * Users interface improved. Cursors and mouse clicks * now work in the most basic modes. * * Revision 1.5 1996/01/04 20:27:15 aml * Range references parsed and reverse parsed. * * Revision 1.4 1996/01/02 16:22:06 aml * Formula compilation, evaluation and decompilation now work. * Cells can be of type label, numerical formula or numbers. * * Revision 1.3 1995/12/30 16:40:25 aml * First cut of formula compilation. * * Revision 1.2 1995/12/28 19:20:36 aml * Created skeleton to merge calculation engine * * Revision 1.1 1995/12/28 18:23:16 aml * Initial revision * * Revision 1.8 1995/09/18 09:25:36 aml * Last working release with inline expressions. * Move to wk1 format will start after this. * * Revision 1.7 1995/08/18 19:39:48 aml * Modularized to allow for multiple spreadsheets. * Introduced bindings for cursors in main canvas. * Introduced range_opers. Copy redone, cut created. * Automatic positioning of active cell. * * Revision 1.6 1995/08/08 22:05:21 aml * Fixed copy operation. * Fixed parsing of ranges in operations. * * Revision 1.5 1995/08/08 02:25:33 aml * Fixed evaluation for loop-free spreadsheets. * Got first version of cursor state machine working. * * Revision 1.4 1995/06/26 22:52:30 aml * Change to C++ * * Revision 1.3 1995/06/25 00:09:49 aml * First version of copy * * Revision 1.2 1995/06/23 16:10:24 aml * *** empty log message *** * * Revision 1.1 1995/06/23 15:42:30 aml * Initial revision * */