lex.yy.c

#line 3 "lex.yy.c"

#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 6
#define YY_FLEX_SUBMINOR_VERSION 4
#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;

/* 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

#ifndef SIZE_MAX
#define SIZE_MAX               (~(size_t)0)
#endif

#endif /* ! C99 */

#endif /* ! FLEXINT_H */

/* begin standard C++ headers. */

/* TODO: this is always defined, so inline it */
#define yyconst const

#if defined(__GNUC__) && __GNUC__ >= 3
#define yynoreturn __attribute__((__noreturn__))
#else
#define yynoreturn
#endif

/* Returned upon end-of-file. */
#define YY_NULL 0

/* Promotes a possibly negative, possibly signed char to an
 *   integer in range [0..255] for use as an array index.
 */
#define YY_SC_TO_UI(c) ((YY_CHAR) (c))

/* Enter a start condition.  This macro really ought to take a parameter,
 * but we do it the disgusting crufty way forced on us by the ()-less
 * definition of BEGIN.
 */
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
 * to BEGIN to return to the state.  The YYSTATE alias is for lex
 * compatibility.
 */
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin  )
#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
 * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
 * Ditto for the __ia64__ case accordingly.
 */
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#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

extern int yyleng;

extern FILE *yyin, *yyout;

#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
    
    #define YY_LESS_LINENO(n)
    #define YY_LINENO_REWIND_TO(ptr)
    
/* 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 = (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 yytext again */ \
		} \
	while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr)  )

#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.
	 */
	int 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 yyrestart()), 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 */

/* 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 = NULL; /**< 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 yytext is formed. */
static char yy_hold_char;
static int yy_n_chars;		/* number of characters read into yy_ch_buf */
int yyleng;

/* Points to current character in buffer. */
static char *yy_c_buf_p = NULL;
static int yy_init = 0;		/* whether we need to initialize */
static int yy_start = 0;	/* start state number */

/* Flag which is used to allow yywrap()'s to do buffer switches
 * instead of setting up a fresh yyin.  A bit of a hack ...
 */
static int yy_did_buffer_switch_on_eof;

void yyrestart ( FILE *input_file  );
void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer  );
YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size  );
void yy_delete_buffer ( YY_BUFFER_STATE b  );
void yy_flush_buffer ( YY_BUFFER_STATE b  );
void yypush_buffer_state ( YY_BUFFER_STATE new_buffer  );
void yypop_buffer_state ( void );

static void yyensure_buffer_stack ( void );
static void yy_load_buffer_state ( void );
static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file  );
#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER )

YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size  );
YY_BUFFER_STATE yy_scan_string ( const char *yy_str  );
YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len  );

void *yyalloc ( yy_size_t  );
void *yyrealloc ( void *, yy_size_t  );
void yyfree ( void *  );

#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
	{ \
	if ( ! YY_CURRENT_BUFFER ){ \
        yyensure_buffer_stack (); \
		YY_CURRENT_BUFFER_LVALUE =    \
            yy_create_buffer( yyin, YY_BUF_SIZE ); \
	} \
	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
	}
#define yy_set_bol(at_bol) \
	{ \
	if ( ! YY_CURRENT_BUFFER ){\
        yyensure_buffer_stack (); \
		YY_CURRENT_BUFFER_LVALUE =    \
            yy_create_buffer( yyin, YY_BUF_SIZE ); \
	} \
	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
	}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)

/* Begin user sect3 */
typedef flex_uint8_t YY_CHAR;

FILE *yyin = NULL, *yyout = NULL;

typedef int yy_state_type;

extern int yylineno;
int yylineno = 1;

extern char *yytext;
#ifdef yytext_ptr
#undef yytext_ptr
#endif
#define yytext_ptr yytext

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 yynoreturn yy_fatal_error ( const char* msg  );

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up yytext.
 */
