#line 2 "pgc.c"
/* A lexical scanner generated by flex */

/* Scanner skeleton version:
 * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $
 * $FreeBSD: src/usr.bin/lex/flex.skl,v 1.4 1999/10/27 07:56:44 obrien 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)


#define YY_USES_REJECT
typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern int yylineno;
int yylineno = 1;
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 89
#define YY_END_OF_BUFFER 90
static yyconst short int yy_acclist[355] =
    {   0,
       10,   10,   90,   89,   26,   89,   15,   89,   89,   89,
       89,   75,   89,   53,   75,   89,   53,   89,   75,   89,
       26,   75,   89,   42,   75,   89,   47,   75,   89,   75,
       89,   15,   75,   89,   51,   75,   89,   52,   75,   89,
       46,   75,   89,   49,   75,   89,   45,   75,   89,   50,
       75,   89,   75,   89,   48,   75,   89,   32,   75,   89,
       32,   75,   89,   44,   75,   89,   75,   89,   58,   75,
       89,   75,   89,   43,   75,   89,   43,   75,   89,   56,
       75,   89,   57,   75,   89,   54,   75,   89,   75,   89,
       55,   75,   89,   38,   89,    1,   38,   89,    1,   89,

       30,   38,   89,   21,   26,   38,   89,   29,   30,   38,
       89,   29,   30,   38,   89,   15,   38,   89,   29,   38,
       89,   29,   30,   38,   89,   29,   38,   89,   29,   30,
       38,   89,   32,   38,   89,   29,   38,   89,   37,   38,
       89,   37,   38,   89,   37,   38,   89,   89,   15,   89,
       89,   89,   89,   87,   89,   87,   89,   15,   87,   89,
       87,   89,   87,   89,   87,   89,   86,   89,   85,   89,
       10,   89,    8,   89,    5,   89,    5,    6,   89,    6,
       89,    6,   89,   25,   89,   22,   89,   27,   89,   23,
       89,   27,   89,    9,   89,   14,   89,   18,   89,   16,

       89,   89,   89,   83,   89,   83,   89,   34,    2,   34,
       42,   67,   42,   42,   72,   63,   70,   64,   68,   65,
       69,   59,   74,   34,   71,   34,   32,   41,   61,   66,
       60,   43,   43,   62,   30,   31,    1,   30,    2,   30,
       34,   32,   28,   36,   37,    7,   13,   88,   34,    2,
       34,   86,   85,   10,    5,    4,    3,   25,   24,   27,
        9,   18,   17,   19,   84,    2,   34,   42,   42,   73,
       40,   34,   35,   41,   43,    1,    1,   30,    2,   30,
       34,   32,   36,    2,   34,   12,    3,   11,   20,   43,
       34,   36,   43,   34,   36,   12,   11,   20,   43,   39,

       43,   33,   39,   39,   43,   43,   43,   33,   43,   43,
       43,   43,   43,   33,   43,   43,   43,   43,   43,   43,
       43,   43,   43,   80,   43,   43,   43,   43,   43,   80,
       43,   80,   81,   43,   43,   78,   43,   43,   78,   43,
       76,   82,   78,   43,   79,   43,   79,   76,   76,   79,
       43,   77,   77,   77
    } ;

static yyconst short int yy_accept[360] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    2,    3,    3,    3,    3,    3,    3,
        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,
        3,    4,    5,    7,    9,   10,   11,   12,   14,   17,
       19,   21,   24,   27,   30,   32,   35,   38,   41,   44,
       47,   50,   53,   55,   58,   61,   64,   67,   69,   72,
       74,   77,   80,   83,   86,   89,   91,   94,   96,   99,
      101,  104,  108,  112,  116,  119,  122,  126,  129,  133,
      136,  139,  142,  145,  148,  149,  151,  152,  153,  154,
      156,  158,  161,  163,  165,  167,  169,  171,  173,  175,

      177,  180,  182,  184,  186,  188,  190,  192,  194,  196,
      198,  200,  202,  203,  204,  206,  208,  209,  210,  211,
      211,  211,  212,  213,  214,  215,  216,  217,  218,  219,
      220,  221,  222,  223,  224,  225,  225,  226,  227,  228,
      228,  229,  230,  231,  232,  233,  234,  235,  236,  237,
      239,  241,  242,  243,  244,  245,  246,  247,  248,  248,
      249,  250,  251,  252,  252,  252,  253,  254,  255,  255,
      255,  255,  256,  256,  257,  258,  259,  260,  261,  262,
      262,  262,  262,  263,  263,  263,  264,  264,  265,  265,
      265,  266,  266,  267,  268,  269,  270,  271,  271,  272,

      273,  273,  274,  275,  276,  277,  279,  281,  282,  283,
      283,  283,  284,  285,  286,  286,  287,  287,  287,  288,
      288,  289,  289,  289,  289,  290,  290,  290,  290,  291,
      291,  292,  293,  293,  293,  293,  293,  293,  293,  293,
      293,  293,  293,  293,  293,  293,  293,  294,  294,  295,
      296,  296,  296,  297,  297,  297,  297,  297,  298,  298,
      298,  298,  298,  299,  299,  299,  299,  299,  299,  300,
      300,  300,  300,  300,  300,  300,  300,  302,  303,  303,
      303,  304,  305,  306,  307,  308,  309,  309,  309,  309,
      309,  309,  310,  311,  312,  313,  314,  315,  315,  315,

      315,  315,  315,  316,  317,  318,  319,  320,  321,  322,
      322,  322,  322,  322,  322,  322,  322,  323,  325,  326,
      327,  328,  329,  330,  331,  331,  331,  331,  331,  331,
      331,  332,  333,  333,  334,  335,  337,  338,  339,  339,
      340,  340,  340,  340,  342,  342,  343,  344,  346,  347,
      348,  349,  349,  350,  351,  353,  354,  355,  355
    } ;

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

       32,   33,   34,   34,   35,   34,   34,   36,   34,   37,
       34,   34,   38,   34,   39,   34,   40,   34,   34,   41,
       34,   34,   46,   47,   48,   27,    1,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,

       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34,   34,   34,   34,   34,   34,
       34,   34,   34,   34,   34
    } ;

static yyconst int yy_meta[49] =
    {   0,
        1,    2,    3,    4,    5,    6,    5,    5,    5,    5,
        7,    1,    1,    8,    5,    1,    9,   10,    8,   11,
       11,   12,    2,    5,    5,    5,    5,   13,   13,   13,
       13,   13,   13,   14,   14,   14,   14,   14,   14,   14,
       14,    1,   15,    1,    5,    1,    5,    1
    } ;

static yyconst short int yy_base[398] =
    {   0,
        0,    4,   25,    0,   73,    0,  116,  122,  144,  166,
      184,    0, 1070, 1061,  221,  264, 1055, 1047,  117,  118,
     1035, 1034,  114,  115,    0,    0,  284,    0,  127,  141,
     1041, 1324, 1324, 1324,  111, 1013,  131, 1324,    0,   10,
      830, 1324,  811,  821,  835, 1324, 1324, 1324,  815,  141,
     1324,  154,  161,  169,  221,  178, 1324,  815,  787,  785,
        0,  767, 1324, 1324, 1324,  755, 1324, 1324, 1324, 1324,
        0, 1324,  133,    0, 1324, 1324,  784,  171,  783,  231,
      774,    0,  783,  781,  768,  756,  186,  115,  236, 1324,
      273, 1324,  180,  760,  240, 1324,    0,    0,  282,    0,

        0,  213,  759,    0,  762, 1324, 1324,  168,    0,  290,
        0,  324,    0,  327, 1324,  716,  213,    0,  223,  277,
      298,  709, 1324,  704,  330, 1324, 1324, 1324, 1324, 1324,
     1324, 1324,  727, 1324,  316,  733, 1324,  319,  324,  332,
        0, 1324, 1324, 1324,    0,  693, 1324,    0,  244,  369,
        0,  334,  339, 1324,  286,    0, 1324, 1324,  692, 1324,
      341,  412,  347,  369,  378, 1324,    0,    0,  395,  407,
      694,    0,  236, 1324,    0,    0, 1324, 1324,    0,  430,
      438,  692,    0,  441,  449, 1324,  691, 1324,  400,  459,
     1324,  667,    0,  385,  650,  649, 1324,  680, 1324,  444,

      387,  447,    0,  647,    0,  478,    0,  452,  457,  650,
        0,  462,    0,  478,  504, 1324,  650,  507,    0,  515,
     1324,  649,  510,  526, 1324,  644,  531,  629,  536,  470,
      524,  529,  547,  550,  557,  566,  569,  574,  585,  590,
      593,  596,  612,  615,  618,  621,  620,  545,  610,  564,
      632,  635,  651,  661,  667,  671,  683,  687,  699,  703,
      710,  715,  720,  731,  726,  736,  618,  613,  614,  564,
      585,  742,  747,  752,  612,  611,  758,  588,  615,  763,
      768,  774,  569,  575,  160,  606,  778,  604,  557,  547,
      273,  529,  330,  526,  354,  525, 1324,  411,  510,  417,

      503,  501,  487,  487,  484,  465,  464,  463,  445,  441,
      439,  434,  424,  399,  393,  389,  378,  677,  781,  380,
      367,  343,  332,  693,  784,  330,  325,  314,  306,  298,
      276,  812,  815, 1324,  818,  821,  254,  251,  824,  827,
      247,  238,  236,  830,  833, 1324,  840,  846,  205,  849,
      855,  176,  858,  861,  864,  867,  870, 1324,  874,  889,
      904,  919,  934,  949,  964,  979,  994, 1009, 1024, 1029,
     1039, 1037, 1041, 1055, 1060, 1074, 1089, 1104, 1119, 1134,
     1148, 1162, 1172, 1181,  165, 1196, 1207, 1208, 1218,  631,
     1227, 1242, 1257, 1264, 1278, 1293, 1308

    } ;

static yyconst short int yy_def[398] =
    {   0,
      359,  359,  358,    3,  358,    5,  360,  360,  361,  361,
      359,   11,  362,  362,  363,  363,  364,  364,  365,  365,
      366,  366,  367,  367,  359,  359,  359,   27,  368,  368,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  369,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      370,  370,  358,  358,  358,  358,  358,  358,  358,  358,
      371,  358,  371,  371,  358,  358,  371,  358,  371,  358,
      372,  373,  373,  373,  374,  374,  374,  374,  374,  358,
      358,  358,  358,  358,  358,  358,  375,  376,  358,  377,

      377,  358,  358,  378,  358,  358,  358,  358,  379,  358,
      380,  358,  381,  382,  358,  358,  358,  383,  358,  358,
      358,  369,  358,  369,  369,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  384,  358,  358,  358,  358,
      385,  358,  358,  358,  370,  370,  358,  371,  358,  386,
      387,  358,  358,  358,  388,  373,  358,  358,  374,  358,
      374,  374,  374,  374,  358,  358,  375,  376,  358,  358,
      358,  377,  358,  358,  389,  378,  358,  358,  379,  358,
      358,  358,  380,  358,  358,  358,  358,  358,  358,  382,
      358,  358,  383,  358,  369,  369,  358,  384,  358,  358,

      358,  358,  385,  370,  386,  386,  387,  358,  358,  358,
      390,  388,  162,  374,  358,  358,  358,  391,  389,  358,
      358,  358,  392,  358,  358,  358,  393,  358,  370,  358,
      358,  394,  395,  391,  391,  391,  396,  392,  392,  392,
      397,  393,  393,  393,  358,  358,  370,  358,  358,  394,
      395,  395,  395,  395,  391,  396,  396,  396,  396,  392,
      397,  397,  397,  397,  393,  358,  358,  358,  370,  358,
      358,  395,  396,  397,  358,  358,  370,  358,  358,  358,
      358,  358,  370,  370,  370,  358,  358,  358,  358,  358,
      358,  370,  370,  370,  370,  370,  358,  358,  358,  358,

      358,  358,  370,  370,  370,  370,  370,  370,  370,  358,
      358,  358,  358,  358,  358,  358,  370,  370,  370,  370,
      370,  370,  370,  358,  358,  358,  358,  358,  358,  358,
      370,  358,  358,  358,  370,  370,  370,  370,  358,  358,
      358,  358,  358,  370,  358,  358,  358,  370,  370,  358,
      358,  358,  358,  358,  370,  358,  358,    0,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358

    } ;

static yyconst short int yy_nxt[1373] =
    {   0,
      358,  121,  121,  121,  358,   33,  122,  358,  358,   33,
       34,  121,  121,  121,   34,  358,  122,   35,   36,   37,
       37,   35,   36,   37,   37,   38,   39,   40,   39,   41,
       42,   43,   38,   44,   45,   46,   47,   48,   49,   50,
       51,   52,   53,   54,   55,   56,   38,   57,   58,   59,
       60,   38,   61,   61,   61,   61,   62,   61,   61,   61,
       61,   61,   61,   61,   61,   61,   63,   38,   64,   38,
       65,   66,   67,   68,   69,   70,   69,   71,   72,   71,
       73,   74,   71,   75,   76,   76,   74,   74,   76,   77,
       78,   79,   80,   80,   81,   76,   74,   74,   74,   71,

       82,   83,   82,   82,   82,   82,   82,   82,   82,   82,
       82,   82,   82,   84,   76,   68,   76,   74,   68,   71,
       68,   33,  107,  107,  112,  112,   86,   33,  162,   32,
      117,  117,   86,   87,   88,   89,   89,  160,   32,   87,
       88,   89,   89,   32,   32,   91,   91,   91,  119,   33,
      120,  120,  149,  149,   92,  129,  113,  113,  116,  108,
      108,   93,   94,   95,   95,  130,   96,   91,   91,   91,
      131,   33,  116,  178,  134,  203,   92,  203,  132,  133,
      135,  135,  118,   93,   94,   95,   95,  136,   96,   33,
      135,  135,  295,  137,   34,  138,  296,  139,  139,  117,

      117,   35,   36,   37,   37,  161,  161,  356,  160,  140,
      178,   97,   97,   97,   97,   97,   97,   97,   97,   97,
       97,   97,   97,   97,   97,  101,  173,  101,  101,  101,
      101,  174,  117,  117,  102,  101,  355,  101,  138,  103,
      139,  139,  194,  194,  101,  101,  101,  101,  152,  173,
      153,  153,  140,  163,  174,  164,  164,  119,  160,  120,
      120,  141,  140,  149,  149,  101,  352,  101,  101,  351,
      101,  101,  101,  101,  165,  165,  165,  102,  101,  350,
      101,  349,  103,  169,  170,  170,  348,  101,  101,  101,
      101,  180,  181,  181,  119,  166,  120,  120,  171,  121,

      121,  121,  210,  211,  122,  300,  182,  344,  101,  302,
      101,  114,  114,  114,  114,  114,  114,  114,  114,  114,
      114,  114,  114,  114,  114,  184,  185,  185,  189,  189,
      189,  195,  196,  195,  186,  135,  135,  343,  200,  200,
      187,  138,  342,  139,  139,  341,  201,  140,  201,  191,
      140,  202,  202,  208,  208,  140,  152,  340,  209,  209,
      161,  161,  339,  160,  304,  140,  214,  214,  305,  160,
      140,  338,  125,  206,  337,  206,  206,  206,  206,  165,
      165,  165,  206,  206,  307,  206,  163,  206,  164,  164,
      308,  160,  206,  206,  206,  206,  169,  170,  170,  336,

      166,  189,  189,  189,  194,  194,  202,  202,  215,  215,
      215,  171,  335,  206,  331,  206,  213,  216,  213,  213,
      213,  213,  191,  217,  330,  213,  213,  329,  213,  328,
      213,  180,  181,  181,  160,  213,  213,  213,  213,  220,
      220,  220,  184,  185,  185,  310,  182,  313,  221,  311,
      224,  224,  224,  314,  222,  327,  213,  187,  213,  225,
      189,  189,  189,  200,  200,  226,  202,  202,  326,  230,
      325,  231,  231,  324,  152,  140,  139,  139,  210,  211,
      323,  191,  206,  140,  206,  206,  206,  206,  140,  248,
      248,  206,  206,  322,  206,  321,  206,  214,  214,  320,

      160,  206,  206,  206,  206,  215,  215,  215,  235,  170,
      170,  239,  181,  181,  216,  319,  220,  220,  220,  318,
      217,  317,  206,  236,  206,  221,  240,  224,  224,  224,
      316,  222,  243,  185,  185,  315,  225,  246,  246,  246,
      312,  230,  226,  249,  249,  210,  211,  244,  252,  215,
      215,  235,  170,  170,  309,  140,  306,  253,  235,  170,
      170,  303,  270,  254,  271,  271,  236,  235,  170,  170,
      257,  220,  220,  236,  247,  239,  181,  181,  301,  258,
      210,  211,  255,  278,  278,  259,  239,  181,  181,  300,
      240,  239,  181,  181,  262,  224,  224,  243,  185,  185,

      292,  240,  270,  263,  279,  279,  260,  286,  286,  264,
      293,  294,  244,  243,  185,  185,  243,  185,  185,  266,
      266,  266,  246,  246,  246,  297,  297,  230,  244,  200,
      200,  265,  270,  252,  215,  215,  252,  215,  215,  298,
      299,  140,  253,  232,  232,  253,  281,  280,  254,  277,
      276,  254,  252,  215,  215,  275,  267,  269,  245,  268,
      241,  253,  252,  215,  215,  237,  233,  254,  235,  170,
      170,  253,  257,  220,  220,  211,  229,  272,  332,  332,
      332,  258,  199,  255,  257,  220,  220,  259,  257,  220,
      220,  125,  125,  258,  332,  332,  332,  258,  228,  259,

      257,  220,  220,  259,  239,  181,  181,  227,  223,  258,
      218,  262,  224,  224,  160,  273,  262,  224,  224,  260,
      263,  262,  224,  224,  204,  263,  264,  243,  185,  185,
      263,  264,  262,  224,  224,  199,  264,  266,  266,  266,
      197,  263,  265,  252,  215,  215,  125,  274,  257,  220,
      220,  125,  253,  262,  224,  224,  192,  258,  272,  282,
      282,  282,  263,  273,  287,  287,  287,  177,  274,  282,
      282,  282,  175,  118,  267,  282,  282,  282,  160,  287,
      287,  287,  333,  333,  333,  333,  333,  333,  283,  284,
      160,  158,  285,  157,  288,  154,  151,  289,  290,  288,

      150,  147,  291,  334,  290,  288,  334,  146,  291,  288,
      144,  143,  289,  332,  332,  332,  333,  333,  333,  345,
      345,  345,  347,  347,  347,  345,  345,  345,  347,  347,
      347,  353,  353,  353,  345,  345,  345,  334,  142,  128,
      346,  347,  347,  347,  127,  126,  346,  354,  354,  354,
      354,  354,  354,  125,  123,  346,  353,  353,  353,  353,
      353,  353,  354,  354,  354,  357,  357,  357,  357,  357,
      357,  357,  357,  357,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   32,   32,   85,
       85,   85,   85,   85,   85,   85,   85,   85,   85,   85,

       85,   85,   85,   85,   90,   90,   90,   90,   90,   90,
       90,   90,   90,   90,   90,   90,   90,   90,   90,   98,
       98,   98,   98,   98,   98,   98,   98,   98,   98,   98,
       98,   98,   98,   98,  100,  100,  100,  100,  100,  100,
      100,  100,  100,  100,  100,  100,  100,  100,  100,  104,
      104,  104,  104,  104,  104,  104,  104,  104,  104,  104,
      104,  104,  104,  104,  106,  106,  106,  106,  106,  106,
      106,  106,  106,  106,  106,  106,  106,  106,  106,  109,
      109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
      109,  109,  109,  109,  111,  111,  111,  111,  111,  111,

      111,  111,  111,  111,  111,  111,  111,  111,  111,  115,
      115,  115,  115,  115,  115,  115,  115,  115,  115,  115,
      115,  115,  115,  115,  124,  124,  118,  124,  124,  124,
      124,  124,  124,  124,  124,  124,  124,  124,  124,  145,
      358,  145,  145,  148,  110,  110,  148,  148,  155,  155,
      155,  156,  105,  156,  156,  159,  159,  159,  159,  159,
      105,  159,  159,  159,  159,  159,  159,  159,  159,  159,
      167,   99,  167,  167,  168,  168,  168,  168,  168,  168,
       99,  168,  168,  168,  168,  168,  168,  168,  168,  172,
      172,  172,  172,  172,  172,  172,  358,  172,  172,  172,

      172,  172,  172,  172,  176,  176,  176,  176,  176,  358,
      176,  176,  176,  176,  176,  176,  176,  176,  176,  179,
      179,  179,  179,  179,  179,  358,  179,  179,  179,  179,
      179,  179,  179,  179,  183,  183,  183,  183,  183,  183,
      358,  183,  183,  183,  183,  183,  183,  183,  188,  188,
      188,  188,  188,  188,  188,  188,  188,  188,  188,  188,
      188,  188,  188,  190,  190,  190,  358,  358,  358,  358,
      358,  358,  190,  358,  190,  190,  193,  358,  358,  193,
      193,  198,  198,  198,  198,  198,  198,  198,  198,  198,
      198,  198,  198,  198,  198,  198,  205,  205,  358,  358,

      205,  205,  205,  205,  205,  205,  205,  205,  205,  205,
      205,  207,  358,  358,  207,  207,  212,  212,  212,  358,
      212,  212,  219,  358,  358,  219,  219,  234,  234,  234,
      234,  234,  234,  234,  234,  234,  234,  234,  234,  234,
      234,  234,  238,  238,  238,  238,  238,  238,  238,  238,
      238,  238,  238,  238,  238,  238,  238,  242,  242,  242,
      242,  242,  242,  242,  242,  242,  242,  242,  242,  242,
      242,  242,  250,  250,  250,  358,  250,  250,  251,  251,
      251,  251,  251,  251,  251,  251,  251,  251,  251,  251,
      251,  251,  251,  256,  256,  256,  256,  256,  256,  256,

      256,  256,  256,  256,  256,  256,  256,  256,  261,  261,
      261,  261,  261,  261,  261,  261,  261,  261,  261,  261,
      261,  261,  261,   31,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358
    } ;

static yyconst short int yy_chk[1373] =
    {   0,
        0,   39,   39,   39,    0,    1,   39,    0,    0,    2,
        1,   40,   40,   40,    2,    0,   40,    1,    1,    1,
        1,    2,    2,    2,    2,    3,    3,    3,    3,    3,
        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,
        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,
        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,
        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,
        3,    3,    3,    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,   19,   20,   23,   24,    7,    8,   88,   29,
       35,   35,    8,    7,    7,    7,    7,   88,    7,    8,
        8,    8,    8,   30,    8,    9,    9,    9,   37,    9,
       37,   37,   73,   73,    9,   50,   23,   24,   29,   19,
       20,    9,    9,    9,    9,   50,    9,   10,   10,   10,
       52,   10,   30,  108,   53,  385,   10,  385,   52,   52,
       53,   53,   54,   10,   10,   10,   10,   54,   10,   11,
       78,   78,  285,   54,   11,   56,  285,   56,   56,   93,

       93,   11,   11,   11,   11,   87,   87,  352,   87,   56,
      108,   11,   11,   11,   11,   11,   11,   11,   11,   11,
       11,   11,   11,   11,   11,   15,  102,   15,   15,   15,
       15,  102,  117,  117,   15,   15,  349,   15,   55,   15,
       55,   55,  119,  119,   15,   15,   15,   15,   80,  173,
       80,   80,   55,   89,  173,   89,   89,   95,   89,   95,
       95,   55,   80,  149,  149,   15,  343,   15,   16,  342,
       16,   16,   16,   16,   91,   91,   91,   16,   16,  341,
       16,  338,   16,   99,   99,   99,  337,   16,   16,   16,
       16,  110,  110,  110,  120,   91,  120,  120,   99,  121,

      121,  121,  155,  155,  121,  291,  110,  331,   16,  291,
       16,   27,   27,   27,   27,   27,   27,   27,   27,   27,
       27,   27,   27,   27,   27,  112,  112,  112,  114,  114,
      114,  125,  125,  125,  112,  135,  135,  330,  138,  138,
      112,  139,  329,  139,  139,  328,  140,  135,  140,  114,
      138,  140,  140,  152,  152,  139,  153,  327,  153,  153,
      161,  161,  326,  161,  293,  152,  163,  163,  293,  163,
      153,  323,  125,  150,  322,  150,  150,  150,  150,  165,
      165,  165,  150,  150,  295,  150,  164,  150,  164,  164,
      295,  164,  150,  150,  150,  150,  169,  169,  169,  321,

      165,  189,  189,  189,  194,  194,  201,  201,  170,  170,
      170,  169,  320,  150,  317,  150,  162,  170,  162,  162,
      162,  162,  189,  170,  316,  162,  162,  315,  162,  314,
      162,  180,  180,  180,  162,  162,  162,  162,  162,  181,
      181,  181,  184,  184,  184,  298,  180,  300,  181,  298,
      185,  185,  185,  300,  181,  313,  162,  184,  162,  185,
      190,  190,  190,  200,  200,  185,  202,  202,  312,  208,
      311,  208,  208,  310,  209,  200,  209,  209,  212,  212,
      309,  190,  206,  208,  206,  206,  206,  206,  209,  230,
      230,  206,  206,  308,  206,  307,  206,  214,  214,  306,

      214,  206,  206,  206,  206,  215,  215,  215,  218,  218,
      218,  223,  223,  223,  215,  305,  220,  220,  220,  304,
      215,  303,  206,  218,  206,  220,  223,  224,  224,  224,
      302,  220,  227,  227,  227,  301,  224,  229,  229,  229,
      299,  231,  224,  231,  231,  232,  232,  227,  233,  233,
      233,  234,  234,  234,  296,  231,  294,  233,  235,  235,
      235,  292,  248,  233,  248,  248,  234,  236,  236,  236,
      237,  237,  237,  235,  229,  238,  238,  238,  290,  237,
      250,  250,  236,  270,  270,  237,  239,  239,  239,  289,
      238,  240,  240,  240,  241,  241,  241,  242,  242,  242,

      283,  239,  271,  241,  271,  271,  240,  278,  278,  241,
      284,  284,  242,  243,  243,  243,  244,  244,  244,  245,
      245,  245,  246,  246,  246,  286,  286,  249,  243,  249,
      249,  244,  279,  251,  251,  251,  252,  252,  252,  288,
      288,  249,  251,  390,  390,  252,  276,  275,  251,  269,
      268,  252,  253,  253,  253,  267,  245,  247,  228,  246,
      226,  253,  254,  254,  254,  222,  217,  253,  255,  255,
      255,  254,  256,  256,  256,  210,  204,  254,  318,  318,
      318,  256,  198,  255,  257,  257,  257,  256,  258,  258,
      258,  196,  195,  257,  324,  324,  324,  258,  192,  257,

      259,  259,  259,  258,  260,  260,  260,  187,  182,  259,
      171,  261,  261,  261,  159,  259,  262,  262,  262,  260,
      261,  263,  263,  263,  146,  262,  261,  265,  265,  265,
      263,  262,  264,  264,  264,  136,  263,  266,  266,  266,
      133,  264,  265,  272,  272,  272,  124,  264,  273,  273,
      273,  122,  272,  274,  274,  274,  116,  273,  272,  277,
      277,  277,  274,  273,  280,  280,  280,  105,  274,  281,
      281,  281,  103,   94,  266,  282,  282,  282,   86,  287,
      287,  287,  319,  319,  319,  325,  325,  325,  277,  277,
       85,   84,  277,   83,  280,   81,   79,  280,  281,  281,

       77,   66,  281,  319,  282,  282,  325,   62,  282,  287,
       60,   59,  287,  332,  332,  332,  333,  333,  333,  335,
      335,  335,  336,  336,  336,  339,  339,  339,  340,  340,
      340,  344,  344,  344,  345,  345,  345,  333,   58,   49,
      335,  347,  347,  347,   45,   44,  339,  348,  348,  348,
      350,  350,  350,   43,   41,  345,  351,  351,  351,  353,
      353,  353,  354,  354,  354,  355,  355,  355,  356,  356,
      356,  357,  357,  357,  359,  359,  359,  359,  359,  359,
      359,  359,  359,  359,  359,  359,  359,  359,  359,  360,
      360,  360,  360,  360,  360,  360,  360,  360,  360,  360,

      360,  360,  360,  360,  361,  361,  361,  361,  361,  361,
      361,  361,  361,  361,  361,  361,  361,  361,  361,  362,
      362,  362,  362,  362,  362,  362,  362,  362,  362,  362,
      362,  362,  362,  362,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  364,
      364,  364,  364,  364,  364,  364,  364,  364,  364,  364,
      364,  364,  364,  364,  365,  365,  365,  365,  365,  365,
      365,  365,  365,  365,  365,  365,  365,  365,  365,  366,
      366,  366,  366,  366,  366,  366,  366,  366,  366,  366,
      366,  366,  366,  366,  367,  367,  367,  367,  367,  367,

      367,  367,  367,  367,  367,  367,  367,  367,  367,  368,
      368,  368,  368,  368,  368,  368,  368,  368,  368,  368,
      368,  368,  368,  368,  369,  369,   36,  369,  369,  369,
      369,  369,  369,  369,  369,  369,  369,  369,  369,  370,
       31,  370,  370,  371,   22,   21,  371,  371,  372,  372,
      372,  373,   18,  373,  373,  374,  374,  374,  374,  374,
       17,  374,  374,  374,  374,  374,  374,  374,  374,  374,
      375,   14,  375,  375,  376,  376,  376,  376,  376,  376,
       13,  376,  376,  376,  376,  376,  376,  376,  376,  377,
      377,  377,  377,  377,  377,  377,    0,  377,  377,  377,

      377,  377,  377,  377,  378,  378,  378,  378,  378,    0,
      378,  378,  378,  378,  378,  378,  378,  378,  378,  379,
      379,  379,  379,  379,  379,    0,  379,  379,  379,  379,
      379,  379,  379,  379,  380,  380,  380,  380,  380,  380,
        0,  380,  380,  380,  380,  380,  380,  380,  381,  381,
      381,  381,  381,  381,  381,  381,  381,  381,  381,  381,
      381,  381,  381,  382,  382,  382,    0,    0,    0,    0,
        0,    0,  382,    0,  382,  382,  383,    0,    0,  383,
      383,  384,  384,  384,  384,  384,  384,  384,  384,  384,
      384,  384,  384,  384,  384,  384,  386,  386,    0,    0,

      386,  386,  386,  386,  386,  386,  386,  386,  386,  386,
      386,  387,    0,    0,  387,  387,  388,  388,  388,    0,
      388,  388,  389,    0,    0,  389,  389,  391,  391,  391,
      391,  391,  391,  391,  391,  391,  391,  391,  391,  391,
      391,  391,  392,  392,  392,  392,  392,  392,  392,  392,
      392,  392,  392,  392,  392,  392,  392,  393,  393,  393,
      393,  393,  393,  393,  393,  393,  393,  393,  393,  393,
      393,  393,  394,  394,  394,    0,  394,  394,  395,  395,
      395,  395,  395,  395,  395,  395,  395,  395,  395,  395,
      395,  395,  395,  396,  396,  396,  396,  396,  396,  396,

      396,  396,  396,  396,  396,  396,  396,  396,  397,  397,
      397,  397,  397,  397,  397,  397,  397,  397,  397,  397,
      397,  397,  397,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358,  358,  358,  358,  358,  358,  358,  358,  358,
      358,  358
    } ;

static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
#define REJECT \
{ \
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
yy_cp = yy_full_match; /* restore poss. backed-over text */ \
++yy_lp; \
goto find_rule; \
}
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "pgc.l"
#define INITIAL 0
#line 2 "pgc.l"
/*-------------------------------------------------------------------------
 *
 * pgc.l
 *	  lexical scanner for ecpg
 *
 * This is a modified version of src/backend/parser/scan.l
 *
 *
 * Portions Copyright (c) 1996-2001, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 *
 * IDENTIFICATION
 *	  $Header: /cvsroot/pgsql/src/interfaces/ecpg/preproc/pgc.l,v 1.85 2002/02/15 17:46:57 petere Exp $
 *
 *-------------------------------------------------------------------------
 */
