diff options
Diffstat (limited to 'es_2_0/ParseLex.inl')
| -rwxr-xr-x | es_2_0/ParseLex.inl | 2453 |
1 files changed, 2453 insertions, 0 deletions
diff --git a/es_2_0/ParseLex.inl b/es_2_0/ParseLex.inl new file mode 100755 index 0000000..9099b91 --- /dev/null +++ b/es_2_0/ParseLex.inl @@ -0,0 +1,2453 @@ + +#line 3 "ParseLex.inl" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define yy_create_buffer hazelParse_create_buffer +#define yy_delete_buffer hazelParse_delete_buffer +#define yy_flex_debug hazelParse_flex_debug +#define yy_init_buffer hazelParse_init_buffer +#define yy_flush_buffer hazelParse_flush_buffer +#define yy_load_buffer_state hazelParse_load_buffer_state +#define yy_switch_to_buffer hazelParse_switch_to_buffer +#define yyin hazelParsein +#define yyleng hazelParseleng +#define yylex hazelParselex +#define yylineno hazelParselineno +#define yyout hazelParseout +#define yyrestart hazelParserestart +#define yytext hazelParsetext +#define yywrap hazelParsewrap +#define yyalloc hazelParsealloc +#define yyrealloc hazelParserealloc +#define yyfree hazelParsefree + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 35 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include <stdio.h> +#include <string.h> +#include <errno.h> +#include <stdlib.h> + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include <inttypes.h> +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; +#endif /* ! C99 */ + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! FLEXINT_H */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#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 hazelParserestart(hazelParsein ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#define YY_BUF_SIZE 16384 +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +extern int hazelParseleng; + +extern FILE *hazelParsein, *hazelParseout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up hazelParsetext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = (yy_hold_char); \ + YY_RESTORE_YY_MORE_OFFSET \ + (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up hazelParsetext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, (yytext_ptr) ) + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +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; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* 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 hazelParserestart()), so that the user can continue scanning by + * just pointing hazelParsein at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* Stack of input buffers. */ +static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ +static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ +static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ + +/* 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". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ + ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ + : NULL) + +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] + +/* yy_hold_char holds the character lost when hazelParsetext is formed. */ +static char yy_hold_char; +static int yy_n_chars; /* number of characters read into yy_ch_buf */ +int hazelParseleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = (char *) 0; +static int yy_init = 0; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow hazelParsewrap()'s to do buffer switches + * instead of setting up a fresh hazelParsein. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void hazelParserestart (FILE *input_file ); +void hazelParse_switch_to_buffer (YY_BUFFER_STATE new_buffer ); +YY_BUFFER_STATE hazelParse_create_buffer (FILE *file,int size ); +void hazelParse_delete_buffer (YY_BUFFER_STATE b ); +void hazelParse_flush_buffer (YY_BUFFER_STATE b ); +void hazelParsepush_buffer_state (YY_BUFFER_STATE new_buffer ); +void hazelParsepop_buffer_state (void ); + +static void hazelParseensure_buffer_stack (void ); +static void hazelParse_load_buffer_state (void ); +static void hazelParse_init_buffer (YY_BUFFER_STATE b,FILE *file ); + +#define YY_FLUSH_BUFFER hazelParse_flush_buffer(YY_CURRENT_BUFFER ) + +YY_BUFFER_STATE hazelParse_scan_buffer (char *base,yy_size_t size ); +YY_BUFFER_STATE hazelParse_scan_string (yyconst char *yy_str ); +YY_BUFFER_STATE hazelParse_scan_bytes (yyconst char *bytes,int len ); + +void *hazelParsealloc (yy_size_t ); +void *hazelParserealloc (void *,yy_size_t ); +void hazelParsefree (void * ); + +#define yy_new_buffer hazelParse_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + hazelParseensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + hazelParse_create_buffer(hazelParsein,YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + hazelParseensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + hazelParse_create_buffer(hazelParsein,YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +typedef unsigned char YY_CHAR; + +FILE *hazelParsein = (FILE *) 0, *hazelParseout = (FILE *) 0; + +typedef int yy_state_type; + +extern int hazelParselineno; + +int hazelParselineno = 1; + +extern char *hazelParsetext; +#define yytext_ptr hazelParsetext + +static yy_state_type yy_get_previous_state (void ); +static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); +static int yy_get_next_buffer (void ); +static void yy_fatal_error (yyconst char msg[] ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up hazelParsetext. + */ +#define YY_DO_BEFORE_ACTION \ + (yytext_ptr) = yy_bp; \ + hazelParseleng = (size_t) (yy_cp - yy_bp); \ + (yy_hold_char) = *yy_cp; \ + *yy_cp = '\0'; \ + (yy_c_buf_p) = yy_cp; + +#define YY_NUM_RULES 133 +#define YY_END_OF_BUFFER 134 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static yyconst flex_int16_t yy_accept[428] = + { 0, + 0, 0, 134, 132, 127, 128, 126, 132, 122, 123, + 132, 132, 132, 132, 132, 94, 93, 93, 129, 132, + 132, 132, 92, 124, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 130, 125, 131, 121, 113, 111, + 102, 101, 112, 107, 100, 103, 118, 98, 104, 97, + 94, 0, 0, 0, 93, 93, 109, 110, 105, 106, + 117, 92, 119, 120, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 81, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 84, 73, + + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 114, 115, 0, + 96, 0, 0, 99, 95, 108, 116, 1, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 82, 92, 92, 92, + 92, 92, 92, 92, 92, 52, 92, 92, 92, 92, + 92, 92, 92, 92, 74, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 0, 98, + + 0, 0, 97, 92, 51, 92, 92, 46, 92, 92, + 92, 92, 92, 92, 92, 85, 4, 92, 92, 92, + 20, 92, 92, 9, 24, 92, 92, 92, 92, 92, + 92, 92, 92, 21, 76, 63, 64, 65, 92, 92, + 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 92, 92, 7, 90, 92, 92, 92, 92, + 92, 92, 54, 55, 56, 50, 92, 92, 0, 96, + 92, 79, 57, 58, 59, 2, 70, 92, 92, 92, + 92, 33, 34, 35, 92, 91, 25, 53, 36, 37, + 38, 78, 30, 31, 32, 92, 75, 28, 92, 92, + + 60, 61, 62, 92, 92, 92, 92, 92, 92, 92, + 92, 92, 22, 92, 92, 92, 92, 92, 92, 92, + 92, 3, 92, 48, 92, 92, 83, 92, 92, 92, + 92, 23, 17, 12, 92, 92, 92, 92, 92, 29, + 8, 92, 15, 88, 92, 45, 16, 89, 27, 10, + 92, 92, 92, 92, 92, 92, 92, 92, 11, 87, + 92, 92, 92, 77, 92, 92, 92, 92, 92, 5, + 71, 92, 72, 92, 92, 80, 18, 92, 92, 92, + 13, 92, 92, 92, 92, 92, 6, 26, 14, 69, + 19, 68, 47, 86, 39, 66, 49, 92, 92, 92, + + 92, 92, 92, 92, 92, 92, 92, 67, 92, 92, + 92, 92, 92, 42, 92, 43, 92, 92, 92, 40, + 92, 41, 92, 92, 92, 44, 0 + } ; + +static yyconst flex_int32_t yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 4, 5, 1, 1, 1, 6, 7, 1, 1, + 1, 8, 9, 1, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 18, 18, 19, 19, 1, 20, 21, + 22, 23, 1, 1, 24, 24, 25, 26, 27, 24, + 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, + 28, 29, 30, 28, 28, 28, 28, 31, 28, 28, + 1, 1, 1, 32, 28, 1, 33, 34, 35, 36, + + 37, 38, 39, 40, 41, 28, 42, 43, 44, 45, + 46, 47, 28, 48, 49, 50, 51, 52, 53, 54, + 55, 56, 57, 58, 59, 60, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 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 flex_int32_t yy_meta[61] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, + 3, 1, 4, 4, 4, 4, 4, 4, 4, 1, + 1, 1, 1, 5, 5, 5, 6, 7, 7, 7, + 7, 1, 5, 5, 5, 5, 6, 5, 7, 7, + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, + 7, 7, 7, 7, 7, 7, 1, 1, 1, 1 + } ; + +static yyconst flex_int16_t yy_base[439] = + { 0, + 0, 0, 553, 554, 554, 554, 554, 530, 529, 54, + 528, 53, 55, 53, 527, 67, 68, 62, 554, 42, + 526, 68, 0, 70, 47, 55, 67, 71, 66, 73, + 501, 85, 77, 500, 91, 94, 494, 97, 507, 101, + 95, 104, 122, 503, 554, 109, 554, 554, 554, 554, + 554, 554, 554, 554, 554, 554, 554, 109, 554, 120, + 102, 133, 129, 0, 147, 150, 520, 554, 554, 554, + 519, 0, 554, 554, 496, 489, 492, 500, 499, 486, + 501, 488, 494, 482, 479, 492, 479, 476, 476, 482, + 470, 129, 475, 485, 471, 477, 480, 481, 0, 126, + + 480, 118, 466, 479, 470, 472, 462, 476, 473, 475, + 458, 463, 460, 449, 131, 457, 462, 458, 460, 449, + 452, 139, 457, 449, 461, 140, 454, 554, 554, 176, + 155, 180, 180, 187, 0, 554, 554, 0, 446, 450, + 459, 456, 440, 440, 158, 455, 452, 452, 450, 447, + 439, 445, 432, 443, 429, 445, 0, 442, 430, 437, + 434, 438, 431, 420, 419, 432, 435, 432, 427, 418, + 194, 423, 426, 417, 414, 418, 424, 415, 406, 409, + 407, 417, 403, 401, 414, 400, 402, 399, 410, 409, + 174, 404, 399, 388, 198, 406, 408, 397, 208, 215, + + 207, 222, 229, 398, 0, 396, 234, 0, 388, 386, + 394, 383, 400, 389, 237, 0, 0, 383, 393, 393, + 0, 378, 240, 0, 0, 380, 243, 381, 375, 374, + 375, 374, 246, 0, 0, 0, 0, 0, 370, 371, + 376, 367, 380, 375, 374, 366, 370, 362, 365, 369, + 374, 360, 372, 363, 0, 0, 369, 358, 358, 363, + 362, 359, 0, 0, 0, 0, 349, 361, 251, 258, + 363, 0, 0, 0, 0, 0, 0, 351, 352, 346, + 356, 0, 0, 0, 347, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 354, 0, 0, 352, 348, + + 0, 0, 0, 344, 340, 345, 335, 348, 334, 347, + 336, 343, 0, 341, 343, 327, 329, 335, 341, 336, + 324, 0, 326, 0, 325, 328, 0, 317, 316, 316, + 329, 0, 331, 0, 330, 329, 314, 327, 314, 0, + 0, 317, 0, 0, 309, 0, 0, 0, 0, 0, + 306, 317, 310, 316, 313, 308, 300, 312, 0, 0, + 305, 312, 301, 0, 310, 307, 297, 264, 305, 0, + 0, 305, 0, 303, 302, 0, 0, 301, 287, 299, + 0, 290, 308, 307, 306, 280, 0, 0, 0, 0, + 0, 0, 0, 0, 300, 189, 300, 294, 287, 288, + + 282, 282, 276, 277, 271, 270, 261, 0, 256, 238, + 251, 236, 239, 254, 237, 0, 229, 241, 138, 0, + 132, 0, 57, 42, 21, 0, 554, 287, 291, 294, + 298, 301, 305, 310, 311, 316, 319, 322 + } ; + +static yyconst flex_int16_t yy_def[439] = + { 0, + 427, 1, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 428, 429, 427, 427, + 427, 427, 430, 427, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 431, 427, 432, + 16, 433, 434, 435, 428, 429, 427, 427, 427, 427, + 427, 430, 427, 427, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 427, 427, 436, + 432, 437, 427, 427, 435, 427, 427, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 427, 427, + + 438, 427, 427, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 427, 427, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 430, 430, 430, 430, + 430, 430, 430, 430, 430, 430, 0, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427 + } ; + +static yyconst flex_int16_t yy_nxt[615] = + { 0, + 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, + 14, 15, 16, 17, 17, 17, 17, 17, 18, 19, + 20, 21, 22, 23, 23, 23, 23, 23, 23, 23, + 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, + 33, 23, 34, 35, 36, 37, 38, 39, 40, 41, + 42, 43, 44, 23, 23, 23, 45, 46, 47, 48, + 51, 54, 67, 68, 56, 58, 58, 58, 58, 58, + 58, 58, 60, 426, 55, 52, 57, 60, 60, 61, + 61, 61, 61, 61, 61, 62, 66, 425, 63, 70, + 71, 73, 424, 63, 63, 75, 76, 64, 63, 80, + + 77, 74, 78, 63, 63, 90, 79, 83, 87, 81, + 88, 84, 82, 91, 99, 92, 85, 96, 93, 89, + 64, 100, 86, 103, 94, 97, 105, 104, 101, 108, + 128, 118, 427, 112, 119, 130, 98, 133, 133, 106, + 113, 114, 120, 60, 109, 130, 132, 110, 122, 121, + 115, 116, 123, 117, 124, 427, 132, 60, 125, 63, + 60, 155, 169, 183, 423, 66, 129, 126, 163, 63, + 170, 164, 165, 63, 156, 166, 63, 167, 184, 191, + 196, 201, 197, 63, 199, 199, 63, 192, 202, 202, + 422, 201, 134, 134, 134, 134, 134, 134, 134, 134, + + 134, 134, 134, 134, 134, 134, 210, 211, 236, 237, + 238, 258, 263, 264, 265, 269, 269, 400, 401, 259, + 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, + 200, 200, 200, 200, 203, 203, 203, 203, 203, 203, + 203, 203, 203, 203, 203, 203, 203, 203, 273, 274, + 275, 282, 283, 284, 289, 290, 291, 293, 294, 295, + 301, 302, 303, 270, 270, 270, 270, 270, 270, 270, + 270, 270, 270, 270, 270, 270, 270, 383, 384, 385, + 421, 420, 419, 418, 417, 416, 415, 414, 386, 65, + 65, 413, 65, 66, 66, 412, 66, 72, 72, 72, + + 72, 58, 411, 58, 131, 410, 131, 62, 62, 409, + 62, 134, 408, 134, 135, 135, 135, 200, 407, 200, + 203, 406, 203, 270, 405, 270, 404, 403, 402, 399, + 398, 397, 396, 395, 394, 393, 392, 391, 390, 389, + 388, 387, 382, 381, 380, 379, 378, 377, 376, 375, + 374, 373, 372, 371, 370, 369, 368, 367, 366, 365, + 364, 363, 362, 361, 360, 359, 358, 357, 356, 355, + 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, + 344, 343, 342, 341, 340, 339, 338, 337, 336, 335, + 334, 333, 332, 331, 330, 329, 328, 327, 326, 325, + + 324, 323, 322, 321, 320, 319, 318, 317, 316, 315, + 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, + 304, 300, 299, 298, 297, 296, 292, 288, 287, 286, + 285, 281, 280, 279, 278, 277, 276, 272, 271, 268, + 267, 266, 262, 261, 260, 257, 256, 255, 254, 253, + 252, 251, 250, 249, 248, 247, 246, 245, 244, 243, + 242, 241, 240, 239, 235, 234, 233, 232, 231, 230, + 229, 228, 227, 226, 225, 224, 223, 222, 221, 220, + 219, 218, 217, 216, 215, 214, 213, 212, 209, 208, + 207, 206, 205, 204, 198, 195, 194, 193, 190, 189, + + 188, 187, 186, 185, 182, 181, 180, 179, 178, 177, + 176, 175, 174, 173, 172, 171, 168, 162, 161, 160, + 159, 158, 157, 154, 153, 152, 151, 150, 149, 148, + 147, 146, 145, 144, 143, 142, 141, 140, 139, 138, + 137, 136, 127, 111, 107, 102, 95, 69, 59, 53, + 50, 49, 427, 3, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427 + } ; + +static yyconst flex_int16_t yy_chk[615] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 10, 12, 20, 20, 13, 14, 14, 14, 14, 14, + 14, 14, 18, 425, 12, 10, 13, 16, 17, 16, + 16, 16, 16, 16, 16, 16, 17, 424, 18, 22, + 22, 24, 423, 16, 17, 25, 25, 16, 18, 27, + + 26, 24, 26, 16, 17, 30, 26, 28, 29, 27, + 29, 28, 27, 30, 33, 30, 28, 32, 30, 29, + 16, 33, 28, 35, 30, 32, 36, 35, 33, 38, + 46, 41, 61, 40, 41, 58, 32, 63, 63, 36, + 40, 40, 41, 62, 38, 58, 60, 38, 42, 41, + 40, 40, 42, 40, 43, 61, 60, 65, 43, 62, + 66, 92, 102, 115, 421, 65, 46, 43, 100, 62, + 102, 100, 100, 65, 92, 100, 66, 100, 115, 122, + 126, 131, 126, 65, 130, 130, 66, 122, 132, 132, + 419, 131, 133, 133, 133, 133, 133, 133, 133, 134, + + 134, 134, 134, 134, 134, 134, 145, 145, 171, 171, + 171, 191, 195, 195, 195, 201, 201, 396, 396, 191, + 199, 199, 199, 199, 199, 199, 199, 200, 200, 200, + 200, 200, 200, 200, 202, 202, 202, 202, 202, 202, + 202, 203, 203, 203, 203, 203, 203, 203, 207, 207, + 207, 215, 215, 215, 223, 223, 223, 227, 227, 227, + 233, 233, 233, 269, 269, 269, 269, 269, 269, 269, + 270, 270, 270, 270, 270, 270, 270, 368, 368, 368, + 418, 417, 415, 414, 413, 412, 411, 410, 368, 428, + 428, 409, 428, 429, 429, 407, 429, 430, 430, 430, + + 430, 431, 406, 431, 432, 405, 432, 433, 433, 404, + 433, 434, 403, 434, 435, 435, 435, 436, 402, 436, + 437, 401, 437, 438, 400, 438, 399, 398, 397, 395, + 386, 385, 384, 383, 382, 380, 379, 378, 375, 374, + 372, 369, 367, 366, 365, 363, 362, 361, 358, 357, + 356, 355, 354, 353, 352, 351, 345, 342, 339, 338, + 337, 336, 335, 333, 331, 330, 329, 328, 326, 325, + 323, 321, 320, 319, 318, 317, 316, 315, 314, 312, + 311, 310, 309, 308, 307, 306, 305, 304, 300, 299, + 296, 285, 281, 280, 279, 278, 271, 268, 267, 262, + + 261, 260, 259, 258, 257, 254, 253, 252, 251, 250, + 249, 248, 247, 246, 245, 244, 243, 242, 241, 240, + 239, 232, 231, 230, 229, 228, 226, 222, 220, 219, + 218, 214, 213, 212, 211, 210, 209, 206, 204, 198, + 197, 196, 194, 193, 192, 190, 189, 188, 187, 186, + 185, 184, 183, 182, 181, 180, 179, 178, 177, 176, + 175, 174, 173, 172, 170, 169, 168, 167, 166, 165, + 164, 163, 162, 161, 160, 159, 158, 156, 155, 154, + 153, 152, 151, 150, 149, 148, 147, 146, 144, 143, + 142, 141, 140, 139, 127, 125, 124, 123, 121, 120, + + 119, 118, 117, 116, 114, 113, 112, 111, 110, 109, + 108, 107, 106, 105, 104, 103, 101, 98, 97, 96, + 95, 94, 93, 91, 90, 89, 88, 87, 86, 85, + 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, + 71, 67, 44, 39, 37, 34, 31, 21, 15, 11, + 9, 8, 3, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + + 427, 427, 427, 427, 427, 427, 427, 427, 427, 427, + 427, 427, 427, 427 + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +extern int hazelParse_flex_debug; +int hazelParse_flex_debug = 0; + +/* 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 *hazelParsetext; + +/* The generated ParseLex.c file must be included at the end of ParseYacc.c */ + +extern int hazelEnableTexture3D; + +extern int iLine; + +static int hazelParsewrap(void) { + return 1; +} + +/* +Gets input and stuffs it into "buf". +number of characters read, or YY_NULL, is returned in "result". +*/ +#undef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + { \ + if (*pSrcPtr == '\0') { \ + result = YY_NULL; \ + } else { \ + result = strlen(pSrcPtr); \ + strcpy(buf, pSrcPtr); \ + pSrcPtr += result; \ + } \ + } + +#define SET_TOKEN(_str_) \ + do { \ + memset(&(yylval), 0, sizeof(yylval)); \ + yylval.token.name = malloc(strlen(_str_) + 1); \ + strcpy(yylval.token.name, _str_); \ + } while (0) + +#define INITIAL 0 + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +static int yy_init_globals (void ); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int hazelParselex_destroy (void ); + +int hazelParseget_debug (void ); + +void hazelParseset_debug (int debug_flag ); + +YY_EXTRA_TYPE hazelParseget_extra (void ); + +void hazelParseset_extra (YY_EXTRA_TYPE user_defined ); + +FILE *hazelParseget_in (void ); + +void hazelParseset_in (FILE * in_str ); + +FILE *hazelParseget_out (void ); + +void hazelParseset_out (FILE * out_str ); + +int hazelParseget_leng (void ); + +char *hazelParseget_text (void ); + +int hazelParseget_lineno (void ); + +void hazelParseset_lineno (int line_number ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int hazelParsewrap (void ); +#else +extern int hazelParsewrap (void ); +#endif +#endif + + static void yyunput (int c,char *buf_ptr ); + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ); +#endif + +#ifndef YY_NO_INPUT + +#ifdef __cplusplus +static int yyinput (void ); +#else +static int input (void ); +#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 fwrite( hazelParsetext, hazelParseleng, 1, hazelParseout ) +#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_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + unsigned n; \ + for ( n = 0; n < max_size && \ + (c = getc( hazelParsein )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( hazelParsein ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = fread(buf, 1, max_size, hazelParsein))==0 && ferror(hazelParsein)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(hazelParsein); \ + } \ + }\ +\ + +#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 + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int hazelParselex (void); + +#define YY_DECL int hazelParselex (void) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after hazelParsetext and hazelParseleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + register yy_state_type yy_current_state; + register char *yy_cp, *yy_bp; + register int yy_act; + + /* 3.7 reserved */ + + if ( !(yy_init) ) + { + (yy_init) = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! (yy_start) ) + (yy_start) = 1; /* first start state */ + + if ( ! hazelParsein ) + hazelParsein = stdin; + + if ( ! hazelParseout ) + hazelParseout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + hazelParseensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + hazelParse_create_buffer(hazelParsein,YY_BUF_SIZE ); + } + + hazelParse_load_buffer_state( ); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = (yy_c_buf_p); + + /* Support of hazelParsetext. */ + *yy_cp = (yy_hold_char); + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = (yy_start); +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 428 ) + 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] != 554 ); + +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: +case 2: +case 3: +case 4: +case 5: +case 6: +case 7: +case 8: +case 9: +case 10: +case 11: +case 12: +case 13: +case 14: +case 15: +case 16: +case 17: +case 18: +case 19: +case 20: +case 21: +case 22: +case 23: +case 24: +case 25: +case 26: +case 27: +case 28: +case 29: +case 30: +case 31: +case 32: +case 33: +case 34: +case 35: +case 36: +case 37: +case 38: +case 39: +case 40: +case 41: +case 42: +case 43: +case 44: +case 45: +case 46: +case 47: +case 48: +YY_RULE_SETUP +{ + FOUND_RESERVED(hazelParsetext); + SET_TOKEN(hazelParsetext); + return '$'; +} + YY_BREAK +case 49: +YY_RULE_SETUP +{ + if (hazelEnableTexture3D == GL_TRUE) { + SET_TOKEN(hazelParsetext); yylval.token.type = T_SAMPLER3D; return SAMPLER3D; + } else { + FOUND_RESERVED(hazelParsetext); + SET_TOKEN(hazelParsetext); + return '$'; + } +} + YY_BREAK +/* 4.1 basic types */ +case 50: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_VOID; return VOID; } + YY_BREAK +case 51: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_BOOL; return BOOL; } + YY_BREAK +case 52: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_INT; return INT; } + YY_BREAK +case 53: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_FLOAT; return FLOAT; } + YY_BREAK +case 54: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_VEC2; return VEC2; } + YY_BREAK +case 55: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_VEC3; return VEC3; } + YY_BREAK +case 56: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_VEC4; return VEC4; } + YY_BREAK +case 57: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_BVEC2; return BVEC2; } + YY_BREAK +case 58: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_BVEC3; return BVEC3; } + YY_BREAK +case 59: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_BVEC4; return BVEC4; } + YY_BREAK +case 60: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_IVEC2; return IVEC2; } + YY_BREAK +case 61: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_IVEC3; return IVEC3; } + YY_BREAK +case 62: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_IVEC4; return IVEC4; } + YY_BREAK +case 63: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_MAT2; return MAT2; } + YY_BREAK +case 64: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_MAT3; return MAT3; } + YY_BREAK +case 65: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_MAT4; return MAT4; } + YY_BREAK +case 66: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_SAMPLER2D; return SAMPLER2D; } + YY_BREAK +case 67: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = T_SAMPLERCUBE; return SAMPLERCUBE; } + YY_BREAK +/* 3.7 keywords */ +case 68: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_INVARIANT; return INVARIANT; } + YY_BREAK +case 69: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_ATTRIBUTE; return ATTRIBUTE; } + YY_BREAK +case 70: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_CONST; return CONST; } + YY_BREAK +case 71: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_UNIFORM; return UNIFORM; } + YY_BREAK +case 72: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_VARYING; return VARYING; } + YY_BREAK +case 73: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_IN; return IN; } + YY_BREAK +case 74: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_OUT; return OUT; } + YY_BREAK +case 75: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_INOUT; return INOUT; } + YY_BREAK +case 76: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_LOWP; return LOW_PRECISION; } + YY_BREAK +case 77: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_MEDIUMP; return MEDIUM_PRECISION; } + YY_BREAK +case 78: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); yylval.token.type = S_HIGHP; return HIGH_PRECISION; } + YY_BREAK +case 79: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return BREAK; } + YY_BREAK +case 80: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return CONTINUE; } + YY_BREAK +case 81: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return DO; } + YY_BREAK +case 82: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return FOR; } + YY_BREAK +case 83: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return WHILE; } + YY_BREAK +case 84: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return IF; } + YY_BREAK +case 85: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return ELSE; } + YY_BREAK +case 86: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return PRECISION; } + YY_BREAK +case 87: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return DISCARD; } + YY_BREAK +case 88: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return RETURN; } + YY_BREAK +case 89: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return STRUCT; } + YY_BREAK +/* 4.1.2 booleans */ +case 90: +YY_RULE_SETUP +{ + SET_TOKEN(hazelParsetext); + yylval.token.type = (T_BOOL | S_CONST); + yylval.token.ival = 1; + return BOOLCONSTANT; +} + YY_BREAK +case 91: +YY_RULE_SETUP +{ + SET_TOKEN(hazelParsetext); + yylval.token.type = (T_BOOL | S_CONST); + yylval.token.ival = 0; + return BOOLCONSTANT; +} + YY_BREAK +/* 3.8 identifiers */ +case 92: +YY_RULE_SETUP +{ + if (strstr(hazelParsetext, "__") != NULL) { + yyerror("identifiers containing two consecutive underscores(__) are reserved\n"); + SET_TOKEN(hazelParsetext); + return '$'; + } + SET_TOKEN(hazelParsetext); + return IDENTIFIER; +} + YY_BREAK +/* 4.1.3 integers */ +case 93: +case 94: +case 95: +YY_RULE_SETUP +{ + SET_TOKEN(hazelParsetext); + yylval.token.type = (T_INT | S_CONST); + yylval.token.ival = (int)strtol(hazelParsetext, NULL, 0); + return INTCONSTANT; +} + YY_BREAK +/* 4.1.4 floats */ +case 96: +case 97: +case 98: +case 99: +YY_RULE_SETUP +{ + SET_TOKEN(hazelParsetext); + yylval.token.type = (T_FLOAT | S_CONST); + yylval.token.fval = (float)strtod(hazelParsetext, NULL); + return FLOATCONSTANT; +} + YY_BREAK +/* operators */ +case 100: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return ADD_ASSIGN; } + YY_BREAK +case 101: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return AND_ASSIGN; /* reserved */ } + YY_BREAK +case 102: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return AND_OP; } + YY_BREAK +case 103: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return DEC_OP; } + YY_BREAK +case 104: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return DIV_ASSIGN; } + YY_BREAK +case 105: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return EQ_OP; } + YY_BREAK +case 106: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return GE_OP; } + YY_BREAK +case 107: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return INC_OP; } + YY_BREAK +case 108: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return LEFT_ASSIGN; /* reserved */ } + YY_BREAK +case 109: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return LEFT_OP; /* reserved */ } + YY_BREAK +case 110: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return LE_OP; } + YY_BREAK +case 111: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return MOD_ASSIGN; /* reserved */ } + YY_BREAK +case 112: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return MUL_ASSIGN; } + YY_BREAK +case 113: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return NE_OP; } + YY_BREAK +case 114: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return OR_ASSIGN; /* reserved */ } + YY_BREAK +case 115: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return OR_OP; } + YY_BREAK +case 116: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return RIGHT_ASSIGN; /* reserved */ } + YY_BREAK +case 117: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return RIGHT_OP; /* reserved */ } + YY_BREAK +case 118: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return SUB_ASSIGN; } + YY_BREAK +case 119: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return XOR_ASSIGN; /* reserved */ } + YY_BREAK +case 120: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return XOR_OP; } + YY_BREAK +case 121: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; /* reserved */ } + YY_BREAK +case 122: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; /* reserved */ } + YY_BREAK +case 123: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; /* reserved */ } + YY_BREAK +case 124: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; /* reserved */ } + YY_BREAK +case 125: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; /* reserved */ } + YY_BREAK +/* extras */ +case 126: +YY_RULE_SETUP +{ /* ignore it */ } + YY_BREAK +case 127: +YY_RULE_SETUP +{ /* ignore it */ } + YY_BREAK +case 128: +/* rule 128 can match eol */ +YY_RULE_SETUP +{ iLine++; /* count new line */ } + YY_BREAK +case 129: +YY_RULE_SETUP +{ SET_TOKEN(";\n"); return hazelParsetext[0]; /* newline */ } + YY_BREAK +case 130: +YY_RULE_SETUP +{ SET_TOKEN("{\n"); return hazelParsetext[0]; /* newline */ } + YY_BREAK +case 131: +YY_RULE_SETUP +{ SET_TOKEN("}\n"); return hazelParsetext[0]; /* newline */ } + YY_BREAK +case 132: +YY_RULE_SETUP +{ SET_TOKEN(hazelParsetext); return hazelParsetext[0]; } + YY_BREAK +case 133: +YY_RULE_SETUP +ECHO; + YY_BREAK +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = (yy_hold_char); + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->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 hazelParsein at a new source and called + * hazelParselex(). 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_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = hazelParsein; + YY_CURRENT_BUFFER_LVALUE->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_LVALUE->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 ( hazelParsewrap( ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * hazelParsetext, 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_LVALUE->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 hazelParselex */ + +/* 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 (void) +{ + register char *dest = YY_CURRENT_BUFFER_LVALUE->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_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->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_LVALUE->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_LVALUE->yy_n_chars = (yy_n_chars) = 0; + + else + { + int num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* 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. */ + hazelParserealloc((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_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + (yy_n_chars), (size_t) num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->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; + hazelParserestart(hazelParsein ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) hazelParserealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + } + + (yy_n_chars) += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; + + (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->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 (void) +{ + register yy_state_type yy_current_state; + register char *yy_cp; + + yy_current_state = (yy_start); + + for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 428 ) + 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 ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) +{ + 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 >= 428 ) + 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 == 427); + + return yy_is_jam ? 0 : yy_current_state; +} + + static void yyunput (int c, register char * yy_bp ) +{ + register char *yy_cp; + + yy_cp = (yy_c_buf_p); + + /* undo effects of setting up hazelParsetext */ + *yy_cp = (yy_hold_char); + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->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_LVALUE->yy_ch_buf[ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; + register char *source = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; + + while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->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; +} + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (void) +#else + static int input (void) +#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_LVALUE->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. */ + hazelParserestart(hazelParsein ); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( hazelParsewrap( ) ) + 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 hazelParsetext */ + (yy_hold_char) = *++(yy_c_buf_p); + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * + * @note This function does not reset the start condition to @c INITIAL . + */ + void hazelParserestart (FILE * input_file ) +{ + + if ( ! YY_CURRENT_BUFFER ){ + hazelParseensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + hazelParse_create_buffer(hazelParsein,YY_BUF_SIZE ); + } + + hazelParse_init_buffer(YY_CURRENT_BUFFER,input_file ); + hazelParse_load_buffer_state( ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * + */ + void hazelParse_switch_to_buffer (YY_BUFFER_STATE new_buffer ) +{ + + /* TODO. We should be able to replace this entire function body + * with + * hazelParsepop_buffer_state(); + * hazelParsepush_buffer_state(new_buffer); + */ + hazelParseensure_buffer_stack (); + 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_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + hazelParse_load_buffer_state( ); + + /* We don't actually know whether we did this switch during + * EOF (hazelParsewrap()) processing, but the only time this flag + * is looked at is after hazelParsewrap() is called, so it's safe + * to go ahead and always set it. + */ + (yy_did_buffer_switch_on_eof) = 1; +} + +static void hazelParse_load_buffer_state (void) +{ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + hazelParsein = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + (yy_hold_char) = *(yy_c_buf_p); +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * + * @return the allocated buffer state. + */ + YY_BUFFER_STATE hazelParse_create_buffer (FILE * file, int size ) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) hazelParsealloc(sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParse_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 *) hazelParsealloc(b->yy_buf_size + 2 ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParse_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + hazelParse_init_buffer(b,file ); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with hazelParse_create_buffer() + * + */ + void hazelParse_delete_buffer (YY_BUFFER_STATE b ) +{ + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + hazelParsefree((void *) b->yy_ch_buf ); + + hazelParsefree((void *) b ); +} + +#ifndef __cplusplus +extern int isatty (int ); +#endif /* __cplusplus */ + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a hazelParserestart() or at EOF. + */ + static void hazelParse_init_buffer (YY_BUFFER_STATE b, FILE * file ) + +{ + int oerrno = errno; + + hazelParse_flush_buffer(b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then hazelParse_init_buffer was _probably_ + * called from hazelParserestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * + */ + void hazelParse_flush_buffer (YY_BUFFER_STATE b ) +{ + 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 ) + hazelParse_load_buffer_state( ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * + */ +void hazelParsepush_buffer_state (YY_BUFFER_STATE new_buffer ) +{ + if (new_buffer == NULL) + return; + + hazelParseensure_buffer_stack(); + + /* This block is copied from hazelParse_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + (yy_buffer_stack_top)++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from hazelParse_switch_to_buffer. */ + hazelParse_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * + */ +void hazelParsepop_buffer_state (void) +{ + if (!YY_CURRENT_BUFFER) + return; + + hazelParse_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + if ((yy_buffer_stack_top) > 0) + --(yy_buffer_stack_top); + + if (YY_CURRENT_BUFFER) { + hazelParse_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void hazelParseensure_buffer_stack (void) +{ + int num_to_alloc; + + if (!(yy_buffer_stack)) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; + (yy_buffer_stack) = (struct yy_buffer_state**)hazelParsealloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParseensure_buffer_stack()" ); + + memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + (yy_buffer_stack_max) = num_to_alloc; + (yy_buffer_stack_top) = 0; + return; + } + + if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + int grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = (yy_buffer_stack_max) + grow_size; + (yy_buffer_stack) = (struct yy_buffer_state**)hazelParserealloc + ((yy_buffer_stack), + num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParseensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); + (yy_buffer_stack_max) = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE hazelParse_scan_buffer (char * base, yy_size_t size ) +{ + 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) hazelParsealloc(sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParse_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; + + hazelParse_switch_to_buffer(b ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to hazelParselex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * hazelParse_scan_bytes() instead. + */ +YY_BUFFER_STATE hazelParse_scan_string (yyconst char * yystr ) +{ + + return hazelParse_scan_bytes(yystr,strlen(yystr) ); +} + +/** Setup the input buffer state to scan the given bytes. The next call to hazelParselex() will + * scan from a @e copy of @a bytes. + * @param bytes the byte buffer to scan + * @param len the number of bytes in the buffer pointed to by @a bytes. + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE hazelParse_scan_bytes (yyconst char * yybytes, int _yybytes_len ) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = _yybytes_len + 2; + buf = (char *) hazelParsealloc(n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in hazelParse_scan_bytes()" ); + + for ( i = 0; i < _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = hazelParse_scan_buffer(buf,n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in hazelParse_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; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yy_fatal_error (yyconst char* msg ) +{ + (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 hazelParsetext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + hazelParsetext[hazelParseleng] = (yy_hold_char); \ + (yy_c_buf_p) = hazelParsetext + yyless_macro_arg; \ + (yy_hold_char) = *(yy_c_buf_p); \ + *(yy_c_buf_p) = '\0'; \ + hazelParseleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the current line number. + * + */ +int hazelParseget_lineno (void) +{ + + return hazelParselineno; +} + +/** Get the input stream. + * + */ +FILE *hazelParseget_in (void) +{ + return hazelParsein; +} + +/** Get the output stream. + * + */ +FILE *hazelParseget_out (void) +{ + return hazelParseout; +} + +/** Get the length of the current token. + * + */ +int hazelParseget_leng (void) +{ + return hazelParseleng; +} + +/** Get the current token. + * + */ + +char *hazelParseget_text (void) +{ + return hazelParsetext; +} + +/** Set the current line number. + * @param line_number + * + */ +void hazelParseset_lineno (int line_number ) +{ + + hazelParselineno = line_number; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param in_str A readable stream. + * + * @see hazelParse_switch_to_buffer + */ +void hazelParseset_in (FILE * in_str ) +{ + hazelParsein = in_str ; +} + +void hazelParseset_out (FILE * out_str ) +{ + hazelParseout = out_str ; +} + +int hazelParseget_debug (void) +{ + return hazelParse_flex_debug; +} + +void hazelParseset_debug (int bdebug ) +{ + hazelParse_flex_debug = bdebug ; +} + +static int yy_init_globals (void) +{ + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from hazelParselex_destroy(), so don't allocate here. + */ + + (yy_buffer_stack) = 0; + (yy_buffer_stack_top) = 0; + (yy_buffer_stack_max) = 0; + (yy_c_buf_p) = (char *) 0; + (yy_init) = 0; + (yy_start) = 0; + +/* Defined in main.c */ +#ifdef YY_STDINIT + hazelParsein = stdin; + hazelParseout = stdout; +#else + hazelParsein = (FILE *) 0; + hazelParseout = (FILE *) 0; +#endif + + /* For future reference: Set errno on error, since we are called by + * hazelParselex_init() + */ + return 0; +} + +/* hazelParselex_destroy is for both reentrant and non-reentrant scanners. */ +int hazelParselex_destroy (void) +{ + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + hazelParse_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + hazelParsepop_buffer_state(); + } + + /* Destroy the stack itself. */ + hazelParsefree((yy_buffer_stack) ); + (yy_buffer_stack) = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * hazelParselex() is called, initialization will occur. */ + yy_init_globals( ); + + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) +{ + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * s ) +{ + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *hazelParsealloc (yy_size_t size ) +{ + return (void *) malloc( size ); +} + +void *hazelParserealloc (void * ptr, yy_size_t size ) +{ + /* 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 ); +} + +void hazelParsefree (void * ptr ) +{ + free( (char *) ptr ); /* see hazelParserealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + |