/* A lexical scanner generated by flex */

/* Scanner skeleton version:
 * $Header: /home/haiku/befpc/bepascal/bepascal/stubgen.so/lex.yy.c,v 1.1 2002-09-21 14:12:12 ocoursiere Exp $
 */

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5

#include <stdio.h>


/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif


#ifdef __cplusplus

#include <stdlib.h>
#include <unistd.h>

/* Use prototypes in function declarations. */
#define YY_USE_PROTOS

/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST

#else	/* ! __cplusplus */

#if __STDC__

#define YY_USE_PROTOS
#define YY_USE_CONST

#endif	/* __STDC__ */
#endif	/* ! __cplusplus */

#ifdef __TURBOC__
 #pragma warn -rch
 #pragma warn -use
#include <io.h>
#include <stdlib.h>
#define YY_USE_CONST
#define YY_USE_PROTOS
#endif

#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif


#ifdef YY_USE_PROTOS
#define YY_PROTO(proto) proto
#else
#define YY_PROTO(proto) ()
#endif

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

/* Promotes a possibly negative, possibly signed char to an unsigned
 * integer for use as an array index.  If the signed char is negative,
 * we want to instead treat it as an 8-bit unsigned char, hence the
 * double cast.
 */
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)

/* Enter a start condition.  This macro really ought to take a parameter,
 * but we do it the disgusting crufty way forced on us by the ()-less
 * definition of BEGIN.
 */
#define BEGIN yy_start = 1 + 2 *

/* Translate the current start state into a value that can be later handed
 * to BEGIN to return to the state.  The YYSTATE alias is for lex
 * compatibility.
 */
#define YY_START ((yy_start - 1) / 2)
#define YYSTATE YY_START

/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)

/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin )

#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#define YY_BUF_SIZE 16384

typedef struct yy_buffer_state *YY_BUFFER_STATE;

extern int yyleng;
extern FILE *yyin, *yyout;

#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2

/* The funky do-while in the following #define is used to turn the definition
 * int a single C statement (which needs a semi-colon terminator).  This
 * avoids problems with code like:
 *
 * 	if ( condition_holds )
 *		yyless( 5 );
 *	else
 *		do_something_else();
 *
 * Prior to using the do-while the compiler would get upset at the
 * "else" because it interpreted the "if" statement as being all
 * done when it reached the ';' after the yyless() call.
 */

/* Return all but the first 'n' matched characters back to the input stream. */

#define yyless(n) \
	do \
		{ \
		/* Undo effects of setting up yytext. */ \
		*yy_cp = yy_hold_char; \
		YY_RESTORE_YY_MORE_OFFSET \
		yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
		} \
	while ( 0 )

#define unput(c) yyunput( c, yytext_ptr )

/* The following is because we cannot portably get our hands on size_t
 * (without autoconf's help, which isn't available because we want
 * flex-generated scanners to compile on their own).
 */
typedef unsigned int yy_size_t;


struct yy_buffer_state
	{
	FILE *yy_input_file;

	char *yy_ch_buf;		/* input buffer */
	char *yy_buf_pos;		/* current position in input buffer */

	/* Size of input buffer in bytes, not including room for EOB
	 * characters.
	 */
	yy_size_t yy_buf_size;

	/* Number of characters read into yy_ch_buf, not including EOB
	 * characters.
	 */
	int yy_n_chars;

	/* Whether we "own" the buffer - i.e., we know we created it,
	 * and can realloc() it to grow it, and should free() it to
	 * delete it.
	 */
	int yy_is_our_buffer;

	/* Whether this is an "interactive" input source; if so, and
	 * if we're using stdio for input, then we want to use getc()
	 * instead of fread(), to make sure we stop fetching input after
	 * each newline.
	 */
	int yy_is_interactive;

	/* Whether we're considered to be at the beginning of a line.
	 * If so, '^' rules will be active on the next match, otherwise
	 * not.
	 */
	int yy_at_bol;

	/* Whether to try to fill the input buffer when we reach the
	 * end of it.
	 */
	int yy_fill_buffer;

	int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
	/* When an EOF's been seen but there's still some text to process
	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
	 * shouldn't try reading from the input source any more.  We might
	 * still have a bunch of tokens to match, though, because of
	 * possible backing-up.
	 *
	 * When we actually see the EOF, we change the status to "new"
	 * (via yyrestart()), so that the user can continue scanning by
	 * just pointing yyin at a new input file.
	 */
#define YY_BUFFER_EOF_PENDING 2
	};

static YY_BUFFER_STATE yy_current_buffer = 0;

/* We provide macros for accessing buffer states in case in the
 * future we want to put the buffer states in a more general
 * "scanner state".
 */
#define YY_CURRENT_BUFFER yy_current_buffer


/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;

static int yy_n_chars;		/* number of characters read into yy_ch_buf */


int yyleng;

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

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

void yyrestart YY_PROTO(( FILE *input_file ));

void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
void yy_load_buffer_state YY_PROTO(( void ));
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )

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

static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
static void yy_flex_free YY_PROTO(( void * ));

#define yy_new_buffer yy_create_buffer

#define yy_set_interactive(is_interactive) \
	{ \
	if ( ! yy_current_buffer ) \
		yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
	yy_current_buffer->yy_is_interactive = is_interactive; \
	}

#define yy_set_bol(at_bol) \
	{ \
	if ( ! yy_current_buffer ) \
		yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
	yy_current_buffer->yy_at_bol = at_bol; \
	}

#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)

typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern char *yytext;
#define yytext_ptr yytext

static yy_state_type yy_get_previous_state YY_PROTO(( void ));
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
static int yy_get_next_buffer YY_PROTO(( void ));
static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up yytext.
 */
#define YY_DO_BEFORE_ACTION \
	yytext_ptr = yy_bp; \
	yyleng = (int) (yy_cp - yy_bp); \
	yy_hold_char = *yy_cp; \
	*yy_cp = '\0'; \
	yy_c_buf_p = yy_cp;

#define YY_NUM_RULES 112
#define YY_END_OF_BUFFER 113
static yyconst short int yy_accept[320] =
    {   0,
        0,    0,    0,    0,    0,    0,  113,  111,  110,    1,
       86,  111,    4,   92,   85,  111,   80,   81,   90,   89,
       77,   88,   84,   91,   46,   46,   78,   74,   93,   79,
       94,   97,   43,   82,   83,   95,   43,   43,   43,   43,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   75,   96,   76,   87,  103,  104,  102,  103,
      108,  109,  107,  108,    1,   73,    0,   51,    0,   58,
       68,   59,    0,    0,   56,   64,   54,   65,   55,   66,
        0,   49,    2,    3,   57,   50,   45,    0,   46,    0,
       46,   98,   63,   70,   72,   71,   62,   43,   60,   43,

       43,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   61,
       69,  100,  101,  105,  106,   47,   67,   99,    0,   49,
        3,   49,    0,   50,   45,    0,   48,   44,   53,   52,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   36,   43,   43,   43,   27,   43,   43,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   43,   43,   43,  101,  106,    0,   49,
        0,   49,    0,   50,   48,   44,    7,   34,   43,   43,

       43,   43,   43,   43,   13,   43,   43,   43,   43,   43,
       37,   43,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   43,   43,   43,   43,   43,   43,   42,
       43,    0,   49,   25,   14,   43,   43,   43,   43,   43,
       43,   40,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   35,   43,   43,   43,   43,   33,   43,   43,   12,
       43,   17,   43,   43,   26,   43,   43,   41,   43,    8,
       28,   23,   43,   43,   43,   43,   43,   32,   43,   38,
        5,   11,   43,   43,   43,   43,   43,   43,   43,   43,
       43,   22,   43,   43,   31,   43,   43,   43,   10,   43,

       43,   24,   43,   43,   43,   21,   43,   29,   43,    9,
       15,   16,   39,    6,   19,   20,   18,   30,    0
    } ;

static yyconst int yy_ec[256] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
        2,    2,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    2,    4,    5,    6,    1,    7,    8,    9,   10,
       11,   12,   13,   14,   15,   16,   17,   18,   19,   19,
       19,   19,   19,   19,   19,   19,   19,   20,   21,   22,
       23,   24,   25,    1,   26,   26,   26,   26,   27,   28,
       29,   29,   29,   29,   29,   30,   29,   29,   29,   29,
       29,   29,   29,   29,   31,   29,   29,   32,   29,   29,
       33,   34,   35,   36,   29,    1,   37,   38,   39,   40,

       41,   42,   43,   44,   45,   29,   29,   46,   47,   48,
       49,   50,   29,   51,   52,   53,   54,   55,   56,   57,
       58,   29,   59,   60,   61,   62,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1
    } ;