#include "postgres_fe.h"

#include <ctype.h>
#include <sys/types.h>
#include <limits.h>
#include <errno.h>

#include "extern.h"
#include "preproc.h"

/* some versions of lex define this as a macro */
#if defined(yywrap)
#undef yywrap
#endif /* yywrap */

#define YY_NO_UNPUT

extern YYSTYPE yylval;

static int		xcdepth = 0;	/* depth of nesting in slash-star comments */

/*
 * literalbuf is used to accumulate literal values when multiple rules
 * are needed to parse a single literal.  Call startlit to reset buffer
 * to empty, addlit to add text.  Note that the buffer is permanently
 * malloc'd to the largest size needed so far in the current run.
 */
static char	   *literalbuf = NULL;		/* expandable buffer */
static int		literallen;		/* actual current length */
static int		literalalloc;	/* current allocated buffer size */

#define startlit()  (literalbuf[0] = '\0', literallen = 0)
static void addlit(char *ytext, int yleng);

int state_before;

struct _yy_buffer { YY_BUFFER_STATE 	buffer;
		    long		lineno;
		    char	      * filename;
		    struct _yy_buffer * next;
		  } *yy_buffer = NULL;

static char *old;

#define MAX_NESTED_IF 128
static short preproc_tos;
static short ifcond;
static struct _if_value {
    short condition;
    short else_branch;
} stacked_if_value[MAX_NESTED_IF];