#define YY_DO_BEFORE_ACTION \
	(yytext_ptr) = yy_bp; \
	yyleng = (int) (yy_cp - yy_bp); \
	(yy_hold_char) = *yy_cp; \
	*yy_cp = '\0'; \
	(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 87
#define YY_END_OF_BUFFER 88
/* 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 const flex_int16_t yy_accept[209] =
    {   0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,   12,   12,
        0,    0,    0,    0,    0,    0,    0,    0,    4,    4,
       88,   86,   85,   84,   74,   83,   83,   82,   86,   75,
       76,   70,   68,   60,   69,   58,   71,   35,   35,   59,
       62,   61,   64,   54,   77,   78,   54,   54,   54,   54,
       54,   54,   54,   54,   79,   81,   80,   27,   26,   27,
       27,   34,   33,   33,   32,   38,   36,   36,   37,   57,
       55,   55,   56,   29,   30,   29,    9,    7,    8,    6,
       87,   18,   17,   21,   12,   10,   11,   19,   20,   16,

       15,   13,    4,    2,    3,   66,    0,    0,   72,    0,
        0,   39,   23,    0,    0,    0,   31,   63,   67,   65,
        0,    0,    0,    0,    0,    0,   45,    0,    0,    0,
        0,    0,   73,   25,   24,   28,    9,    6,    6,   12,
       19,    0,   15,   13,   15,   14,    4,    0,    0,   42,
        0,    0,    0,   22,    0,    0,    0,    0,    0,   49,
       43,    0,    0,    0,    0,    0,   14,    0,    0,    0,
        0,    0,    0,    0,   46,    0,   52,    0,    0,    0,
        0,    0,    0,    0,    0,   41,    0,    0,   50,    0,
        0,    0,   47,   53,    0,    1,    0,    0,    0,   48,

       44,    0,   40,   40,    0,    5,   51,    0
    } ;

static const YY_CHAR yy_ec[256] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
        1,    1,    2,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    4,    5,    6,    7,    6,    6,    8,    9,   10,
       11,   12,   13,   14,   15,   16,   17,   18,   19,   19,
       19,   19,   19,   19,   19,   19,   19,    6,   20,   21,
       22,   23,    6,    6,   24,   24,   24,   24,   24,   24,
       25,   25,   25,   25,   25,   25,   25,   25,   25,   25,
       25,   25,   25,   25,   25,   25,   25,   25,   25,   25,
       26,   27,   28,    6,   29,    6,   30,   31,   32,   33,

       34,   35,   25,   36,   37,   25,   38,   39,   25,   40,
       41,   25,   25,   42,   43,   44,   45,   25,   46,   47,
       25,   25,   48,   49,   50,    6,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    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 const YY_CHAR yy_meta[51] =
    {   0,
        1,    2,    3,    4,    5,    6,    6,    7,    8,    9,
       10,    5,    5,   10,    5,    5,    5,   11,   11,    5,
        5,    5,    5,   11,   12,    5,    9,    5,   13,   11,
       11,   11,   11,   11,   11,   12,   12,   12,   12,   12,
       12,   12,   12,   12,   12,   12,   12,    5,    7,    5
    } ;

static const flex_int16_t yy_base[228] =
    {   0,
        0,    0,   48,   49,   66,    0,  116,    0,  166,    0,
       50,   51,  216,    0,   54,  263,  666,  665,  264,  265,
       52,  267,  270,  276,    0,    0,    0,    0,  289,  292,
      662,  686,  686,  686,  639,  686,  244,  652,  626,  686,
      686,  686,  686,  686,  686,  264,  285,  282,  287,  686,
      630,  628,  604,  686,  686,  686,  583,  263,  585,   18,
      272,  578,  562,  272,  686,  551,  686,  686,  686,  435,
      439,  686,  686,  686,  686,  686,  686,  686,  686,  686,
      686,  686,  686,  686,  686,  433,    0,    0,  686,  325,
      686,  686,  686,  686,    0,  686,  686,    0,  686,  305,

      268,  686,    0,  686,  686,  686,  415,  408,  686,  301,
      399,  267,  686,  442,  299,  304,  686,  686,  686,  686,
      410,  413,  394,  390,  391,  389,  686,  386,  281,  386,
      390,  389,  686,  686,  686,  686,    0,    0,    0,    0,
        0,  320,  372,  686,  421,  418,    0,  386,  387,  368,
      372,  378,  415,  686,  387,  374,  371,  373,  376,  686,
      686,  372,  359,  358,  362,  356,  395,  357,  359,    0,
      405,  423,  353,  353,  686,  345,  686,  346,  355,  352,
      351,  344,  348,    0,    0,  686,  373,  455,  686,  341,
      339,  334,  686,  686,  318,  686,  326,  323,  282,  686,

      686,  322,  686,  371,  287,  686,  686,  686,  505,  518,
      531,  544,  557,  570,  580,  583,  596,  609,  622,  635,
      644,  652,  304,  659,  666,  302,  673
    } ;

static const flex_int16_t yy_def[228] =
    {   0,
      208,    1,  209,  209,  208,    5,  208,    7,  208,    9,
      210,  210,  208,   13,  211,  211,  211,  211,  212,  212,
      213,  213,  211,  211,  211,  211,  211,  211,  214,  214,
      208,  208,  208,  208,  208,  208,  208,  208,  215,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  216,  216,  208,  208,
      208,  208,  208,  208,  217,  208,  208,  218,  208,  208,

      208,  208,  219,  208,  208,  208,  208,  208,  208,  215,
      208,  208,  208,  220,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  216,  221,   90,  217,
      218,  208,  208,  208,  208,  208,  219,  208,  208,  215,
      208,  222,  220,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  223,
      224,  225,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  226,  227,  208,  227,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  227,  188,  208,  208,

      208,  208,  208,  215,  208,  208,  208,    0,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208
    } ;

static const flex_int16_t yy_nxt[737] =
    {   0,
       32,   33,   34,   33,   35,   36,   37,   38,   39,   40,
       41,   42,   43,   44,   45,   46,   47,   48,   49,   50,
       51,   52,   53,   54,   54,   55,   36,   56,   54,   54,
       57,   58,   54,   59,   60,   54,   61,   54,   54,   54,
       54,   62,   63,   54,   54,   64,   54,   65,   66,   67,
       69,   69,   85,   85,   99,   91,  125,   92,  126,   70,
       70,   86,   86,   93,   71,   71,   72,   72,   73,   74,
       74,   72,   72,   74,   72,   74,   74,   74,   74,   74,
       74,   74,   74,   75,   75,   74,   74,   74,   74,   75,
       72,   74,   72,   74,   72,   75,   75,   75,   75,   75,

       75,   72,   72,   72,   72,   72,   72,   72,   72,   72,
       72,   72,   72,   74,   74,   74,   76,   76,   77,   78,
       78,   76,   76,   78,   76,   78,   78,   78,   78,   78,
       78,   78,   78,   79,   79,   78,   78,   78,   78,   76,
       76,   78,   76,   78,   76,   76,   76,   76,   76,   76,
       76,   76,   76,   76,   76,   76,   76,   76,   76,   76,
       76,   76,   76,   78,   78,   78,   80,   80,   81,   82,
       82,   80,   80,   82,   80,   82,   82,   82,   82,   82,
       82,   82,   82,   83,   83,   82,   82,   82,   82,   83,
       83,   82,   80,   82,   83,   83,   83,   83,   83,   83,

       83,   83,   83,   83,   83,   83,   83,   83,   83,   83,
       83,   83,   83,   82,   82,   82,   87,   88,   89,   88,
       87,   87,   87,   87,   87,   87,   87,   87,   87,   87,
       87,   87,   87,   87,   87,   87,   87,   87,   87,   90,
       90,   87,   87,   87,   90,   90,   90,   90,   90,   90,
       90,   90,   90,   90,   90,   90,   90,   90,   90,   90,
       90,   90,   90,   87,   87,   87,   92,   96,   96,   99,
       91,  145,   93,  100,   91,   91,  107,   97,   97,  100,
      101,  112,  112,  102,  112,  112,  101,  146,  108,  102,
      104,  105,  104,  104,  105,  104,  113,  115,  122,  116,

      116,  114,  115,  123,  116,  116,  127,  131,  142,  150,
      162,  128,  110,  132,  184,  143,  112,  112,  144,  115,
      207,  116,  116,  142,  163,  206,  205,  151,  117,  138,
      143,  204,  138,  144,  203,  138,  138,  138,  138,  138,
      138,  138,  139,  139,  138,  138,  138,  138,  139,  139,
      138,  202,  138,  139,  139,  139,  139,  139,  139,  139,
      139,  139,  139,  139,  139,  139,  139,  139,  139,  139,
      139,  139,  138,  138,  138,  145,  150,  201,  200,  150,
      199,  186,  196,  195,  194,  193,  192,  191,  161,  190,
      189,  146,  183,  182,  151,  172,  172,  151,  167,  181,

      180,  172,  179,  178,  177,  176,  175,  172,  172,  172,
      172,  172,  172,  186,  174,  161,  173,  154,  170,  169,
      168,  167,  187,  187,  145,  166,  165,  164,  187,  161,
      160,  159,  158,  157,  187,  187,  187,  187,  187,  187,
      188,  188,  156,  155,  154,  152,  188,  149,  148,  136,
      135,  134,  188,  188,  188,  188,  188,  188,  110,  110,
      198,  198,  198,  150,  110,  110,  110,  110,  110,  110,
      110,  110,  198,  198,  110,  110,  110,  110,  198,  198,
      110,  151,  110,  110,  198,  198,  198,  198,  198,  198,
      198,  198,  198,  198,  198,  198,  198,  198,  198,  198,

      198,  198,  110,  198,  110,   68,   68,   68,   68,   68,
       68,   68,   68,   68,   68,   68,   68,   68,   84,   84,
       84,   84,   84,   84,   84,   84,   84,   84,   84,   84,
       84,   91,   91,   91,   91,   91,   91,   91,   91,   91,
       91,   91,   91,   91,   95,   95,   95,   95,   95,   95,
       95,   95,   95,   95,   95,   95,   95,   98,   98,   98,
       98,   98,   98,   98,   98,   98,   98,   98,   98,   98,
      103,  103,  103,  103,  103,  103,  103,  103,  103,  103,
      103,  103,  103,  110,  110,  110,  110,  110,  110,  110,
      110,  110,  110,  137,  137,  137,  140,  140,  140,  133,

      140,  140,  140,  140,  140,  130,  140,  140,  140,  141,
      141,  129,  141,  141,  141,  141,  141,  141,  141,  141,
      141,  141,  147,  124,  121,  120,  147,  147,  147,  147,
      147,  147,  147,  147,  147,  153,  153,  153,  153,  153,
      153,  153,  153,  153,  153,  153,  153,  153,  138,  119,
      138,  118,  111,  138,  138,  138,  138,  171,  171,  109,
      106,  208,  171,  171,  185,  185,  185,   94,   94,  185,
      185,  187,  187,  208,  208,  208,  187,  187,  197,  197,
      208,  208,  208,  197,  197,   31,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,

      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208
    } ;

static const flex_int16_t yy_chk[737] =
    {   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,
        3,    4,   11,   12,   21,   21,   60,   15,   60,    3,
        4,   11,   12,   15,    3,    4,    5,    5,    5,    5,
        5,    5,    5,    5,    5,    5,    5,    5,    5,    5,
        5,    5,    5,    5,    5,    5,    5,    5,    5,    5,
        5,    5,    5,    5,    5,    5,    5,    5,    5,    5,

        5,    5,    5,    5,    5,    5,    5,    5,    5,    5,
        5,    5,    5,    5,    5,    5,    7,    7,    7,    7,
        7,    7,    7,    7,    7,    7,    7,    7,    7,    7,
        7,    7,    7,    7,    7,    7,    7,    7,    7,    7,
        7,    7,    7,    7,    7,    7,    7,    7,    7,    7,
        7,    7,    7,    7,    7,    7,    7,    7,    7,    7,
        7,    7,    7,    7,    7,    7,    9,    9,    9,    9,
        9,    9,    9,    9,    9,    9,    9,    9,    9,    9,
        9,    9,    9,    9,    9,    9,    9,    9,    9,    9,
        9,    9,    9,    9,    9,    9,    9,    9,    9,    9,

        9,    9,    9,    9,    9,    9,    9,    9,    9,    9,
        9,    9,    9,    9,    9,    9,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   16,   19,   20,   22,
       22,  101,   16,   23,   19,   20,   37,   19,   20,   24,
       23,   46,   46,   23,  112,  112,   24,  101,   37,   24,
       29,   29,   29,   30,   30,   30,   47,   48,   58,   48,

       48,   47,   49,   58,   49,   49,   61,   64,  100,  110,
      129,   61,  226,   64,  223,  100,  115,  115,  100,  116,
      205,  116,  116,  142,  129,  202,  199,  110,   48,   90,
      142,  198,   90,  142,  197,   90,   90,   90,   90,   90,
       90,   90,   90,   90,   90,   90,   90,   90,   90,   90,
       90,  195,   90,   90,   90,   90,   90,   90,   90,   90,
       90,   90,   90,   90,   90,   90,   90,   90,   90,   90,
       90,   90,   90,   90,   90,  143,  150,  192,  191,  204,
      190,  187,  183,  182,  181,  180,  179,  178,  176,  174,
      173,  143,  169,  168,  150,  152,  152,  204,  167,  166,

      165,  152,  164,  163,  162,  159,  158,  152,  152,  152,
      152,  152,  152,  171,  157,  156,  155,  153,  151,  149,
      148,  146,  171,  171,  145,  132,  131,  130,  171,  128,
      126,  125,  124,  123,  171,  171,  171,  171,  171,  171,
      172,  172,  122,  121,  114,  111,  172,  108,  107,   86,
       71,   70,  172,  172,  172,  172,  172,  172,  188,  188,
      188,  188,  188,  188,  188,  188,  188,  188,  188,  188,
      188,  188,  188,  188,  188,  188,  188,  188,  188,  188,
      188,  188,  188,  188,  188,  188,  188,  188,  188,  188,
      188,  188,  188,  188,  188,  188,  188,  188,  188,  188,

      188,  188,  188,  188,  188,  209,  209,  209,  209,  209,
      209,  209,  209,  209,  209,  209,  209,  209,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  211,  211,  211,  211,  211,  211,  211,  211,  211,
      211,  211,  211,  211,  212,  212,  212,  212,  212,  212,
      212,  212,  212,  212,  212,  212,  212,  213,  213,  213,
      213,  213,  213,  213,  213,  213,  213,  213,  213,  213,
      214,  214,  214,  214,  214,  214,  214,  214,  214,  214,
      214,  214,  214,  215,  215,  215,  215,  215,  215,  215,
      215,  215,  215,  216,  216,  216,  217,  217,  217,   66,

      217,  217,  217,  217,  217,   63,  217,  217,  217,  218,
      218,   62,  218,  218,  218,  218,  218,  218,  218,  218,
      218,  218,  219,   59,   57,   53,  219,  219,  219,  219,
      219,  219,  219,  219,  219,  220,  220,  220,  220,  220,
      220,  220,  220,  220,  220,  220,  220,  220,  221,   52,
      221,   51,   39,  221,  221,  221,  221,  222,  222,   38,
       35,   31,  222,  222,  224,  224,  224,   18,   17,  224,
      224,  225,  225,    0,    0,    0,  225,  225,  227,  227,
        0,    0,    0,  227,  227,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,

      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  208
    } ;

static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;

extern int yy_flex_debug;
int yy_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 *yytext;
#line 1 "lex.l"
#line 2 "lex.l"
    #include"syntax.tab.h"
    #include"LinkedList.c"
    #include"Attributes.c"
    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    /* library inclusions */ 
    int yycolno = 1; 
    int error = 0;
    int wrong = 0;
    char *rec = "";
    struct LstHead *head = NULL;
    struct LstNode *node = NULL;
    int neasted_start;
    #define YY_USER_ACTION \
        yylloc.first_line = yylineno; \
        yylloc.first_column = yycolno; \
        yylloc.last_line = yylineno; \
        yylloc.last_column = yycolno + yyleng; \
        yycolno += yyleng; \
    char *strCopy(char*);
    char *splice_char(char*, char);
    void record(char*);
    void record_char(char);
    void unputStr(char*);
    void appendLst(struct LstNode *);
    int eatLine();
    char *splice(char*, char*);
#line 704 "lex.yy.c"

#line 706 "lex.yy.c"

#define INITIAL 0
#define COMMENT 1
#define INT_HEX 2
#define INT_BINARY_OR_WRONG_ID 3
#define C_ID 4
#define NEASTED_COMMENT 5
#define DEFINE 6
#define NAME 7
#define TEXT 8
#define WHE_PARA 9
#define NAME_EAT 10
#define PARA 11
#define INCLUDE_HEAD 12
#define INCLUDE_FILE 13
#define UNDEF 14

#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

static int yy_init_globals ( void );

/* Accessor methods to globals.
   These are made visible to non-reentrant scanners for convenience. */

int yylex_destroy ( void );

int yyget_debug ( void );

void yyset_debug ( int debug_flag  );

YY_EXTRA_TYPE yyget_extra ( void );

void yyset_extra ( YY_EXTRA_TYPE user_defined  );

FILE *yyget_in ( void );

void yyset_in  ( FILE * _in_str  );

FILE *yyget_out ( void );

void yyset_out  ( FILE * _out_str  );

			int yyget_leng ( void );

char *yyget_text ( void );

int yyget_lineno ( void );

void yyset_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 yywrap ( void );
#else
extern int yywrap ( void );
#endif
#endif

#ifndef YY_NO_UNPUT
    
    static void yyunput ( int c, char *buf_ptr  );
    
#endif

#ifndef yytext_ptr
static void yy_flex_strncpy ( char *, const char *, int );
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen ( const 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
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#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 do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0)
#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 = '*'; \
		int 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 = (int) fread(buf, 1, (yy_size_t) 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 )
#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 yylex (void);

#define YY_DECL int yylex (void)
#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 /*LINTED*/break;
#endif

#define YY_RULE_SETUP \
	YY_USER_ACTION

/** The main scanner function which does all the work.
 */
YY_DECL
{
	yy_state_type yy_current_state;
	char *yy_cp, *yy_bp;
	int yy_act;
    
	if ( !(yy_init) )
		{
		(yy_init) = 1;

#ifdef YY_USER_INIT
		YY_USER_INIT;
#endif

		if ( ! (yy_start) )
			(yy_start) = 1;	/* first start state */

		if ( ! yyin )
			yyin = stdin;

		if ( ! yyout )
			yyout = stdout;

		if ( ! YY_CURRENT_BUFFER ) {
			yyensure_buffer_stack ();
			YY_CURRENT_BUFFER_LVALUE =
				yy_create_buffer( yyin, YY_BUF_SIZE );
		}

		yy_load_buffer_state(  );
		}

	{
#line 44 "lex.l"

#line 939 "lex.yy.c"

	while ( /*CONSTCOND*/1 )		/* loops until end-of-file is reached */
		{
		yy_cp = (yy_c_buf_p);

		/* Support of yytext. */
		*yy_cp = (yy_hold_char);

		/* yy_bp points to the position in yy_ch_buf of the start of
		 * the current run.
		 */
		yy_bp = yy_cp;

		yy_current_state = (yy_start);
yy_match:
		do
			{
			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 >= 209 )
					yy_c = yy_meta[yy_c];
				}
			yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
			++yy_cp;
			}
		while ( yy_base[yy_current_state] != 686 );

yy_find_action:
		yy_act = yy_accept[yy_current_state];
		if ( yy_act == 0 )
			{ /* have to back up */
			yy_cp = (yy_last_accepting_cpos);
			yy_current_state = (yy_last_accepting_state);
			yy_act = yy_accept[yy_current_state];
			}

		YY_DO_BEFORE_ACTION;

do_action:	/* This label is used only to access EOF actions. */

		switch ( yy_act )
	{ /* beginning of action switch */
			case 0: /* must back up */
			/* undo the effects of YY_DO_BEFORE_ACTION */
			*yy_cp = (yy_hold_char);
			yy_cp = (yy_last_accepting_cpos);
			yy_current_state = (yy_last_accepting_state);
			goto yy_find_action;

case 1:
YY_RULE_SETUP
#line 45 "lex.l"
{
        BEGIN(UNDEF);
    }
	YY_BREAK
case 2:
YY_RULE_SETUP
#line 48 "lex.l"
{
    }
	YY_BREAK
case 3:
/* rule 3 can match eol */
YY_RULE_SETUP
#line 50 "lex.l"
{
        yylineno++;
        fprintf(out, "Error UNDEF at Line %d: empty macro\n", yylineno);
        eatLine();
    }
	YY_BREAK
case 4:
YY_RULE_SETUP
#line 55 "lex.l"
{
        char *name = strCopy(yytext);
        if (head == NULL || !checkName(head, name)){
            fprintf(out, "Error UNDEF at Line %d: not exist macro name\n", yylineno);
        } else {
            removeNode(head, name);
        }
        eatLine();
    }
	YY_BREAK
case 5:
YY_RULE_SETUP
#line 64 "lex.l"
{
        BEGIN(DEFINE);
        node = newLstNode();
    }
	YY_BREAK
case 6:
YY_RULE_SETUP
#line 68 "lex.l"
{
        node->name = strCopy(yytext);
        node->name_len = yyleng;
        rec = "";
        BEGIN(NAME);
    }
	YY_BREAK
case 7:
YY_RULE_SETUP
#line 74 "lex.l"
{}
	YY_BREAK
case 8:
/* rule 8 can match eol */
YY_RULE_SETUP
#line 75 "lex.l"
{
        fprintf(out, "Error DEFINE at Line %d: empty macro\n", yylineno);
        yylineno++;
        BEGIN(INITIAL);
    }
	YY_BREAK
case 9:
YY_RULE_SETUP
#line 80 "lex.l"
{ 
        fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        node = NULL;
        eatLine();
    }
	YY_BREAK
case 10:
YY_RULE_SETUP
#line 85 "lex.l"
{}
	YY_BREAK
case 11:
YY_RULE_SETUP
#line 86 "lex.l"
{
        fprintf(out, "Error macro at Line %d: empty parameter\n", yylineno);
        eatLine();
    }
	YY_BREAK
case 12:
/* rule 12 can match eol */
YY_RULE_SETUP
#line 90 "lex.l"
{
        if (checkArg(node->argHead, yytext)){
            fprintf(out, "Error macro at Line %d: duplicate parameter\n", yylineno);
            eatLine();
        } else {
            appendArgId(node->argHead, strCopy(yytext));
            BEGIN(PARA);
        }
    }
	YY_BREAK
case 13:
YY_RULE_SETUP
#line 99 "lex.l"
{
        BEGIN(WHE_PARA);
    }
	YY_BREAK
case 14:
YY_RULE_SETUP
#line 102 "lex.l"
{
        node->semi = 1;
        BEGIN(NAME_EAT);
    }
	YY_BREAK
case 15:
YY_RULE_SETUP
#line 106 "lex.l"
{
        BEGIN(NAME_EAT);
    }
	YY_BREAK
case 16:
YY_RULE_SETUP
#line 109 "lex.l"
{
        fprintf(out, "Error at Line %d: missing right parenthesis\n", yylineno);
        eatLine();
    }
	YY_BREAK
case 17:
YY_RULE_SETUP
#line 113 "lex.l"
{
        record("(");
        BEGIN(WHE_PARA);
    }
	YY_BREAK
case 18:
YY_RULE_SETUP
#line 117 "lex.l"
{ 
        BEGIN(NAME_EAT);
    }
	YY_BREAK
case 19:
YY_RULE_SETUP
#line 120 "lex.l"
{
        node->text = strCopy(yytext);
        BEGIN(TEXT);
    }
	YY_BREAK
case 20:
/* rule 20 can match eol */
YY_RULE_SETUP
#line 124 "lex.l"
{ 
        BEGIN(INITIAL);
        node->text = "";
        appendLst(node);
        node = NULL;
        yylineno++; 
    }
	YY_BREAK
case 21:
/* rule 21 can match eol */
YY_RULE_SETUP
#line 131 "lex.l"
{
        BEGIN(INITIAL);
        appendLst(node);
        node = NULL;
        yylineno++; 
    }
	YY_BREAK
case 22:
/* rule 22 can match eol */
YY_RULE_SETUP
#line 137 "lex.l"
{
        yylineno++; 
    }
	YY_BREAK
case 23:
YY_RULE_SETUP
#line 140 "lex.l"
{ 
        rec = "";
        BEGIN(COMMENT);
    }
	YY_BREAK
case 24:
YY_RULE_SETUP
#line 144 "lex.l"
{
        neasted_start = yylineno;
        BEGIN(NEASTED_COMMENT);
    }
	YY_BREAK
case 25:
YY_RULE_SETUP
#line 148 "lex.l"
{ 
        rec = "";
        BEGIN(INITIAL);
    }
	YY_BREAK
case 26:
/* rule 26 can match eol */
YY_RULE_SETUP
#line 152 "lex.l"
{
        yylineno++; 
    }
	YY_BREAK
case YY_STATE_EOF(COMMENT):
#line 155 "lex.l"
{
        fprintf(out, "Error COMMENT at Line %d: missing '*/'\n", yylineno);
    }
	YY_BREAK
case 27:
YY_RULE_SETUP
#line 158 "lex.l"
{
    }
	YY_BREAK
case 28:
YY_RULE_SETUP
#line 160 "lex.l"
{
        fprintf(out, "Error COMMENT from Line %d to Line %d: nested multi-line comments\n", neasted_start, yylineno);
        BEGIN(COMMENT);
    }
	YY_BREAK
case YY_STATE_EOF(NEASTED_COMMENT):
#line 164 "lex.l"
{
        fprintf(out, "Error COMMENT at Line %d: missing '*/'\n", yylineno);
    }
	YY_BREAK
case 29:
YY_RULE_SETUP
#line 167 "lex.l"
{
    }
	YY_BREAK
case 30:
/* rule 30 can match eol */
YY_RULE_SETUP
#line 169 "lex.l"
{
        yylineno++;
    }
	YY_BREAK
case 31:
YY_RULE_SETUP
#line 172 "lex.l"
{ 
        BEGIN(INT_HEX);
        rec = "";
        record(yytext);
    }
	YY_BREAK
case 32:
YY_RULE_SETUP
#line 177 "lex.l"
{
        record(yytext);
    }
	YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 180 "lex.l"
{ 
        if (yytext == "\n"){
            yylineno++;
        }
        if (wrong == 1){
            fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, rec);
            error = 1;
            yylval.node = newLeaf("INT", strCopy(rec));
            wrong = 0;
            BEGIN(INITIAL);
            yyless(yyleng - 1);
            rec = "";
            return UNKNOW;
        }
        yylval.node = newLeaf("INT", strCopy(rec));
        wrong = 0;
        BEGIN(INITIAL);
        yyless(yyleng - 1);
        rec = "";
        return INT;
    }
	YY_BREAK
case 34:
YY_RULE_SETUP
#line 201 "lex.l"
{ 
        record(yytext);
        wrong = 1; 
    }
	YY_BREAK
case 35:
YY_RULE_SETUP
#line 205 "lex.l"
{ 
        BEGIN(INT_BINARY_OR_WRONG_ID); 
        record(yytext);
    }
	YY_BREAK
case 36:
/* rule 36 can match eol */
YY_RULE_SETUP
#line 209 "lex.l"
{
        if (yytext == "\n"){
            yylineno++;
        }
        if (wrong == 1){
            fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, rec);
            error = 1;
            yylval.node = newLeaf("ID", strCopy(rec));
            wrong = 0;
            BEGIN(INITIAL);
            yyless(yyleng - 1);
            rec = "";
            return ID;
        } else {
            yylval.node = newLeaf("INT", strCopy(rec));
            BEGIN(INITIAL);
            yyless(yyleng - 1);
            rec = "";
            return INT;
        }
    }
	YY_BREAK
case 37:
YY_RULE_SETUP
#line 230 "lex.l"
{
        record(yytext);
    }
	YY_BREAK
case 38:
YY_RULE_SETUP
#line 233 "lex.l"
{
        wrong = 1;
        record(yytext);
    }
	YY_BREAK
case 39:
YY_RULE_SETUP
#line 237 "lex.l"
{ 
        yylval.node = newLeaf("FLOAT", strCopy(yytext)); 
        return FLOAT; 
    }
	YY_BREAK
/*Hex appears more than three times*/
case 40:
YY_RULE_SETUP
#line 242 "lex.l"
{
        yylval.node = newLeaf("CHAR", strCopy(yytext));
        fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        error = 1;
        return UNKNOW;
    }
	YY_BREAK
/*Invalid hex lenth 2 or 1*/
case 41:
YY_RULE_SETUP
#line 249 "lex.l"
{
        yylval.node = newLeaf("CHAR", strCopy(yytext));
        fprintf(out,  "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        error = 1;
        return UNKNOW;
    }
	YY_BREAK
case 42:
YY_RULE_SETUP
#line 255 "lex.l"
{ 
        yylval.node = newLeaf("CHAR", strCopy(yytext));
        return CHAR; 
    }
	YY_BREAK
case 43:
YY_RULE_SETUP
#line 259 "lex.l"
{         
        yylval.node = newLeaf("TYPE", strCopy(yytext)); 
        return TYPE; 
    }
	YY_BREAK
case 44:
YY_RULE_SETUP
#line 263 "lex.l"
{
        yylval.node = newNotation("STRUCT"); 
        return STRUCT; 
    }
	YY_BREAK
case 45:
YY_RULE_SETUP
#line 267 "lex.l"
{ 
        yylval.node = newNotation("IF"); 
        return IF; 
    }
	YY_BREAK
case 46:
YY_RULE_SETUP
#line 271 "lex.l"
{ 
        yylval.node = newNotation("ELSE"); 
        return ELSE; 
    }
	YY_BREAK
case 47:
YY_RULE_SETUP
#line 275 "lex.l"
{ 
        yylval.node = newNotation("WHILE"); 
        return WHILE; 
    }
	YY_BREAK
case 48:
YY_RULE_SETUP
#line 279 "lex.l"
{
        yylval.node = newNotation("RETURN"); 
        return RETURN; 
    }
	YY_BREAK
case 49:
YY_RULE_SETUP
#line 283 "lex.l"
{
        yylval.node = newNotation("FOR");
        return FOR;
    }
	YY_BREAK
case 50:
YY_RULE_SETUP
#line 287 "lex.l"
{
        yylval.node = newNotation("BREAK");
        return BREAK;
    }
	YY_BREAK
case 51:
YY_RULE_SETUP
#line 291 "lex.l"
{
        yylval.node = newNotation("CONTINUE");
        return CONTINUE;
    }
	YY_BREAK
case 52:
YY_RULE_SETUP
#line 295 "lex.l"
{
        yylval.node = newNotation("READ");
        return READ;
    }
	YY_BREAK
case 53:
YY_RULE_SETUP
#line 299 "lex.l"
{
        yylval.node = newNotation("WRITE");
        return WRITE;
    }
	YY_BREAK
case 54:
YY_RULE_SETUP
#line 303 "lex.l"
{
        rec = "";
        int judge = 1;
        int change = 0;
        if (head != NULL) {
            int i;
            LstNode *tmp = head->next;
            register int c = 0;
            for(i = 0; i < head->num; i++){
                if (yytext[0] == tmp->name[0]){
                    record(yytext);
                    change = 1;
                    int j;
                    for(j = 0; j < tmp->name_len - 1; j++){
                        c = input();
                        if (c != EOF){
                            record_char(c);
                        } else {
                            /* fail */
                            unputStr(rec);
                            rec = "";
                            break;
                        }
                    }
                    if (c == EOF){
                        /* fail */
                        continue;
                    }
                    if (!strcmp(tmp->name, rec)){
                        /* success */
                        if (tmp->argHead->num == 0){
                            unputStr(strCopy(tmp->text));
                            rec = "";
                            yytext = "";
                            judge = 0;
                            break;
                        } else {
                            char next_char = input();
                            record_char(next_char);
                            int state = 0;
                            int count = 0;
                            Arg *arg = tmp->argHead->next;
                            while(next_char != EOF){
                                if (state == 0){
                                    if (next_char == '('){
                                        state = 1;
                                    } else {
                                        unputStr(rec);
                                        break;
                                    }
                                } else if (state == 1){
                                    if (next_char == ','){
                                        if (arg->match == NULL){
                                            unputStr(rec);
                                            break;
                                        } else {
                                            if (arg->next != NULL){
                                                count++;
                                                arg = arg->next;
                                                state = 1;
                                            } else {
                                                unputStr(rec);
                                                break;
                                            }
                                        }
                                    } else if (next_char == ' '){
                                        state = 1;
                                    } else if (next_char == ')'){
                                        if (arg->match != NULL && count + 1 == tmp->argHead->num){
                                            if (tmp->semi){
                                                next_char = input();
                                                record_char(next_char);
                                                if (next_char == ';'){
                                                    /* success */
                                                    unputStr(replace(tmp->text, tmp->argHead));
                                                    clearMatch(tmp->argHead);
                                                    rec = "";
                                                    yytext = "";
                                                    judge = 0;
                                                    break;
                                                } else {
                                                    unputStr(rec);
                                                    break;
                                                }
                                            } else {
                                                /* success */
                                                unputStr(replace(arg->match, tmp->argHead));
                                                clearMatch(tmp->argHead);
                                                rec = "";
                                                yytext = "";
                                                judge = 0;
                                                break;
                                            }
                                        } else {
                                            unputStr(rec);
                                            break;
                                        }
                                    } else {
                                        arg->match = splice_char(arg->match, next_char);
                                        state = 1;
                                    }
                                }
                                next_char = input();
                                record_char(next_char);
                            }
                            if (next_char == EOF){
                                unputStr(rec);
                            }
                        }
                    } else {
                        /* fail */
                        unputStr(rec);
                        rec = "";
                    }
                }
                tmp = tmp->next;
            }
        }
        if (judge) {
            if (change){
                yytext = "";
                yytext = splice_char(yytext, input());
            }
            BEGIN(C_ID);
            wrong = 0;
            record(yytext);
        }
    }
	YY_BREAK
case 55:
/* rule 55 can match eol */
YY_RULE_SETUP
#line 431 "lex.l"
{
        if (yytext == "\n"){
            yylineno++;
        }
        if (wrong == 1){
            fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, rec);
            error = 1;
            wrong = 0;
            BEGIN(INITIAL);
            yyless(yyleng - 1);
            rec = "";
            return UNKNOW;
        } else {
            yylval.node = newLeaf("ID", strCopy(rec));
            wrong = 0;
            BEGIN(INITIAL);
            yyless(yyleng - 1);
            rec = "";
            return ID;
        }
    }
	YY_BREAK
case 56:
YY_RULE_SETUP
#line 452 "lex.l"
{
        record(yytext);
    }
	YY_BREAK
case 57:
YY_RULE_SETUP
#line 455 "lex.l"
{
        record(yytext);
        wrong = 1;
    }
	YY_BREAK
case 58:
YY_RULE_SETUP
#line 459 "lex.l"
{ 
        yylval.node = newNotation("DOT"); 
        return DOT;
    }
	YY_BREAK
case 59:
YY_RULE_SETUP
#line 463 "lex.l"
{ 
        yylval.node = newNotation("SEMI");
        return SEMI;
    }
	YY_BREAK
case 60:
YY_RULE_SETUP
#line 467 "lex.l"
{ 
        yylval.node = newNotation("COMMA"); 
        return COMMA;
    }
	YY_BREAK
case 61:
YY_RULE_SETUP
#line 471 "lex.l"
{ 
        yylval.node = newNotation("ASSIGN"); 
        return ASSIGN;
    }
	YY_BREAK
case 62:
YY_RULE_SETUP
#line 475 "lex.l"
{ 
        yylval.node = newNotation("LT"); 
        return LT;
    }
	YY_BREAK
case 63:
YY_RULE_SETUP
#line 479 "lex.l"
{ 
        yylval.node = newNotation("LE"); 
        return LE;
    }
	YY_BREAK
case 64:
YY_RULE_SETUP
#line 483 "lex.l"
{ 
        yylval.node = newNotation("GT"); 
        return GT;
    }
	YY_BREAK
case 65:
YY_RULE_SETUP
#line 487 "lex.l"
{ 
        yylval.node = newNotation("GE"); 
        return GE;
    }
	YY_BREAK
case 66:
YY_RULE_SETUP
#line 491 "lex.l"
{ 
        yylval.node = newNotation("NE"); 
        return NE;
    }
	YY_BREAK
case 67:
YY_RULE_SETUP
#line 495 "lex.l"
{ 
        yylval.node = newNotation("EQ"); 
        return EQ;
    }
	YY_BREAK
case 68:
YY_RULE_SETUP
#line 499 "lex.l"
{ 
        yylval.node = newNotation("PLUS"); 
        return PLUS;
    }
	YY_BREAK
case 69:
YY_RULE_SETUP
#line 503 "lex.l"
{ 
        yylval.node = newNotation("MINUS"); 
        return MINUS; 
    }
	YY_BREAK
case 70:
YY_RULE_SETUP
#line 507 "lex.l"
{ 
        yylval.node = newNotation("MUL"); 
        return MUL;
    }
	YY_BREAK
case 71:
YY_RULE_SETUP
#line 511 "lex.l"
{ 
        yylval.node = newNotation("DIV");
        return DIV;
    }
	YY_BREAK
case 72:
YY_RULE_SETUP
#line 515 "lex.l"
{ 
        yylval.node = newNotation("AND");
        return AND;
    }
	YY_BREAK
case 73:
YY_RULE_SETUP
#line 519 "lex.l"
{ 
        yylval.node = newNotation("OR"); 
        return OR; 
    }
	YY_BREAK
case 74:
YY_RULE_SETUP
#line 523 "lex.l"
{ 
        yylval.node = newNotation("NOT");
        return NOT;
    }
	YY_BREAK
case 75:
YY_RULE_SETUP
#line 528 "lex.l"
{ 
        yylval.node = newNotation("LP"); 
        return LP; 
    }
	YY_BREAK
case 76:
YY_RULE_SETUP
#line 532 "lex.l"
{ 
        yylval.node = newNotation("RP");
        return RP; 
    }
	YY_BREAK
case 77:
YY_RULE_SETUP
#line 536 "lex.l"
{ 
        yylval.node = newNotation("LB");
        return LB; 
    }
	YY_BREAK
case 78:
YY_RULE_SETUP
#line 540 "lex.l"
{ 
        yylval.node = newNotation("RB");
        return RB; 
    }
	YY_BREAK
case 79:
YY_RULE_SETUP
#line 544 "lex.l"
{ 
        yylval.node = newNotation("LC");
        return LC; 
    }
	YY_BREAK
case 80:
YY_RULE_SETUP
#line 548 "lex.l"
{ 
        yylval.node = newNotation("RC");
        return RC; 
    }
	YY_BREAK
case 81:
YY_RULE_SETUP
#line 552 "lex.l"
{
        fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        error = 1;
        yylval.node = newLeaf("UNKNOW", "|");
        return UNKNOW; 
    }
	YY_BREAK
case 82:
YY_RULE_SETUP
#line 558 "lex.l"
{
        fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        error = 1;
        yylval.node = newLeaf("UNKNOW", "&");
        return UNKNOW; 
    }
	YY_BREAK
case 83:
YY_RULE_SETUP
#line 564 "lex.l"
{
        BEGIN(C_ID);
        wrong = 1;
        rec = "";
        record(yytext);
    }
	YY_BREAK
case 84:
/* rule 84 can match eol */
YY_RULE_SETUP
#line 570 "lex.l"
{ 
        yylineno++;
    }
	YY_BREAK
case 85:
YY_RULE_SETUP
#line 573 "lex.l"
{ 
    }
	YY_BREAK
case 86:
YY_RULE_SETUP
#line 575 "lex.l"
{
        fprintf(out, "Error type A at Line %d: unknown lexeme %s\n", yylineno, yytext);
        error = 1;
    }
	YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(INT_HEX):
case YY_STATE_EOF(INT_BINARY_OR_WRONG_ID):
case YY_STATE_EOF(C_ID):
case YY_STATE_EOF(DEFINE):
case YY_STATE_EOF(NAME):
case YY_STATE_EOF(TEXT):
case YY_STATE_EOF(WHE_PARA):
case YY_STATE_EOF(NAME_EAT):
case YY_STATE_EOF(PARA):
case YY_STATE_EOF(INCLUDE_HEAD):
case YY_STATE_EOF(INCLUDE_FILE):
case YY_STATE_EOF(UNDEF):
#line 579 "lex.l"
{
        yyterminate();
    }
	YY_BREAK
case 87:
YY_RULE_SETUP
#line 582 "lex.l"
ECHO;
	YY_BREAK
#line 1914 "lex.yy.c"

	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 yyin at a new source and called
			 * yylex().  If so, then we have to assure
			 * consistency between YY_CURRENT_BUFFER and our
			 * globals.  Here is the right place to do so, because
			 * this is the first action (other than possibly a
			 * back-up) that will match for the new input source.
			 */
			(yy_n_chars) = YY_CURRENT_BUFFER_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 ( (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 ( yywrap(  ) )
					{
					/* Note: because we've taken care in
					 * yy_get_next_buffer() to have set up
					 * yytext, we can now set up
					 * yy_c_buf_p so that if some total
					 * hoser (like flex itself) wants to
					 * call the scanner after we return the
					 * YY_NULL, it'll still work - another
					 * YY_NULL will get returned.
					 */
					(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;

					yy_act = YY_STATE_EOF(YY_START);
					goto do_action;
					}

				else
					{
					if ( ! (yy_did_buffer_switch_on_eof) )
						YY_NEW_FILE;
					}
				break;
				}

			case EOB_ACT_CONTINUE_SCAN:
				(yy_c_buf_p) =
					(yytext_ptr) + yy_amount_of_matched_text;

				yy_current_state = yy_get_previous_state(  );

				yy_cp = (yy_c_buf_p);
				yy_bp = (yytext_ptr) + YY_MORE_ADJ;
				goto yy_match;

			case EOB_ACT_LAST_MATCH:
				(yy_c_buf_p) =
				&YY_CURRENT_BUFFER_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 user's declarations */
} /* end of yylex */

/* yy_get_next_buffer - try to read in a new buffer
 *
 * Returns a code representing an action:
 *	EOB_ACT_LAST_MATCH -
 *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
 *	EOB_ACT_END_OF_FILE - end of file
 */
static int yy_get_next_buffer (void)
{
    	char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
	char *source = (yytext_ptr);
	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_LVALUE;

			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. */
					yyrealloc( (void *) b->yy_ch_buf,
							 (yy_size_t) (b->yy_buf_size + 2)  );
				}
			else
				/* Can't grow it, we don't own it. */
				b->yy_ch_buf = NULL;

			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), 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;
			yyrestart( yyin  );
			}

		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_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
		/* Extend the array by 50%, plus the number we really need. */
		int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc(
			(void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size  );
		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
		/* "- 2" to take care of EOB's */
		YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2);
	}

	(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)
{
	yy_state_type yy_current_state;
	char *yy_cp;
    
	yy_current_state = (yy_start);

	for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
		{
		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 >= 209 )
				yy_c = yy_meta[yy_c];
			}
		yy_current_state = yy_nxt[yy_base[yy_current_state] + 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 )
{
	int yy_is_jam;
    	char *yy_cp = (yy_c_buf_p);

	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 >= 209 )
			yy_c = yy_meta[yy_c];
		}
	yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
	yy_is_jam = (yy_current_state == 208);

		return yy_is_jam ? 0 : yy_current_state;
}

