#line 3 "<stdout>"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#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)
/* An opaque pointer. */
#ifndef YY_TYPEDEF_YY_SCANNER_T
#define YY_TYPEDEF_YY_SCANNER_T
typedef void* yyscan_t;
#endif
/* For convenience, these vars (plus the bison vars far below)
are macros in the reentrant scanner. */
#define yyin yyg->yyin_r
#define yyout yyg->yyout_r
#define yyextra yyg->yyextra_r
#define yyleng yyg->yyleng_r
#define yytext yyg->yytext_r
#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
#define yy_flex_debug yyg->yy_flex_debug_r
/* 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 yyg->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 ((yyg->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 langscan_scheme_lex_restart(yyin ,yyscanner )
#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
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
#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 yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = yyg->yy_hold_char; \
YY_RESTORE_YY_MORE_OFFSET \
yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
#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.
*/
yy_size_t 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 langscan_scheme_lex_restart()), so that the user can continue scanning by
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* 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 ( yyg->yy_buffer_stack \
? yyg->yy_buffer_stack[yyg->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 yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
void langscan_scheme_lex_restart (FILE *input_file ,yyscan_t yyscanner );
void langscan_scheme_lex__switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
YY_BUFFER_STATE langscan_scheme_lex__create_buffer (FILE *file,int size ,yyscan_t yyscanner );
void langscan_scheme_lex__delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
void langscan_scheme_lex__flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
void langscan_scheme_lex_push_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
void langscan_scheme_lex_pop_buffer_state (yyscan_t yyscanner );
static void langscan_scheme_lex_ensure_buffer_stack (yyscan_t yyscanner );
static void langscan_scheme_lex__load_buffer_state (yyscan_t yyscanner );
static void langscan_scheme_lex__init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
#define YY_FLUSH_BUFFER langscan_scheme_lex__flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
YY_BUFFER_STATE langscan_scheme_lex__scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
YY_BUFFER_STATE langscan_scheme_lex__scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
YY_BUFFER_STATE langscan_scheme_lex__scan_bytes (yyconst char *bytes,yy_size_t len ,yyscan_t yyscanner );
void *langscan_scheme_lex_alloc (yy_size_t ,yyscan_t yyscanner );
void *langscan_scheme_lex_realloc (void *,yy_size_t ,yyscan_t yyscanner );
void langscan_scheme_lex_free (void * ,yyscan_t yyscanner );
#define yy_new_buffer langscan_scheme_lex__create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
langscan_scheme_lex_ensure_buffer_stack (yyscanner); \
YY_CURRENT_BUFFER_LVALUE = \
langscan_scheme_lex__create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
langscan_scheme_lex_ensure_buffer_stack (yyscanner); \
YY_CURRENT_BUFFER_LVALUE = \
langscan_scheme_lex__create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
#define langscan_scheme_lex_wrap(n) 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
typedef int yy_state_type;
#define yytext_ptr yytext_r
static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state ,yyscan_t yyscanner);
static int yy_get_next_buffer (yyscan_t yyscanner );
static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
yyg->yytext_ptr = yy_bp; \
yyleng = (size_t) (yy_cp - yy_bp); \
yyg->yy_hold_char = *yy_cp; \
*yy_cp = '\0'; \
yyg->yy_c_buf_p = yy_cp;
#define YY_NUM_RULES 18
#define YY_END_OF_BUFFER 19
/* 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[368] =
{ 0,
0, 0, 19, 17, 1, 2, 2, 13, 17, 17,
4, 13, 17, 7, 3, 1, 2, 13, 13, 13,
0, 5, 0, 16, 0, 0, 0, 0, 0, 14,
0, 4, 4, 0, 7, 12, 0, 7, 7, 13,
7, 13, 7, 13, 13, 7, 3, 5, 0, 0,
6, 0, 0, 0, 0, 8, 15, 15, 15, 0,
0, 0, 0, 0, 10, 0, 7, 0, 0, 0,
7, 13, 7, 7, 13, 13, 7, 7, 7, 7,
13, 7, 13, 7, 6, 0, 8, 8, 0, 8,
0, 0, 0, 8, 0, 0, 0, 0, 0, 10,
0, 0, 0, 10, 0, 0, 7, 7, 7, 0,
7, 0, 7, 7, 13, 0, 13, 13, 13, 7,
7, 7, 7, 13, 13, 0, 0, 8, 8, 8,
0, 0, 8, 8, 8, 8, 0, 8, 0, 8,
0, 0, 0, 0, 9, 0, 10, 0, 11, 0,
10, 10, 10, 0, 0, 0, 0, 7, 7, 0,
0, 0, 0, 0, 13, 13, 13, 13, 7, 7,
7, 7, 7, 13, 7, 8, 8, 0, 8, 0,
0, 0, 8, 8, 0, 0, 0, 0, 0, 8,
8, 8, 8, 0, 0, 0, 0, 9, 9, 0,
9, 0, 0, 0, 9, 10, 0, 0, 0, 10,
11, 0, 0, 0, 11, 0, 0, 10, 10, 0,
0, 0, 0, 0, 7, 7, 0, 7, 0, 0,
7, 7, 8, 8, 0, 0, 8, 8, 8, 8,
0, 8, 0, 8, 0, 0, 0, 0, 0, 0,
0, 8, 8, 8, 8, 8, 0, 8, 0, 9,
9, 0, 0, 9, 9, 9, 9, 0, 9, 0,
9, 0, 10, 10, 10, 0, 11, 11, 11, 0,
10, 8, 0, 0, 0, 0, 0, 8, 8, 8,
8, 0, 0, 0, 0, 8, 8, 0, 9, 0,
0, 0, 0, 0, 9, 9, 9, 9, 0, 0,
0, 0, 10, 10, 0, 0, 0, 11, 11, 0,
0, 10, 0, 0, 0, 0, 0, 0, 0, 8,
8, 8, 8, 8, 0, 8, 0, 0, 0, 0,
0, 0, 0, 9, 9, 9, 9, 9, 0, 9,
0, 10, 0, 11, 0, 0, 8, 8, 0, 0,
9, 9, 0, 10, 0, 11, 0
} ;
static yyconst flex_int32_t 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, 2, 5, 6, 7, 8, 9, 10, 11, 12,
1, 13, 14, 11, 15, 16, 17, 18, 18, 18,
18, 18, 18, 18, 18, 18, 18, 19, 20, 21,
22, 23, 24, 25, 26, 27, 26, 28, 29, 29,
30, 30, 30, 30, 30, 31, 30, 30, 32, 30,
30, 30, 31, 30, 30, 30, 30, 30, 30, 30,
1, 33, 1, 34, 35, 11, 36, 37, 38, 39,
40, 41, 30, 30, 42, 30, 30, 43, 30, 44,
45, 46, 30, 30, 47, 48, 30, 30, 49, 50,
30, 30, 1, 1, 1, 51, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 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[52] =
{ 0,
1, 1, 2, 1, 1, 1, 3, 1, 1, 1,
1, 1, 1, 4, 4, 5, 5, 6, 1, 1,
1, 1, 1, 1, 1, 7, 7, 6, 6, 1,
5, 1, 1, 1, 1, 7, 7, 7, 6, 6,
6, 8, 5, 1, 1, 1, 5, 1, 1, 1,
1
} ;
static yyconst flex_int16_t yy_base[398] =
{ 0,
0, 0, 1047, 1048, 1044, 1048, 1032, 47, 47, 87,
98, 89, 85, 131, 0, 1030, 1048, 0, 0, 0,
100, 1048, 106, 1048, 85, 136, 64, 150, 168, 1048,
127, 111, 119, 1011, 180, 1048, 1009, 172, 184, 151,
196, 1004, 0, 137, 162, 0, 0, 152, 193, 198,
1048, 199, 121, 188, 1001, 226, 1048, 957, 948, 218,
243, 212, 195, 203, 269, 230, 174, 973, 231, 238,
1048, 1048, 969, 232, 966, 305, 0, 256, 274, 282,
963, 346, 952, 284, 244, 290, 311, 323, 301, 296,
948, 246, 317, 1048, 913, 917, 340, 44, 102, 353,
895, 0, 0, 1048, 907, 364, 1048, 331, 358, 905,
381, 904, 376, 343, 395, 398, 403, 903, 389, 410,
415, 420, 427, 902, 432, 269, 901, 446, 900, 421,
899, 441, 1048, 423, 447, 466, 898, 483, 897, 454,
870, 872, 297, 891, 502, 210, 490, 244, 496, 495,
1048, 521, 303, 507, 448, 890, 480, 540, 449, 889,
536, 888, 522, 898, 548, 541, 886, 283, 885, 553,
895, 560, 554, 883, 882, 563, 568, 571, 555, 881,
341, 576, 1048, 575, 581, 585, 588, 879, 590, 600,
593, 610, 611, 877, 606, 852, 779, 615, 623, 618,
628, 800, 433, 629, 1048, 638, 775, 0, 0, 1048,
642, 774, 0, 0, 1048, 631, 0, 647, 362, 0,
651, 657, 794, 324, 0, 658, 782, 779, 0, 309,
0, 778, 760, 659, 737, 674, 1048, 661, 664, 679,
722, 689, 721, 694, 706, 667, 716, 680, 693, 699,
366, 692, 695, 688, 0, 696, 665, 652, 606, 619,
708, 601, 711, 1048, 713, 715, 723, 594, 727, 578,
732, 725, 1048, 744, 475, 745, 1048, 756, 671, 527,
561, 742, 759, 766, 754, 535, 774, 788, 789, 792,
761, 534, 776, 0, 532, 0, 519, 482, 786, 804,
807, 808, 488, 813, 822, 825, 832, 826, 460, 820,
838, 0, 844, 747, 0, 845, 0, 846, 849, 0,
609, 469, 452, 847, 435, 850, 856, 411, 683, 408,
860, 416, 0, 863, 391, 378, 374, 865, 330, 866,
872, 277, 738, 261, 875, 271, 0, 878, 220, 211,
833, 200, 869, 133, 0, 870, 0, 118, 0, 882,
0, 103, 884, 60, 885, 47, 1048, 927, 935, 943,
951, 957, 961, 965, 967, 970, 972, 977, 983, 987,
993, 994, 997, 999, 1001, 1004, 1006, 1008, 1010, 1015,
1021, 1025, 1031, 1032, 1034, 1036, 1038
} ;
static yyconst flex_int16_t yy_def[398] =
{ 0,
367, 1, 367, 367, 367, 367, 367, 367, 368, 367,
367, 367, 367, 8, 369, 367, 367, 8, 8, 8,
368, 367, 368, 367, 370, 367, 371, 367, 367, 367,
372, 367, 367, 367, 367, 367, 367, 35, 38, 8,
14, 8, 14, 8, 8, 8, 369, 368, 368, 370,
367, 370, 367, 367, 367, 367, 367, 367, 367, 367,
367, 367, 367, 372, 372, 367, 38, 367, 367, 367,
367, 367, 38, 38, 8, 8, 8, 38, 14, 8,
8, 8, 8, 8, 370, 367, 56, 87, 367, 87,
367, 367, 367, 367, 367, 367, 367, 373, 374, 367,
375, 376, 377, 367, 367, 378, 367, 38, 367, 367,
379, 367, 367, 38, 76, 378, 76, 8, 8, 367,
82, 379, 82, 8, 8, 367, 367, 367, 87, 87,
367, 380, 367, 87, 87, 367, 367, 381, 367, 367,
367, 367, 367, 367, 367, 373, 373, 374, 374, 375,
367, 376, 377, 116, 154, 367, 367, 379, 158, 367,
367, 154, 154, 163, 76, 8, 8, 8, 158, 158,
170, 82, 8, 8, 8, 128, 176, 367, 176, 367,
367, 367, 367, 87, 380, 185, 185, 367, 367, 367,
381, 381, 191, 367, 367, 367, 367, 145, 198, 367,
198, 367, 367, 367, 367, 367, 382, 383, 384, 367,
367, 385, 386, 387, 367, 367, 388, 367, 367, 389,
163, 367, 367, 367, 159, 367, 367, 367, 163, 367,
170, 367, 176, 176, 367, 390, 367, 176, 176, 367,
367, 391, 367, 367, 185, 185, 246, 246, 367, 367,
367, 191, 191, 253, 193, 367, 367, 367, 367, 198,
198, 367, 392, 367, 198, 198, 367, 367, 393, 367,
367, 382, 367, 383, 384, 385, 367, 386, 387, 388,
389, 176, 390, 283, 283, 367, 367, 367, 391, 391,
289, 367, 367, 246, 367, 253, 367, 367, 198, 392,
300, 300, 367, 367, 367, 393, 393, 306, 367, 367,
367, 394, 367, 367, 395, 367, 396, 367, 367, 397,
367, 367, 283, 283, 324, 324, 367, 367, 367, 289,
289, 331, 291, 367, 367, 367, 300, 300, 338, 338,
367, 367, 367, 306, 306, 345, 308, 367, 367, 367,
394, 395, 396, 397, 324, 367, 331, 367, 338, 367,
345, 367, 367, 367, 367, 367, 0, 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
} ;
static yyconst flex_int16_t yy_nxt[1100] =
{ 0,
4, 5, 6, 7, 8, 9, 10, 8, 8, 8,
11, 4, 8, 12, 12, 13, 8, 14, 8, 15,
8, 8, 8, 8, 11, 8, 8, 8, 8, 8,
8, 8, 4, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 18, 22, 366, 18, 18, 18, 146, 146, 18,
19, 19, 19, 18, 20, 18, 364, 18, 18, 18,
18, 19, 18, 18, 18, 18, 18, 18, 18, 23,
18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
18, 18, 18, 18, 18, 18, 18, 18, 24, 32,
37, 51, 38, 25, 34, 22, 35, 58, 33, 362,
59, 48, 32, 26, 26, 148, 148, 52, 26, 27,
32, 33, 33, 28, 358, 28, 29, 30, 29, 33,
36, 28, 23, 63, 30, 33, 31, 39, 49, 366,
64, 64, 53, 33, 40, 40, 41, 42, 43, 54,
54, 55, 81, 56, 82, 44, 53, 22, 45, 45,
86, 45, 86, 60, 60, 55, 75, 56, 76, 45,
45, 45, 46, 45, 61, 83, 83, 45, 73, 84,
78, 62, 62, 34, 23, 35, 39, 367, 367, 38,
39, 108, 77, 66, 66, 67, 68, 35, 48, 74,
68, 367, 78, 55, 69, 56, 364, 70, 70, 367,
70, 19, 18, 79, 51, 85, 367, 367, 70, 70,
70, 71, 70, 367, 367, 49, 70, 34, 350, 35,
52, 52, 88, 55, 99, 56, 99, 350, 114, 89,
89, 90, 91, 56, 36, 105, 110, 106, 111, 367,
92, 112, 112, 93, 93, 113, 93, 367, 367, 36,
51, 137, 78, 138, 93, 93, 93, 94, 93, 97,
97, 107, 93, 367, 97, 100, 52, 346, 367, 97,
78, 97, 101, 101, 127, 102, 128, 97, 120, 19,
18, 79, 98, 103, 343, 40, 40, 40, 40, 80,
168, 84, 134, 126, 126, 127, 44, 128, 44, 219,
104, 116, 144, 135, 145, 230, 131, 129, 132, 220,
117, 118, 76, 46, 77, 46, 367, 367, 87, 88,
139, 139, 119, 119, 140, 119, 339, 78, 130, 91,
367, 224, 133, 119, 119, 119, 77, 119, 108, 114,
107, 119, 122, 143, 143, 144, 241, 145, 242, 100,
367, 123, 124, 82, 120, 107, 101, 101, 219, 102,
116, 66, 66, 125, 125, 109, 125, 103, 220, 155,
156, 106, 69, 251, 125, 125, 125, 122, 125, 66,
66, 367, 125, 113, 104, 336, 159, 160, 111, 71,
69, 162, 167, 167, 116, 107, 168, 133, 336, 164,
19, 18, 115, 163, 156, 367, 120, 71, 19, 18,
165, 169, 332, 66, 66, 367, 122, 184, 329, 134,
19, 18, 121, 171, 69, 170, 160, 367, 367, 107,
367, 325, 19, 18, 172, 174, 174, 186, 268, 175,
269, 71, 177, 134, 164, 171, 187, 188, 132, 178,
178, 179, 180, 128, 135, 221, 225, 89, 89, 367,
181, 140, 190, 182, 182, 322, 182, 348, 92, 89,
89, 314, 133, 136, 182, 182, 182, 183, 182, 192,
92, 315, 182, 223, 223, 94, 206, 224, 193, 194,
138, 216, 211, 207, 207, 341, 208, 94, 199, 212,
212, 217, 213, 162, 209, 200, 200, 201, 202, 145,
214, 57, 367, 367, 154, 297, 203, 218, 229, 204,
204, 210, 204, 321, 101, 101, 151, 215, 295, 367,
204, 204, 204, 205, 204, 103, 169, 230, 204, 227,
227, 334, 327, 228, 164, 367, 367, 158, 166, 231,
232, 238, 104, 19, 18, 165, 171, 322, 151, 233,
367, 173, 239, 133, 177, 19, 18, 172, 367, 367,
176, 184, 77, 234, 180, 367, 235, 245, 236, 243,
243, 186, 367, 244, 247, 271, 367, 367, 185, 252,
246, 188, 367, 250, 250, 248, 190, 251, 367, 367,
191, 306, 237, 89, 89, 321, 192, 254, 300, 257,
257, 260, 133, 258, 92, 253, 194, 367, 255, 199,
367, 367, 198, 262, 265, 263, 367, 216, 261, 202,
367, 94, 270, 270, 206, 266, 271, 217, 211, 298,
151, 207, 207, 218, 208, 212, 212, 164, 213, 264,
101, 101, 209, 230, 232, 282, 214, 238, 221, 258,
238, 103, 151, 294, 222, 226, 367, 319, 367, 210,
284, 239, 258, 215, 367, 288, 247, 320, 104, 285,
286, 236, 178, 178, 254, 290, 240, 248, 107, 295,
329, 296, 297, 181, 291, 292, 242, 178, 178, 367,
249, 244, 367, 256, 299, 237, 251, 301, 181, 265,
183, 265, 247, 367, 237, 367, 302, 303, 263, 305,
367, 311, 266, 307, 133, 183, 200, 200, 244, 289,
267, 312, 308, 309, 269, 200, 200, 203, 282, 271,
313, 316, 264, 314, 283, 343, 203, 207, 207, 367,
325, 317, 318, 315, 205, 323, 273, 332, 209, 212,
212, 326, 284, 205, 367, 367, 283, 367, 333, 264,
214, 324, 286, 367, 232, 210, 277, 328, 328, 335,
335, 329, 299, 336, 288, 330, 228, 215, 290, 228,
237, 178, 178, 367, 367, 367, 289, 331, 292, 367,
337, 224, 181, 301, 339, 277, 273, 267, 57, 367,
367, 300, 338, 303, 367, 340, 342, 342, 305, 183,
343, 344, 346, 349, 349, 200, 200, 350, 307, 363,
367, 367, 306, 347, 311, 264, 203, 345, 309, 367,
313, 316, 318, 355, 312, 319, 325, 207, 207, 212,
212, 317, 356, 205, 367, 320, 357, 326, 209, 358,
214, 359, 339, 327, 273, 365, 356, 367, 360, 273,
334, 361, 367, 340, 362, 210, 277, 215, 360, 341,
363, 365, 367, 259, 256, 348, 249, 237, 240, 175,
175, 171, 367, 168, 164, 367, 226, 222, 198, 197,
277, 237, 196, 264, 140, 191, 185, 367, 176, 173,
166, 113, 158, 264, 154, 273, 277, 21, 21, 21,
21, 21, 21, 21, 21, 47, 151, 47, 47, 47,
47, 47, 47, 50, 50, 50, 50, 50, 50, 50,
50, 57, 142, 57, 57, 57, 57, 57, 57, 65,
65, 141, 65, 65, 147, 136, 147, 147, 149, 84,
149, 149, 150, 150, 150, 152, 152, 153, 153, 157,
121, 157, 157, 115, 157, 161, 367, 161, 161, 189,
109, 189, 189, 96, 189, 195, 95, 195, 195, 272,
272, 272, 274, 274, 275, 275, 276, 276, 276, 278,
278, 279, 279, 280, 280, 281, 281, 287, 87, 287,
287, 80, 287, 293, 72, 293, 293, 304, 38, 304,
304, 16, 304, 310, 17, 310, 310, 351, 351, 352,
352, 353, 353, 354, 354, 16, 367, 3, 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
} ;
static yyconst flex_int16_t yy_chk[1100] =
{ 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, 8, 9, 366, 8, 8, 8, 98, 98, 8,
8, 8, 8, 8, 8, 8, 364, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 9,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 10, 11,
13, 25, 13, 10, 12, 21, 12, 27, 11, 362,
27, 23, 32, 10, 10, 99, 99, 25, 10, 10,
33, 32, 11, 10, 358, 10, 10, 10, 10, 33,
12, 10, 21, 31, 10, 32, 10, 14, 23, 354,
31, 31, 26, 33, 14, 14, 14, 14, 14, 26,
26, 26, 44, 26, 44, 14, 28, 48, 14, 14,
53, 14, 53, 28, 28, 28, 40, 28, 40, 14,
14, 14, 14, 14, 29, 45, 45, 14, 38, 45,
67, 29, 29, 29, 48, 29, 35, 38, 38, 38,
39, 67, 40, 35, 35, 35, 35, 35, 49, 39,
39, 39, 41, 54, 35, 54, 352, 35, 35, 64,
35, 41, 41, 41, 50, 52, 64, 64, 35, 35,
35, 35, 35, 146, 146, 49, 35, 62, 350, 62,
50, 52, 56, 60, 63, 60, 63, 349, 74, 56,
56, 56, 56, 56, 64, 66, 69, 66, 69, 74,
56, 70, 70, 56, 56, 70, 56, 148, 148, 60,
85, 92, 78, 92, 56, 56, 56, 56, 56, 61,
61, 66, 56, 78, 61, 65, 85, 346, 344, 61,
79, 61, 65, 65, 126, 65, 126, 61, 80, 79,
79, 79, 61, 65, 342, 80, 80, 84, 84, 80,
168, 84, 90, 86, 86, 86, 80, 86, 84, 153,
65, 76, 143, 90, 143, 230, 89, 87, 89, 153,
76, 76, 76, 80, 168, 84, 87, 87, 87, 88,
93, 93, 76, 76, 93, 76, 339, 108, 88, 88,
88, 224, 89, 76, 76, 76, 76, 76, 108, 114,
230, 76, 82, 97, 97, 97, 181, 97, 181, 100,
114, 82, 82, 82, 109, 224, 100, 100, 219, 100,
106, 109, 109, 82, 82, 109, 82, 100, 219, 106,
106, 106, 109, 251, 82, 82, 82, 111, 82, 113,
113, 337, 82, 113, 100, 336, 111, 111, 111, 109,
113, 115, 119, 119, 116, 106, 119, 251, 335, 117,
115, 115, 115, 116, 116, 116, 120, 113, 117, 117,
117, 121, 332, 120, 120, 330, 122, 130, 328, 134,
121, 121, 121, 123, 120, 122, 122, 122, 130, 116,
134, 325, 123, 123, 123, 125, 125, 132, 203, 125,
203, 120, 128, 135, 155, 159, 132, 132, 132, 128,
128, 128, 128, 128, 135, 155, 159, 140, 140, 323,
128, 140, 136, 128, 128, 322, 128, 309, 140, 136,
136, 275, 132, 136, 128, 128, 128, 128, 128, 138,
136, 275, 128, 157, 157, 140, 147, 157, 138, 138,
138, 150, 149, 147, 147, 303, 147, 136, 145, 149,
149, 150, 149, 154, 147, 145, 145, 145, 145, 145,
149, 298, 154, 154, 154, 297, 145, 152, 163, 145,
145, 147, 145, 280, 152, 152, 150, 149, 295, 163,
145, 145, 145, 145, 145, 152, 158, 166, 145, 161,
161, 292, 286, 161, 165, 158, 158, 158, 166, 170,
173, 179, 152, 165, 165, 165, 172, 281, 280, 176,
170, 173, 179, 295, 177, 172, 172, 172, 176, 176,
176, 184, 166, 177, 177, 177, 178, 185, 178, 182,
182, 186, 184, 182, 187, 270, 185, 185, 185, 191,
186, 186, 186, 189, 189, 187, 190, 189, 191, 191,
191, 268, 178, 190, 190, 321, 192, 193, 262, 195,
195, 198, 185, 195, 190, 192, 192, 192, 193, 199,
198, 198, 198, 200, 201, 200, 260, 216, 199, 199,
199, 190, 204, 204, 206, 201, 204, 216, 211, 259,
321, 206, 206, 218, 206, 211, 211, 221, 211, 200,
218, 218, 206, 222, 226, 234, 211, 238, 221, 258,
239, 218, 216, 246, 222, 226, 234, 279, 238, 206,
236, 239, 257, 211, 246, 240, 248, 279, 218, 236,
236, 236, 240, 240, 254, 242, 240, 248, 222, 249,
329, 253, 256, 240, 242, 242, 242, 244, 244, 252,
249, 244, 253, 256, 261, 236, 250, 263, 244, 265,
240, 266, 247, 245, 329, 261, 263, 263, 263, 267,
265, 272, 266, 269, 249, 244, 267, 267, 243, 241,
267, 272, 269, 269, 269, 271, 271, 267, 282, 271,
274, 276, 263, 314, 235, 343, 271, 274, 274, 282,
285, 276, 278, 314, 267, 283, 272, 291, 274, 278,
278, 285, 284, 271, 283, 283, 283, 233, 291, 343,
278, 284, 284, 284, 232, 274, 276, 287, 287, 293,
293, 287, 299, 293, 288, 289, 228, 278, 290, 227,
283, 288, 288, 299, 289, 289, 289, 290, 290, 290,
300, 223, 288, 301, 302, 212, 207, 202, 197, 300,
300, 300, 301, 301, 301, 302, 304, 304, 305, 288,
304, 306, 308, 310, 310, 305, 305, 310, 307, 351,
306, 306, 306, 308, 311, 300, 305, 307, 307, 307,
313, 316, 318, 324, 311, 319, 326, 313, 313, 318,
318, 316, 327, 305, 324, 319, 331, 326, 313, 334,
318, 338, 340, 327, 351, 353, 356, 331, 341, 311,
334, 345, 338, 340, 348, 313, 316, 318, 360, 341,
363, 365, 345, 196, 194, 348, 188, 327, 180, 175,
174, 171, 169, 167, 164, 162, 160, 156, 144, 142,
353, 356, 141, 341, 139, 137, 131, 129, 127, 124,
118, 112, 110, 360, 105, 363, 365, 368, 368, 368,
368, 368, 368, 368, 368, 369, 101, 369, 369, 369,
369, 369, 369, 370, 370, 370, 370, 370, 370, 370,
370, 371, 96, 371, 371, 371, 371, 371, 371, 372,
372, 95, 372, 372, 373, 91, 373, 373, 374, 83,
374, 374, 375, 375, 375, 376, 376, 377, 377, 378,
81, 378, 378, 75, 378, 379, 73, 379, 379, 380,
68, 380, 380, 59, 380, 381, 58, 381, 381, 382,
382, 382, 383, 383, 384, 384, 385, 385, 385, 386,
386, 387, 387, 388, 388, 389, 389, 390, 55, 390,
390, 42, 390, 391, 37, 391, 391, 392, 34, 392,
392, 16, 392, 393, 7, 393, 393, 394, 394, 395,
395, 396, 396, 397, 397, 5, 3, 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, 367
} ;
/* 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
/*
* schemetok.l - a lex rule for Scheme.
*
* Copyright (C) 2005 Kenichi Ishibashi <bashi at dream.ie.ariake-nct.ac.jp>
* All rights reserved.
* This is free software with ABSOLUTELY NO WARRANTY.
*
* You can redistribute it and/or modify it under the terms of
* the GNU General Public License version 2.
*/
#include "scheme.h"
#define YY_EXTRA_TYPE langscan_scheme_lex_extra_t *
#if YY_NULL != 0
#error "YY_NULL is not 0."
#endif
#define YY_DECL langscan_scheme_token_t langscan_scheme_lex_lex(yyscan_t yyscanner)
#define YY_INPUT(buf,result,max_size) \
if (!yyextra->eof) { \
result = yyextra->user_read(&(yyextra->user_data), (buf), (max_size)); \
if (result == 0) \
yyextra->eof = 1; \
}
#define UPD update_pos(yyextra, yytext, yyleng)
static void update_pos(langscan_scheme_lex_extra_t *, char *, int);
#define report(token) \
do { \
yyextra->text = yytext; \
yyextra->leng = yyleng; \
return langscan_scheme_##token; \
} while (0)
#define INITIAL 0
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include <unistd.h>
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
/* Holds the entire state of the reentrant scanner. */
struct yyguts_t
{
/* User-defined. Not touched by flex. */
YY_EXTRA_TYPE yyextra_r;
/* The rest are the same as the globals declared in the non-reentrant scanner. */
FILE *yyin_r, *yyout_r;
size_t yy_buffer_stack_top; /**< index of top of stack. */
size_t yy_buffer_stack_max; /**< capacity of stack. */
YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
char yy_hold_char;
yy_size_t yy_n_chars;
yy_size_t yyleng_r;
char *yy_c_buf_p;
int yy_init;
int yy_start;
int yy_did_buffer_switch_on_eof;
int yy_start_stack_ptr;
int yy_start_stack_depth;
int *yy_start_stack;
yy_state_type yy_last_accepting_state;
char* yy_last_accepting_cpos;
int yylineno_r;
int yy_flex_debug_r;
char *yytext_r;
int yy_more_flag;
int yy_more_len;
}; /* end struct yyguts_t */
static int yy_init_globals (yyscan_t yyscanner );
int langscan_scheme_lex_lex_init (yyscan_t* scanner);
int langscan_scheme_lex_lex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int langscan_scheme_lex_lex_destroy (yyscan_t yyscanner );
int langscan_scheme_lex_get_debug (yyscan_t yyscanner );
void langscan_scheme_lex_set_debug (int debug_flag ,yyscan_t yyscanner );
YY_EXTRA_TYPE langscan_scheme_lex_get_extra (yyscan_t yyscanner );
void langscan_scheme_lex_set_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
FILE *langscan_scheme_lex_get_in (yyscan_t yyscanner );
void langscan_scheme_lex_set_in (FILE * in_str ,yyscan_t yyscanner );
FILE *langscan_scheme_lex_get_out (yyscan_t yyscanner );
void langscan_scheme_lex_set_out (FILE * out_str ,yyscan_t yyscanner );
yy_size_t langscan_scheme_lex_get_leng (yyscan_t yyscanner );
char *langscan_scheme_lex_get_text (yyscan_t yyscanner );
int langscan_scheme_lex_get_lineno (yyscan_t yyscanner );
void langscan_scheme_lex_set_lineno (int line_number ,yyscan_t yyscanner );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int langscan_scheme_lex_wrap (yyscan_t yyscanner );
#else
extern int langscan_scheme_lex_wrap (yyscan_t yyscanner );
#endif
#endif
static void yyunput (int c,char *buf_ptr ,yyscan_t yyscanner);
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (yyscan_t yyscanner );
#else
static int input (yyscan_t yyscanner );
#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( 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_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
yy_size_t 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 \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(yyin); \
} \
}\
\
#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 , yyscanner)
#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 langscan_scheme_lex_lex (yyscan_t yyscanner);
#define YY_DECL int langscan_scheme_lex_lex (yyscan_t yyscanner)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
/** 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;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if ( !yyg->yy_init )
{
yyg->yy_init = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! yyg->yy_start )
yyg->yy_start = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
if ( ! yyout )
yyout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
langscan_scheme_lex_ensure_buffer_stack (yyscanner);
YY_CURRENT_BUFFER_LVALUE =
langscan_scheme_lex__create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
}
langscan_scheme_lex__load_buffer_state(yyscanner );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = yyg->yy_c_buf_p;
/* Support of yytext. */
*yy_cp = yyg->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 = yyg->yy_start;
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
if ( yy_accept[yy_current_state] )
{
yyg->yy_last_accepting_state = yy_current_state;
yyg->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 >= 368 )
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] != 1048 );
yy_find_action:
yy_act = yy_accept[yy_current_state];
if ( yy_act == 0 )
{ /* have to back up */
yy_cp = yyg->yy_last_accepting_cpos;
yy_current_state = yyg->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 = yyg->yy_hold_char;
yy_cp = yyg->yy_last_accepting_cpos;
yy_current_state = yyg->yy_last_accepting_state;
goto yy_find_action;
case 1:
YY_RULE_SETUP
{ UPD; report(space); }
YY_BREAK
case 2:
/* rule 2 can match eol */
YY_RULE_SETUP
{ UPD; report(space); }
YY_BREAK
case 3:
YY_RULE_SETUP
{ UPD; report(comment); }
YY_BREAK
case 4:
YY_RULE_SETUP
{ UPD; report(quote_chars); }
YY_BREAK
case 5:
/* rule 5 can match eol */
YY_RULE_SETUP
{ UPD; report(string); }
YY_BREAK
case 6:
/* rule 6 can match eol */
YY_RULE_SETUP
{ UPD; report(string); }
YY_BREAK
case 7:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 8:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 9:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 10:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 11:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 12:
YY_RULE_SETUP
{ UPD; report(number); }
YY_BREAK
case 13:
YY_RULE_SETUP
{ UPD; report(ident); }
YY_BREAK
case 14:
YY_RULE_SETUP
{ UPD; report(ident); }
YY_BREAK
case 15:
YY_RULE_SETUP
{ UPD; report(punct); }
YY_BREAK
case 16:
YY_RULE_SETUP
{ UPD; report(punct); }
YY_BREAK
case 17:
YY_RULE_SETUP
{ UPD; report(punct); }
YY_BREAK
case 18:
YY_RULE_SETUP
YY_FATAL_ERROR( "flex scanner jammed" );
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 - yyg->yytext_ptr) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = yyg->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 yyin at a new source and called
* langscan_scheme_lex_lex(). 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.
*/
yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
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 ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( yyscanner );
/* 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 , yyscanner);
yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++yyg->yy_c_buf_p;
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = yyg->yy_c_buf_p;
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( yyscanner ) )
{
case EOB_ACT_END_OF_FILE:
{
yyg->yy_did_buffer_switch_on_eof = 0;
if ( langscan_scheme_lex_wrap(yyscanner ) )
{
/* 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.
*/
yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! yyg->yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
yyg->yy_c_buf_p =
yyg->yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( yyscanner );
yy_cp = yyg->yy_c_buf_p;
yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
yyg->yy_c_buf_p =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
yy_current_state = yy_get_previous_state( yyscanner );
yy_cp = yyg->yy_c_buf_p;
yy_bp = yyg->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 langscan_scheme_lex_lex */
/* 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 (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
register char *source = yyg->yytext_ptr;
register int number_to_move, i;
int ret_val;
if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->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 ( yyg->yy_c_buf_p - yyg->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) (yyg->yy_c_buf_p - yyg->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 = yyg->yy_n_chars = 0;
else
{
yy_size_t 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) (yyg->yy_c_buf_p - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
yy_size_t 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. */
langscan_scheme_lex_realloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
}
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" );
yyg->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]),
yyg->yy_n_chars, num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
}
if ( yyg->yy_n_chars == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
langscan_scheme_lex_restart(yyin ,yyscanner);
}
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) (yyg->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 = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) langscan_scheme_lex_realloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
}
yyg->yy_n_chars += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
yyg->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 (yyscan_t yyscanner)
{
register yy_state_type yy_current_state;
register char *yy_cp;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yy_current_state = yyg->yy_start;
for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->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] )
{
yyg->yy_last_accepting_state = yy_current_state;
yyg->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 >= 368 )
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 , yyscan_t yyscanner)
{
register int yy_is_jam;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
register char *yy_cp = yyg->yy_c_buf_p;
register YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
yyg->yy_last_accepting_state = yy_current_state;
yyg->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 >= 368 )
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 == 367);
return yy_is_jam ? 0 : yy_current_state;
}
static void yyunput (int c, register char * yy_bp , yyscan_t yyscanner)
{
register char *yy_cp;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yy_cp = yyg->yy_c_buf_p;
/* undo effects of setting up yytext */
*yy_cp = yyg->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 yy_size_t number_to_move = yyg->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 =
yyg->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;
yyg->yytext_ptr = yy_bp;
yyg->yy_hold_char = *yy_cp;
yyg->yy_c_buf_p = yy_cp;
}
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (yyscan_t yyscanner)
#else
static int input (yyscan_t yyscanner)
#endif
{
int c;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
*yyg->yy_c_buf_p = yyg->yy_hold_char;
if ( *yyg->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 ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
/* This was really a NUL. */
*yyg->yy_c_buf_p = '\0';
else
{ /* need more input */
yy_size_t offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
++yyg->yy_c_buf_p;
switch ( yy_get_next_buffer( yyscanner ) )
{
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. */
langscan_scheme_lex_restart(yyin ,yyscanner);
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( langscan_scheme_lex_wrap(yyscanner ) )
return 0;
if ( ! yyg->yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput(yyscanner);
#else
return input(yyscanner);
#endif
}
case EOB_ACT_CONTINUE_SCAN:
yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
break;
}
}
}
c = *(unsigned char *) yyg->yy_c_buf_p; /* cast for 8-bit char's */
*yyg->yy_c_buf_p = '\0'; /* preserve yytext */
yyg->yy_hold_char = *++yyg->yy_c_buf_p;
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
* @param yyscanner The scanner object.
* @note This function does not reset the start condition to @c INITIAL .
*/
void langscan_scheme_lex_restart (FILE * input_file , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if ( ! YY_CURRENT_BUFFER ){
langscan_scheme_lex_ensure_buffer_stack (yyscanner);
YY_CURRENT_BUFFER_LVALUE =
langscan_scheme_lex__create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
}
langscan_scheme_lex__init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
langscan_scheme_lex__load_buffer_state(yyscanner );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex__switch_to_buffer (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
/* TODO. We should be able to replace this entire function body
* with
* langscan_scheme_lex_pop_buffer_state();
* langscan_scheme_lex_push_buffer_state(new_buffer);
*/
langscan_scheme_lex_ensure_buffer_stack (yyscanner);
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*yyg->yy_c_buf_p = yyg->yy_hold_char;
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
langscan_scheme_lex__load_buffer_state(yyscanner );
/* We don't actually know whether we did this switch during
* EOF (langscan_scheme_lex_wrap()) processing, but the only time this flag
* is looked at is after langscan_scheme_lex_wrap() is called, so it's safe
* to go ahead and always set it.
*/
yyg->yy_did_buffer_switch_on_eof = 1;
}
static void langscan_scheme_lex__load_buffer_state (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
yyg->yy_hold_char = *yyg->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.
* @param yyscanner The scanner object.
* @return the allocated buffer state.
*/
YY_BUFFER_STATE langscan_scheme_lex__create_buffer (FILE * file, int size , yyscan_t yyscanner)
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) langscan_scheme_lex_alloc(sizeof( struct yy_buffer_state ) ,yyscanner );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex__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 *) langscan_scheme_lex_alloc(b->yy_buf_size + 2 ,yyscanner );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex__create_buffer()" );
b->yy_is_our_buffer = 1;
langscan_scheme_lex__init_buffer(b,file ,yyscanner);
return b;
}
/** Destroy the buffer.
* @param b a buffer created with langscan_scheme_lex__create_buffer()
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex__delete_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
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 )
langscan_scheme_lex_free((void *) b->yy_ch_buf ,yyscanner );
langscan_scheme_lex_free((void *) b ,yyscanner );
}
#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 langscan_scheme_lex_restart() or at EOF.
*/
static void langscan_scheme_lex__init_buffer (YY_BUFFER_STATE b, FILE * file , yyscan_t yyscanner)
{
int oerrno = errno;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
langscan_scheme_lex__flush_buffer(b ,yyscanner);
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then langscan_scheme_lex__init_buffer was _probably_
* called from langscan_scheme_lex_restart() 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.
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex__flush_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
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 )
langscan_scheme_lex__load_buffer_state(yyscanner );
}
/** 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.
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex_push_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if (new_buffer == NULL)
return;
langscan_scheme_lex_ensure_buffer_stack(yyscanner);
/* This block is copied from langscan_scheme_lex__switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*yyg->yy_c_buf_p = yyg->yy_hold_char;
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
yyg->yy_buffer_stack_top++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from langscan_scheme_lex__switch_to_buffer. */
langscan_scheme_lex__load_buffer_state(yyscanner );
yyg->yy_did_buffer_switch_on_eof = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex_pop_buffer_state (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if (!YY_CURRENT_BUFFER)
return;
langscan_scheme_lex__delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
YY_CURRENT_BUFFER_LVALUE = NULL;
if (yyg->yy_buffer_stack_top > 0)
--yyg->yy_buffer_stack_top;
if (YY_CURRENT_BUFFER) {
langscan_scheme_lex__load_buffer_state(yyscanner );
yyg->yy_did_buffer_switch_on_eof = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void langscan_scheme_lex_ensure_buffer_stack (yyscan_t yyscanner)
{
yy_size_t num_to_alloc;
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if (!yyg->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;
yyg->yy_buffer_stack = (struct yy_buffer_state**)langscan_scheme_lex_alloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
, yyscanner);
if ( ! yyg->yy_buffer_stack )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex_ensure_buffer_stack()" );
memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
yyg->yy_buffer_stack_max = num_to_alloc;
yyg->yy_buffer_stack_top = 0;
return;
}
if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
/* Increase the buffer to prepare for a possible push. */
int grow_size = 8 /* arbitrary grow size */;
num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
yyg->yy_buffer_stack = (struct yy_buffer_state**)langscan_scheme_lex_realloc
(yyg->yy_buffer_stack,
num_to_alloc * sizeof(struct yy_buffer_state*)
, yyscanner);
if ( ! yyg->yy_buffer_stack )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex_ensure_buffer_stack()" );
/* zero only the new slots.*/
memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
yyg->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
* @param yyscanner The scanner object.
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE langscan_scheme_lex__scan_buffer (char * base, yy_size_t size , yyscan_t yyscanner)
{
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) langscan_scheme_lex_alloc(sizeof( struct yy_buffer_state ) ,yyscanner );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex__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;
langscan_scheme_lex__switch_to_buffer(b ,yyscanner );
return b;
}
/** Setup the input buffer state to scan a string. The next call to langscan_scheme_lex_lex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
* @param yyscanner The scanner object.
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* langscan_scheme_lex__scan_bytes() instead.
*/
YY_BUFFER_STATE langscan_scheme_lex__scan_string (yyconst char * yystr , yyscan_t yyscanner)
{
return langscan_scheme_lex__scan_bytes(yystr,strlen(yystr) ,yyscanner);
}
/** Setup the input buffer state to scan the given bytes. The next call to langscan_scheme_lex_lex() 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.
* @param yyscanner The scanner object.
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE langscan_scheme_lex__scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len , yyscan_t yyscanner)
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n, i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) langscan_scheme_lex_alloc(n ,yyscanner );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in langscan_scheme_lex__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 = langscan_scheme_lex__scan_buffer(buf,n ,yyscanner);
if ( ! b )
YY_FATAL_ERROR( "bad buffer in langscan_scheme_lex__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 , yyscan_t yyscanner)
{
(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. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
yytext[yyleng] = yyg->yy_hold_char; \
yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
yyg->yy_hold_char = *yyg->yy_c_buf_p; \
*yyg->yy_c_buf_p = '\0'; \
yyleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the user-defined data for this scanner.
* @param yyscanner The scanner object.
*/
YY_EXTRA_TYPE langscan_scheme_lex_get_extra (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yyextra;
}
/** Get the current line number.
* @param yyscanner The scanner object.
*/
int langscan_scheme_lex_get_lineno (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if (! YY_CURRENT_BUFFER)
return 0;
return yylineno;
}
/** Get the current column number.
* @param yyscanner The scanner object.
*/
int langscan_scheme_lex_get_column (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
if (! YY_CURRENT_BUFFER)
return 0;
return yycolumn;
}
/** Get the input stream.
* @param yyscanner The scanner object.
*/
FILE *langscan_scheme_lex_get_in (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yyin;
}
/** Get the output stream.
* @param yyscanner The scanner object.
*/
FILE *langscan_scheme_lex_get_out (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yyout;
}
/** Get the length of the current token.
* @param yyscanner The scanner object.
*/
yy_size_t langscan_scheme_lex_get_leng (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yyleng;
}
/** Get the current token.
* @param yyscanner The scanner object.
*/
char *langscan_scheme_lex_get_text (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yytext;
}
/** Set the user-defined data. This data is never touched by the scanner.
* @param user_defined The data to be associated with this scanner.
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex_set_extra (YY_EXTRA_TYPE user_defined , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yyextra = user_defined ;
}
/** Set the current line number.
* @param line_number
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex_set_lineno (int line_number , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
/* lineno is only valid if an input buffer exists. */
if (! YY_CURRENT_BUFFER )
yy_fatal_error( "langscan_scheme_lex_set_lineno called with no buffer" , yyscanner);
yylineno = line_number;
}
/** Set the current column.
* @param line_number
* @param yyscanner The scanner object.
*/
void langscan_scheme_lex_set_column (int column_no , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
/* column is only valid if an input buffer exists. */
if (! YY_CURRENT_BUFFER )
yy_fatal_error( "langscan_scheme_lex_set_column called with no buffer" , yyscanner);
yycolumn = column_no;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param in_str A readable stream.
* @param yyscanner The scanner object.
* @see langscan_scheme_lex__switch_to_buffer
*/
void langscan_scheme_lex_set_in (FILE * in_str , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yyin = in_str ;
}
void langscan_scheme_lex_set_out (FILE * out_str , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yyout = out_str ;
}
int langscan_scheme_lex_get_debug (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
return yy_flex_debug;
}
void langscan_scheme_lex_set_debug (int bdebug , yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
yy_flex_debug = bdebug ;
}
/* Accessor methods for yylval and yylloc */
/* User-visible API */
/* langscan_scheme_lex_lex_init is special because it creates the scanner itself, so it is
* the ONLY reentrant function that doesn't take the scanner as the last argument.
* That's why we explicitly handle the declaration, instead of using our macros.
*/
int langscan_scheme_lex_lex_init(yyscan_t* ptr_yy_globals)
{
if (ptr_yy_globals == NULL){
errno = EINVAL;
return 1;
}
*ptr_yy_globals = (yyscan_t) langscan_scheme_lex_alloc ( sizeof( struct yyguts_t ), NULL );
if (*ptr_yy_globals == NULL){
errno = ENOMEM;
return 1;
}
/* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
return yy_init_globals ( *ptr_yy_globals );
}
/* langscan_scheme_lex_lex_init_extra has the same functionality as langscan_scheme_lex_lex_init, but follows the
* convention of taking the scanner as the last argument. Note however, that
* this is a *pointer* to a scanner, as it will be allocated by this call (and
* is the reason, too, why this function also must handle its own declaration).
* The user defined value in the first argument will be available to langscan_scheme_lex_alloc in
* the yyextra field.
*/
int langscan_scheme_lex_lex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
{
struct yyguts_t dummy_yyguts;
langscan_scheme_lex_set_extra (yy_user_defined, &dummy_yyguts);
if (ptr_yy_globals == NULL){
errno = EINVAL;
return 1;
}
*ptr_yy_globals = (yyscan_t) langscan_scheme_lex_alloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
if (*ptr_yy_globals == NULL){
errno = ENOMEM;
return 1;
}
/* By setting to 0xAA, we expose bugs in
yy_init_globals. Leave at 0x00 for releases. */
memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
langscan_scheme_lex_set_extra (yy_user_defined, *ptr_yy_globals);
return yy_init_globals ( *ptr_yy_globals );
}
static int yy_init_globals (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from langscan_scheme_lex_lex_destroy(), so don't allocate here.
*/
yyg->yy_buffer_stack = 0;
yyg->yy_buffer_stack_top = 0;
yyg->yy_buffer_stack_max = 0;
yyg->yy_c_buf_p = (char *) 0;
yyg->yy_init = 0;
yyg->yy_start = 0;
yyg->yy_start_stack_ptr = 0;
yyg->yy_start_stack_depth = 0;
yyg->yy_start_stack = NULL;
/* Defined in main.c */
#ifdef YY_STDINIT
yyin = stdin;
yyout = stdout;
#else
yyin = (FILE *) 0;
yyout = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* langscan_scheme_lex_lex_init()
*/
return 0;
}
/* langscan_scheme_lex_lex_destroy is for both reentrant and non-reentrant scanners. */
int langscan_scheme_lex_lex_destroy (yyscan_t yyscanner)
{
struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
langscan_scheme_lex__delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
YY_CURRENT_BUFFER_LVALUE = NULL;
langscan_scheme_lex_pop_buffer_state(yyscanner);
}
/* Destroy the stack itself. */
langscan_scheme_lex_free(yyg->yy_buffer_stack ,yyscanner);
yyg->yy_buffer_stack = NULL;
/* Destroy the start condition stack. */
langscan_scheme_lex_free(yyg->yy_start_stack ,yyscanner );
yyg->yy_start_stack = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* langscan_scheme_lex_lex() is called, initialization will occur. */
yy_init_globals( yyscanner);
/* Destroy the main struct (reentrant only). */
langscan_scheme_lex_free ( yyscanner , yyscanner );
yyscanner = NULL;
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
{
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 , yyscan_t yyscanner)
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *langscan_scheme_lex_alloc (yy_size_t size , yyscan_t yyscanner)
{
return (void *) malloc( size );
}
void *langscan_scheme_lex_realloc (void * ptr, yy_size_t size , yyscan_t yyscanner)
{
/* 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 langscan_scheme_lex_free (void * ptr , yyscan_t yyscanner)
{
free( (char *) ptr ); /* see langscan_scheme_lex_realloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
static void update_pos(
langscan_scheme_lex_extra_t *extra,
char *text,
int leng)
{
int i, j;
extra->beg_byteno = extra->end_byteno;
extra->beg_lineno = extra->end_lineno;
extra->beg_columnno = extra->end_columnno;
j = 0;
for (i = 0; i < leng; i++) {
if (text[i] == '\n') {
extra->end_lineno++;
j = i + 1;
extra->end_columnno = 0;
}
}
extra->end_columnno += leng - j;
extra->end_byteno += leng;
}
langscan_scheme_tokenizer_t *langscan_scheme_make_tokenizer(
size_t (*user_read)(void **user_data_p, char *buf, size_t maxlen),
void *user_data)
{
langscan_scheme_tokenizer_t *tokenizer;
langscan_scheme_lex_extra_t *extra;
tokenizer = (langscan_scheme_tokenizer_t *)malloc(sizeof(langscan_scheme_tokenizer_t));
if (tokenizer == NULL)
return NULL;
extra = (langscan_scheme_lex_extra_t *)malloc(sizeof(langscan_scheme_lex_extra_t));
if (extra == NULL)
return NULL;
extra->user_read = user_read;
extra->user_data = user_data;
extra->beg_lineno = 1;
extra->beg_columnno = 0;
extra->beg_byteno = 0;
extra->end_lineno = 1;
extra->end_columnno = 0;
extra->end_byteno = 0;
extra->eof = 0;
tokenizer->extra = extra;
langscan_scheme_lex_lex_init(&tokenizer->scanner);
langscan_scheme_lex_set_extra(extra, tokenizer->scanner);
return tokenizer;
}
langscan_scheme_token_t langscan_scheme_get_token(langscan_scheme_tokenizer_t *tokenizer)
{
return langscan_scheme_lex_lex(tokenizer->scanner);
}
void langscan_scheme_free_tokenizer(langscan_scheme_tokenizer_t *tokenizer)
{
langscan_scheme_lex_extra_t *extra = langscan_scheme_lex_get_extra(tokenizer->scanner);
free((void *)extra);
langscan_scheme_lex_lex_destroy(tokenizer->scanner);
free((void *)tokenizer);
}
user_read_t langscan_scheme_tokenizer_get_user_read(langscan_scheme_tokenizer_t *tokenizer)
{
return tokenizer->extra->user_read;
}
void *langscan_scheme_tokenizer_get_user_data(langscan_scheme_tokenizer_t *tokenizer)
{
return tokenizer->extra->user_data;
}
const char *langscan_scheme_token_name(langscan_scheme_token_t token)
{
static char *token_names[] = {
"*eof*",
#define LANGSCAN_SCHEME_TOKEN(name) #name,
LANGSCAN_SCHEME_TOKEN_LIST
#undef LANGSCAN_SCHEME_TOKEN
};
return token_names[token];
}