#define C 1
#define SQL 2
#define incl 3
#define def 4
#define def_ident 5

/*
 * OK, here is a short description of lex/flex rules behavior.
 * The longest pattern which matches an input string is always chosen.
 * For equal-length patterns, the first occurring in the rules list is chosen.
 * INITIAL is the starting state, to which all non-conditional rules apply.
 * Exclusive states change parsing rules while the state is active.  When in
 * an exclusive state, only those rules defined for that state apply.
 *
 * We use exclusive states for quoted strings, extended comments,
 * and to eliminate parsing troubles for numeric strings.
 * Exclusive states:
 *  <xbit> bit string literal
 *  <xc> extended C-style comments - thomas 1997-07-12
 *  <xd> delimited identifiers (double-quoted identifiers) - thomas 1997-10-27
 *  <xh> hexadecimal numeric string - thomas 1997-11-16
 *  <xq> quoted strings - thomas 1997-07-30
 */
#define xbit 6

#define xc 7

#define xd 8

#define xdc 9

#define xh 10

#define xq 11

#define xpre 12

#define xcond 13

#define xskip 14

/* Bit string
 */
/* Hexadecimal number
 */
/* C version of hex number 
 */
/* Extended quote
 * xqdouble implements SQL92 embedded quote
 * xqcat allows strings to cross input lines
 */