#ifndef YY_NO_UNPUT

    static void yyunput (int c, char * yy_bp )
{
	char *yy_cp;
    
    yy_cp = (yy_c_buf_p);

	/* undo effects of setting up yytext */
	*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. */
		int number_to_move = (yy_n_chars) + 2;
		char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
					YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
		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) = (int) 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;
}

#endif

#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 = (int) ((yy_c_buf_p) - (yytext_ptr));
			++(yy_c_buf_p);

			switch ( yy_get_next_buffer(  ) )
				{
				case EOB_ACT_LAST_MATCH:
					/* This happens because yy_g_n_b()
					 * sees that we've accumulated a
					 * token and flags that we need to
					 * try matching the token before
					 * proceeding.  But for input(),
					 * there's no matching to consider.
					 * So convert the EOB_ACT_LAST_MATCH
					 * to EOB_ACT_END_OF_FILE.
					 */

					/* Reset buffer status. */
					yyrestart( yyin );

					/*FALLTHROUGH*/

				case EOB_ACT_END_OF_FILE:
					{
					if ( yywrap(  ) )
						return 0;

					if ( ! (yy_did_buffer_switch_on_eof) )
						YY_NEW_FILE;
#ifdef __cplusplus
					return yyinput();
#else
					return input();
#endif
					}

				case EOB_ACT_CONTINUE_SCAN:
					(yy_c_buf_p) = (yytext_ptr) + offset;
					break;
				}
			}
		}

	c = *(unsigned char *) (yy_c_buf_p);	/* cast for 8-bit char's */
	*(yy_c_buf_p) = '\0';	/* preserve yytext */
	(yy_hold_char) = *++(yy_c_buf_p);

	return c;
}
#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 yyrestart  (FILE * input_file )
{
    
	if ( ! YY_CURRENT_BUFFER ){
        yyensure_buffer_stack ();
		YY_CURRENT_BUFFER_LVALUE =
            yy_create_buffer( yyin, YY_BUF_SIZE );
	}

	yy_init_buffer( YY_CURRENT_BUFFER, input_file );
	yy_load_buffer_state(  );
}