static yyconst int yy_meta[63] =
    {   0,
        1,    1,    2,    1,    1,    1,    1,    1,    3,    1,
        1,    1,    1,    1,    1,    1,    1,    4,    4,    1,
        1,    1,    1,    1,    1,    4,    4,    4,    5,    5,
        5,    5,    1,    1,    1,    1,    4,    4,    4,    4,
        4,    4,    5,    5,    5,    5,    5,    5,    5,    5,
        5,    5,    5,    5,    5,    5,    5,    5,    1,    1,
        1,    1
    } ;

static yyconst short int yy_base[330] =
    {   0,
        0,    0,   60,   61,   62,   66,  468,  469,  469,    0,
      444,   65,  469,  443,   63,  431,  469,  469,  441,   61,
      469,   58,   69,   77,   85,   79,  443,  469,   53,  439,
       67,  469,    0,  469,  469,  438,  406,   75,   81,   45,
       62,  411,  409,  403,   55,  406,   60,  414,   84,   91,
       86,   91,  469,   84,  469,  469,  469,  469,  469,  106,
      469,  469,  469,  129,    0,  469,  138,  469,  451,  469,
      469,  469,   71,  142,  469,  469,  469,  469,  469,  441,
      436,  129,  469,    0,  469,  135,  164,  171,  157,    0,
      182,  469,  428,  469,  469,  469,  427,    0,  469,  396,

      411,  410,  398,  399,  398,  389,  388,  102,  392,  395,
      114,  391,  385,  390,  380,  394,  119,  396,  390,  383,
      388,  141,  383,  378,  378,  121,  382,  375,  151,  469,
      469,  469,    0,  469,    0,  469,  469,  469,  189,  469,
        0,  197,  216,  469,  191,  201,  214,  216,  469,  469,
      376,  373,  371,  370,  380,  185,  382,  372,  372,  376,
      379,  374,  369,    0,  370,  375,  370,    0,  359,  354,
      355,  361,  361,  354,  356,  350,  348,  351,  351,  358,
      349,  352,  348,  342,  354,  356,    0,    0,  222,  231,
      239,  469,  245,  248,  469,  238,    0,    0,  340,  338,

      337,  332,  341,  341,    0,  341,  334,  331,  335,  334,
        0,  343,  328,  342,  341,  336,  331,  323,  321,  332,
      327,  332,  324,  313,  110,  320,  324,  323,  311,    0,
      311,  253,  261,    0,    0,  322,  312,  311,  319,  320,
      310,    0,  317,  315,  309,  304,  300,  299,  312,  311,
      293,    0,  301,  297,  277,  282,    0,  265,  268,    0,
      256,    0,  265,  256,    0,  251,  250,    0,  253,    0,
        0,    0,  256,  259,  246,  252,  235,    0,  246,    0,
        0,    0,  233,  243,  236,  241,  235,  229,  223,  214,
      202,    0,  214,  200,    0,  207,  166,  173,    0,  165,

      159,    0,  152,  132,  126,    0,  133,    0,  129,    0,
        0,    0,    0,    0,    0,    0,    0,    0,  469,  307,
      312,  317,  322,  327,  329,  334,  157,  339,  344
    } ;

static yyconst short int yy_def[330] =
    {   0,
      319,    1,  320,  320,  321,  321,  319,  319,  319,  322,
      319,  323,  319,  319,  319,  324,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  325,  319,  319,  319,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  322,  319,  323,  319,  323,  319,
      319,  319,  324,  324,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  326,  319,  319,  319,  319,  319,  327,
      319,  319,  319,  319,  319,  319,  319,  325,  319,  325,

      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  319,
      319,  319,  328,  319,  329,  319,  319,  319,  319,  319,
      326,  319,  319,  319,  319,  319,  319,  327,  319,  319,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  328,  329,  319,  319,
      319,  319,  319,  319,  319,  319,  325,  325,  325,  325,

      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  319,  319,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,

      325,  325,  325,  325,  325,  325,  325,  325,  325,  325,
      325,  325,  325,  325,  325,  325,  325,  325,    0,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319
    } ;

static yyconst short int yy_nxt[532] =
    {   0,
        8,    9,   10,   11,   12,   13,   14,   15,   16,   17,
       18,   19,   20,   21,   22,   23,   24,   25,   26,   27,
       28,   29,   30,   31,   32,   33,   33,   33,   33,   33,
       33,   33,   34,    8,   35,   36,   37,   33,   38,   39,
       40,   41,   33,   33,   42,   43,   44,   45,   46,   47,
       48,   49,   50,   51,   52,   33,   33,   33,   53,   54,
       55,   56,   58,   58,   62,   59,   59,   63,   62,   68,
       71,   63,   78,   76,   93,   94,   60,   60,   64,  136,
       79,   80,   64,   77,   81,   72,   82,   82,   83,   96,
       97,  114,  107,   84,   86,  115,   91,   91,   69,   85,

       86,  108,   87,   87,   74,   88,  130,  109,   89,   89,
      117,   88,  110,  118,   89,   89,   90,  132,  101,   88,
      102,  104,  133,  103,   89,   88,  105,  120,  121,  106,
       89,  123,   89,  126,  124,  128,  122,  127,   89,  129,
      134,   90,   68,  131,  319,  135,   82,   82,  125,  258,
       73,  159,  142,  142,  160,  139,  140,  259,  140,  163,
      148,  143,  144,  170,  144,  181,  164,  171,  318,  139,
      140,   69,  182,  317,  140,  143,  144,  176,  316,   86,
      144,   87,   87,  146,  315,  146,   89,   89,  147,  147,
       88,  177,  314,  145,  145,  185,  186,   86,  313,   91,

       91,  189,   89,  189,   88,  312,  190,  190,   88,  145,
       89,   89,   89,  311,  142,  142,  310,  145,  147,  147,
      145,  145,   88,  191,  192,  202,  192,   89,  193,  203,
      193,  147,  147,  194,  194,   89,  145,  191,  192,  190,
      190,  195,  192,  195,  145,  196,  196,  309,  190,  190,
      308,  232,  307,  232,  306,  195,  233,  233,  140,  195,
      140,  196,  194,  194,  305,  194,  194,  196,  196,  196,
      233,  233,  140,  304,  303,  144,  140,  144,  233,  233,
      302,  301,  300,  196,  299,  298,  297,  296,  192,  144,
      192,  196,  295,  144,  294,  293,  292,  291,  290,  289,

      288,  287,  192,  286,  285,  284,  192,   57,   57,   57,
       57,   57,   61,   61,   61,   61,   61,   65,  283,   65,
       65,   65,   67,   67,   67,   67,   67,   73,   73,  282,
       73,   73,   98,   98,  141,  281,  141,  141,  141,  187,
      280,  187,  187,  187,  188,  279,  188,  188,  188,  278,
      277,  276,  275,  274,  273,  272,  271,  270,  269,  268,
      267,  266,  265,  264,  263,  262,  261,  260,  257,  256,
      255,  254,  253,  252,  251,  250,  249,  248,  247,  246,
      245,  244,  243,  242,  241,  240,  239,  238,  237,  236,
      235,  234,  231,  230,  229,  228,  227,  226,  225,  224,

      223,  222,  221,  220,  219,  218,  217,  216,  215,  214,
      213,  212,  211,  210,  209,  208,  207,  206,  205,  204,
      201,  200,  199,  198,  197,  184,  183,  180,  179,  178,
      175,  174,  173,  172,  169,  168,  167,  166,  165,  162,
      161,  158,  157,  156,  155,  154,  153,  152,  151,  150,
      149,  138,  137,  319,  119,  116,  113,  112,  111,  100,
       99,   95,   92,   75,   74,   70,   66,  319,    7,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,

      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319
    } ;