/* Delimited quote
 * Allows embedded spaces and other special characters into identifiers.
 */
/* special stuff for C strings */
/* C-style comments
 *
 * The "extended comment" syntax closely resembles allowable operator syntax.
 * The tricky part here is to get lex to recognize a string starting with
 * slash-star as a comment, when interpreting it as an operator would produce
 * a longer match --- remember lex will prefer a longer match!  Also, if we
 * have something like plus-slash-star, lex will think this is a 3-character
 * operator whereas we want to see it as a + operator and a comment start.
 * The solution is two-fold:
 * 1. append {op_chars}* to xcstart so that it matches as much text as
 *    {operator} would. Then the tie-breaker (first matching rule of same
 *    length) ensures xcstart wins.  We put back the extra stuff with yyless()
 *    in case it contains a star-slash that should terminate the comment.
 * 2. In the operator rule, check for slash-star within the operator, and
 *    if found throw it back with yyless().  This handles the plus-slash-star
 *    problem.
 * SQL92-style comments, which start with dash-dash, have similar interactions
 * with the operator rule.
 */
/*
 * "self" is the set of chars that should be returned as single-character
 * tokens.  "op_chars" is the set of chars that can make up "Op" tokens,
 * which can be one or more characters long (but if a single-char token
 * appears in the "self" set, it is not to be returned as an Op).  Note
 * that the sets overlap, but each has some chars that are not in the other.
 *
 * If you change either set, adjust the character lists appearing in the
 * rule for "operator"!
 */
