/* A lexical scanner generated by flex */ /* Scanner skeleton version: * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern 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) #define YY_USES_REJECT 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 87 #define YY_END_OF_BUFFER 88 static yyconst short int yy_acclist[389] = { 0, 88, 85, 87, 84, 85, 87, 1, 86, 87, 85, 86, 87, 85, 87, 85, 87, 84, 85, 87, 85, 87, 85, 87, 26, 85, 87, 1, 27, 86, 87, 26, 85, 86, 87, 26, 85, 87, 26, 85, 87, 49, 85, 87, 1, 50, 86, 87, 49, 85, 86, 87, 42, 49, 85, 87, 49, 85, 87, 49, 85, 87, 49, 85, 87, 47, 49, 85, 87, 48, 49, 85, 87, 49, 85, 87, 49, 85, 87, 45, 85, 87, 1, 46, 86, 87, 45, 85, 86, 87, 44, 45, 85, 87, 45, 85, 87, 85, 87, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 81, 85, 87, 85, 87, 85, 87, 76, 85, 87, 76, 85, 87, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 79, 85, 87, 82, 85, 87, 83, 85, 87, 9, 85, 87, 9, 85, 86, 87, 9, 85, 87, 9, 85, 87, 9, 85, 87, 14, 85, 87, 14, 85, 86, 87, 14, 85, 87, 14, 85, 87, 14, 85, 87, 17, 85, 87, 17, 85, 86, 87, 17, 85, 87, 21, 33, 25, 22, 41, 34, 43, 23, 78, 79, 77, 79, 79, 79, 76, 24, 76, 76, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 8, 6, 13, 10, 12, 11, 13, 16, 15, 3, 28, 32, 39, 35, 37, 18, 19, 78, 78, 77, 79, 79, 79, 68, 76, 20, 76, 76, 79, 79, 79, 79, 79, 79, 63, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 11, 29, 30, 31, 40, 36, 38, 78, 79, 54, 79, 53, 79, 5, 79, 66, 79, 79, 79, 58, 79, 79, 61, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 55, 79, 7, 51, 79, 67, 79, 79, 64, 79, 79, 79, 79, 79, 62, 79, 79, 79, 79, 57, 79, 79, 79, 79, 65, 79, 79, 79, 79, 69, 79, 74, 79, 59, 79, 56, 79, 79, 79, 79, 79, 70, 79, 79, 79, 73, 79, 72, 79, 75, 79, 79, 60, 79, 71, 79, 2, 4, 52 } ; static yyconst short int yy_accept[348] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 7, 10, 13, 15, 17, 20, 22, 24, 27, 31, 35, 38, 41, 44, 48, 52, 56, 59, 62, 65, 69, 73, 76, 79, 82, 86, 90, 94, 97, 99, 101, 104, 107, 110, 113, 116, 118, 120, 123, 126, 128, 131, 134, 137, 140, 143, 146, 149, 152, 155, 158, 161, 164, 167, 170, 173, 177, 180, 183, 186, 189, 193, 196, 199, 202, 205, 209, 212, 213, 213, 213, 213, 213, 213, 213, 213, 214, 214, 215, 215, 215, 215, 215, 215, 216, 216, 217, 217, 217, 218, 219, 220, 220, 221, 222, 223, 224, 225, 226, 226, 227, 228, 228, 228, 229, 229, 229, 230, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 249, 249, 249, 250, 250, 251, 251, 251, 251, 252, 253, 253, 255, 256, 257, 257, 258, 258, 258, 258, 259, 259, 259, 260, 260, 260, 260, 260, 261, 261, 261, 261, 262, 263, 263, 264, 264, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 273, 273, 274, 275, 276, 276, 277, 278, 279, 280, 281, 282, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 296, 297, 297, 297, 298, 298, 299, 300, 300, 300, 300, 301, 302, 303, 303, 304, 305, 307, 309, 309, 310, 311, 313, 314, 315, 317, 318, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 332, 332, 333, 333, 333, 334, 334, 334, 334, 334, 334, 334, 335, 337, 338, 340, 341, 342, 343, 344, 346, 347, 348, 349, 351, 352, 353, 353, 353, 353, 353, 353, 353, 354, 356, 357, 358, 359, 361, 363, 365, 367, 368, 369, 369, 369, 369, 369, 369, 370, 371, 373, 374, 375, 377, 377, 377, 377, 377, 377, 379, 381, 382, 384, 384, 384, 384, 384, 384, 384, 386, 386, 386, 386, 387, 387, 387, 387, 387, 388, 388, 388, 388, 388, 388, 388, 389, 389 } ; static yyconst int yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 6, 7, 1, 8, 1, 9, 10, 11, 12, 1, 1, 1, 13, 14, 15, 16, 17, 17, 17, 17, 17, 17, 18, 18, 19, 1, 20, 1, 21, 1, 1, 22, 22, 22, 22, 23, 22, 24, 24, 25, 24, 24, 24, 24, 24, 24, 24, 24, 26, 27, 24, 24, 24, 24, 24, 24, 24, 28, 29, 30, 1, 24, 1, 31, 32, 33, 34, 35, 36, 37, 38, 39, 24, 24, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 24, 51, 24, 24, 52, 1, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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[54] = { 0, 1, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 5, 1, 1, 6, 6, 7, 7, 7, 7, 1, 1, 1, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1 } ; static yyconst short int yy_base[371] = { 0, 0, 32, 3, 5, 76, 127, 15, 19, 180, 0, 221, 0, 8, 47, 35, 51, 54, 57, 809, 810, 810, 810, 810, 12, 768, 26, 37, 772, 810, 810, 810, 792, 778, 810, 810, 810, 810, 35, 15, 0, 810, 810, 65, 751, 810, 810, 810, 810, 0, 31, 0, 784, 43, 52, 54, 810, 78, 62, 93, 84, 97, 97, 99, 102, 65, 84, 98, 103, 100, 106, 119, 107, 129, 810, 810, 810, 810, 788, 149, 157, 810, 810, 787, 161, 239, 797, 796, 150, 810, 795, 766, 238, 761, 210, 211, 131, 810, 750, 810, 0, 785, 239, 784, 783, 810, 788, 810, 264, 748, 810, 810, 810, 786, 769, 768, 767, 101, 104, 228, 772, 260, 772, 780, 264, 270, 280, 0, 289, 293, 754, 253, 270, 275, 280, 281, 293, 294, 295, 296, 300, 146, 297, 301, 299, 302, 305, 307, 810, 320, 345, 350, 810, 354, 810, 356, 360, 364, 810, 368, 767, 810, 810, 810, 777, 810, 732, 738, 725, 810, 745, 723, 810, 722, 734, 723, 745, 810, 761, 760, 759, 810, 810, 764, 810, 733, 762, 810, 745, 744, 743, 335, 345, 341, 810, 360, 378, 758, 810, 374, 0, 378, 360, 365, 366, 368, 378, 379, 741, 380, 382, 383, 384, 385, 388, 387, 386, 393, 399, 395, 396, 418, 810, 712, 122, 810, 724, 810, 810, 707, 717, 730, 810, 810, 810, 714, 734, 397, 733, 732, 437, 810, 405, 731, 403, 407, 730, 408, 729, 412, 422, 309, 426, 429, 431, 430, 433, 435, 436, 728, 465, 810, 471, 476, 810, 703, 710, 713, 693, 0, 683, 445, 698, 452, 697, 450, 438, 463, 464, 693, 465, 469, 472, 658, 473, 475, 613, 604, 546, 558, 569, 557, 474, 571, 476, 479, 480, 569, 565, 554, 544, 482, 481, 456, 526, 502, 538, 506, 483, 488, 520, 490, 492, 518, 487, 480, 8, 317, 517, 494, 442, 493, 441, 415, 292, 527, 518, 535, 518, 229, 145, 541, 549, 810, 534, 141, 553, 541, 810, 51, 559, 31, 563, 580, 584, 810, 810, 598, 605, 612, 619, 626, 633, 640, 647, 654, 656, 660, 667, 674, 681, 688, 692, 696, 703, 707, 712, 716, 722, 729, 736 } ; static yyconst short int yy_def[371] = { 0, 347, 347, 348, 348, 349, 349, 350, 350, 346, 9, 9, 11, 351, 351, 352, 352, 353, 353, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 354, 346, 346, 346, 346, 346, 346, 346, 346, 355, 346, 356, 357, 357, 357, 357, 346, 346, 346, 346, 346, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 358, 346, 346, 346, 346, 346, 346, 346, 346, 346, 359, 346, 346, 346, 346, 346, 360, 346, 346, 346, 346, 346, 346, 361, 362, 357, 363, 357, 357, 357, 346, 346, 346, 364, 346, 346, 346, 365, 346, 346, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 346, 346, 346, 346, 346, 366, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 358, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 360, 346, 346, 361, 346, 362, 367, 363, 357, 357, 357, 346, 346, 346, 364, 346, 346, 365, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 368, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 367, 357, 357, 357, 346, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 346, 346, 368, 346, 346, 346, 346, 346, 346, 369, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 346, 346, 346, 346, 346, 346, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 346, 346, 346, 346, 346, 357, 357, 357, 357, 357, 357, 346, 346, 346, 346, 346, 357, 357, 357, 357, 346, 346, 346, 346, 346, 346, 357, 346, 346, 346, 346, 370, 346, 346, 370, 346, 346, 346, 346, 346, 346, 346, 346, 0, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346 } ; static yyconst short int yy_nxt[864] = { 0, 346, 21, 22, 23, 21, 30, 31, 30, 31, 325, 22, 77, 325, 24, 32, 346, 32, 46, 47, 78, 48, 46, 47, 89, 48, 90, 105, 92, 106, 33, 92, 346, 25, 26, 22, 23, 26, 22, 82, 27, 101, 346, 112, 49, 113, 24, 83, 49, 79, 22, 77, 79, 84, 22, 82, 84, 22, 87, 80, 22, 87, 116, 85, 102, 25, 88, 108, 94, 88, 108, 116, 93, 116, 122, 95, 123, 173, 28, 35, 36, 96, 37, 117, 116, 38, 341, 103, 104, 97, 39, 120, 119, 121, 121, 121, 121, 124, 118, 128, 128, 128, 128, 116, 109, 40, 124, 135, 125, 125, 125, 126, 129, 129, 129, 129, 116, 116, 116, 116, 116, 116, 116, 116, 136, 116, 116, 130, 41, 42, 35, 36, 191, 37, 43, 44, 38, 132, 116, 117, 137, 39, 133, 131, 127, 134, 138, 192, 116, 145, 139, 149, 140, 162, 149, 141, 40, 142, 143, 151, 152, 150, 153, 155, 163, 116, 155, 144, 146, 173, 265, 148, 147, 156, 169, 339, 335, 174, 213, 41, 42, 20, 21, 22, 23, 21, 20, 20, 20, 20, 20, 20, 20, 20, 50, 20, 20, 20, 20, 51, 20, 20, 52, 52, 52, 52, 52, 52, 20, 20, 20, 52, 52, 53, 52, 52, 54, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 55, 52, 52, 52, 56, 20, 57, 58, 59, 60, 60, 60, 92, 157, 158, 92, 159, 178, 170, 116, 116, 61, 167, 160, 62, 161, 63, 64, 65, 66, 168, 171, 67, 68, 169, 172, 69, 70, 108, 193, 71, 108, 72, 73, 116, 74, 75, 195, 195, 195, 195, 199, 199, 199, 199, 124, 93, 125, 125, 125, 126, 116, 202, 179, 180, 124, 116, 126, 126, 126, 126, 116, 116, 203, 124, 109, 128, 128, 128, 128, 129, 129, 129, 129, 116, 116, 116, 116, 116, 204, 116, 116, 116, 116, 149, 130, 116, 149, 116, 330, 116, 205, 206, 210, 150, 326, 327, 327, 207, 209, 215, 211, 214, 217, 208, 212, 277, 216, 220, 151, 152, 218, 153, 219, 151, 152, 116, 151, 151, 152, 155, 151, 116, 155, 157, 158, 116, 159, 157, 158, 156, 157, 157, 158, 160, 157, 222, 195, 195, 195, 195, 116, 240, 241, 237, 240, 116, 116, 238, 116, 239, 199, 199, 199, 199, 129, 129, 129, 129, 116, 116, 116, 245, 116, 116, 116, 116, 116, 116, 116, 130, 242, 247, 243, 116, 244, 116, 116, 116, 248, 116, 246, 260, 261, 116, 260, 116, 252, 116, 116, 249, 254, 259, 116, 251, 250, 253, 255, 256, 263, 257, 240, 241, 116, 240, 258, 239, 116, 271, 273, 116, 116, 116, 272, 116, 276, 116, 116, 274, 116, 275, 171, 116, 116, 280, 282, 116, 278, 281, 260, 261, 116, 260, 116, 284, 260, 261, 283, 260, 279, 260, 261, 292, 260, 116, 116, 116, 285, 295, 293, 116, 294, 263, 116, 116, 116, 116, 116, 296, 297, 116, 116, 116, 116, 116, 299, 314, 298, 302, 116, 172, 116, 309, 116, 116, 116, 310, 301, 308, 312, 324, 328, 300, 313, 328, 320, 334, 321, 322, 329, 311, 325, 323, 319, 325, 332, 332, 332, 332, 116, 334, 116, 338, 318, 331, 331, 331, 331, 333, 338, 317, 316, 332, 332, 332, 332, 336, 338, 331, 331, 331, 331, 333, 315, 338, 116, 332, 332, 332, 332, 340, 340, 340, 340, 342, 116, 340, 340, 340, 340, 343, 343, 343, 343, 344, 345, 116, 344, 344, 345, 116, 344, 116, 307, 306, 305, 304, 343, 343, 343, 343, 20, 20, 20, 20, 20, 20, 20, 29, 29, 29, 29, 29, 29, 29, 34, 34, 34, 34, 34, 34, 34, 45, 45, 45, 45, 45, 45, 45, 76, 76, 76, 76, 76, 76, 76, 81, 81, 81, 81, 81, 81, 81, 86, 86, 86, 86, 86, 86, 86, 107, 107, 303, 107, 107, 107, 107, 111, 111, 168, 111, 111, 111, 111, 114, 114, 115, 115, 115, 115, 164, 164, 164, 164, 164, 164, 164, 176, 176, 116, 176, 176, 176, 176, 183, 183, 183, 183, 183, 183, 183, 186, 186, 186, 186, 186, 186, 186, 188, 188, 188, 188, 190, 190, 190, 190, 197, 197, 197, 197, 197, 197, 197, 200, 116, 200, 221, 221, 116, 116, 221, 221, 236, 236, 236, 236, 262, 262, 262, 262, 262, 262, 290, 290, 291, 290, 290, 290, 290, 337, 337, 289, 337, 337, 337, 337, 288, 287, 286, 116, 116, 116, 116, 116, 116, 189, 270, 269, 268, 267, 266, 264, 116, 198, 116, 189, 189, 187, 235, 184, 234, 233, 232, 231, 230, 229, 228, 227, 226, 225, 224, 223, 165, 222, 201, 198, 196, 194, 116, 116, 189, 187, 185, 184, 182, 181, 177, 175, 98, 166, 165, 162, 162, 154, 148, 116, 110, 100, 99, 98, 91, 346, 19, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346 } ; static yyconst short int yy_chk[864] = { 0, 0, 1, 1, 1, 1, 3, 3, 4, 4, 316, 13, 13, 316, 1, 3, 0, 4, 7, 7, 13, 7, 8, 8, 24, 8, 24, 39, 26, 39, 4, 26, 0, 1, 2, 2, 2, 2, 15, 15, 2, 38, 0, 50, 7, 50, 2, 15, 8, 14, 14, 14, 14, 16, 16, 16, 16, 17, 17, 14, 18, 18, 53, 16, 38, 2, 17, 43, 27, 18, 43, 54, 26, 55, 58, 27, 58, 341, 2, 5, 5, 27, 5, 53, 65, 5, 339, 38, 38, 27, 5, 57, 55, 57, 57, 57, 57, 60, 54, 60, 60, 60, 60, 66, 43, 5, 59, 65, 59, 59, 59, 59, 61, 61, 61, 61, 62, 67, 63, 69, 117, 64, 68, 118, 66, 70, 72, 61, 5, 5, 6, 6, 117, 6, 6, 6, 6, 63, 71, 63, 67, 6, 63, 62, 59, 64, 68, 118, 73, 72, 69, 79, 70, 88, 79, 70, 6, 71, 71, 80, 80, 79, 80, 84, 88, 141, 84, 71, 73, 96, 224, 80, 73, 84, 224, 335, 330, 96, 141, 6, 6, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 92, 85, 85, 92, 85, 102, 95, 119, 329, 11, 94, 85, 11, 85, 11, 11, 11, 11, 94, 95, 11, 11, 94, 95, 11, 11, 108, 119, 11, 108, 11, 11, 131, 11, 11, 121, 121, 121, 121, 124, 124, 124, 124, 125, 92, 125, 125, 125, 125, 132, 131, 102, 102, 126, 133, 126, 126, 126, 126, 134, 135, 132, 128, 108, 128, 128, 128, 128, 129, 129, 129, 129, 136, 137, 138, 139, 142, 133, 144, 140, 143, 145, 149, 129, 146, 149, 147, 324, 251, 134, 135, 139, 149, 317, 317, 317, 136, 138, 143, 140, 142, 145, 137, 140, 251, 144, 147, 150, 150, 145, 150, 146, 151, 151, 191, 151, 153, 153, 155, 153, 193, 155, 156, 156, 192, 156, 157, 157, 155, 157, 159, 159, 156, 159, 156, 195, 195, 195, 195, 202, 196, 196, 191, 196, 203, 204, 192, 205, 193, 199, 199, 199, 199, 201, 201, 201, 201, 206, 207, 209, 205, 210, 211, 212, 213, 216, 215, 214, 201, 202, 207, 203, 217, 204, 219, 220, 237, 209, 218, 206, 221, 221, 244, 221, 242, 213, 245, 247, 210, 215, 220, 249, 212, 211, 214, 216, 217, 221, 218, 240, 240, 250, 240, 219, 237, 252, 242, 245, 253, 255, 254, 244, 256, 250, 257, 258, 247, 276, 249, 323, 322, 320, 254, 255, 271, 252, 254, 260, 260, 275, 260, 273, 257, 262, 262, 256, 262, 253, 263, 263, 271, 263, 277, 278, 280, 258, 276, 273, 281, 275, 262, 282, 284, 292, 285, 294, 277, 278, 295, 296, 302, 301, 308, 281, 303, 280, 285, 309, 303, 311, 294, 312, 321, 319, 295, 284, 292, 301, 315, 318, 282, 302, 318, 309, 328, 311, 312, 321, 296, 325, 314, 308, 325, 326, 326, 326, 326, 313, 328, 310, 334, 307, 325, 325, 325, 325, 327, 337, 306, 305, 327, 327, 327, 327, 331, 334, 331, 331, 331, 331, 332, 304, 337, 300, 332, 332, 332, 332, 336, 336, 336, 336, 340, 299, 340, 340, 340, 340, 342, 342, 342, 342, 343, 343, 298, 343, 344, 344, 297, 344, 293, 291, 290, 289, 288, 343, 343, 343, 343, 347, 347, 347, 347, 347, 347, 347, 348, 348, 348, 348, 348, 348, 348, 349, 349, 349, 349, 349, 349, 349, 350, 350, 350, 350, 350, 350, 350, 351, 351, 351, 351, 351, 351, 351, 352, 352, 352, 352, 352, 352, 352, 353, 353, 353, 353, 353, 353, 353, 354, 354, 287, 354, 354, 354, 354, 355, 355, 286, 355, 355, 355, 355, 356, 356, 357, 357, 357, 357, 358, 358, 358, 358, 358, 358, 358, 359, 359, 283, 359, 359, 359, 359, 360, 360, 360, 360, 360, 360, 360, 361, 361, 361, 361, 361, 361, 361, 362, 362, 362, 362, 363, 363, 363, 363, 364, 364, 364, 364, 364, 364, 364, 365, 279, 365, 366, 366, 274, 272, 366, 366, 367, 367, 367, 367, 368, 368, 368, 368, 368, 368, 369, 369, 270, 369, 369, 369, 369, 370, 370, 268, 370, 370, 370, 370, 267, 266, 265, 259, 248, 246, 243, 239, 238, 236, 235, 231, 230, 229, 226, 223, 208, 197, 190, 189, 188, 186, 185, 183, 180, 179, 178, 176, 175, 174, 173, 171, 170, 168, 167, 166, 164, 160, 130, 123, 122, 120, 116, 115, 114, 113, 109, 106, 104, 103, 101, 98, 93, 91, 90, 87, 86, 83, 78, 52, 44, 33, 32, 28, 25, 19, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346, 346 } ; static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr; static char *yy_full_match; static int yy_lp; #define REJECT \ { \ *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \ yy_cp = yy_full_match; /* restore poss. backed-over text */ \ ++yy_lp; \ goto find_rule; \ } #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; #line 1 "lexer.l" #define INITIAL 0 /* GOB C Preprocessor * Copyright (C) 1999 the Free Software Foundation. * * Author: George Lebl * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, * USA. */ #line 22 "lexer.l" #include "config.h" #include #include #include "treefuncs.h" #include "parse.h" #include "main.h" #include "util.h" static int parenth_depth = 0; static int before_comment = INITIAL; static gboolean class_after_c = FALSE; static int code_type = CCODE; /* GTK+ doc stuff */ static char *gtk_doc_func = NULL; /* current gtk-doc func */ GHashTable *gtk_doc_hash = NULL; static GString *cbuf = NULL; int ccode_line = 1; GList *include_files = NULL; /* 0 no, 1 means yes, 2+ means don't even start looking anymore */ static int look_for_includes = 0; int line_no = 1; static void clear_cbuf(void) { if(!cbuf) { cbuf = g_string_new(NULL); } else { cbuf = g_string_assign(cbuf, ""); } } static void add_to_cbuf(char *s) { if(!cbuf) { cbuf = g_string_new(s); } else { cbuf = g_string_append(cbuf,s); } } static void add_gtk_doc_func(void) { if(!gtk_doc_func) return; if(!gtk_doc_hash) gtk_doc_hash = g_hash_table_new(g_str_hash, g_str_equal); g_hash_table_insert(gtk_doc_hash, gtk_doc_func, g_strdup(cbuf->str)); clear_cbuf(); gtk_doc_func = NULL; } #define COMMENT 1 #define C_CODE 2 #define C_CODE_STRING 3 #define CLASS_CODE 4 #define CLASS_CODE_I 5 #define GTK_DOC_BEFORE_NAME 6 #define GTK_DOC 7 #define GTK_DOC_LINE 8 #line 822 "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 \ if ( yyleng > 0 ) \ yy_current_buffer->yy_at_bol = \ (yytext[yyleng - 1] == '\n'); \ YY_USER_ACTION YY_DECL { register yy_state_type yy_current_state; register char *yy_cp = NULL, *yy_bp = NULL; register int yy_act; #line 98 "lexer.l" #line 979 "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_current_state += YY_AT_BOL(); yy_state_ptr = yy_state_buf; *yy_state_ptr++ = yy_current_state; yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*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 >= 347 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; *yy_state_ptr++ = yy_current_state; ++yy_cp; } while ( yy_base[yy_current_state] != 810 ); yy_find_action: yy_current_state = *--yy_state_ptr; yy_lp = yy_accept[yy_current_state]; find_rule: /* we branch to this label when backing up */ for ( ; ; ) /* until we find what rule we matched */ { if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] ) { yy_act = yy_acclist[yy_lp]; { yy_full_match = yy_cp; break; } } --yy_cp; yy_current_state = *--yy_state_ptr; yy_lp = 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 1: YY_RULE_SETUP #line 100 "lexer.l" { line_no++; REJECT; } YY_BREAK case 2: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 102 "lexer.l" { /* Thy evil easter egg */ #define QQ(x) long x #define KK(x) =atoi(__(&,,x,)) #define MM(x,a) {QQ(i);for(i=2;i'); *p = '\0'; include_files = g_list_prepend(include_files,g_strdup(file)); g_free(str); } REJECT; } YY_BREAK case 5: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 142 "lexer.l" { /* eat out gtk doc stuff */ BEGIN(GTK_DOC_BEFORE_NAME); clear_cbuf(); } YY_BREAK case 6: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 147 "lexer.l" { /* empty doc lines */ ; } YY_BREAK case 7: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 151 "lexer.l" { char *p; BEGIN(GTK_DOC); p = strchr(yytext, '*'); g_free(gtk_doc_func); gtk_doc_func = g_strdup(p+2); p = strchr(gtk_doc_func, ':'); if(p) *p='\0'; g_strstrip(gtk_doc_func); } YY_BREAK case 8: YY_RULE_SETUP #line 161 "lexer.l" { BEGIN(CLASS_CODE_I); } YY_BREAK case 9: YY_RULE_SETUP #line 164 "lexer.l" { BEGIN(COMMENT); before_comment = CLASS_CODE_I; } YY_BREAK case 10: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 168 "lexer.l" { /* empty doc lines */ add_to_cbuf(" *\n"); } YY_BREAK case 11: YY_RULE_SETUP #line 172 "lexer.l" { BEGIN(CLASS_CODE_I); add_gtk_doc_func(); } YY_BREAK case 12: YY_RULE_SETUP #line 176 "lexer.l" { fflush(stdout); add_to_cbuf(" * "); BEGIN(GTK_DOC_LINE); } YY_BREAK case 13: YY_RULE_SETUP #line 181 "lexer.l" { BEGIN(CLASS_CODE_I); } YY_BREAK case 14: YY_RULE_SETUP #line 184 "lexer.l" { BEGIN(COMMENT); before_comment = CLASS_CODE_I; } YY_BREAK case 15: YY_RULE_SETUP #line 188 "lexer.l" { BEGIN(CLASS_CODE_I); add_to_cbuf("\n"); add_gtk_doc_func(); } YY_BREAK case 16: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 193 "lexer.l" { BEGIN(GTK_DOC); add_to_cbuf(yytext); add_to_cbuf("\n"); } YY_BREAK case 17: YY_RULE_SETUP #line 198 "lexer.l" { fflush(stdout); add_to_cbuf(yytext); } YY_BREAK case 18: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 203 "lexer.l" { add_to_cbuf(yytext); /*comment, ignore*/ } YY_BREAK case 19: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 204 "lexer.l" { ; /*comment, ignore*/ } YY_BREAK case 20: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 205 "lexer.l" { ; /*comment, ignore*/ } YY_BREAK case 21: YY_RULE_SETUP #line 206 "lexer.l" {BEGIN(COMMENT); before_comment = INITIAL; } YY_BREAK case 22: YY_RULE_SETUP #line 207 "lexer.l" { add_to_cbuf(yytext); BEGIN(COMMENT); before_comment = C_CODE; } YY_BREAK case 23: YY_RULE_SETUP #line 212 "lexer.l" {BEGIN(COMMENT); before_comment = CLASS_CODE; } YY_BREAK case 24: YY_RULE_SETUP #line 213 "lexer.l" {BEGIN(COMMENT); before_comment = CLASS_CODE_I; } YY_BREAK case 25: YY_RULE_SETUP #line 214 "lexer.l" { if(before_comment == C_CODE) add_to_cbuf(yytext); BEGIN(before_comment); } YY_BREAK case 26: YY_RULE_SETUP #line 218 "lexer.l" { /* comment, ignore */ if(before_comment == C_CODE) add_to_cbuf(yytext); } YY_BREAK case 27: YY_RULE_SETUP #line 222 "lexer.l" { /* comment, ignore */ if(before_comment == C_CODE) add_to_cbuf(yytext); } YY_BREAK case 28: YY_RULE_SETUP #line 227 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = ACODE; clear_cbuf(); ccode_line = line_no; } YY_BREAK case 29: YY_RULE_SETUP #line 235 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = ATCODE; clear_cbuf(); ccode_line = line_no; } YY_BREAK case 30: YY_RULE_SETUP #line 244 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = HTCODE; clear_cbuf(); ccode_line = line_no; } YY_BREAK case 31: YY_RULE_SETUP #line 252 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = PHCODE; clear_cbuf(); ccode_line = line_no; } YY_BREAK case 32: YY_RULE_SETUP #line 260 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = HCODE; clear_cbuf(); ccode_line = line_no; } YY_BREAK case 33: YY_RULE_SETUP #line 268 "lexer.l" { BEGIN(C_CODE); parenth_depth = 1; class_after_c = FALSE; code_type = CCODE; clear_cbuf(); ccode_line = line_no; if(look_for_includes==0) look_for_includes=1; } YY_BREAK case 34: YY_RULE_SETUP #line 278 "lexer.l" { BEGIN(INITIAL); yylval.cbuf = cbuf; cbuf = NULL; if(look_for_includes==1) look_for_includes=0; return code_type; } YY_BREAK case 35: YY_RULE_SETUP #line 287 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 36: YY_RULE_SETUP #line 288 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 37: YY_RULE_SETUP #line 289 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 38: YY_RULE_SETUP #line 290 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 39: YY_RULE_SETUP #line 291 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 40: YY_RULE_SETUP #line 292 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 41: YY_RULE_SETUP #line 294 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 42: YY_RULE_SETUP #line 295 "lexer.l" { BEGIN(C_CODE_STRING); add_to_cbuf(yytext); } YY_BREAK case 43: YY_RULE_SETUP #line 299 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 44: YY_RULE_SETUP #line 300 "lexer.l" { BEGIN(C_CODE); add_to_cbuf(yytext); } YY_BREAK case 45: YY_RULE_SETUP #line 304 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 46: YY_RULE_SETUP #line 305 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 47: YY_RULE_SETUP #line 307 "lexer.l" { parenth_depth++; add_to_cbuf(yytext); } YY_BREAK case 48: YY_RULE_SETUP #line 311 "lexer.l" { parenth_depth--; if(parenth_depth<0) { REJECT; } else if(parenth_depth==0 && class_after_c) { BEGIN(CLASS_CODE_I); yylval.cbuf = cbuf; cbuf = NULL; return CCODE; } add_to_cbuf(yytext); } YY_BREAK case 49: YY_RULE_SETUP #line 324 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 50: YY_RULE_SETUP #line 325 "lexer.l" { add_to_cbuf(yytext); } YY_BREAK case 51: YY_RULE_SETUP #line 327 "lexer.l" { static int found_classes = 0; look_for_includes = 2; BEGIN(CLASS_CODE); if(++found_classes > 1) { print_error(FALSE, "Only one class per file allowed", line_no); } return CLASS; } YY_BREAK case 52: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 341 "lexer.l" { int maj = 0,min = 0,pl = 0; int rmaj = 0,rmin = 0,rpl = 0; char *p; sscanf(VERSION,"%d.%d.%d",&rmaj,&rmin,&rpl); p = strchr(yytext,'r'); g_assert(p); /* we MUST have found it */ sscanf(p,"requires %d.%d.%d",&maj,&min,&pl); if(rmaj < maj || (rmaj == maj && rmin < min) || (rmaj == maj && rmin == min && rpl < pl)) { char *s; s = g_strdup_printf( "GOB version %d.%d.%d required " "(this is %s)\n" "To upgrade your gob, see: " "http://www.5z.com/jirka/gob.html", maj,min,pl,VERSION); print_error(FALSE, s, line_no); g_free(s); } } YY_BREAK case 53: YY_RULE_SETUP #line 365 "lexer.l" { if(for_cpp) { char *s; s = g_strdup_printf("'%s' keyword should not " "be used when generating " "C++ code",yytext); print_error(TRUE, s, line_no); g_free(s); } REJECT; } YY_BREAK case 54: YY_RULE_SETUP #line 377 "lexer.l" {return FROM;} YY_BREAK case 55: YY_RULE_SETUP #line 379 "lexer.l" {return VOID;} YY_BREAK case 56: YY_RULE_SETUP #line 380 "lexer.l" {return STRUCT;} YY_BREAK case 57: YY_RULE_SETUP #line 381 "lexer.l" {return UNION;} YY_BREAK case 58: YY_RULE_SETUP #line 382 "lexer.l" {return ENUM;} YY_BREAK case 59: YY_RULE_SETUP #line 383 "lexer.l" {return SIGNED;} YY_BREAK case 60: YY_RULE_SETUP #line 384 "lexer.l" {return UNSIGNED;} YY_BREAK case 61: YY_RULE_SETUP #line 385 "lexer.l" {return LONG;} YY_BREAK case 62: YY_RULE_SETUP #line 386 "lexer.l" {return SHORT;} YY_BREAK case 63: YY_RULE_SETUP #line 387 "lexer.l" {return INT;} YY_BREAK case 64: YY_RULE_SETUP #line 388 "lexer.l" {return FLOAT;} YY_BREAK case 65: YY_RULE_SETUP #line 389 "lexer.l" {return DOUBLE;} YY_BREAK case 66: YY_RULE_SETUP #line 390 "lexer.l" {return CHAR;} YY_BREAK case 67: YY_RULE_SETUP #line 391 "lexer.l" {return CONST;} YY_BREAK case 68: YY_RULE_SETUP #line 393 "lexer.l" {return THREEDOTS;} YY_BREAK case 69: YY_RULE_SETUP #line 395 "lexer.l" {yylval.line = line_no; return PUBLIC;} YY_BREAK case 70: YY_RULE_SETUP #line 396 "lexer.l" {yylval.line = line_no; return PRIVATE;} YY_BREAK case 71: YY_RULE_SETUP #line 397 "lexer.l" {yylval.line = line_no; return PROTECTED;} YY_BREAK case 72: YY_RULE_SETUP #line 398 "lexer.l" {yylval.line = line_no; return ARGUMENT;} YY_BREAK case 73: YY_RULE_SETUP #line 399 "lexer.l" {yylval.line = line_no; return VIRTUAL;} YY_BREAK case 74: YY_RULE_SETUP #line 400 "lexer.l" {yylval.line = line_no; return SIGNAL;} YY_BREAK case 75: YY_RULE_SETUP #line 401 "lexer.l" {yylval.line = line_no; return OVERRIDE;} YY_BREAK case 76: YY_RULE_SETUP #line 402 "lexer.l" { yylval.id = g_strdup(yytext); return NUMBER; } YY_BREAK case 77: YY_RULE_SETUP #line 406 "lexer.l" { /* this one is for a classname with a namespace */ yylval.id = g_strdup(yytext); return TYPETOKEN; } YY_BREAK case 78: YY_RULE_SETUP #line 411 "lexer.l" { /* this is for a classname with an empty namespace */ yylval.id = g_strdup(yytext); return TYPETOKEN; } YY_BREAK case 79: YY_RULE_SETUP #line 416 "lexer.l" { yylval.id = g_strdup(yytext); return TOKEN; } YY_BREAK case 80: YY_RULE_SETUP #line 421 "lexer.l" { yylval.id = g_strdup(yytext); return ARRAY_DIM; } YY_BREAK case 81: YY_RULE_SETUP #line 426 "lexer.l" { BEGIN(CLASS_CODE_I); return '{'; } YY_BREAK case 82: YY_RULE_SETUP #line 430 "lexer.l" { BEGIN(C_CODE); parenth_depth=1; class_after_c = TRUE; yylval.line = line_no; clear_cbuf(); ccode_line = line_no; return '{'; } YY_BREAK case 83: YY_RULE_SETUP #line 439 "lexer.l" { BEGIN(INITIAL); return '}'; } YY_BREAK case 84: YY_RULE_SETUP #line 444 "lexer.l" ; /*ignore*/ YY_BREAK case 85: YY_RULE_SETUP #line 446 "lexer.l" { yylval.line = line_no; return yytext[0]; } YY_BREAK case 86: YY_RULE_SETUP #line 451 "lexer.l" ; /*ignore*/ YY_BREAK case 87: YY_RULE_SETUP #line 452 "lexer.l" ECHO; YY_BREAK #line 1776 "lex.yy.c" case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(COMMENT): case YY_STATE_EOF(C_CODE): case YY_STATE_EOF(C_CODE_STRING): case YY_STATE_EOF(CLASS_CODE): case YY_STATE_EOF(CLASS_CODE_I): case YY_STATE_EOF(GTK_DOC_BEFORE_NAME): case YY_STATE_EOF(GTK_DOC): case YY_STATE_EOF(GTK_DOC_LINE): 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; yy_current_state += YY_AT_BOL(); yy_state_ptr = yy_state_buf; *yy_state_ptr++ = yy_current_state; 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); 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 >= 347 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; *yy_state_ptr++ = yy_current_state; } 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 YY_CHAR yy_c = 1; 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 >= 347 ) 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 == 346); if ( ! yy_is_jam ) *yy_state_ptr++ = yy_current_state; 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; yy_current_buffer->yy_at_bol = (c == '\n'); 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 452 "lexer.l"