/** Switch to a different input buffer.
 * @param new_buffer The new input buffer.
 * 
 */
    void yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer )
{
    
	/* TODO. We should be able to replace this entire function body
	 * with
	 *		yypop_buffer_state();
	 *		yypush_buffer_state(new_buffer);
     */
	yyensure_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;
	yy_load_buffer_state(  );

	/* We don't actually know whether we did this switch during
	 * EOF (yywrap()) processing, but the only time this flag
	 * is looked at is after yywrap() is called, so it's safe
	 * to go ahead and always set it.
	 */
	(yy_did_buffer_switch_on_eof) = 1;
}

static void yy_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;
	yyin = 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 yy_create_buffer  (FILE * file, int  size )
{
	YY_BUFFER_STATE b;
    
	b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state )  );
	if ( ! b )
		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );

	b->yy_buf_size = size;

	/* yy_ch_buf has to be 2 characters longer than the size given because
	 * we need to put in 2 end-of-buffer characters.
	 */
	b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2)  );
	if ( ! b->yy_ch_buf )
		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );

	b->yy_is_our_buffer = 1;

	yy_init_buffer( b, file );

	return b;
}

/** Destroy the buffer.
 * @param b a buffer created with yy_create_buffer()
 * 
 */
    void yy_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 )
		yyfree( (void *) b->yy_ch_buf  );

	yyfree( (void *) b  );
}

/* Initializes or reinitializes a buffer.
 * This function is sometimes called more than once on the same buffer,
 * such as during a yyrestart() or at EOF.
 */
    static void yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file )

{
	int oerrno = errno;
    
	yy_flush_buffer( b );

	b->yy_input_file = file;
	b->yy_fill_buffer = 1;

    /* If b is the current buffer, then yy_init_buffer was _probably_
     * called from yyrestart() 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 yy_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 )
		yy_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 yypush_buffer_state (YY_BUFFER_STATE new_buffer )
{
    	if (new_buffer == NULL)
		return;

	yyensure_buffer_stack();

	/* This block is copied from yy_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 yy_switch_to_buffer. */
	yy_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 yypop_buffer_state (void)
{
    	if (!YY_CURRENT_BUFFER)
		return;

	yy_delete_buffer(YY_CURRENT_BUFFER );
	YY_CURRENT_BUFFER_LVALUE = NULL;
	if ((yy_buffer_stack_top) > 0)
		--(yy_buffer_stack_top);

	if (YY_CURRENT_BUFFER) {
		yy_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 yyensure_buffer_stack (void)
{
	yy_size_t 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; /* After all that talk, this was set to 1 anyways... */
		(yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
								(num_to_alloc * sizeof(struct yy_buffer_state*)
								);
		if ( ! (yy_buffer_stack) )
			YY_FATAL_ERROR( "out of dynamic memory in yyensure_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. */
		yy_size_t grow_size = 8 /* arbitrary grow size */;

		num_to_alloc = (yy_buffer_stack_max) + grow_size;
		(yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
								((yy_buffer_stack),
								num_to_alloc * sizeof(struct yy_buffer_state*)
								);
		if ( ! (yy_buffer_stack) )
			YY_FATAL_ERROR( "out of dynamic memory in yyensure_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 yy_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 NULL;

	b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state )  );
	if ( ! b )
		YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );

	b->yy_buf_size = (int) (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 = NULL;
	b->yy_n_chars = b->yy_buf_size;
	b->yy_is_interactive = 0;
	b->yy_at_bol = 1;
	b->yy_fill_buffer = 0;
	b->yy_buffer_status = YY_BUFFER_NEW;

	yy_switch_to_buffer( b  );

	return b;
}

/** Setup the input buffer state to scan a string. The next call to yylex() 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
 *       yy_scan_bytes() instead.
 */
YY_BUFFER_STATE yy_scan_string (const char * yystr )
{
    
	return yy_scan_bytes( yystr, (int) strlen(yystr) );
}

/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
 * scan from a @e copy of @a bytes.
 * @param yybytes the byte buffer to scan
 * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
 * 
 * @return the newly allocated buffer state object.
 */
YY_BUFFER_STATE yy_scan_bytes  (const 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 = (yy_size_t) (_yybytes_len + 2);
	buf = (char *) yyalloc( n  );
	if ( ! buf )
		YY_FATAL_ERROR( "out of dynamic memory in yy_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 = yy_scan_buffer( buf, n );
	if ( ! b )
		YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );

	/* It's okay to grow etc. this buffer, and we should throw it
	 * away when we're done.
	 */
	b->yy_is_our_buffer = 1;

	return b;
}

#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif

static void yynoreturn yy_fatal_error (const char* msg )
{
			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] = (yy_hold_char); \
		(yy_c_buf_p) = yytext + yyless_macro_arg; \
		(yy_hold_char) = *(yy_c_buf_p); \
		*(yy_c_buf_p) = '\0'; \
		yyleng = yyless_macro_arg; \
		} \
	while ( 0 )

/* Accessor  methods (get/set functions) to struct members. */

/** Get the current line number.
 * 
 */
int yyget_lineno  (void)
{
    
    return yylineno;
}

/** Get the input stream.
 * 
 */
FILE *yyget_in  (void)
{
        return yyin;
}

/** Get the output stream.
 * 
 */
FILE *yyget_out  (void)
{
        return yyout;
}

/** Get the length of the current token.
 * 
 */
int yyget_leng  (void)
{
        return yyleng;
}

/** Get the current token.
 * 
 */

char *yyget_text  (void)
{
        return yytext;
}

/** Set the current line number.
 * @param _line_number line number
 * 
 */
void yyset_lineno (int  _line_number )
{
    
    yylineno = _line_number;
}

/** Set the input stream. This does not discard the current
 * input buffer.
 * @param _in_str A readable stream.
 * 
 * @see yy_switch_to_buffer
 */
void yyset_in (FILE *  _in_str )
{
        yyin = _in_str ;
}

void yyset_out (FILE *  _out_str )
{
        yyout = _out_str ;
}

int yyget_debug  (void)
{
        return yy_flex_debug;
}

void yyset_debug (int  _bdebug )
{
        yy_flex_debug = _bdebug ;
}

static int yy_init_globals (void)
{
        /* Initialization is the same as for the non-reentrant scanner.
     * This function is called from yylex_destroy(), so don't allocate here.
     */

    (yy_buffer_stack) = NULL;
    (yy_buffer_stack_top) = 0;
    (yy_buffer_stack_max) = 0;
    (yy_c_buf_p) = NULL;
    (yy_init) = 0;
    (yy_start) = 0;

/* Defined in main.c */
#ifdef YY_STDINIT
    yyin = stdin;
    yyout = stdout;
#else
    yyin = NULL;
    yyout = NULL;
#endif

    /* For future reference: Set errno on error, since we are called by
     * yylex_init()
     */
    return 0;
}

/* yylex_destroy is for both reentrant and non-reentrant scanners. */
int yylex_destroy  (void)
{
    
    /* Pop the buffer stack, destroying each element. */
	while(YY_CURRENT_BUFFER){
		yy_delete_buffer( YY_CURRENT_BUFFER  );
		YY_CURRENT_BUFFER_LVALUE = NULL;
		yypop_buffer_state();
	}

	/* Destroy the stack itself. */
	yyfree((yy_buffer_stack) );
	(yy_buffer_stack) = NULL;

    /* Reset the globals. This is important in a non-reentrant scanner so the next time
     * yylex() is called, initialization will occur. */
    yy_init_globals( );

    return 0;
}

/*
 * Internal utility routines.
 */

#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, const char * s2, int n )
{
		
	int i;
	for ( i = 0; i < n; ++i )
		s1[i] = s2[i];
}
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (const char * s )
{
	int n;
	for ( n = 0; s[n]; ++n )
		;

	return n;
}
#endif

void *yyalloc (yy_size_t  size )
{
			return malloc(size);
}

void *yyrealloc  (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 realloc(ptr, size);
}

void yyfree (void * ptr )
{
			free( (char *) ptr );	/* see yyrealloc() for (char *) cast */
}

#define YYTABLES_NAME "yytables"

#line 582 "lex.l"

char* strCopy(char* src)
{
    char *dest = malloc(strlen(src));
    strcpy(dest, src);
    return dest;
}

void record(char* ipt)
{
    char *str = malloc(strlen(rec) + strlen(ipt) + 1);
    strcpy(str, rec);
    strcat(str, ipt);
    str[strlen(rec) + strlen(ipt)] = 0;
    rec = str;
}

void appendLst(LstNode *node)
{
    if (head == NULL){
        head = newLstHead();
    }
    appendNode(head, node);
}

void record_char(char ipt)
{
    char *str = malloc(strlen(rec) + 2);
    strcpy(str, rec);
    str[strlen(rec)] = ipt;
    str[strlen(rec) + 1] = 0;
    rec = str;
}

void unputStr(char* str){
    int i = strlen(str) - 1;
    for (; i >= 0; i--){
        unput(str[i]);
    }
}

char *splice(char* a, char* b)
{
    char *str = malloc(strlen(a) + strlen(b) + 1);
    strcpy(str, a);
    strcat(str, b);
    str[strlen(a) + strlen(b)] = 0;
    return str;
}

int eatLine()
{
    register int c;
    while((c = input()) != '\n' && c != EOF);
    if (c == '\n'){
        BEGIN(INITIAL);
        yylineno++;
    } else {
        fprintf(out, "Error at Line %d: EOF in macros\n", yylineno);
        yyterminate();
    }
}

char *splice_char(char* a, char b)
{   
    char *str;
    if (a == NULL){
        str = malloc(2);
        str[0] = b;
        str[1] = 0;
    } else {
        str = malloc(strlen(a) + 2);
        strcpy(str, a);
        str[strlen(a)] = b;
        str[strlen(a) + 1] = 0;
    }
    return str;
}