/* we no longer allow unary minus in numbers. 
 * instead we pass it separately to parser. there it gets
 * coerced via doNegate() -- Leon aug 20 1999 
 */
/*
 * In order to make the world safe for Windows and Mac clients as well as
 * Unix ones, we accept either \n or \r as a newline.  A DOS-style \r\n
 * sequence will be seen as two successive newlines, but that doesn't cause
 * any problems.  SQL92-style comments, which start with -- and extend to the
 * next newline, are treated as equivalent to a single whitespace character.
 *
 * NOTE a fine point: if there is no newline following --, we will absorb
 * everything to the end of the input as a comment.  This is correct.  Older
 * versions of Postgres failed to recognize -- as a comment if the input
 * did not end with a newline.
 *
 * XXX perhaps \f (formfeed) should be treated as a newline as well?
 */
/*
 * SQL92 requires at least one newline in the whitespace separating
 * string literals that are to be concatenated.  Silly, but who are we
 * to argue?  Note that {whitespace_with_newline} should not have * after
 * it, whereas {whitespace} should generally have a * after it...
 */
/* some stuff needed for ecpg */
/* Take care of cpp continuation lines */
/* DO NOT PUT ANY COMMENTS IN THE FOLLOWING SECTION.
 * AT&T lex does not properly handle C-style comments in this second lex block.
 * So, put comments here. thomas - 1997-09-08
 *
 * Quoted strings must allow some special characters such as single-quote
 *  and newline.
 * Embedded single-quotes are implemented both in the SQL92-standard
 *  style of two adjacent single quotes "''" and in the Postgres/Java style
 *  of escaped-quote "\'".
 * Other embedded escaped characters are matched explicitly and the leading
 *  backslash is dropped from the string. - thomas 1997-09-24
 * Note that xcstart must appear before operator, as explained above!
 *  Also whitespace (comment) must appear before operator.
 */
#line 1037 "pgc.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 277 "pgc.l"

#line 1190 "pgc.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_state_ptr = yy_state_buf;
		*yy_state_ptr++ = yy_current_state;
yy_match:
		do
			{
			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*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 >= 359 )
					yy_c = yy_meta[(unsigned int) yy_c];
				}
			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
			*yy_state_ptr++ = yy_current_state;
			++yy_cp;
			}
		while ( yy_base[yy_current_state] != 1324 );

yy_find_action:
		yy_current_state = *--yy_state_ptr;
		yy_lp = yy_accept[yy_current_state];
find_rule: /* we branch to this label when backing up */
		for ( ; ; ) /* until we find what rule we matched */
			{
			if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
				{
				yy_act = yy_acclist[yy_lp];
					{
					yy_full_match = yy_cp;
					break;
					}
				}
			--yy_cp;
			yy_current_state = *--yy_state_ptr;
			yy_lp = yy_accept[yy_current_state];
			}

		YY_DO_BEFORE_ACTION;

		if ( yy_act != YY_END_OF_BUFFER )
			{
			int yyl;
			for ( yyl = 0; yyl < yyleng; ++yyl )
				if ( yytext[yyl] == '\n' )
					++yylineno;
			}

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


		switch ( yy_act )
	{ /* beginning of action switch */
case 1:
YY_RULE_SETUP
#line 278 "pgc.l"
{ /* ignore */ }
	YY_BREAK
case 2:
YY_RULE_SETUP
#line 280 "pgc.l"
{
				state_before = YYSTATE;
				xcdepth = 0;
	 			BEGIN(xc);
				/* Put back any characters past slash-star; see above */
				yyless(2);
				fputs("/*", yyout);
			}
	YY_BREAK
case 3:
YY_RULE_SETUP
#line 289 "pgc.l"
{
                        xcdepth++;
                        /* Put back any characters past slash-star; see above */
                        yyless(2);
			fputs("/*", yyout);
                }
	YY_BREAK
case 4:
YY_RULE_SETUP
#line 296 "pgc.l"
{
			ECHO;
                        if (xcdepth <= 0)
                        	BEGIN(state_before);
                        else
                                xcdepth--;
		}
	YY_BREAK
case 5:
YY_RULE_SETUP
#line 304 "pgc.l"
{ ECHO; }
	YY_BREAK
case 6:
YY_RULE_SETUP
#line 305 "pgc.l"
{ ECHO; }
	YY_BREAK
case YY_STATE_EOF(xc):
#line 307 "pgc.l"
{ mmerror(PARSE_ERROR, ET_ERROR, "Unterminated /* comment"); }
	YY_BREAK
case 7:
YY_RULE_SETUP
#line 309 "pgc.l"
{
					BEGIN(xbit);
					startlit();
				}
	YY_BREAK
case 8:
YY_RULE_SETUP
#line 313 "pgc.l"
{
					BEGIN(SQL);
					if (literalbuf[strspn(literalbuf, "01") + 1] != '\0')
						mmerror(PARSE_ERROR, ET_ERROR, "invalid bit string input.");
					yylval.str = literalbuf;
			                return BITCONST;
				}
	YY_BREAK
case 9:
#line 322 "pgc.l"
case 10:
YY_RULE_SETUP
#line 322 "pgc.l"
{
					addlit(yytext, yyleng);
				}
	YY_BREAK
case 11:
#line 326 "pgc.l"
case 12:
YY_RULE_SETUP
#line 326 "pgc.l"
{
					/* ignore */
				}
	YY_BREAK
case YY_STATE_EOF(xbit):
#line 329 "pgc.l"
{ mmerror(PARSE_ERROR, ET_ERROR, "Unterminated bit string"); }
	YY_BREAK
case 13:
YY_RULE_SETUP
#line 331 "pgc.l"
{
					BEGIN(xh);
					startlit();
				}
	YY_BREAK
case 14:
YY_RULE_SETUP
#line 335 "pgc.l"
{
					long val;
					char* endptr;

					BEGIN(SQL);
					errno = 0;
					val = strtol(literalbuf, &endptr, 16);
					if (*endptr != '\0' || errno == ERANGE
#ifdef HAVE_LONG_INT_64  
						/* if long > 32 bits, check for overflow of int4 */
	                                        || val != (long) ((int32) val)
#endif
						)
						mmerror(PARSE_ERROR, ET_ERROR, "Bad hexadecimal integer input");
					yylval.ival = val;
					return ICONST;
				}
	YY_BREAK
case YY_STATE_EOF(xh):
#line 353 "pgc.l"
{ mmerror(PARSE_ERROR, ET_ERROR, "Unterminated hexadecimal integer"); }
	YY_BREAK
case 15:
YY_RULE_SETUP
#line 355 "pgc.l"
{
					state_before = YYSTATE;
					BEGIN(xq);
					startlit();
				}
	YY_BREAK
case 16:
YY_RULE_SETUP
#line 360 "pgc.l"
{
					BEGIN(state_before);
					yylval.str = mm_strdup(literalbuf);
					return SCONST;
				}
	YY_BREAK
case 17:
#line 366 "pgc.l"
case 18:
#line 367 "pgc.l"
case 19:
YY_RULE_SETUP
#line 367 "pgc.l"
{
					addlit(yytext, yyleng);
				}
	YY_BREAK
case 20:
YY_RULE_SETUP
#line 370 "pgc.l"
{
					/* ignore */
				}
	YY_BREAK
case YY_STATE_EOF(xq):
#line 374 "pgc.l"
{ mmerror(PARSE_ERROR, ET_ERROR, "Unterminated quoted string"); }
	YY_BREAK
case 21:
YY_RULE_SETUP
#line 376 "pgc.l"
{
					state_before = YYSTATE;
					BEGIN(xd);
					startlit();
				}
	YY_BREAK
case 22:
YY_RULE_SETUP
#line 381 "pgc.l"
{
					BEGIN(state_before);
					if (strlen(literalbuf) >= NAMEDATALEN)
       			                {
#ifdef MULTIBYTE_NOTUSED
                                                int len;

	                                        len = pg_mbcliplen(literalbuf,strlen(literalbuf),NAMEDATALEN-1);
						sprintf(errortext, "identifier \"%s\" will be truncated to \"%.*s\"",
                                                        literalbuf, len, literalbuf);
	                                        literalbuf[len] = '\0';
#else
						sprintf(errortext, "identifier \"%s\" will be truncated to \"%.*s\"",
                                                        literalbuf, NAMEDATALEN-1, literalbuf);
                                                literalbuf[NAMEDATALEN-1] = '\0';
#endif
 						mmerror(PARSE_ERROR, ET_NOTICE, errortext);
                                        }

					yylval.str = mm_strdup(literalbuf);
					return CSTRING;
				}
	YY_BREAK
case 23:
YY_RULE_SETUP
#line 403 "pgc.l"
{
					BEGIN(state_before);   
					yylval.str = mm_strdup(literalbuf);
					return CSTRING;
				}
	YY_BREAK
case 24:
YY_RULE_SETUP
#line 408 "pgc.l"
{
					addlit(yytext, yyleng-1);
				}
	YY_BREAK
case 25:
YY_RULE_SETUP
#line 411 "pgc.l"
{
					addlit(yytext, yyleng);
				}
	YY_BREAK
case YY_STATE_EOF(xd):
case YY_STATE_EOF(xdc):
#line 414 "pgc.l"
{ mmerror(PARSE_ERROR, ET_ERROR, "Unterminated quoted identifier"); }
	YY_BREAK
case 26:
YY_RULE_SETUP
#line 415 "pgc.l"
{
					state_before = YYSTATE;
					BEGIN(xdc);
					startlit();
				}
	YY_BREAK
case 27:
YY_RULE_SETUP
#line 420 "pgc.l"
{
 					addlit(yytext, yyleng);
				}
	YY_BREAK
case 28:
YY_RULE_SETUP
#line 423 "pgc.l"
{ 	return TYPECAST; }
	YY_BREAK
case 29:
YY_RULE_SETUP
#line 424 "pgc.l"
{ /* 
				   * We may find a ';' inside a structure
				   * definition in a TYPE or VAR statement.
				   * This is not an EOL marker.
				   */
				  if (yytext[0] == ';' && struct_level == 0)
					 BEGIN C;
				  return yytext[0];
				}
	YY_BREAK
case 30:
YY_RULE_SETUP
#line 433 "pgc.l"
{
					/*
					 * Check for embedded slash-star or dash-dash; those
					 * are comment starts, so operator must stop there.
					 * Note that slash-star or dash-dash at the first
					 * character will match a prior rule, not this one.
					 */
					int		nchars = yyleng;
					char   *slashstar = strstr((char*)yytext, "/*");
					char   *dashdash = strstr((char*)yytext, "--");

					if (slashstar && dashdash)
					{
						/* if both appear, take the first one */
						if (slashstar > dashdash)
							slashstar = dashdash;
					}
					else if (!slashstar)
						slashstar = dashdash;
					if (slashstar)
						nchars = slashstar - ((char*)yytext);

					/*
					 * For SQL92 compatibility, '+' and '-' cannot be the
					 * last char of a multi-char operator unless the operator
					 * contains chars that are not in SQL92 operators.
					 * The idea is to lex '=-' as two operators, but not
					 * to forbid operator names like '?-' that could not be
					 * sequences of SQL92 operators.
					 */
					while (nchars > 1 &&
						   (yytext[nchars-1] == '+' ||
							yytext[nchars-1] == '-'))
					{
						int		ic;

						for (ic = nchars-2; ic >= 0; ic--)
						{
							if (strchr("~!@#^&|`?$%", yytext[ic]))
								break;
						}
						if (ic >= 0)
							break; /* found a char that makes it OK */
						nchars--; /* else remove the +/-, and check again */
					}

					if (nchars < yyleng)
					{
						/* Strip the unwanted chars from the token */
						yyless(nchars);
						/*
						 * If what we have left is only one char, and it's
						 * one of the characters matching "self", then
						 * return it as a character token the same way
						 * that the "self" rule would have.
						 */
						if (nchars == 1 &&
							strchr(",()[].;$:+-*/%^<>=", yytext[0]))
							return yytext[0];
					}

					/* Convert "!=" operator to "<>" for compatibility */
					if (strcmp((char*)yytext, "!=") == 0)
						yylval.str = mm_strdup("<>");
					else
						yylval.str = mm_strdup((char*)yytext);
					return Op;
				}
	YY_BREAK
case 31:
YY_RULE_SETUP
#line 501 "pgc.l"
{
					yylval.ival = atol((char*)&yytext[1]);
					return PARAM;
				}
	YY_BREAK
case 32:
YY_RULE_SETUP
#line 505 "pgc.l"
{
					long val;
					char* endptr;

					errno = 0;
					val = strtol((char *)yytext, &endptr,10);
					if (*endptr != '\0' || errno == ERANGE
#ifdef HAVE_LONG_INT_64  
						/* if long > 32 bits, check for overflow of int4 */
	                                        || val != (long) ((int32) val)
#endif
						)
					{
						errno = 0;
						yylval.str = mm_strdup((char*)yytext);
						return FCONST;
					}
					yylval.ival = val;
					return ICONST;
				}
	YY_BREAK
case 33:
YY_RULE_SETUP
#line 525 "pgc.l"
{
					yylval.str = mm_strdup((char*)yytext);
					return IP;
				}
	YY_BREAK
case 34:
YY_RULE_SETUP
#line 529 "pgc.l"
{
					yylval.str = mm_strdup((char*)yytext);
					return FCONST;
				}
	YY_BREAK
case 35:
YY_RULE_SETUP
#line 533 "pgc.l"
{
					yylval.str = mm_strdup((char*)yytext);
					return FCONST;
				}
	YY_BREAK
case 36:
YY_RULE_SETUP
#line 537 "pgc.l"
{
					yylval.str = mm_strdup((char*)yytext+1);
					return(CVARIABLE);
			}
	YY_BREAK
case 37:
YY_RULE_SETUP
#line 541 "pgc.l"
{
					ScanKeyword	   *keyword;
					struct _defines *ptr;

					/* Is it an SQL keyword? */
					keyword = ScanKeywordLookup((char*) yytext);
					if (keyword != NULL)
						return keyword->value;

					/* Is it an ECPG keyword? */
					keyword = ScanECPGKeywordLookup((char*) yytext);
					if (keyword != NULL)
						return keyword->value;

					/* How about a DEFINE? */
					for (ptr = defines; ptr; ptr = ptr->next)
					{
						if (strcmp(yytext, ptr->old) == 0)
						{
							struct _yy_buffer *yb;

							yb = mm_alloc(sizeof(struct _yy_buffer));

							yb->buffer =  YY_CURRENT_BUFFER;
							yb->lineno = yylineno;
							yb->filename = mm_strdup(input_filename);
							yb->next = yy_buffer;

							yy_buffer = yb;

							yy_scan_string(ptr->new);
							break;
						}
					}

					/*
					 * None of the above.  Return it as an identifier.
					 *
					 * The backend would attempt to truncate and case-fold
					 * the identifier, but I see no good reason for ecpg
					 * to do so; that's just another way that ecpg could get
					 * out of step with the backend.
					 */
					if (ptr == NULL) 
					{
						yylval.str = mm_strdup((char*) yytext);
						return IDENT;
					}
				}
	YY_BREAK
case 38:
YY_RULE_SETUP
#line 590 "pgc.l"
{ return yytext[0]; }
	YY_BREAK
case 39:
YY_RULE_SETUP
#line 591 "pgc.l"
{ BEGIN SQL; return SQL_START; }
	YY_BREAK
case 40:
YY_RULE_SETUP
#line 592 "pgc.l"
{ /* ignore */ } 
	YY_BREAK
case 41:
YY_RULE_SETUP
#line 593 "pgc.l"
{
					char* endptr;

					errno = 0;
					yylval.ival = strtol((char *)yytext,&endptr,16);
					if (*endptr != '\0' || errno == ERANGE)
					{
						errno = 0;
						yylval.str = mm_strdup((char*)yytext);
						return SCONST;
					}
					return ICONST;
				}
	YY_BREAK
case 42:
YY_RULE_SETUP
#line 606 "pgc.l"
{
					yylval.str = mm_strdup((char*)yytext);
					return(CPP_LINE);
				}
	YY_BREAK
case 43:
YY_RULE_SETUP
#line 610 "pgc.l"
{
					ScanKeyword		*keyword;

					keyword = ScanCKeywordLookup((char*)yytext);
					if (keyword != NULL) {
						return keyword->value;
					}
					else
					{
						struct _defines *ptr;

						for (ptr = defines; ptr; ptr = ptr->next)
						{
							if (strcmp(yytext, ptr->old) == 0)
							{
								struct _yy_buffer *yb;

								yb = mm_alloc(sizeof(struct _yy_buffer));

					                        yb->buffer =  YY_CURRENT_BUFFER;
					                        yb->lineno = yylineno;
					                        yb->filename = mm_strdup(input_filename);
					                        yb->next = yy_buffer;

					                        yy_buffer = yb;

								yy_scan_string(ptr->new);
								break;
							}
						}
						if (ptr == NULL) 
						{
							yylval.str = mm_strdup((char*)yytext);
							return IDENT;
						}
					}
				}
	YY_BREAK
case 44:
YY_RULE_SETUP
#line 647 "pgc.l"
{ return(';'); }
	YY_BREAK
case 45:
YY_RULE_SETUP
#line 648 "pgc.l"
{ return(','); }
	YY_BREAK
case 46:
YY_RULE_SETUP
#line 649 "pgc.l"
{ return('*'); }
	YY_BREAK
case 47:
YY_RULE_SETUP
#line 650 "pgc.l"
{ return('%'); }
	YY_BREAK
case 48:
YY_RULE_SETUP
#line 651 "pgc.l"
{ return('/'); }
	YY_BREAK
case 49:
YY_RULE_SETUP
#line 652 "pgc.l"
{ return('+'); }
	YY_BREAK
case 50:
YY_RULE_SETUP
#line 653 "pgc.l"
{ return('-'); }
	YY_BREAK
case 51:
YY_RULE_SETUP
#line 654 "pgc.l"
{ return('('); }
	YY_BREAK
case 52:
YY_RULE_SETUP
#line 655 "pgc.l"
{ return(')'); }
	YY_BREAK
case 53:
YY_RULE_SETUP
#line 656 "pgc.l"
{ ECHO; }
	YY_BREAK
case 54:
YY_RULE_SETUP
#line 657 "pgc.l"
{ return('{'); }
	YY_BREAK
case 55:
YY_RULE_SETUP
#line 658 "pgc.l"
{ return('}'); }
	YY_BREAK
case 56:
YY_RULE_SETUP
#line 659 "pgc.l"
{ return('['); }
	YY_BREAK
case 57:
YY_RULE_SETUP
#line 660 "pgc.l"
{ return(']'); }
	YY_BREAK
case 58:
YY_RULE_SETUP
#line 661 "pgc.l"
{ return('='); }
	YY_BREAK
case 59:
YY_RULE_SETUP
#line 662 "pgc.l"
{ return(S_MEMBER); } 
	YY_BREAK
case 60:
YY_RULE_SETUP
#line 663 "pgc.l"
{ return(S_RSHIFT); } 
	YY_BREAK
case 61:
YY_RULE_SETUP
#line 664 "pgc.l"
{ return(S_LSHIFT); } 
	YY_BREAK
case 62:
YY_RULE_SETUP
#line 665 "pgc.l"
{ return(S_OR); } 
	YY_BREAK
case 63:
YY_RULE_SETUP
#line 666 "pgc.l"
{ return(S_AND); } 
	YY_BREAK
case 64:
YY_RULE_SETUP
#line 667 "pgc.l"
{ return(S_INC); } 
	YY_BREAK
case 65:
YY_RULE_SETUP
#line 668 "pgc.l"
{ return(S_DEC); } 
	YY_BREAK
case 66:
YY_RULE_SETUP
#line 669 "pgc.l"
{ return(S_EQUAL); } 
	YY_BREAK
case 67:
YY_RULE_SETUP
#line 670 "pgc.l"
{ return(S_NEQUAL); } 
	YY_BREAK
case 68:
YY_RULE_SETUP
#line 671 "pgc.l"
{ return(S_ADD); } 
	YY_BREAK
case 69:
YY_RULE_SETUP
#line 672 "pgc.l"
{ return(S_SUB); } 
	YY_BREAK
case 70:
YY_RULE_SETUP
#line 673 "pgc.l"
{ return(S_MUL); } 
	YY_BREAK
case 71:
YY_RULE_SETUP
#line 674 "pgc.l"
{ return(S_DIV); } 
	YY_BREAK
case 72:
YY_RULE_SETUP
#line 675 "pgc.l"
{ return(S_MOD); } 
	YY_BREAK
case 73:
YY_RULE_SETUP
#line 676 "pgc.l"
{ return(S_MEMPOINT); } 
	YY_BREAK
case 74:
YY_RULE_SETUP
#line 677 "pgc.l"
{ return(S_DOTPOINT); } 
	YY_BREAK
case 75:
YY_RULE_SETUP
#line 678 "pgc.l"
{ return S_ANYTHING; }
	YY_BREAK
case 76:
YY_RULE_SETUP
#line 680 "pgc.l"
{ BEGIN(def_ident); }
	YY_BREAK
case 77:
YY_RULE_SETUP
#line 681 "pgc.l"
{ BEGIN(incl); }
	YY_BREAK
case 78:
YY_RULE_SETUP
#line 683 "pgc.l"
{ ifcond = TRUE; BEGIN(xcond); }
	YY_BREAK
case 79:
YY_RULE_SETUP
#line 684 "pgc.l"
{ ifcond = FALSE; BEGIN(xcond); }
	YY_BREAK
case 80:
YY_RULE_SETUP
#line 686 "pgc.l"
{	/* pop stack */
						if ( preproc_tos == 0 ) {
						    mmerror(PARSE_ERROR, ET_FATAL, "Missing matching 'EXEC SQL IFDEF / EXEC SQL IFNDEF'");
						}
						else if ( stacked_if_value[preproc_tos].else_branch ) {
						    mmerror(PARSE_ERROR, ET_FATAL, "Missing 'EXEC SQL ENDIF;'");
						}
						else {
						    preproc_tos--;
						}

						ifcond = TRUE; BEGIN(xcond);
					}
	YY_BREAK
case 81:
YY_RULE_SETUP
#line 700 "pgc.l"
{	/* only exec sql endif pops the stack, so take care of duplicated 'else' */
						if ( stacked_if_value[preproc_tos].else_branch ) {
						    mmerror(PARSE_ERROR, ET_FATAL, "Duplicated 'EXEC SQL ELSE;'");
						}
						else {
						    stacked_if_value[preproc_tos].else_branch = TRUE;
						    stacked_if_value[preproc_tos].condition = 
							(stacked_if_value[preproc_tos-1].condition &&
							 ! stacked_if_value[preproc_tos].condition);

						    if ( stacked_if_value[preproc_tos].condition ) {
							BEGIN(C);
						    }
						    else {
							BEGIN(xskip);
						    }
						}
					}
	YY_BREAK
case 82:
YY_RULE_SETUP
#line 718 "pgc.l"
{ 
						if ( preproc_tos == 0 ) {
						    mmerror(PARSE_ERROR, ET_FATAL, "Unmatched 'EXEC SQL ENDIF;'");
						}
						else {
						    preproc_tos--;
						}

						if ( stacked_if_value[preproc_tos].condition ) {
						   BEGIN(C);
						}
						else {
						   BEGIN(xskip);
						}
					}
	YY_BREAK
case 83:
YY_RULE_SETUP
#line 734 "pgc.l"
{ /* ignore */ }
	YY_BREAK
case 84:
YY_RULE_SETUP
#line 736 "pgc.l"
{
					if ( preproc_tos >= MAX_NESTED_IF-1 ) {
					    mmerror(PARSE_ERROR, ET_FATAL, "Too many nested 'EXEC SQL IFDEF' conditions");
					}
					else {
					    struct _defines *defptr;
					    unsigned int i;

					    /* skip the ";" and trailing whitespace. Note that yytext contains
					       at least one non-space character plus the ";" */
					    for ( i = strlen(yytext)-2;
							  i > 0 && isspace((unsigned char) yytext[i]);
							  i-- )
						{}
					    yytext[i+1] = '\0';

					    for ( defptr = defines; defptr != NULL &&
						      ( strcmp((char*)yytext, defptr->old) != 0 ); defptr = defptr->next );

					    preproc_tos++;
					    stacked_if_value[preproc_tos].else_branch = FALSE;
					    stacked_if_value[preproc_tos].condition = 
						( (defptr ? ifcond : !ifcond) && stacked_if_value[preproc_tos-1].condition );
					}

					if ( stacked_if_value[preproc_tos].condition ) {
					   BEGIN C;
					}
					else {
					   BEGIN(xskip);
					}
				}
	YY_BREAK
case 85:
YY_RULE_SETUP
#line 769 "pgc.l"
{
				old = mm_strdup(yytext);
				BEGIN(def);
				startlit();
			}
	YY_BREAK
case 86:
YY_RULE_SETUP
#line 774 "pgc.l"
{
				struct _defines *ptr, *this;
        
                                for (ptr = defines; ptr != NULL; ptr = ptr->next)
                                {
                                     if (strcmp(old, ptr->old) == 0)
                                     {
					free(ptr->new);
					/* ptr->new = mm_strdup(scanstr(literalbuf));*/
					ptr->new = mm_strdup(literalbuf);
                                     }
                                }
				if (ptr == NULL)
				{                        
                                        this = (struct _defines *) mm_alloc(sizeof(struct _defines));

                                        /* initial definition */
                                        this->old = old;
                                        /* this->new = mm_strdup(scanstr(literalbuf));*/
                                        this->new = mm_strdup(literalbuf);
					this->next = defines;
					defines = this;
				}

				BEGIN(C);
			}
	YY_BREAK
case 87:
YY_RULE_SETUP
#line 800 "pgc.l"
{
				addlit(yytext, yyleng);
			}
	YY_BREAK
case 88:
YY_RULE_SETUP
#line 804 "pgc.l"
{ /* got the include file name */
			  struct _yy_buffer *yb;
			  struct _include_path *ip;
			  char inc_file[MAXPGPATH];
			  unsigned int i;

			  yb = mm_alloc(sizeof(struct _yy_buffer));

			  yb->buffer =  YY_CURRENT_BUFFER;
			  yb->lineno = yylineno;
			  yb->filename = input_filename;
			  yb->next = yy_buffer;

			  yy_buffer = yb;

			  /* skip the ";" and trailing whitespace. Note that yytext contains
			     at least one non-space character plus the ";" */
			  for ( i = strlen(yytext)-2;
					i > 0 && isspace((unsigned char) yytext[i]);
					i-- )
			  {}
			  yytext[i+1] = '\0';

			  yyin = NULL;
			  for (ip = include_paths; yyin == NULL && ip != NULL; ip = ip->next)
			  {
				if (strlen(ip->path) + strlen(yytext) + 3 > MAXPGPATH)
				{
					fprintf(stderr, "Error: Path %s/%s is too long in line %d, skipping.\n", ip->path, yytext, yylineno);
					continue;
				}
			  	sprintf (inc_file, "%s/%s", ip->path, yytext);
		          	yyin = fopen( inc_file, "r" );
			  	if (!yyin)
				{
					if (strcmp(inc_file + strlen(inc_file) - 2, ".h"))
					{
						strcat(inc_file, ".h");
						yyin = fopen( inc_file, "r" );
					}

				}
			  }
			  if (!yyin)
			  {
				sprintf(errortext, "Cannot open include file %s in line %d\n", yytext, yylineno);
				mmerror(NO_INCLUDE_FILE, ET_FATAL, errortext);
			  }

			  input_filename = mm_strdup(inc_file);
			  yy_switch_to_buffer(yy_create_buffer(yyin,YY_BUF_SIZE ));
			  yylineno = 1;
			  output_line_number();

			  BEGIN C;
			}
	YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(C):
case YY_STATE_EOF(SQL):
case YY_STATE_EOF(incl):
case YY_STATE_EOF(def):
case YY_STATE_EOF(def_ident):
case YY_STATE_EOF(xpre):
case YY_STATE_EOF(xcond):
case YY_STATE_EOF(xskip):
#line 861 "pgc.l"
{
			  if ( preproc_tos > 0 ) {
			      preproc_tos = 0;

			      mmerror(PARSE_ERROR, ET_FATAL, "Missing 'EXEC SQL ENDIF;'");
			  }

			  if (yy_buffer == NULL)
				yyterminate();
			  else
			  {
				struct _yy_buffer *yb = yy_buffer;

				if (yyin != NULL)
					fclose(yyin);

				yy_delete_buffer( YY_CURRENT_BUFFER );
				yy_switch_to_buffer(yy_buffer->buffer);

				yylineno = yy_buffer->lineno;

				free(input_filename);
				input_filename = yy_buffer->filename;

				yy_buffer = yy_buffer->next;
				free(yb);
				output_line_number();
			  }
			}
	YY_BREAK
case 89:
YY_RULE_SETUP
#line 890 "pgc.l"
ECHO;
	YY_BREAK
#line 2244 "pgc.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->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;
	yy_state_ptr = yy_state_buf;
	*yy_state_ptr++ = yy_current_state;

	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);
		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 >= 359 )
				yy_c = yy_meta[(unsigned int) yy_c];
			}
		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
		*yy_state_ptr++ = yy_current_state;
		}

	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 YY_CHAR yy_c = 1;
	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 >= 359 )
			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 == 358);
	if ( ! yy_is_jam )
		*yy_state_ptr++ = yy_current_state;

	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;

	if ( c == '\n' )
		--yylineno;

	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;

	if ( c == '\n' )
		++yylineno;

	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 890 "pgc.l"

void
lex_init(void)
{
	braces_open = 0;

	preproc_tos = 0;
	yylineno = 1;
	ifcond = TRUE;
	stacked_if_value[preproc_tos].condition = ifcond;
	stacked_if_value[preproc_tos].else_branch = FALSE;

	/* initialize literal buffer to a reasonable but expansible size */
	if (literalbuf == NULL)
	{
		literalalloc = 128;
		literalbuf = (char *) malloc(literalalloc);
	}
	startlit();

    BEGIN C;
}

static void
addlit(char *ytext, int yleng)
{
	/* enlarge buffer if needed */
	if ((literallen+yleng) >= literalalloc)
	{
		do {
			literalalloc *= 2;
		} while ((literallen+yleng) >= literalalloc);
		literalbuf = (char *) realloc(literalbuf, literalalloc);
	}
	/* append new data, add trailing null */
	memcpy(literalbuf+literallen, ytext, yleng);
	literallen += yleng;
	literalbuf[literallen] = '\0';
}

int yywrap(void) 
{
    return 1;
}
