/* A lexical scanner generated by flex */ /* Scanner skeleton version: * $Header: /home2/brain/cvsroot/links-current/javascr.c,v 1.56 2006/05/12 03:26:49 mikulas Exp $ */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #include #include /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #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 56 #define YY_END_OF_BUFFER 57 static yyconst short int yy_accept[366] = { 0, 44, 44, 44, 44, 57, 55, 50, 51, 52, 29, 55, 46, 29, 29, 55, 29, 30, 29, 29, 29, 29, 29, 43, 43, 29, 29, 29, 29, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 29, 50, 29, 56, 50, 52, 29, 56, 46, 29, 29, 56, 29, 30, 29, 29, 29, 29, 29, 43, 43, 29, 29, 29, 29, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 29, 50, 29, 32, 0, 49, 0, 46, 32, 0, 48, 0, 31, 45, 0, 0, 0, 54, 32, 0, 45, 44, 42, 43, 32, 32, 32, 46, 46, 46, 46, 46, 46, 46, 46, 46, 8, 46, 46, 46, 46, 46, 46, 46, 46, 46, 13, 46, 14, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 0, 0, 0, 34, 0, 0, 0, 0, 0, 45, 0, 47, 0, 0, 0, 0, 54, 42, 36, 33, 37, 35, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 11, 46, 46, 46, 46, 28, 46, 46, 16, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 21, 46, 23, 46, 46, 46, 46, 0, 0, 0, 47, 53, 0, 38, 46, 46, 46, 27, 3, 46, 46, 46, 46, 46, 46, 46, 46, 9, 46, 46, 46, 46, 46, 46, 28, 46, 46, 46, 46, 46, 39, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 19, 46, 46, 40, 46, 24, 46, 46, 26, 1, 0, 46, 46, 2, 4, 46, 46, 46, 46, 46, 46, 46, 41, 27, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 20, 46, 46, 46, 25, 1, 0, 46, 46, 46, 46, 46, 7, 46, 46, 46, 46, 46, 46, 46, 46, 46, 17, 18, 46, 46, 22, 46, 46, 46, 46, 6, 10, 46, 46, 46, 46, 46, 46, 46, 46, 5, 12, 46, 46, 46, 46, 46, 46, 46, 46, 46, 15, 46, 46, 0 } ; 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, 6, 7, 1, 8, 9, 10, 11, 12, 13, 14, 15, 12, 16, 17, 18, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 12, 12, 21, 22, 23, 12, 1, 24, 24, 24, 24, 25, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 12, 26, 13, 27, 8, 1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 8, 37, 38, 39, 40, 41, 42, 8, 43, 44, 45, 46, 47, 48, 49, 50, 51, 12, 52, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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[53] = { 0, 1, 1, 2, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 4, 4, 1, 1, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 } ; static yyconst short int yy_base[376] = { 0, 0, 51, 72, 123, 605, 606, 606, 606, 606, 582, 119, 0, 581, 44, 44, 606, 606, 580, 42, 43, 110, 125, 121, 135, 39, 579, 40, 578, 570, 107, 121, 26, 123, 130, 557, 94, 556, 137, 136, 564, 139, 138, 149, 33, 153, 189, 174, 606, 606, 606, 573, 171, 0, 572, 176, 181, 606, 606, 571, 178, 115, 183, 195, 199, 203, 190, 570, 203, 569, 561, 186, 202, 200, 204, 211, 548, 221, 547, 218, 223, 555, 227, 171, 217, 198, 216, 265, 257, 564, 248, 606, 278, 0, 606, 245, 606, 283, 606, 270, 277, 258, 118, 0, 273, 0, 281, 284, 0, 290, 563, 562, 289, 539, 541, 549, 535, 272, 551, 550, 537, 285, 530, 531, 528, 159, 535, 532, 530, 527, 529, 523, 0, 525, 275, 526, 520, 516, 525, 532, 285, 532, 515, 518, 530, 515, 520, 515, 262, 296, 512, 510, 289, 516, 506, 326, 544, 533, 606, 330, 333, 346, 327, 324, 335, 334, 0, 0, 534, 327, 344, 0, 0, 606, 606, 606, 525, 501, 507, 516, 511, 510, 511, 497, 495, 319, 492, 509, 504, 506, 502, 494, 491, 499, 486, 501, 500, 0, 497, 485, 327, 480, 492, 489, 486, 0, 483, 483, 472, 473, 479, 470, 472, 469, 481, 467, 481, 466, 468, 468, 475, 0, 474, 0, 474, 476, 465, 467, 485, 354, 355, 0, 482, 353, 606, 456, 466, 460, 0, 0, 461, 451, 449, 457, 458, 445, 445, 451, 0, 445, 447, 454, 447, 439, 438, 0, 450, 438, 452, 436, 431, 0, 449, 448, 443, 438, 430, 427, 435, 427, 439, 433, 0, 419, 422, 0, 424, 0, 419, 431, 0, 0, 355, 434, 433, 0, 0, 420, 425, 420, 425, 424, 410, 423, 0, 415, 416, 412, 405, 409, 415, 415, 412, 400, 414, 413, 402, 411, 405, 396, 394, 401, 403, 399, 0, 0, 416, 403, 392, 385, 398, 384, 0, 384, 377, 385, 393, 394, 395, 390, 389, 375, 0, 0, 378, 386, 0, 379, 371, 383, 371, 0, 0, 371, 365, 365, 363, 347, 338, 337, 344, 0, 0, 330, 333, 338, 308, 293, 263, 250, 248, 214, 0, 227, 168, 606, 381, 383, 387, 391, 395, 399, 403, 67, 405, 409 } ; static yyconst short int yy_def[376] = { 0, 365, 1, 365, 3, 365, 365, 365, 365, 365, 365, 366, 367, 365, 365, 368, 365, 365, 365, 365, 365, 365, 369, 365, 365, 365, 365, 365, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 365, 365, 365, 365, 365, 365, 365, 366, 367, 365, 365, 368, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 365, 365, 365, 365, 366, 365, 366, 367, 365, 368, 365, 368, 365, 365, 365, 370, 371, 372, 370, 369, 365, 365, 373, 365, 365, 365, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 365, 365, 365, 365, 366, 366, 368, 368, 365, 365, 370, 374, 370, 371, 371, 371, 372, 373, 365, 365, 365, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 365, 366, 368, 374, 365, 371, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 375, 371, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 375, 365, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 367, 0, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365 } ; static yyconst short int yy_nxt[659] = { 0, 6, 7, 8, 9, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 12, 12, 6, 28, 29, 30, 31, 32, 33, 34, 35, 12, 36, 12, 37, 12, 38, 12, 39, 40, 41, 42, 12, 43, 44, 12, 12, 12, 45, 46, 94, 96, 46, 98, 121, 98, 110, 94, 94, 112, 94, 94, 94, 122, 153, 154, 97, 172, 47, 48, 49, 8, 50, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 53, 53, 48, 69, 70, 71, 72, 73, 74, 75, 76, 53, 77, 53, 78, 53, 79, 53, 80, 81, 82, 83, 53, 84, 85, 53, 53, 53, 86, 87, 91, 132, 87, 99, 99, 98, 169, 133, 134, 100, 170, 94, 106, 102, 107, 107, 100, 103, 88, 92, 100, 104, 114, 117, 115, 105, 106, 100, 109, 109, 118, 116, 126, 119, 100, 123, 120, 124, 139, 136, 127, 100, 128, 137, 108, 129, 125, 148, 143, 94, 130, 151, 91, 140, 157, 149, 141, 138, 144, 145, 94, 146, 150, 147, 152, 155, 96, 98, 155, 110, 94, 92, 94, 255, 94, 192, 99, 99, 193, 94, 148, 97, 100, 102, 156, 110, 94, 103, 149, 100, 106, 94, 107, 107, 106, 150, 109, 109, 100, 94, 112, 114, 100, 115, 117, 100, 121, 153, 154, 100, 116, 118, 94, 126, 119, 122, 123, 120, 124, 151, 136, 127, 108, 128, 137, 139, 129, 125, 132, 91, 96, 130, 152, 364, 133, 134, 143, 157, 138, 363, 140, 155, 94, 141, 155, 97, 144, 145, 92, 146, 166, 147, 110, 94, 159, 362, 160, 159, 167, 161, 156, 162, 161, 99, 99, 166, 163, 163, 255, 100, 164, 164, 217, 167, 99, 99, 100, 107, 107, 218, 100, 106, 255, 109, 109, 175, 176, 100, 186, 100, 181, 182, 187, 201, 202, 208, 100, 188, 219, 224, 209, 225, 155, 361, 230, 155, 159, 229, 160, 159, 229, 91, 96, 255, 91, 169, 220, 164, 164, 232, 221, 156, 161, 230, 162, 161, 166, 97, 164, 164, 92, 96, 169, 92, 167, 91, 233, 242, 243, 256, 96, 169, 257, 169, 255, 233, 97, 316, 360, 359, 255, 358, 357, 356, 92, 97, 90, 90, 90, 90, 93, 93, 95, 95, 95, 95, 101, 355, 101, 101, 165, 354, 165, 165, 168, 168, 168, 168, 171, 353, 171, 171, 231, 231, 315, 352, 315, 315, 238, 351, 238, 350, 349, 348, 347, 255, 255, 346, 345, 344, 343, 342, 238, 341, 340, 339, 238, 338, 282, 337, 336, 335, 255, 334, 333, 255, 332, 255, 331, 330, 329, 255, 328, 327, 255, 326, 325, 324, 323, 238, 238, 322, 321, 320, 319, 318, 317, 314, 313, 312, 311, 310, 309, 308, 255, 307, 255, 306, 305, 304, 303, 302, 301, 300, 299, 298, 297, 296, 238, 295, 294, 293, 292, 291, 290, 289, 288, 287, 238, 238, 286, 285, 284, 283, 282, 281, 280, 279, 278, 277, 276, 275, 274, 273, 272, 271, 270, 269, 268, 267, 266, 265, 264, 263, 262, 261, 260, 255, 259, 258, 255, 254, 253, 252, 251, 250, 249, 238, 248, 247, 246, 245, 244, 241, 238, 240, 239, 238, 237, 236, 235, 234, 169, 228, 157, 227, 226, 223, 222, 216, 215, 214, 213, 212, 211, 210, 207, 206, 205, 204, 203, 200, 199, 198, 197, 196, 195, 194, 191, 190, 189, 185, 184, 183, 180, 179, 178, 177, 174, 173, 158, 142, 135, 131, 113, 94, 111, 94, 94, 89, 142, 135, 131, 113, 94, 111, 94, 94, 89, 365, 5, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365 } ; static yyconst short int yy_chk[659] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 14, 15, 2, 19, 32, 20, 25, 25, 27, 27, 19, 20, 14, 32, 44, 44, 15, 373, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 11, 36, 4, 21, 21, 61, 102, 36, 36, 21, 102, 61, 23, 22, 23, 23, 21, 22, 4, 11, 23, 22, 30, 31, 30, 22, 24, 23, 24, 24, 31, 30, 34, 31, 24, 33, 31, 33, 39, 38, 34, 24, 34, 38, 23, 34, 33, 42, 41, 45, 34, 43, 52, 39, 47, 42, 39, 38, 41, 41, 55, 41, 42, 41, 43, 46, 56, 60, 46, 47, 47, 52, 55, 364, 60, 125, 62, 62, 125, 45, 83, 56, 62, 63, 46, 66, 66, 63, 83, 62, 64, 63, 64, 64, 65, 83, 65, 65, 64, 68, 68, 71, 65, 71, 72, 64, 73, 85, 85, 65, 71, 72, 86, 75, 72, 73, 74, 72, 74, 84, 79, 75, 64, 75, 79, 80, 75, 74, 77, 90, 95, 75, 84, 363, 77, 77, 82, 88, 79, 361, 80, 87, 86, 80, 87, 95, 82, 82, 90, 82, 101, 82, 88, 88, 92, 360, 92, 92, 101, 97, 87, 97, 97, 99, 99, 104, 100, 100, 359, 99, 100, 100, 148, 104, 106, 106, 99, 107, 107, 148, 106, 109, 358, 109, 109, 112, 112, 106, 121, 109, 117, 117, 121, 134, 134, 140, 109, 121, 149, 152, 140, 152, 155, 357, 162, 155, 159, 159, 159, 159, 160, 159, 162, 356, 160, 169, 149, 163, 163, 169, 149, 155, 161, 161, 161, 161, 165, 162, 164, 164, 159, 161, 170, 160, 165, 229, 170, 185, 185, 200, 230, 233, 200, 282, 355, 233, 161, 282, 354, 353, 350, 349, 348, 347, 229, 230, 366, 366, 366, 366, 367, 367, 368, 368, 368, 368, 369, 346, 369, 369, 370, 345, 370, 370, 371, 371, 371, 371, 372, 344, 372, 372, 374, 374, 375, 343, 375, 375, 340, 339, 338, 337, 335, 334, 331, 330, 329, 328, 327, 326, 325, 324, 323, 321, 320, 319, 318, 317, 316, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 302, 301, 300, 299, 298, 297, 296, 295, 293, 292, 291, 290, 289, 288, 287, 284, 283, 279, 278, 276, 274, 273, 271, 270, 269, 268, 267, 266, 265, 264, 263, 262, 260, 259, 258, 257, 256, 254, 253, 252, 251, 250, 249, 247, 246, 245, 244, 243, 242, 241, 240, 237, 236, 235, 232, 228, 227, 226, 225, 224, 222, 220, 219, 218, 217, 216, 215, 214, 213, 212, 211, 210, 209, 208, 207, 206, 204, 203, 202, 201, 199, 198, 196, 195, 194, 193, 192, 191, 190, 189, 188, 187, 186, 184, 183, 182, 181, 180, 179, 178, 177, 176, 168, 157, 156, 154, 153, 151, 150, 147, 146, 145, 144, 143, 142, 141, 139, 138, 137, 136, 135, 133, 131, 130, 129, 128, 127, 126, 124, 123, 122, 120, 119, 118, 116, 115, 114, 113, 111, 110, 89, 81, 78, 76, 70, 69, 67, 59, 54, 51, 40, 37, 35, 29, 28, 26, 18, 13, 10, 5, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365, 365 } ; 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 "javascr.l" #define INITIAL 0 #line 2 "javascr.l" /* ipret.c * Javascript interpreter * (c) 2002 Martin 'PerM' Pergel * This file is a part of the Links program, released under GPL. */ #include #include #include #include "cfg.h" #ifndef JS static void *yy_flex_alloc(yy_size_t a){ return 0;} static void *yy_flex_realloc(void* a,yy_size_t b){ return 0;} static void yy_flex_free(void*a){ } static yy_state_type yy_get_previous_state(void){ return 0;} static yy_state_type yy_try_NUL_trans(yy_state_type current_state) { return 0; } static int yy_get_next_buffer(void) { return 0; } static void yy_fatal_error(yyconst char msg[]) { } void js_fake_function_to_stop_silly_warnings(void); void js_fake_function_to_stop_silly_warnings(void) { yy_last_accepting_state=0; yy_last_accepting_cpos=0; yy_n_chars=0; yy_c_buf_p=0; yy_init=yy_start=0; yy_did_buffer_switch_on_eof=0; yy_hold_char=0; yy_current_buffer=0; yy_flex_alloc(0); yy_flex_realloc(0,0); yy_flex_free(0); yy_get_previous_state(); yy_try_NUL_trans(0); yy_get_next_buffer(); yy_fatal_error(0); } #endif #ifdef JS #include "tree.h" #include "struct.h" #include "ipret.h" #define YYSTYPE long #include "javascript.h" #define DEBUZIM #undef DEBUZIM #undef getc #define YY_ALWAYS_INTERACTIVE 1 #define getc mygetc #define ungetc myungetc void yyparse(void); /* stops silly warning - hope prototype isn't buggy! */ char * js_get_char; char * js_get_char_upto; char * js_get_char_from; char * rawstr; js_context * js_context_ptr; extern vrchol*js_strom; extern vrchol*js_last; int mygetc(FILE *); int myungetc(int, FILE *); long civilize(char*); int f(void); int mygetc(FILE *stream) { int i=EOF; if(js_get_char<=js_get_char_upto)i=(unsigned char)(*js_get_char++); return i; } int myungetc(int c, FILE *stream) { int i=EOF; if(js_get_char>js_get_char_from)i=(unsigned char)(*js_get_char--=c); return i; } static int decode_hex_char(const char *s) { const char *hex = "0123456789ABCDEF", *p; int a; if (!s[0] || !s[1]) return -1; if (!(p=strchr(hex,toupper(s[0])))) return -1; a=(p-hex)<<4; if (!(p=strchr(hex,toupper(s[1])))) return -1; a|=(p-hex); return a; } long civilize(char* string) { char* result=js_mem_alloc(strlen(string)+1); int i=0,j=0,k; while(string[i]) { while(string[i]&&string[i]!='\\') { result[j++]=string[i++];} if(string[i]&&string[i+1]) { switch(string[++i]) { case 'n': case 'r': result[j++]='\n'; break; case 't': result[j++]='\t'; break; case 'x': /* Should be a byte coded in hex. */ k = decode_hex_char(string + i + 1); if (k != -1) { result[j++]=k; i+=2; } else result[j++]=string[i]; break; default: result[j++]=string[i]; break; } i++; } } result[j]='\0'; if((size_t)j>strlen(string))internal("Strilim do pameti!\n"); js_mem_free(string); return (long) result; } static int i,j; int linenumber=1; long c_radku=0; js_id_name * * names; static js_id_name*lastname; char*retezec; int f(void){return 0;} #define jiny_stav 1 #line 788 "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 162 "javascr.l" #line 945 "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_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 >= 366 ) 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] != 606 ); 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 164 "javascr.l" { js_warning("HTML comment begin in javascript ",c_radku,js_context_ptr); #ifdef DEBUZIM printf("Creeping featurism comment stripping!\n"); #endif } YY_BREAK case 2: YY_RULE_SETUP #line 171 "javascr.l" { #ifdef DEBUZIM printf("break\n"); #endif BEGIN(INITIAL); return BREAK; /*Keywordy*/ } YY_BREAK case 3: YY_RULE_SETUP #line 179 "javascr.l" { #ifdef DEBUZIM printf("case\n"); #endif BEGIN(INITIAL); return CASE;} YY_BREAK case 4: YY_RULE_SETUP #line 186 "javascr.l" { #ifdef DEBUZIM printf("catch\n"); #endif BEGIN(INITIAL); return CATCH; } YY_BREAK case 5: YY_RULE_SETUP #line 194 "javascr.l" { #ifdef DEBUZIM printf("continue\n"); #endif BEGIN(INITIAL); return CONTINUE; } YY_BREAK case 6: YY_RULE_SETUP #line 202 "javascr.l" { #ifdef DEBUZIM printf("default\n"); #endif BEGIN(INITIAL); return DEFAULT;} YY_BREAK case 7: YY_RULE_SETUP #line 209 "javascr.l" { #ifdef DEBUZIM printf("delete\n"); #endif BEGIN(INITIAL); return DELETE;} YY_BREAK case 8: YY_RULE_SETUP #line 216 "javascr.l" { #ifdef DEBUZIM printf("do\n"); #endif BEGIN(INITIAL); return DO;} YY_BREAK case 9: YY_RULE_SETUP #line 223 "javascr.l" { #ifdef DEBUZIM printf("else\n"); #endif BEGIN(INITIAL); return ELSE;} YY_BREAK case 10: YY_RULE_SETUP #line 230 "javascr.l" { #ifdef DEBUZIM printf("finally\n"); #endif BEGIN(INITIAL); return FINALLY;} YY_BREAK case 11: YY_RULE_SETUP #line 237 "javascr.l" { #ifdef DEBUZIM printf("for\n"); #endif BEGIN(INITIAL); return FOR;} YY_BREAK case 12: YY_RULE_SETUP #line 244 "javascr.l" { /*zde vratime dva tokeny FUNCTION*/ #ifdef DEBUZIM printf("function\n"); #endif BEGIN(INITIAL); return FUNCTION;} YY_BREAK case 13: YY_RULE_SETUP #line 251 "javascr.l" { #ifdef DEBUZIM printf("if\n"); #endif BEGIN(INITIAL); return IF;} YY_BREAK case 14: YY_RULE_SETUP #line 258 "javascr.l" { #ifdef DEBUZIM printf("in\n"); #endif BEGIN(INITIAL); return IN;} YY_BREAK case 15: YY_RULE_SETUP #line 265 "javascr.l" { #ifdef DEBUZIM printf("instanceof\n"); #endif BEGIN(INITIAL); return INSTANCEOF;} YY_BREAK case 16: YY_RULE_SETUP #line 272 "javascr.l" { #ifdef DEBUZIM printf("new\n"); #endif BEGIN(INITIAL); return NEW;} YY_BREAK case 17: YY_RULE_SETUP #line 279 "javascr.l" { #ifdef DEBUZIM printf("return\n"); #endif BEGIN(INITIAL); return RETURN;} YY_BREAK case 18: YY_RULE_SETUP #line 286 "javascr.l" { #ifdef DEBUZIM printf("switch\n"); #endif BEGIN(INITIAL); return SWITCH;} YY_BREAK case 19: YY_RULE_SETUP #line 293 "javascr.l" { #ifdef DEBUZIM printf("this\n"); #endif BEGIN(jiny_stav); return THIS;} YY_BREAK case 20: YY_RULE_SETUP #line 300 "javascr.l" { #ifdef DEBUZIM printf("throw\n"); #endif BEGIN(INITIAL); return THROW;} YY_BREAK case 21: YY_RULE_SETUP #line 307 "javascr.l" { #ifdef DEBUZIM printf("try\n"); #endif BEGIN(INITIAL); return TRY;} YY_BREAK case 22: YY_RULE_SETUP #line 314 "javascr.l" { #ifdef DEBUZIM printf("typeof\n"); #endif BEGIN(INITIAL); return TYPEOF;} YY_BREAK case 23: YY_RULE_SETUP #line 321 "javascr.l" { #ifdef DEBUZIM printf("var\n"); #endif BEGIN(INITIAL); return VAR;} YY_BREAK case 24: YY_RULE_SETUP #line 328 "javascr.l" { #ifdef DEBUZIM printf("void\n"); #endif BEGIN(INITIAL); return VOID;} YY_BREAK case 25: YY_RULE_SETUP #line 335 "javascr.l" { #ifdef DEBUZIM printf("while\n"); #endif BEGIN(INITIAL); return WHILE;} YY_BREAK case 26: YY_RULE_SETUP #line 342 "javascr.l" { #ifdef DEBUZIM printf("with\n"); #endif BEGIN(INITIAL); return WITH;} YY_BREAK case 27: YY_RULE_SETUP #line 349 "javascr.l" { #ifdef DEBUZIM printf("You use future keywords?\n"); #endif return LEXERROR;} YY_BREAK case 28: YY_RULE_SETUP #line 354 "javascr.l" { #ifdef DEBUZIM printf("You use future keywords?\n"); #endif return LEXERROR;} YY_BREAK case 29: YY_RULE_SETUP #line 360 "javascr.l" { #ifdef DEBUZIM printf("symbol %c\n",yytext[0]); #endif BEGIN(INITIAL); return yytext[0];} YY_BREAK case 30: YY_RULE_SETUP #line 367 "javascr.l" { #ifdef DEBUZIM printf("symbol %c\n",yytext[0]); #endif BEGIN(jiny_stav); return yytext[0];} YY_BREAK case 31: YY_RULE_SETUP #line 374 "javascr.l" { #ifdef DEBUZIM printf("symbol %d\n",yytext[0]+256*yytext[1]); #endif BEGIN(jiny_stav); return (yytext[0]+256*yytext[1]);} YY_BREAK case 32: YY_RULE_SETUP #line 381 "javascr.l" { #ifdef DEBUZIM printf("symbol %d\n",yytext[0]+256*yytext[1]); #endif BEGIN(INITIAL); return (yytext[0]+256*yytext[1]);} YY_BREAK case 33: YY_RULE_SETUP #line 388 "javascr.l" { #ifdef DEBUZIM printf("symbol ===\n"); #endif BEGIN(INITIAL); return EQEQEQ;} YY_BREAK case 34: YY_RULE_SETUP #line 395 "javascr.l" { #ifdef DEBUZIM printf("symbol !==\n"); #endif BEGIN(INITIAL); return EXCLAMEQEQ;} YY_BREAK case 35: YY_RULE_SETUP #line 402 "javascr.l" { #ifdef DEBUZIM printf("symbol >>>\n"); #endif BEGIN(INITIAL); return SHRSHRSHR;} YY_BREAK case 36: YY_RULE_SETUP #line 409 "javascr.l" { #ifdef DEBUZIM printf("symbol <<=\n"); #endif BEGIN(INITIAL); return SHLSHLEQ;} YY_BREAK case 37: YY_RULE_SETUP #line 416 "javascr.l" { #ifdef DEBUZIM printf("symbol >>=\n"); #endif BEGIN(INITIAL); return SHRSHREQ;} YY_BREAK case 38: YY_RULE_SETUP #line 423 "javascr.l" { #ifdef DEBUZIM printf("symbol >>>=\n"); #endif BEGIN(INITIAL); return THREERIGHTEQUAL; /*POZOR, prasarna, tohle se bude predelavat! Jinymi slovy tedka nemam spravne numericke a retezcove literaly a identifikatory!*/ } YY_BREAK case 39: YY_RULE_SETUP #line 433 "javascr.l" { #ifdef DEBUZIM printf("nullit\n"); #endif BEGIN(jiny_stav); return NULLLIT;} YY_BREAK case 40: YY_RULE_SETUP #line 440 "javascr.l" { #ifdef DEBUZIM printf("truelit\n"); #endif BEGIN(jiny_stav); return TRUELIT;} YY_BREAK case 41: YY_RULE_SETUP #line 446 "javascr.l" { #ifdef DEBUZIM printf("falselit\n"); #endif BEGIN(jiny_stav); return FALSELIT;} YY_BREAK case 42: YY_RULE_SETUP #line 454 "javascr.l" { yylval=(long)js_mem_alloc(sizeof(cislo)); ((cislo*)yylval)->typ=CELE; ((cislo*)yylval)->nr.cele=strtol(yytext+2,0,16); /*NUMERICKE LITERALY -- sestnactkovy*/ #ifdef DEBUZIM printf("hexnr.: %x\n",((cislo*)yylval)->nr.cele); #endif BEGIN(jiny_stav); return NUMLIT;} YY_BREAK case 43: YY_RULE_SETUP #line 465 "javascr.l" { yylval=(long)js_mem_alloc(sizeof(cislo)); ((cislo*)yylval)->typ=CELE; ((cislo*)yylval)->nr.cele=strtol(yytext,0,10); #ifdef DEBUZIM printf("decint.: %d\n",((cislo*)yylval)->nr.cele); #endif BEGIN(jiny_stav); return NUMLIT;} YY_BREAK case 44: YY_RULE_SETUP #line 474 "javascr.l" { yylval=(long)js_mem_alloc(sizeof(cislo)); ((cislo*)yylval)->typ=CELE; ((cislo*)yylval)->nr.cele=strtol(yytext,0,8); #ifdef DEBUZIM printf("octint.: %d\n",((cislo*)yylval)->nr.cele); #endif BEGIN(jiny_stav); return NUMLIT; } YY_BREAK case 45: YY_RULE_SETUP #line 485 "javascr.l" { yylval=(long)js_mem_alloc(sizeof(cislo)); ((cislo*)yylval)->typ=NECELE; ((cislo*)yylval)->nr.necele=(float)atof(yytext); #ifdef DEBUZIM printf("decf.: %f\n",((cislo*)yylval)->nr.necele); #endif BEGIN(jiny_stav); return NUMLIT;} YY_BREAK case 46: YY_RULE_SETUP #line 503 "javascr.l" { #ifdef DEBUZIM printf("IDENTIFIER "); #endif /* Tohle prijde kompletne prekopat: Nebudeme na zacatku zhuverile mallocovat, nybrz jen okopirujeme retezec a pak si ifneme: Budto je kolej prazdna, pak rovnou udelame vagonek s promennou, jinak koukneme, jestli tam identif. uz je, jestli ne, tak dojdeme na konec, pak zname posledniho a za nej to povesime */ if ((unsigned)yyleng >= MAXINT) overalloc(); retezec=(char*)js_mem_alloc(yyleng+1); for(j=0;j=HASHNUM)/*Takova trapna assertiona*/ {internal("Error! HASHNUM musi byt vetsi nez 127!\n");} /* if(yyleng==1)j=((retezec[0])&127); else j=((retezec[0]^retezec[yyleng-1])&127); */ /*MJovo prurazne #ovani:*/ j=i=0;while(retezec[i])j=j*MAGIC+retezec[i++]; j&=127;/*a je to... Jeste bude potreba ohandlovat dynamitickou velikost hashoveho pole*/ if((lastname=names[j])){ while(strcmp(retezec,lastname->jmeno) &&lastname->next) lastname=lastname->next; if(!strcmp(retezec,lastname->jmeno)){ js_mem_free(retezec); yylval=(lastname->klic)*128+j; } else{ /*Koukame na posledni vagonek a ten nematchuje!*/ lastname->next=js_mem_alloc(sizeof(js_id_name)); yylval=lastname->klic+1; lastname=lastname->next; lastname->jmeno=retezec; lastname->next=0; lastname->klic=yylval; yylval=yylval*128+j; } } else{ names[j]=(js_id_name*)js_mem_alloc(sizeof(js_id_name)); names[j]->klic=0; names[j]->jmeno=retezec; names[j]->next=0; yylval=j; } /* yylval=(long)js_mem_alloc(sizeof(js_id_name)); if ((unsigned)yyleng >= MAXINT) overalloc(); (((js_id_name*)yylval)->jmeno)=retezec=(char*)js_mem_alloc(yyleng+1); (((js_id_name*)yylval)->next)=0;/nema dosud naslednika/ for(j=0;j (((js_id_name*)yylval)->klic)=lastns[j]->klic+1; lastns[j]->next=(js_id_name*)yylval; lastns[j]=lastns[j]->next; }else{ names[j]=(js_id_name*)yylval; f(); names[j]->klic=0; } */ BEGIN(jiny_stav); return IDENTIFIER; /*tohle je tezce debuzi, budu to stejne cele prepisovat.*/ } YY_BREAK case 47: YY_RULE_SETUP #line 573 "javascr.l" { if ((unsigned)yyleng >= MAXINT) overalloc(); j=0; rawstr=js_mem_alloc(yyleng+1); while(j<(yyleng+1)){rawstr[j]=yytext[j];j++;} rawstr[j-1]=0; yylval=civilize(rawstr); #ifdef DEBUZIM printf("RegExp: %s\n",(char*)yylval); #endif BEGIN(jiny_stav); return REGEXPLIT; } YY_BREAK case 48: YY_RULE_SETUP #line 585 "javascr.l" {/*RETEZCOVY LITERAL*/ if ((unsigned)yyleng >= MAXINT) overalloc(); j=1; rawstr=js_mem_alloc(yyleng-1); while(j<(yyleng-1)){rawstr[j-1]=yytext[j];j++;} rawstr[j-1]=0;/*konec stringu, spadla klec!*/ yylval=civilize(rawstr); #ifdef DEBUZIM printf("string1: %s\n",(char*)yylval); #endif BEGIN(jiny_stav); return STRINGLIT; } YY_BREAK case 49: YY_RULE_SETUP #line 597 "javascr.l" { if ((unsigned)yyleng >= MAXINT) overalloc(); j=1; rawstr=js_mem_alloc(yyleng-1); while(j<(yyleng-1)){rawstr[j-1]=yytext[j];j++;} rawstr[j-1]=0; yylval=civilize(rawstr); #ifdef DEBUZIM printf("%d ",yyleng); printf("string2: %s\n",(char*)yylval); #endif BEGIN(jiny_stav); return STRINGLIT; /*pozor, prasarna kvuli '"', Jestli to je escsekv, tak to budu prepisovat na 2 pravidla!*/ } YY_BREAK case 50: YY_RULE_SETUP #line 610 "javascr.l" /*zahodime Whitespace*/ YY_BREAK case 51: YY_RULE_SETUP #line 612 "javascr.l" c_radku++;/*Line Terminator*/ YY_BREAK case 52: YY_RULE_SETUP #line 614 "javascr.l" c_radku++;/*ultrapervers!*/ YY_BREAK case 53: YY_RULE_SETUP #line 616 "javascr.l" {i=0; while(iyy_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(); 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 >= 366 ) 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 >= 366 ) 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 == 365); 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 */ #ifndef YY_NO_INPUT #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; } #endif /* YY_NO_INPUT */ #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 ); } #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 635 "javascr.l" /*Todle se bude jmenovat js_execute_code(struct javascript_context*context,unsigned char*code, int len), ja sam si tu budu muset pretizit funkce (f)getc a (f)ungetc, aby to fungovalo. js_create_context a js_destroy_context budou jinde.*/ static vrchol*pom_js_strom; vrchol* previous;/*Tady se bude ukladat pointer na posledni allokovany kus stromu*/ /*Todle udela javascr_execute_code:*/ /* Zbyva: opravit getc a ungetc, aby to fungovalo */ void js_execute_code(js_context* context,unsigned char * code,int len, void (*callback)(void *)) { char*pomstr; int timerno=0; js_bordylek*bordylek; names=(context->namespace); /* for(i=0;inext)pom=pom->next; lastns[i]=pom; }else lastns[i]=0; */ previous=context->js_tree;/* Jsme na zacatku*/ js_last=context->js_tree; /* Kdyby to spadlo driv nez to co naalokuje */ js_get_char=js_get_char_from=code; js_get_char_upto=js_get_char+len-1; c_radku=context->lineno; context->callback=callback; js_context_ptr=context; if(context->code) { if ((unsigned)context->codelen + (unsigned)len > MAXINT - 1) overalloc(); if ((unsigned)context->codelen + (unsigned)len < (unsigned)context->codelen) overalloc(); pomstr=js_mem_alloc(context->codelen+len+1); strncpy(pomstr,context->code,context->codelen); pomstr[context->codelen]='\0'; strncat(pomstr,code,len); pomstr[context->codelen+len]='\0'; js_mem_free(context->code); context->code=pomstr; pomstr=0; }else { if ((unsigned)len >= MAXINT) overalloc(); context->code=js_mem_alloc(len+1); strncpy(context->code,code,len); context->code[len]='\0'; } if(!context->jsem_dead){ /* js_file=fopen("links_debug.err","a"); fprintf(js_file,context->code); fclose(js_file);*/ yyparse(); YY_FLUSH_BUFFER; /*yy_delete_buffer(YY_CURRENT_BUFFER);*/ if(!context->jsem_dead) context->lineno=c_radku; else { js_volej_kolbena(context); return; } } else { js_volej_kolbena(context); return; } /*context->lnamespace=projdi(js_strom); POZOR! Tady je to blbe! Tadyhle prolezeme vsechny funkce a zapamatujeme si, kam s nimi.*/ /* Tadyhle je potreba pridelat kontrolu neprazdnosti stromu pro pripad */ /* ze autor stranky je prase a udelal samomodifikujici kod! */ js_context_ptr=0; if(!context->js_tree) context->js_tree=js_strom; else { pom_js_strom=context->js_tree; context->js_tree=js_mem_alloc(sizeof(vrchol)); context->js_tree->prev=previous; previous=context->js_tree; /*shift pointer to last node */ context->js_tree->opcode=TPROGRAM; context->js_tree->arg[0]=pom_js_strom; context->js_tree->arg[1]=js_strom; } context->current=js_strom; /* odsud se zadne upcally volat nemuzou. muzou se volat az z funkce js_do_code volane z nuloveho timeru !!! Mikulasova sekce !!! */ /* if (context->t != -1) internal("there is already code executing in this context");*/ /* if(context->code) { if ((unsigned)context->codelen + (unsigned)len > MAXINT - 1) overalloc(); if ((unsigned)context->codelen + (unsigned)len < (unsigned)context->codelen) overalloc(); pomstr=js_mem_alloc(context->codelen+len+1); strncpy(pomstr,context->code,context->codelen); pomstr[context->codelen]='\0'; strncat(pomstr,code,len); pomstr[context->codelen+len]='\0'; js_mem_free(context->code); context->code=pomstr; pomstr=0; }else { if ((unsigned)len >= MAXINT) overalloc(); context->code=js_mem_alloc(len+1); strncpy(context->code,code,len); context[code]='\0'; } context->code = code;*/ context->codelen += len; while(timernot[timerno]!=-1))timerno++; if(timerno>=TIMERNO) { js_error("Too many timers",context); return; } if(!(bordylek=js_mem_alloc(sizeof(js_bordylek)))) internal("Out of memory!\n"); bordylek->context=context; bordylek->mytimer=&context->t[timerno]; context->running=1; context->t[timerno]=install_timer(1,(void(*)(void*))ipret,bordylek); context->bordely[timerno]=bordylek; } /* Tady zkonci funkce js_execute_code*/ #ifdef CHCEME_FLEXI_LIBU int yywrap() { return 1; } #endif #endif