static yyconst short int yy_chk[532] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    3,    4,    5,    3,    4,    5,    6,   12,
       15,    6,   22,   20,   29,   29,    3,    4,    5,   73,
       22,   22,    6,   20,   23,   15,   23,   23,   24,   31,
       31,   45,   40,   24,   26,   45,   26,   26,   12,   24,

       25,   40,   25,   25,   73,   26,   54,   41,   26,   26,
       47,   25,   41,   47,   25,   25,   25,   60,   38,   26,
       38,   39,   60,   38,   26,   25,   39,   49,   49,   39,
       25,   50,   26,   51,   50,   52,   49,   51,   25,   52,
       64,   25,   67,   54,   74,   64,   82,   82,   50,  225,
       74,  108,   86,   86,  108,   82,   82,  225,   82,  111,
      327,   86,   86,  117,   86,  126,  111,  117,  309,   82,
       82,   67,  126,  307,   82,   86,   86,  122,  305,   87,
       86,   87,   87,   88,  304,   88,   89,   89,   88,   88,
       87,  122,  303,   87,   87,  129,  129,   91,  301,   91,

       91,  139,   89,  139,   87,  300,  139,  139,   91,   87,
       89,   91,   91,  298,  142,  142,  297,   87,  146,  146,
      145,  145,   91,  142,  142,  156,  142,   91,  143,  156,
      143,  147,  147,  143,  143,   91,  145,  142,  142,  189,
      189,  147,  142,  147,  145,  148,  148,  296,  190,  190,
      294,  191,  293,  191,  291,  147,  191,  191,  190,  147,
      190,  148,  193,  193,  290,  194,  194,  196,  196,  148,
      232,  232,  190,  289,  288,  194,  190,  194,  233,  233,
      287,  286,  285,  196,  284,  283,  279,  277,  233,  194,
      233,  196,  276,  194,  275,  274,  273,  269,  267,  266,

      264,  263,  233,  261,  259,  258,  233,  320,  320,  320,
      320,  320,  321,  321,  321,  321,  321,  322,  256,  322,
      322,  322,  323,  323,  323,  323,  323,  324,  324,  255,
      324,  324,  325,  325,  326,  254,  326,  326,  326,  328,
      253,  328,  328,  328,  329,  251,  329,  329,  329,  250,
      249,  248,  247,  246,  245,  244,  243,  241,  240,  239,
      238,  237,  236,  231,  229,  228,  227,  226,  224,  223,
      222,  221,  220,  219,  218,  217,  216,  215,  214,  213,
      212,  210,  209,  208,  207,  206,  204,  203,  202,  201,
      200,  199,  186,  185,  184,  183,  182,  181,  180,  179,

      178,  177,  176,  175,  174,  173,  172,  171,  170,  169,
      167,  166,  165,  163,  162,  161,  160,  159,  158,  157,
      155,  154,  153,  152,  151,  128,  127,  125,  124,  123,
      121,  120,  119,  118,  116,  115,  114,  113,  112,  110,
      109,  107,  106,  105,  104,  103,  102,  101,  100,   97,
       93,   81,   80,   69,   48,   46,   44,   43,   42,   37,
       36,   30,   27,   19,   16,   14,   11,    7,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,

      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319,  319,  319,  319,  319,  319,  319,  319,  319,  319,
      319
    } ;

static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;

/* The intent behind this definition is that it'll catch
 * any uses of REJECT which flex missed.
 */
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "lexer.l"
#define INITIAL 0
#line 2 "lexer.l"
/*
 *  FILE: lexer.l
 *  AUTH: Michael John Radwin <mjr@acm.org>
 *
 *  DESC: stubgen lexer.  Portions borrowed from Newcastle
 *  University's Arjuna project (http://arjuna.ncl.ac.uk/), and
 *  Jeff Lee's ANSI Grammar
 *  (ftp://ftp.uu.net/usenet/net.sources/ansi.c.grammar.Z)
 *
 *  DATE: Thu Aug 15 13:10:06 EDT 1996
 *   $Id: lex.yy.c,v 1.1 2002-09-21 14:12:12 ocoursiere Exp $
 *
 *  Copyright (c) 1996-1998  Michael John Radwin
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *  Modification history:
 *  $Log: not supported by cvs2svn $
 *  Revision 1.1  2001/11/07 10:06:07  ithamar
 *  Added stubgen to CVS
 *
 *  Revision 1.33  1998/07/27 19:16:57  mradwin
 *  added some c++ keywords
 *  need to handle typename, using, and namespace
 *
 *  Revision 1.32  1998/05/11 19:49:11  mradwin
 *  Version 2.03 (updated copyright information).
 *
 *  Revision 1.31  1998/04/07 23:39:55  mradwin
 *  changed error-handling code significantly.  functions
 *  like count() are now contributing to linebuf so we get correct
 *  parse error messages during lineno == 1 and other situations.
 *  also, instead of calling fatal() for collect*() functions,
 *  we return -1 and let the parser recover more gracefully.
 *
 *  Revision 1.30  1998/01/12 19:39:11  mradwin
 *  modified rcsid
 *
 *  Revision 1.29  1997/11/13 22:37:31  mradwin
 *  changed char[] to char * to make non-gcc compilers
 *  a little happier.  We need to #define const to nothing
 *  for other compilers as well.
 *
 *  Revision 1.28  1997/11/13 21:29:30  mradwin
 *  moved code from parser.y to main.c
 *
 *  Revision 1.27  1997/11/13 21:10:17  mradwin
 *  renamed stubgen.[ly] to parser.y lexer.l
 *
 *  Revision 1.26  1997/11/11 03:52:06  mradwin
 *  changed fatal()
 *
 *  Revision 1.25  1997/11/05 03:02:02  mradwin
 *  Modified logging routines.
 *
 *  Revision 1.24  1997/11/01 23:12:43  mradwin
 *  greatly improved error-recovery.  errors no longer spill over
 *  into other files because the yyerror state is properly reset.
 *
 *  Revision 1.23  1997/10/26 23:16:32  mradwin
 *  changed inform_user and fatal functions to use varargs
 *
 *  Revision 1.22  1997/10/26 22:46:48  mradwin
 *  support macros within comments, etc.
 *
 *  Revision 1.21  1997/10/16 19:42:48  mradwin
 *  added support for elipses, static member/array initializers,
 *  and bitfields.
 *
 *  Revision 1.20  1997/10/16 17:36:06  mradwin
 *  Fixed compiler warning on win32 from <ctype.h> and isspace()
 *
 *  Revision 1.19  1997/10/16 17:12:59  mradwin
 *  handle extern "C" blocks better now, and support multi-line
 *  macros.  still need error-checking.
 *
 *  Revision 1.18  1997/10/15 22:09:06  mradwin
 *  changed tons of names.  stubelem -> sytaxelem,
 *  stubin -> infile, stubout -> outfile, stublog -> logfile.
 *
 *  Revision 1.17  1997/10/15 21:45:13  mradwin
 *  rearranged table.[ch] and util.[ch] so that util pkg
 *  knows nothing about syntaxelems.
 *
 *  Revision 1.16  1997/10/15 17:42:37  mradwin
 *  added support for 'extern "C" { ... }' blocks.
 *
 *  Revision 1.15  1997/09/05 19:17:06  mradwin
 *  works for scanning old versions, except for parameter
 *  names that differ between .H and .C files.
 *
 *  Revision 1.14  1997/09/05 16:37:41  mradwin
 *  rcsid
 *
 *  Revision 1.13  1997/09/05 16:34:36  mradwin
 *  GPL-ized code.
 *
 *  Revision 1.12  1997/09/05 16:13:18  mradwin
 *  changed email address to acm.org
 *
 *  Revision 1.11  1996/09/12 14:44:49  mjr
 *  Added throw decl recognition (great, another 4 bytes in syntaxelem)
 *  and cleaned up the grammar so that const_opt appears in far fewer
 *  places.  const_opt is by default 0 as well, so we don't need to
 *  pass it as an arg to new_elem().
 *
 *  I also added a fix to a potential bug with the MINIT and INLIN
 *  exclusive start states.  I think they could have been confused
 *  by braces within comments, so now I'm grabbing comments in those
 *  states as well.
 *
 *  Revision 1.10  1996/09/12 03:46:10  mjr
 *  No concrete changes in code.  Just added some sanity by
 *  factoring out code into util.[ch] and putting some prototypes
 *  that were in table.h into stubgen.y where they belong.
 *
 *  Revision 1.9  1996/09/01 20:59:48  mjr
 *  Added collectMemberInitList() function, which is similar
 *  to collectInlineDef() and also the exclusive state MINIT
 *
 *  Revision 1.8  1996/08/23 05:09:19  mjr
 *  fixed up some more portability things
 *
 *  Revision 1.7  1996/08/22 02:43:47  mjr
 *  added parse error message (using O'Reilly p. 274)
 *
 *  Revision 1.6  1996/08/21 18:33:50  mjr
 *  removed the buffer for inlines.  we don't care anyway.
 *  now we can't overflow on inlines!
 *
 *  Revision 1.5  1996/08/21 17:40:56  mjr
 *  added some cpp directives for porting to WIN32
 *
 *  Revision 1.4  1996/08/19 17:01:33  mjr
 *  no echo now
 *
 *  Revision 1.3  1996/08/15 21:24:58  mjr
 *  *** empty log message ***
 */
#line 163 "lexer.l"
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include "table.h"
#include "util.h"

#ifdef WIN32
/* definitions of exit, malloc, realloc, and free */
#include <stdlib.h>
#endif

#if 0 /* #ifdef WIN32 */
#include "y_tab.h"
#else
#include "y.tab.h"
#endif

#ifdef __cplusplus
#define STUB_INPUT() yyinput()
#else
#define STUB_INPUT() input()
#endif

/* when we return a string, duplicate it so we can free it later.
   we always allocate memory so we can uniformly free() it. */
#define RETURN_STR(x) tokens_seen++; yylval.string = strdup(yytext); return(x)

/* make that nasty union a value that will bus error if we misinterpret
   the value as a pointer */
#define RETURN_VAL(x) tokens_seen++; yylval.flag = 37; return(x)

static const char rcsid[] = "$Id: lex.yy.c,v 1.1 2002-09-21 14:12:12 ocoursiere Exp $";

static void count();
static void comment();
static void macro();

char linebuf[1024]; /* null-terminated at beginning of each file */
int lineno;         /* set to 1        at beginning of each file */
int column;         /* set to 0        at beginning of each file */
int tokens_seen;    /* set to 0        at beginning of each file */

#define INLIN 1
#define MINIT 2

#line 787 "lex.yy.c"

/* Macros after this point can all be overridden by user definitions in
 * section 1.
 */

#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap YY_PROTO(( void ));
#else
extern int yywrap YY_PROTO(( void ));
#endif
#endif

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

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

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
#endif

#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput YY_PROTO(( void ));
#else
static int input YY_PROTO(( void ));
#endif
#endif

#if YY_STACK_USED
static int yy_start_stack_ptr = 0;
static int yy_start_stack_depth = 0;
static int *yy_start_stack = 0;
#ifndef YY_NO_PUSH_STATE
static void yy_push_state YY_PROTO(( int new_state ));
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state YY_PROTO(( void ));
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state YY_PROTO(( void ));
#endif

#else
#define YY_NO_PUSH_STATE 1
#define YY_NO_POP_STATE 1
#define YY_NO_TOP_STATE 1
#endif

#ifdef YY_MALLOC_DECL
YY_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include <stdlib.h>
#endif
#else
/* Just try to get by without declaring the routines.  This will fail
 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
 * or sizeof(void*) != sizeof(int).
 */
#endif
#endif

/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif

/* Copy whatever the last rule matched to the standard output. */

#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
 * we now use fwrite().
 */
#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
#endif

/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
 * is returned in "result".
 */
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
	if ( yy_current_buffer->yy_is_interactive ) \
		{ \
		int c = '*', n; \
		for ( n = 0; n < max_size && \
			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
			buf[n] = (char) c; \
		if ( c == '\n' ) \
			buf[n++] = (char) c; \
		if ( c == EOF && ferror( yyin ) ) \
			YY_FATAL_ERROR( "input in flex scanner failed" ); \
		result = n; \
		} \
	else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
		  && ferror( yyin ) ) \
		YY_FATAL_ERROR( "input in flex scanner failed" );
#endif

/* No semi-colon after return; correct usage is to write "yyterminate();" -
 * we don't want an extra ';' after the "return" because that will cause
 * some compilers to complain about unreachable statements.
 */
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif

/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif

/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif

/* Default declaration of generated scanner - a define so the user can
 * easily add parameters.
 */
#ifndef YY_DECL
#define YY_DECL int yylex YY_PROTO(( void ))
#endif

/* Code executed at the beginning of each rule, after yytext and yyleng
 * have been set up.
 */
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif

/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif

#define YY_RULE_SETUP \
	YY_USER_ACTION

YY_DECL
	{
	register yy_state_type yy_current_state;
	register char *yy_cp, *yy_bp;
	register int yy_act;

#line 208 "lexer.l"

#line 940 "lex.yy.c"

	if ( yy_init )
		{
		yy_init = 0;

#ifdef YY_USER_INIT
		YY_USER_INIT;
#endif

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

		if ( ! yyin )
			yyin = stdin;

		if ( ! yyout )
			yyout = stdout;

		if ( ! yy_current_buffer )
			yy_current_buffer =
				yy_create_buffer( yyin, YY_BUF_SIZE );

		yy_load_buffer_state();
		}

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

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

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

		yy_current_state = yy_start;
yy_match:
		do
			{
			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
			if ( yy_accept[yy_current_state] )
				{
				yy_last_accepting_state = yy_current_state;
				yy_last_accepting_cpos = yy_cp;
				}
			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
				{
				yy_current_state = (int) yy_def[yy_current_state];
				if ( yy_current_state >= 320 )
					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] != 469 );

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 209 "lexer.l"
{ /* 
                           * for debugging purposes, we grab an entire
                           * line and buffer it, then grab tokens out of
                           * it.  This lets us have more informative
                           * error messages.  See yyerror() in parser.y
                           */
                          strncpy(linebuf, yytext+1, 1024);
			  lineno++;
			  column = 0;
			  yyless(1); /* give back everything but \n */
			}
	YY_BREAK
case 2:
YY_RULE_SETUP
#line 220 "lexer.l"
{ comment(); }
	YY_BREAK
case 3:
YY_RULE_SETUP
#line 222 "lexer.l"
{ count(); }
	YY_BREAK
case 4:
YY_RULE_SETUP
#line 223 "lexer.l"
{ macro(); /* was #.* { count(); } */ }
	YY_BREAK
case 5:
YY_RULE_SETUP
#line 225 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 6:
YY_RULE_SETUP
#line 226 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 7:
YY_RULE_SETUP
#line 227 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 8:
YY_RULE_SETUP
#line 228 "lexer.l"
{ count(); RETURN_VAL(EXTERN); }
	YY_BREAK
case 9:
YY_RULE_SETUP
#line 229 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 10:
YY_RULE_SETUP
#line 230 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 11:
YY_RULE_SETUP
#line 231 "lexer.l"
{ count(); RETURN_VAL(STRUCT); }
	YY_BREAK
case 12:
YY_RULE_SETUP
#line 232 "lexer.l"
{ count(); RETURN_VAL(UNION); }
	YY_BREAK
case 13:
YY_RULE_SETUP
#line 233 "lexer.l"
{ count(); RETURN_VAL(ENUM); }
	YY_BREAK
case 14:
YY_RULE_SETUP
#line 234 "lexer.l"
{ count(); RETURN_VAL(CONST); }
	YY_BREAK
case 15:
YY_RULE_SETUP
#line 235 "lexer.l"
{ count(); RETURN_VAL(TEMPLATE); }
	YY_BREAK
case 16:
YY_RULE_SETUP
#line 237 "lexer.l"
{ count(); tokens_seen++; /* FIXME */ }
	YY_BREAK
case 17:
YY_RULE_SETUP
#line 238 "lexer.l"
{ count(); tokens_seen++; /* FIXME */ }
	YY_BREAK
case 18:
YY_RULE_SETUP
#line 239 "lexer.l"
{ count(); RETURN_VAL(CLASS); /* FIXME */ }
	YY_BREAK
case 19:
YY_RULE_SETUP
#line 241 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 20:
YY_RULE_SETUP
#line 242 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 21:
YY_RULE_SETUP
#line 244 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 22:
YY_RULE_SETUP
#line 245 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 23:
YY_RULE_SETUP
#line 246 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 24:
YY_RULE_SETUP
#line 247 "lexer.l"
{ count(); tokens_seen++; }
	YY_BREAK
case 25:
YY_RULE_SETUP
#line 248 "lexer.l"
{ count(); RETURN_VAL(CLASS); }
	YY_BREAK
case 26:
YY_RULE_SETUP
#line 249 "lexer.l"
{ count(); RETURN_VAL(DELETE); }
	YY_BREAK
case 27:
YY_RULE_SETUP
#line 250 "lexer.l"
{ count(); RETURN_VAL(NEW); }
	YY_BREAK
case 28:
YY_RULE_SETUP
#line 251 "lexer.l"
{ count(); RETURN_VAL(FRIEND); }
	YY_BREAK
case 29:
YY_RULE_SETUP
#line 252 "lexer.l"
{ count(); RETURN_VAL(OPERATOR); }
	YY_BREAK
case 30:
YY_RULE_SETUP
#line 253 "lexer.l"
{ count(); RETURN_VAL(PROTECTED); }
	YY_BREAK
case 31:
YY_RULE_SETUP
#line 254 "lexer.l"
{ count(); RETURN_VAL(PRIVATE); }
	YY_BREAK
case 32:
YY_RULE_SETUP
#line 255 "lexer.l"
{ count(); RETURN_VAL(PUBLIC); }
	YY_BREAK
case 33:
YY_RULE_SETUP
#line 256 "lexer.l"
{ count(); RETURN_VAL(THROW); }
	YY_BREAK
case 34:
YY_RULE_SETUP
#line 258 "lexer.l"
{ count(); RETURN_STR(CHAR); }
	YY_BREAK
case 35:
YY_RULE_SETUP
#line 259 "lexer.l"
{ count(); RETURN_STR(SHORT); }
	YY_BREAK
case 36:
YY_RULE_SETUP
#line 260 "lexer.l"
{ count(); RETURN_STR(INT); }
	YY_BREAK
case 37:
YY_RULE_SETUP
#line 261 "lexer.l"
{ count(); RETURN_STR(LONG); }
	YY_BREAK
case 38:
YY_RULE_SETUP
#line 262 "lexer.l"
{ count(); RETURN_STR(SIGNED); }
	YY_BREAK
case 39:
YY_RULE_SETUP
#line 263 "lexer.l"
{ count(); RETURN_STR(UNSIGNED); }
	YY_BREAK
case 40:
YY_RULE_SETUP
#line 264 "lexer.l"
{ count(); RETURN_STR(FLOAT); }
	YY_BREAK
case 41:
YY_RULE_SETUP
#line 265 "lexer.l"
{ count(); RETURN_STR(DOUBLE); }
	YY_BREAK
case 42:
YY_RULE_SETUP
#line 266 "lexer.l"
{ count(); RETURN_STR(VOID); }
	YY_BREAK
case 43:
YY_RULE_SETUP
#line 268 "lexer.l"
{ count(); RETURN_STR(IDENTIFIER); }
	YY_BREAK
case 44:
YY_RULE_SETUP
#line 270 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 45:
YY_RULE_SETUP
#line 271 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 46:
YY_RULE_SETUP
#line 272 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 47:
YY_RULE_SETUP
#line 273 "lexer.l"
{ count(); RETURN_STR(CONSTANT); /* 'fontlck */ }
	YY_BREAK
case 48:
YY_RULE_SETUP
#line 275 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 49:
YY_RULE_SETUP
#line 276 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 50:
YY_RULE_SETUP
#line 277 "lexer.l"
{ count(); RETURN_STR(CONSTANT); }
	YY_BREAK
case 51:
YY_RULE_SETUP
#line 279 "lexer.l"
{ count(); RETURN_STR(STRING_LITERAL); /* "fontlck */ }
	YY_BREAK
case 52:
YY_RULE_SETUP
#line 281 "lexer.l"
{ count(); RETURN_VAL(RIGHT_ASSIGN); }
	YY_BREAK
case 53:
YY_RULE_SETUP
#line 282 "lexer.l"
{ count(); RETURN_VAL(LEFT_ASSIGN); }
	YY_BREAK
case 54:
YY_RULE_SETUP
#line 283 "lexer.l"
{ count(); RETURN_VAL(ADD_ASSIGN); }
	YY_BREAK
case 55:
YY_RULE_SETUP
#line 284 "lexer.l"
{ count(); RETURN_VAL(SUB_ASSIGN); }
	YY_BREAK
case 56:
YY_RULE_SETUP
#line 285 "lexer.l"
{ count(); RETURN_VAL(MUL_ASSIGN); }
	YY_BREAK
case 57:
YY_RULE_SETUP
#line 286 "lexer.l"
{ count(); RETURN_VAL(DIV_ASSIGN); }
	YY_BREAK
case 58:
YY_RULE_SETUP
#line 287 "lexer.l"
{ count(); RETURN_VAL(MOD_ASSIGN); }
	YY_BREAK
case 59:
YY_RULE_SETUP
#line 288 "lexer.l"
{ count(); RETURN_VAL(AND_ASSIGN); }
	YY_BREAK
case 60:
YY_RULE_SETUP
#line 289 "lexer.l"
{ count(); RETURN_VAL(XOR_ASSIGN); }
	YY_BREAK
case 61:
YY_RULE_SETUP
#line 290 "lexer.l"
{ count(); RETURN_VAL(OR_ASSIGN); }
	YY_BREAK
case 62:
YY_RULE_SETUP
#line 291 "lexer.l"
{ count(); RETURN_VAL(RIGHT_OP); }
	YY_BREAK
case 63:
YY_RULE_SETUP
#line 292 "lexer.l"
{ count(); RETURN_VAL(LEFT_OP); }
	YY_BREAK
case 64:
YY_RULE_SETUP
#line 293 "lexer.l"
{ count(); RETURN_VAL(INC_OP); }
	YY_BREAK
case 65:
YY_RULE_SETUP
#line 294 "lexer.l"
{ count(); RETURN_VAL(DEC_OP); }
	YY_BREAK
case 66:
YY_RULE_SETUP
#line 295 "lexer.l"
{ count(); RETURN_VAL(PTR_OP); }
	YY_BREAK
case 67:
YY_RULE_SETUP
#line 296 "lexer.l"
{ count(); RETURN_VAL(MEM_PTR_OP); }
	YY_BREAK
case 68:
YY_RULE_SETUP
#line 297 "lexer.l"
{ count(); RETURN_VAL(AND_OP); }
	YY_BREAK
case 69:
YY_RULE_SETUP
#line 298 "lexer.l"
{ count(); RETURN_VAL(OR_OP); }
	YY_BREAK
case 70:
YY_RULE_SETUP
#line 299 "lexer.l"
{ count(); RETURN_VAL(LE_OP); }
	YY_BREAK
case 71:
YY_RULE_SETUP
#line 300 "lexer.l"
{ count(); RETURN_VAL(GE_OP); }
	YY_BREAK
case 72:
YY_RULE_SETUP
#line 301 "lexer.l"
{ count(); RETURN_VAL(EQ_OP); }
	YY_BREAK
case 73:
YY_RULE_SETUP
#line 302 "lexer.l"
{ count(); RETURN_VAL(NE_OP); }
	YY_BREAK
case 74:
YY_RULE_SETUP
#line 303 "lexer.l"
{ count(); RETURN_VAL(';'); }
	YY_BREAK
case 75:
YY_RULE_SETUP
#line 304 "lexer.l"
{ count(); RETURN_VAL('{'); }
	YY_BREAK
case 76:
YY_RULE_SETUP
#line 305 "lexer.l"
{ count(); RETURN_VAL('}'); }
	YY_BREAK
case 77:
YY_RULE_SETUP
#line 306 "lexer.l"
{ count(); RETURN_VAL(','); }
	YY_BREAK
case 78:
YY_RULE_SETUP
#line 307 "lexer.l"
{ count(); RETURN_VAL(':'); }
	YY_BREAK
case 79:
YY_RULE_SETUP
#line 308 "lexer.l"
{ count(); RETURN_VAL('='); }
	YY_BREAK
case 80:
YY_RULE_SETUP
#line 309 "lexer.l"
{ count(); RETURN_VAL('('); }
	YY_BREAK
case 81:
YY_RULE_SETUP
#line 310 "lexer.l"
{ count(); RETURN_VAL(')'); }
	YY_BREAK
case 82:
YY_RULE_SETUP
#line 311 "lexer.l"
{ count(); RETURN_VAL('['); }
	YY_BREAK
case 83:
YY_RULE_SETUP
#line 312 "lexer.l"
{ count(); RETURN_VAL(']'); }
	YY_BREAK
case 84:
YY_RULE_SETUP
#line 313 "lexer.l"
{ count(); RETURN_VAL('.'); }
	YY_BREAK
case 85:
YY_RULE_SETUP
#line 314 "lexer.l"
{ count(); RETURN_VAL('&'); }
	YY_BREAK
case 86:
YY_RULE_SETUP
#line 315 "lexer.l"
{ count(); RETURN_VAL('!'); }
	YY_BREAK
case 87:
YY_RULE_SETUP
#line 316 "lexer.l"
{ count(); RETURN_VAL('~'); }
	YY_BREAK
case 88:
YY_RULE_SETUP
#line 317 "lexer.l"
{ count(); RETURN_VAL('-'); }
	YY_BREAK
case 89:
YY_RULE_SETUP
#line 318 "lexer.l"
{ count(); RETURN_VAL('+'); }
	YY_BREAK
case 90:
YY_RULE_SETUP
#line 319 "lexer.l"
{ count(); RETURN_VAL('*'); }
	YY_BREAK
case 91:
YY_RULE_SETUP
#line 320 "lexer.l"
{ count(); RETURN_VAL('/'); }
	YY_BREAK
case 92:
YY_RULE_SETUP
#line 321 "lexer.l"
{ count(); RETURN_VAL('%'); }
	YY_BREAK
case 93:
YY_RULE_SETUP
#line 322 "lexer.l"
{ count(); RETURN_VAL('<'); }
	YY_BREAK
case 94:
YY_RULE_SETUP
#line 323 "lexer.l"
{ count(); RETURN_VAL('>'); }
	YY_BREAK
case 95:
YY_RULE_SETUP
#line 324 "lexer.l"
{ count(); RETURN_VAL('^'); }
	YY_BREAK
case 96:
YY_RULE_SETUP
#line 325 "lexer.l"
{ count(); RETURN_VAL('|'); }
	YY_BREAK
case 97:
YY_RULE_SETUP
#line 326 "lexer.l"
{ count(); RETURN_VAL('?'); }
	YY_BREAK
case 98:
YY_RULE_SETUP
#line 327 "lexer.l"
{ count(); RETURN_VAL(CLCL); }
	YY_BREAK
case 99:
YY_RULE_SETUP
#line 328 "lexer.l"
{ count(); RETURN_VAL(ELIPSIS); }
	YY_BREAK
case 100:
YY_RULE_SETUP
#line 330 "lexer.l"
{ comment(); }
	YY_BREAK
case 101:
YY_RULE_SETUP
#line 331 "lexer.l"
{ count(); }
	YY_BREAK
case 102:
YY_RULE_SETUP
#line 332 "lexer.l"
{ macro(); /* was #.* { count(); } */ }
	YY_BREAK
case 103:
#line 334 "lexer.l"
case 104:
YY_RULE_SETUP
#line 334 "lexer.l"
{ RETURN_VAL((int) yytext[0]); }
	YY_BREAK
case 105:
YY_RULE_SETUP
#line 336 "lexer.l"
{ comment(); }
	YY_BREAK
case 106:
YY_RULE_SETUP
#line 337 "lexer.l"
{ count(); }
	YY_BREAK
case 107:
YY_RULE_SETUP
#line 338 "lexer.l"
{ macro(); /* was #.* { count(); } */ }
	YY_BREAK
case 108:
#line 340 "lexer.l"
case 109:
YY_RULE_SETUP
#line 340 "lexer.l"
{ RETURN_VAL((int) yytext[0]); }
	YY_BREAK
case 110:
YY_RULE_SETUP
#line 342 "lexer.l"
{ count(); }
	YY_BREAK
case 111:
YY_RULE_SETUP
#line 343 "lexer.l"
{ count(); /* ignore bad characters */ }
	YY_BREAK
case 112:
YY_RULE_SETUP
#line 345 "lexer.l"
ECHO;
	YY_BREAK
#line 1587 "lex.yy.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(INLIN):
case YY_STATE_EOF(MINIT):
	yyterminate();

	case YY_END_OF_BUFFER:
		{
		/* Amount of text matched not including the EOB char. */
		int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;

		/* Undo the effects of YY_DO_BEFORE_ACTION. */
		*yy_cp = yy_hold_char;
		YY_RESTORE_YY_MORE_OFFSET

		if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
			{
			/* We're scanning a new file or input source.  It's
			 * possible that this happened because the user
			 * just pointed yyin at a new source and called
			 * yylex().  If so, then we have to assure
			 * consistency between yy_current_buffer and our
			 * globals.  Here is the right place to do so, because
			 * this is the first action (other than possibly a
			 * back-up) that will match for the new input source.
			 */
			yy_n_chars = yy_current_buffer->yy_n_chars;
			yy_current_buffer->yy_input_file = yyin;
			yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
			}

		/* Note that here we test for yy_c_buf_p "<=" to the position
		 * of the first EOB in the buffer, since yy_c_buf_p will
		 * already have been incremented past the NUL character
		 * (since all states make transitions on EOB to the
		 * end-of-buffer state).  Contrast this with the test
		 * in input().
		 */
		if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
			{ /* This was really a NUL. */
			yy_state_type yy_next_state;

			yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;

			yy_current_state = yy_get_previous_state();

			/* Okay, we're now positioned to make the NUL
			 * transition.  We couldn't have
			 * yy_get_previous_state() go ahead and do it
			 * for us because it doesn't know how to deal
			 * with the possibility of jamming (and we don't
			 * want to build jamming into it because then it
			 * will run more slowly).
			 */

			yy_next_state = yy_try_NUL_trans( yy_current_state );

			yy_bp = yytext_ptr + YY_MORE_ADJ;

			if ( yy_next_state )
				{
				/* Consume the NUL. */
				yy_cp = ++yy_c_buf_p;
				yy_current_state = yy_next_state;
				goto yy_match;
				}

			else
				{
				yy_cp = yy_c_buf_p;
				goto yy_find_action;
				}
			}

		else switch ( yy_get_next_buffer() )
			{
			case EOB_ACT_END_OF_FILE:
				{
				yy_did_buffer_switch_on_eof = 0;

				if ( yywrap() )
					{
					/* Note: because we've taken care in
					 * yy_get_next_buffer() to have set up
					 * yytext, we can now set up
					 * yy_c_buf_p so that if some total
					 * hoser (like flex itself) wants to
					 * call the scanner after we return the
					 * YY_NULL, it'll still work - another
					 * YY_NULL will get returned.
					 */
					yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;

					yy_act = YY_STATE_EOF(YY_START);
					goto do_action;
					}

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

			case EOB_ACT_CONTINUE_SCAN:
				yy_c_buf_p =
					yytext_ptr + yy_amount_of_matched_text;

				yy_current_state = yy_get_previous_state();

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

			case EOB_ACT_LAST_MATCH:
				yy_c_buf_p =
				&yy_current_buffer->yy_ch_buf[yy_n_chars];

				yy_current_state = yy_get_previous_state();

				yy_cp = yy_c_buf_p;
				yy_bp = yytext_ptr + YY_MORE_ADJ;
				goto yy_find_action;
			}
		break;
		}

	default:
		YY_FATAL_ERROR(
			"fatal flex scanner internal error--no action found" );
	} /* end of action switch */
		} /* end of scanning one token */
	} /* end of yylex */


/* yy_get_next_buffer - try to read in a new buffer
 *
 * Returns a code representing an action:
 *	EOB_ACT_LAST_MATCH -
 *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
 *	EOB_ACT_END_OF_FILE - end of file
 */

static int yy_get_next_buffer()
	{
	register char *dest = yy_current_buffer->yy_ch_buf;
	register char *source = yytext_ptr;
	register int number_to_move, i;
	int ret_val;

	if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
		YY_FATAL_ERROR(
		"fatal flex scanner internal error--end of buffer missed" );

	if ( yy_current_buffer->yy_fill_buffer == 0 )
		{ /* Don't try to fill the buffer, so this is an EOF. */
		if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
			{
			/* We matched a single character, the EOB, so
			 * treat this as a final EOF.
			 */
			return EOB_ACT_END_OF_FILE;
			}

		else
			{
			/* We matched some text prior to the EOB, first
			 * process it.
			 */
			return EOB_ACT_LAST_MATCH;
			}
		}

	/* Try to read more data. */

	/* First move last chars to start of buffer. */
	number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;

	for ( i = 0; i < number_to_move; ++i )
		*(dest++) = *(source++);

	if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
		/* don't do the read, it's not guaranteed to return an EOF,
		 * just force an EOF
		 */
		yy_current_buffer->yy_n_chars = yy_n_chars = 0;

	else
		{
		int num_to_read =
			yy_current_buffer->yy_buf_size - number_to_move - 1;

		while ( num_to_read <= 0 )
			{ /* Not enough room in the buffer - grow it. */
#ifdef YY_USES_REJECT
			YY_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else

			/* just a shorter name for the current buffer */
			YY_BUFFER_STATE b = yy_current_buffer;

			int yy_c_buf_p_offset =
				(int) (yy_c_buf_p - b->yy_ch_buf);

			if ( b->yy_is_our_buffer )
				{
				int new_size = b->yy_buf_size * 2;

				if ( new_size <= 0 )
					b->yy_buf_size += b->yy_buf_size / 8;
				else
					b->yy_buf_size *= 2;

				b->yy_ch_buf = (char *)
					/* Include room in for 2 EOB chars. */
					yy_flex_realloc( (void *) b->yy_ch_buf,
							 b->yy_buf_size + 2 );
				}
			else
				/* Can't grow it, we don't own it. */
				b->yy_ch_buf = 0;

			if ( ! b->yy_ch_buf )
				YY_FATAL_ERROR(
				"fatal error - scanner input buffer overflow" );

			yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];

			num_to_read = yy_current_buffer->yy_buf_size -
						number_to_move - 1;
#endif
			}

		if ( num_to_read > YY_READ_BUF_SIZE )
			num_to_read = YY_READ_BUF_SIZE;

		/* Read in more data. */
		YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
			yy_n_chars, num_to_read );

		yy_current_buffer->yy_n_chars = yy_n_chars;
		}

	if ( yy_n_chars == 0 )
		{
		if ( number_to_move == YY_MORE_ADJ )
			{
			ret_val = EOB_ACT_END_OF_FILE;
			yyrestart( yyin );
			}

		else
			{
			ret_val = EOB_ACT_LAST_MATCH;
			yy_current_buffer->yy_buffer_status =
				YY_BUFFER_EOF_PENDING;
			}
		}

	else
		ret_val = EOB_ACT_CONTINUE_SCAN;

	yy_n_chars += number_to_move;
	yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
	yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;

	yytext_ptr = &yy_current_buffer->yy_ch_buf[0];

	return ret_val;
	}


/* yy_get_previous_state - get the state just before the EOB char was reached */

static yy_state_type yy_get_previous_state()
	{
	register yy_state_type yy_current_state;
	register char *yy_cp;

	yy_current_state = yy_start;

	for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
		{
		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
		if ( yy_accept[yy_current_state] )
			{
			yy_last_accepting_state = yy_current_state;
			yy_last_accepting_cpos = yy_cp;
			}
		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
			{
			yy_current_state = (int) yy_def[yy_current_state];
			if ( yy_current_state >= 320 )
				yy_c = yy_meta[(unsigned int) yy_c];
			}
		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
		}

	return yy_current_state;
	}


/* yy_try_NUL_trans - try to make a transition on the NUL character
 *
 * synopsis
 *	next_state = yy_try_NUL_trans( current_state );
 */

#ifdef YY_USE_PROTOS
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
#else
static yy_state_type yy_try_NUL_trans( yy_current_state )
yy_state_type yy_current_state;
#endif
	{
	register int yy_is_jam;
	register char *yy_cp = yy_c_buf_p;

	register YY_CHAR yy_c = 1;
	if ( yy_accept[yy_current_state] )
		{
		yy_last_accepting_state = yy_current_state;
		yy_last_accepting_cpos = yy_cp;
		}
	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
		{
		yy_current_state = (int) yy_def[yy_current_state];
		if ( yy_current_state >= 320 )
			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 == 319);

	return yy_is_jam ? 0 : yy_current_state;
	}


#ifndef YY_NO_UNPUT
#ifdef YY_USE_PROTOS
static void yyunput( int c, register char *yy_bp )
#else
static void yyunput( c, yy_bp )
int c;
register char *yy_bp;
#endif
	{
	register char *yy_cp = yy_c_buf_p;

	/* undo effects of setting up yytext */
	*yy_cp = yy_hold_char;

	if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
		{ /* need to shift things up to make room */
		/* +2 for EOB chars. */
		register int number_to_move = yy_n_chars + 2;
		register char *dest = &yy_current_buffer->yy_ch_buf[
					yy_current_buffer->yy_buf_size + 2];
		register char *source =
				&yy_current_buffer->yy_ch_buf[number_to_move];

		while ( source > yy_current_buffer->yy_ch_buf )
			*--dest = *--source;

		yy_cp += (int) (dest - source);
		yy_bp += (int) (dest - source);
		yy_current_buffer->yy_n_chars =
			yy_n_chars = yy_current_buffer->yy_buf_size;

		if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
			YY_FATAL_ERROR( "flex scanner push-back overflow" );
		}

	*--yy_cp = (char) c;


	yytext_ptr = yy_bp;
	yy_hold_char = *yy_cp;
	yy_c_buf_p = yy_cp;
	}
#endif	/* ifndef YY_NO_UNPUT */


#ifdef __cplusplus
static int yyinput()
#else
static int input()
#endif
	{
	int c;

	*yy_c_buf_p = yy_hold_char;

	if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
		{
		/* yy_c_buf_p now points to the character we want to return.
		 * If this occurs *before* the EOB characters, then it's a
		 * valid NUL; if not, then we've hit the end of the buffer.
		 */
		if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
			/* This was really a NUL. */
			*yy_c_buf_p = '\0';

		else
			{ /* need more input */
			int offset = yy_c_buf_p - yytext_ptr;
			++yy_c_buf_p;

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

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

					/* fall through */

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

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

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

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


	return c;
	}


#ifdef YY_USE_PROTOS
void yyrestart( FILE *input_file )
#else
void yyrestart( input_file )
FILE *input_file;
#endif
	{
	if ( ! yy_current_buffer )
		yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );

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


#ifdef YY_USE_PROTOS
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
#else
void yy_switch_to_buffer( new_buffer )
YY_BUFFER_STATE new_buffer;
#endif
	{
	if ( yy_current_buffer == new_buffer )
		return;

	if ( yy_current_buffer )
		{
		/* Flush out information for old buffer. */
		*yy_c_buf_p = yy_hold_char;
		yy_current_buffer->yy_buf_pos = yy_c_buf_p;
		yy_current_buffer->yy_n_chars = yy_n_chars;
		}

	yy_current_buffer = new_buffer;
	yy_load_buffer_state();

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


#ifdef YY_USE_PROTOS
void yy_load_buffer_state( void )
#else
void yy_load_buffer_state()
#endif
	{
	yy_n_chars = yy_current_buffer->yy_n_chars;
	yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
	yyin = yy_current_buffer->yy_input_file;
	yy_hold_char = *yy_c_buf_p;
	}


#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
#else
YY_BUFFER_STATE yy_create_buffer( file, size )
FILE *file;
int size;
#endif
	{
	YY_BUFFER_STATE b;

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

	b->yy_buf_size = size;

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

	b->yy_is_our_buffer = 1;

	yy_init_buffer( b, file );

	return b;
	}


#ifdef YY_USE_PROTOS
void yy_delete_buffer( YY_BUFFER_STATE b )
#else
void yy_delete_buffer( b )
YY_BUFFER_STATE b;
#endif
	{
	if ( ! b )
		return;

	if ( b == yy_current_buffer )
		yy_current_buffer = (YY_BUFFER_STATE) 0;

	if ( b->yy_is_our_buffer )
		yy_flex_free( (void *) b->yy_ch_buf );

	yy_flex_free( (void *) b );
	}


#ifndef YY_ALWAYS_INTERACTIVE
#ifndef YY_NEVER_INTERACTIVE
extern int isatty YY_PROTO(( int ));
#endif
#endif

#ifdef YY_USE_PROTOS
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
#else
void yy_init_buffer( b, file )
YY_BUFFER_STATE b;
FILE *file;
#endif


	{
	yy_flush_buffer( b );

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

#if YY_ALWAYS_INTERACTIVE
	b->yy_is_interactive = 1;
#else
#if YY_NEVER_INTERACTIVE
	b->yy_is_interactive = 0;
#else
	b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
	}


#ifdef YY_USE_PROTOS
void yy_flush_buffer( YY_BUFFER_STATE b )
#else
void yy_flush_buffer( b )
YY_BUFFER_STATE b;
#endif

	{
	if ( ! b )
		return;

	b->yy_n_chars = 0;

	/* We always need two end-of-buffer characters.  The first causes
	 * a transition to the end-of-buffer state.  The second causes
	 * a jam in that state.
	 */
	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;

	b->yy_buf_pos = &b->yy_ch_buf[0];

	b->yy_at_bol = 1;
	b->yy_buffer_status = YY_BUFFER_NEW;

	if ( b == yy_current_buffer )
		yy_load_buffer_state();
	}


#ifndef YY_NO_SCAN_BUFFER
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
#else
YY_BUFFER_STATE yy_scan_buffer( base, size )
char *base;
yy_size_t size;
#endif
	{
	YY_BUFFER_STATE b;

	if ( size < 2 ||
	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
	     base[size-1] != YY_END_OF_BUFFER_CHAR )
		/* They forgot to leave room for the EOB's. */
		return 0;

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

	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
	b->yy_buf_pos = b->yy_ch_buf = base;
	b->yy_is_our_buffer = 0;
	b->yy_input_file = 0;
	b->yy_n_chars = b->yy_buf_size;
	b->yy_is_interactive = 0;
	b->yy_at_bol = 1;
	b->yy_fill_buffer = 0;
	b->yy_buffer_status = YY_BUFFER_NEW;

	yy_switch_to_buffer( b );

	return b;
	}
#endif


#ifndef YY_NO_SCAN_STRING
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
#else
YY_BUFFER_STATE yy_scan_string( yy_str )
yyconst char *yy_str;
#endif
	{
	int len;
	for ( len = 0; yy_str[len]; ++len )
		;

	return yy_scan_bytes( yy_str, len );
	}
#endif


#ifndef YY_NO_SCAN_BYTES
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
#else
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
yyconst char *bytes;
int len;
#endif
	{
	YY_BUFFER_STATE b;
	char *buf;
	yy_size_t n;
	int i;

	/* Get memory for full buffer, including space for trailing EOB's. */
	n = len + 2;
	buf = (char *) yy_flex_alloc( n );
	if ( ! buf )
		YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );

	for ( i = 0; i < len; ++i )
		buf[i] = bytes[i];

	buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;

	b = yy_scan_buffer( buf, n );
	if ( ! b )
		YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );

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

	return b;
	}
#endif


#ifndef YY_NO_PUSH_STATE
#ifdef YY_USE_PROTOS
static void yy_push_state( int new_state )
#else
static void yy_push_state( new_state )
int new_state;
#endif
	{
	if ( yy_start_stack_ptr >= yy_start_stack_depth )
		{
		yy_size_t new_size;

		yy_start_stack_depth += YY_START_STACK_INCR;
		new_size = yy_start_stack_depth * sizeof( int );

		if ( ! yy_start_stack )
			yy_start_stack = (int *) yy_flex_alloc( new_size );

		else
			yy_start_stack = (int *) yy_flex_realloc(
					(void *) yy_start_stack, new_size );

		if ( ! yy_start_stack )
			YY_FATAL_ERROR(
			"out of memory expanding start-condition stack" );
		}

	yy_start_stack[yy_start_stack_ptr++] = YY_START;

	BEGIN(new_state);
	}
#endif


#ifndef YY_NO_POP_STATE
static void yy_pop_state()
	{
	if ( --yy_start_stack_ptr < 0 )
		YY_FATAL_ERROR( "start-condition stack underflow" );

	BEGIN(yy_start_stack[yy_start_stack_ptr]);
	}
#endif


#ifndef YY_NO_TOP_STATE
static int yy_top_state()
	{
	return yy_start_stack[yy_start_stack_ptr - 1];
	}
#endif

#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif

#ifdef YY_USE_PROTOS
static void yy_fatal_error( yyconst char msg[] )
#else
static void yy_fatal_error( msg )
char msg[];
#endif
	{
	(void) fprintf( stderr, "%s\n", msg );
	exit( YY_EXIT_FAILURE );
	}



/* Redefine yyless() so it works in section 3 code. */

#undef yyless
#define yyless(n) \
	do \
		{ \
		/* Undo effects of setting up yytext. */ \
		yytext[yyleng] = yy_hold_char; \
		yy_c_buf_p = yytext + n; \
		yy_hold_char = *yy_c_buf_p; \
		*yy_c_buf_p = '\0'; \
		yyleng = n; \
		} \
	while ( 0 )


/* Internal utility routines. */

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

#ifdef YY_NEED_STRLEN
#ifdef YY_USE_PROTOS
static int yy_flex_strlen( yyconst char *s )
#else
static int yy_flex_strlen( s )
yyconst char *s;
#endif
	{
	register int n;
	for ( n = 0; s[n]; ++n )
		;

	return n;
	}
#endif


#ifdef YY_USE_PROTOS
static void *yy_flex_alloc( yy_size_t size )
#else
static void *yy_flex_alloc( size )
yy_size_t size;
#endif
	{
	return (void *) malloc( size );
	}

#ifdef YY_USE_PROTOS
static void *yy_flex_realloc( void *ptr, yy_size_t size )
#else
static void *yy_flex_realloc( ptr, size )
void *ptr;
yy_size_t size;
#endif
	{
	/* The cast to (char *) in the following accommodates both
	 * implementations that use char* generic pointers, and those
	 * that use void* generic pointers.  It works with the latter
	 * because both ANSI C and C++ allow castless assignment from
	 * any pointer type to void*, and deal with argument conversions
	 * as though doing an assignment.
	 */
	return (void *) realloc( (char *) ptr, size );
	}

#ifdef YY_USE_PROTOS
static void yy_flex_free( void *ptr )
#else
static void yy_flex_free( ptr )
void *ptr;
#endif
	{
	free( ptr );
	}

#if YY_MAIN
int main()
	{
	yylex();
	return 0;
	}
#endif
#line 345 "lexer.l"


/*
 * called when EOF is encountered.  Return 1 so the scanner will return
 * the zero token to report end-of-file.
 */
int yywrap()
{
    return(1);
}

static void comment()
{
    int c1 = 0, c2 = STUB_INPUT();
  
    linebuf[column] = c2;
    column++;
    for(;;) {
	if (c2 == EOF)
	    break;
	if (c1 == '*' && c2 == '/')
	    break;
	if (c2 == '\n') {
	    linebuf[0] = '\0';
	    column = 0;
	    lineno++;
	}
	
	c1 = c2;
	c2 = STUB_INPUT();
	linebuf[column] = c2;
	column++;
    }
}


static void macro()
{
  int c1 = 0, c2 = STUB_INPUT(), nonws = 0;
  
  log_printf("MACRO reading begining...\n#");
  log_printf("%c", c2);

  linebuf[column] = c2;
  column++;
  for(;;) {
    if (c2 == EOF)
      break;
    if (!isspace(c1))
      nonws = c1;
    if (nonws == '\\' && c2 == '\n') {
      linebuf[0] = '\0';
      column = 0;
      lineno++;
    } else if (c2 == '\n') {
      linebuf[0] = '\0';
      column = 0;
      lineno++;
      break;
    }
    
    c1 = c2;
    c2 = STUB_INPUT();
    linebuf[column] = c2;
    log_printf("%c", c2);
    column++;
  }
  log_printf("MACRO reading done.\n");
}


static void count()
{
    int i;

    if (lineno == 1)
	strcat(linebuf, yytext);

    for (i = 0; yytext[i] != '\0'; i++)
	if (yytext[i] == '\n')
	    column = 0;
	else if (yytext[i] == '\t')
	    column += 8 - (column % 8);
	else
	    column++;
    
    /* equiv to fprintf(yyout, "%s", yytext); */
    /* ECHO; */
}

/*
 * Collect the contents of inline functions, reading them char by char. 
 * thanks to the arjuna stubgen project for this one
 */
int collectInlineDef()
{
    int bracelevel = 1;
    int token;

    /* the magic of exclusive start states makes it all possible */
    BEGIN INLIN;

    while (bracelevel > 0) {
        token = yylex();
	column++;
/*	fprintf(stderr, "INLIN: read token %c\n", token); */
	if (token > 0) {
	    /* Assume single char */
	    switch (token) {
	    case '{':
		bracelevel++;
		break;
	    case '}':
		bracelevel--;
		if (bracelevel == 0)
		{
		    column--;
		    unput(token);
		    break;
		}
		break;
	    case '\n':
		column = 0;
		lineno++;
		break;
	    }
	} else {
	    /* fatal error: Unexpected EOF reading inline function */
	    return -1;
	}
    }

    /* we now return you to your regularly scheduled start state */
    BEGIN 0;

    return 0;
}


/*
 * hmmm... looks familiar.  more control-y programming.
 */
int collectMemberInitList()
{
    int token;
    int insideList = 1;

    /* the magic of exclusive start states makes it all possible */
    BEGIN MINIT;

    while(insideList) {
        token = yylex();
	column++;
/*	fprintf(stderr, "MINIT: read token %c\n", token); */
	if (token > 0) {
	    /* Assume single char */
	    switch (token)
	    {
	    case '{':
		insideList = 0;
		unput(token);
		break;
	    case '\n':
		column = 0;
		lineno++;
		break;
	    }
	} else {
	    /* fatal error: Unexpected EOF reading member initialization */
	    return -1;
	}
    }

    /* we now return you to your regularly scheduled start state */
    BEGIN 0;

    return 0;
}
