Skip to content

P
Postgres FD Implementation
Commit a4ce6f00 authored by Tom Lane's avatar Tom Lane
Browse files
Options

Remove yacc/lex output files from CVS repository.

parent 19e4d33b
Hide whitespace changes
Inline Side-by-side
Showing with 0 additions and 34169 deletions
src/backend/parser/gram.c deleted 100644 → 0
View file @ 19e4d33b
This source diff could not be displayed because it is too large. You can view the blob instead.
src/backend/parser/parse.h deleted 100644 → 0
View file @ 19e4d33b
typedef union
{
double dval;
int ival;
char chr;
char *str;
bool boolean;
bool* pboolean; /* for pg_shadow privileges */
List *list;
Node *node;
Value *value;
Attr *attr;
TypeName *typnam;
DefElem *defelt;
ParamString *param;
SortGroupBy *sortgroupby;
JoinExpr *joinexpr;
IndexElem *ielem;
RangeVar *range;
RelExpr *relexp;
A_Indices *aind;
ResTarget *target;
ParamNo *paramno;
VersionStmt *vstmt;
DefineStmt *dstmt;
RuleStmt *rstmt;
InsertStmt *astmt;
} YYSTYPE;
#define ABSOLUTE 258
#define ACTION 259
#define ADD 260
#define ALL 261
#define ALTER 262
#define AND 263
#define ANY 264
#define AS 265
#define ASC 266
#define BEGIN_TRANS 267
#define BETWEEN 268
#define BOTH 269
#define BY 270
#define CASCADE 271
#define CASE 272
#define CAST 273
#define CHAR 274
#define CHARACTER 275
#define CHECK 276
#define CLOSE 277
#define COALESCE 278
#define COLLATE 279
#define COLUMN 280
#define COMMIT 281
#define CONSTRAINT 282
#define CREATE 283
#define CROSS 284
#define CURRENT 285
#define CURRENT_DATE 286
#define CURRENT_TIME 287
#define CURRENT_TIMESTAMP 288
#define CURRENT_USER 289
#define CURSOR 290
#define DAY_P 291
#define DECIMAL 292
#define DECLARE 293
#define DEFAULT 294
#define DELETE 295
#define DESC 296
#define DISTINCT 297
#define DOUBLE 298
#define DROP 299
#define ELSE 300
#define END_TRANS 301
#define EXCEPT 302
#define EXECUTE 303
#define EXISTS 304
#define EXTRACT 305
#define FALSE_P 306
#define FETCH 307
#define FLOAT 308
#define FOR 309
#define FOREIGN 310
#define FROM 311
#define FULL 312
#define GRANT 313
#define GROUP 314
#define HAVING 315
#define HOUR_P 316
#define IN 317
#define INNER_P 318
#define INSENSITIVE 319
#define INSERT 320
#define INTERSECT 321
#define INTERVAL 322
#define INTO 323
#define IS 324
#define ISOLATION 325
#define JOIN 326
#define KEY 327
#define LANGUAGE 328
#define LEADING 329
#define LEFT 330
#define LEVEL 331
#define LIKE 332
#define LOCAL 333
#define MATCH 334
#define MINUTE_P 335
#define MONTH_P 336
#define NAMES 337
#define NATIONAL 338
#define NATURAL 339
#define NCHAR 340
#define NEXT 341
#define NO 342
#define NOT 343
#define NULLIF 344
#define NULL_P 345
#define NUMERIC 346
#define OF 347
#define ON 348
#define ONLY 349
#define OPTION 350
#define OR 351
#define ORDER 352
#define OUTER_P 353
#define PARTIAL 354
#define POSITION 355
#define PRECISION 356
#define PRIMARY 357
#define PRIOR 358
#define PRIVILEGES 359
#define PROCEDURE 360
#define PUBLIC 361
#define READ 362
#define REFERENCES 363
#define RELATIVE 364
#define REVOKE 365
#define RIGHT 366
#define ROLLBACK 367
#define SCROLL 368
#define SECOND_P 369
#define SELECT 370
#define SET 371
#define SUBSTRING 372
#define TABLE 373
#define TEMP 374
#define THEN 375
#define TIME 376
#define TIMESTAMP 377
#define TIMEZONE_HOUR 378
#define TIMEZONE_MINUTE 379
#define TO 380
#define TRAILING 381
#define TRANSACTION 382
#define TRIM 383
#define TRUE_P 384
#define UNION 385
#define UNIQUE 386
#define UPDATE 387
#define USER 388
#define USING 389
#define VALUES 390
#define VARCHAR 391
#define VARYING 392
#define VIEW 393
#define WHEN 394
#define WHERE 395
#define WITH 396
#define WORK 397
#define YEAR_P 398
#define ZONE 399
#define TRIGGER 400
#define TYPE_P 401
#define ABORT_TRANS 402
#define AFTER 403
#define AGGREGATE 404
#define ANALYZE 405
#define BACKWARD 406
#define BEFORE 407
#define BINARY 408
#define CACHE 409
#define CLUSTER 410
#define COPY 411
#define CREATEDB 412
#define CREATEUSER 413
#define CYCLE 414
#define DATABASE 415
#define DELIMITERS 416
#define DO 417
#define EACH 418
#define ENCODING 419
#define EXPLAIN 420
#define EXTEND 421
#define FORWARD 422
#define FUNCTION 423
#define HANDLER 424
#define INCREMENT 425
#define INDEX 426
#define INHERITS 427
#define INSTEAD 428
#define ISNULL 429
#define LANCOMPILER 430
#define LIMIT 431
#define LISTEN 432
#define LOAD 433
#define LOCATION 434
#define LOCK_P 435
#define MAXVALUE 436
#define MINVALUE 437
#define MOVE 438
#define NEW 439
#define NOCREATEDB 440
#define NOCREATEUSER 441
#define NONE 442
#define NOTHING 443
#define NOTIFY 444
#define NOTNULL 445
#define OFFSET 446
#define OIDS 447
#define OPERATOR 448
#define PASSWORD 449
#define PROCEDURAL 450
#define RENAME 451
#define RESET 452
#define RETURNS 453
#define ROW 454
#define RULE 455
#define SEQUENCE 456
#define SERIAL 457
#define SETOF 458
#define SHOW 459
#define START 460
#define STATEMENT 461
#define STDIN 462
#define STDOUT 463
#define TRUSTED 464
#define UNLISTEN 465
#define UNTIL 466
#define VACUUM 467
#define VALID 468
#define VERBOSE 469
#define VERSION 470
#define IDENT 471
#define SCONST 472
#define Op 473
#define ICONST 474
#define PARAM 475
#define FCONST 476
#define OP 477
#define UMINUS 478
#define TYPECAST 479
extern YYSTYPE yylval;
src/backend/parser/scan.c deleted 100644 → 0
View file @ 19e4d33b
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* /master/usr.bin/lex/skel.c,v 1.3 1997/09/25 00:10:23 jch 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 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 41
#define YY_END_OF_BUFFER 42
static yyconst short int yy_acclist[182] =
{ 0,
10, 10, 6, 6, 23, 23, 9, 9, 24, 24,
18, 18, 42, 40, 41, 39, 40, 41, 39, 41,
31, 40, 41, 21, 40, 41, 28, 29, 31, 40,
41, 28, 29, 31, 40, 41, 15, 40, 41, 28,
29, 40, 41, 28, 29, 31, 40, 41, 28, 29,
40, 41, 28, 29, 31, 40, 41, 36, 40, 41,
16418, 28, 29, 31, 40, 41, 38, 40, 41,16417,
38, 40, 41,16417, 38, 40, 41,16417, 10, 41,
8, 41, 3, 6, 41, 3, 6, 41, 3, 41,
6, 41, 23, 41, 22, 41, 9, 41, 14, 41,
41, 24, 41, 25, 41, 18, 41, 16, 41, 41,
31, 31, 31, 32, 31, 31, 36,16418, 37,16419,
4, 31, 31, 37,16419, 26, 31, 38,16417, 7,
13, 10, 6, 6, 5, 23, 9, 24, 18, 17,
19, 30, 27, 30, 27, 30, 32, 27, 1, 31,
31, 27, 30, 4, 31, 4, 31, 4, 31, 8226,
37,16419, 37,16419, 8225, 12, 5, 11, 20, 30,
8227, 37,16419, 2, 4, 31, 30, 2, 2, 2,
2
} ;
static yyconst short int yy_accept[134] =
{ 0,
1, 1, 1, 2, 3, 4, 5, 6, 7, 8,
9, 10, 11, 12, 13, 14, 16, 19, 21, 24,
27, 32, 37, 40, 44, 49, 53, 58, 62, 67,
71, 75, 79, 81, 83, 86, 89, 91, 93, 95,
97, 99, 101, 102, 104, 106, 108, 110, 111, 112,
113, 113, 114, 115, 116, 116, 117, 117, 119, 121,
123, 124, 124, 124, 126, 126, 128, 128, 128, 130,
131, 132, 133, 133, 133, 134, 135, 135, 135, 136,
137, 138, 138, 138, 139, 140, 140, 140, 141, 142,
143, 145, 148, 149, 149, 150, 151, 152, 154, 154,
154, 154, 154, 156, 158, 160, 161, 163, 163, 165,
166, 166, 166, 167, 168, 168, 168, 169, 169, 169,
170, 171, 172, 172, 174, 174, 177, 178, 179, 180,
181, 182, 182
} ;
static yyconst int yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 4, 5, 4, 6, 7, 4, 8, 9,
9, 10, 11, 9, 12, 13, 14, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 16, 9, 7,
7, 7, 4, 4, 17, 18, 17, 17, 19, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 20, 17, 17,
9, 21, 9, 4, 17, 4, 17, 18, 17, 17,
19, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 20,
17, 17, 1, 7, 1, 4, 1, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17
} ;
static yyconst int yy_meta[22] =
{ 0,
1, 2, 3, 4, 5, 4, 4, 6, 1, 7,
8, 9, 10, 4, 11, 4, 2, 2, 11, 2,
12
} ;
static yyconst short int yy_base[152] =
{ 0,
0, 0, 341, 340, 18, 31, 342, 341, 337, 331,
24, 37, 23, 25, 338, 454, 454, 454, 251, 454,
48, 40, 454, 54, 46, 65, 55, 79, 234, 71,
97, 240, 0, 51, 0, 106, 61, 0, 0, 454,
0, 76, 454, 82, 454, 0, 85, 0, 227, 89,
94, 49, 222, 213, 57, 122, 211, 0, 142, 158,
106, 144, 0, 206, 96, 193, 146, 0, 187, 454,
454, 0, 87, 173, 0, 0, 141, 172, 150, 0,
0, 112, 175, 164, 0, 177, 182, 454, 454, 454,
454, 135, 454, 187, 454, 200, 158, 0, 184, 0,
177, 93, 213, 81, 200, 454, 0, 71, 144, 454,
228, 230, 454, 206, 232, 239, 454, 241, 243, 454,
0, 454, 61, 33, 208, 250, 13, 252, 254, 256,
258, 454, 264, 276, 288, 300, 312, 324, 333, 341,
352, 364, 373, 382, 394, 406, 417, 429, 434, 438,
442
} ;
static yyconst short int yy_def[152] =
{ 0,
132, 1, 133, 133, 134, 134, 135, 135, 136, 136,
137, 137, 138, 138, 132, 132, 132, 132, 139, 132,
139, 21, 132, 132, 21, 132, 22, 132, 22, 140,
140, 31, 141, 132, 142, 142, 143, 36, 144, 132,
145, 132, 132, 132, 132, 146, 132, 147, 139, 139,
132, 50, 132, 52, 132, 132, 132, 28, 132, 148,
56, 132, 149, 59, 132, 139, 132, 150, 31, 132,
132, 141, 132, 132, 142, 36, 143, 143, 143, 144,
145, 132, 132, 132, 146, 132, 132, 132, 132, 132,
132, 132, 132, 56, 132, 94, 96, 94, 132, 151,
132, 148, 148, 103, 103, 132, 64, 132, 64, 132,
132, 132, 132, 132, 132, 132, 132, 132, 132, 132,
94, 132, 132, 109, 148, 103, 148, 148, 148, 132,
132, 0, 132, 132, 132, 132, 132, 132, 132, 132,
132, 132, 132, 132, 132, 132, 132, 132, 132, 132,
132
} ;
static yyconst short int yy_nxt[476] =
{ 0,
16, 17, 18, 19, 20, 21, 22, 23, 24, 22,
22, 25, 26, 27, 28, 29, 30, 31, 30, 32,
16, 36, 125, 36, 36, 44, 44, 37, 36, 36,
47, 38, 47, 36, 36, 45, 36, 36, 44, 44,
37, 36, 36, 48, 38, 48, 36, 124, 45, 51,
51, 54, 73, 74, 132, 51, 51, 56, 57, 52,
58, 91, 53, 92, 60, 55, 51, 51, 61, 93,
77, 93, 67, 67, 79, 124, 55, 82, 83, 59,
62, 62, 68, 84, 84, 109, 86, 87, 73, 74,
63, 64, 88, 58, 126, 51, 51, 65, 67, 67,
50, 90, 125, 90, 70, 55, 108, 108, 68, 76,
109, 76, 76, 82, 83, 77, 76, 76, 94, 76,
94, 76, 94, 94, 95, 96, 94, 96, 96, 94,
94, 96, 96, 97, 98, 96, 98, 96, 94, 94,
94, 94, 94, 99, 99, 62, 62, 67, 67, 53,
77, 114, 114, 100, 79, 63, 59, 68, 109, 77,
101, 103, 132, 103, 103, 84, 84, 104, 103, 105,
121, 103, 121, 103, 111, 112, 115, 116, 86, 87,
113, 77, 117, 118, 119, 99, 99, 123, 123, 120,
94, 124, 94, 94, 132, 100, 94, 94, 94, 94,
94, 94, 94, 96, 50, 96, 96, 114, 114, 96,
96, 97, 127, 96, 127, 96, 103, 125, 103, 103,
107, 128, 104, 103, 105, 59, 103, 91, 103, 111,
112, 111, 112, 115, 116, 113, 53, 113, 50, 117,
115, 116, 118, 119, 118, 119, 117, 71, 120, 66,
120, 129, 130, 129, 130, 129, 130, 131, 130, 131,
130, 125, 50, 125, 33, 33, 33, 33, 33, 33,
33, 33, 33, 33, 33, 33, 35, 35, 35, 35,
35, 35, 35, 35, 35, 35, 35, 35, 39, 39,
39, 39, 39, 39, 39, 39, 39, 39, 39, 39,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 43, 43, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 46, 46, 46, 46, 46, 46,
46, 46, 46, 46, 46, 46, 49, 132, 42, 49,
49, 49, 69, 69, 42, 40, 40, 34, 34, 69,
132, 69, 72, 72, 72, 72, 72, 132, 72, 72,
72, 72, 72, 72, 75, 75, 75, 75, 75, 75,
132, 75, 75, 75, 75, 75, 78, 132, 132, 78,
78, 78, 80, 80, 80, 80, 132, 80, 80, 80,
80, 80, 80, 80, 81, 81, 81, 81, 81, 132,
81, 81, 81, 81, 81, 81, 85, 85, 85, 85,
85, 132, 85, 85, 85, 85, 85, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 102,
102, 132, 102, 102, 102, 102, 102, 102, 102, 102,
102, 106, 106, 106, 106, 110, 110, 110, 110, 122,
122, 122, 122, 15, 132, 132, 132, 132, 132, 132,
132, 132, 132, 132, 132, 132, 132, 132, 132, 132,
132, 132, 132, 132, 132
} ;
static yyconst short int yy_chk[476] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 5, 127, 5, 5, 11, 11, 5, 5, 5,
13, 5, 14, 5, 6, 11, 6, 6, 12, 12,
6, 6, 6, 13, 6, 14, 6, 124, 12, 21,
21, 22, 34, 34, 22, 24, 24, 25, 25, 21,
25, 52, 21, 52, 27, 24, 26, 26, 27, 55,
37, 55, 30, 30, 37, 123, 26, 42, 42, 26,
28, 28, 30, 44, 44, 108, 47, 47, 73, 73,
28, 28, 47, 28, 104, 51, 51, 28, 31, 31,
50, 50, 102, 50, 31, 51, 65, 65, 31, 36,
65, 36, 36, 82, 82, 36, 36, 36, 61, 36,
61, 36, 56, 56, 56, 56, 56, 56, 56, 56,
56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
56, 56, 56, 59, 59, 62, 62, 67, 67, 92,
77, 79, 79, 59, 77, 62, 59, 67, 109, 79,
59, 60, 109, 60, 60, 84, 84, 60, 60, 60,
97, 60, 97, 60, 74, 74, 83, 83, 86, 86,
74, 78, 83, 87, 87, 99, 99, 101, 101, 87,
94, 101, 94, 94, 69, 99, 94, 94, 94, 94,
94, 94, 94, 96, 66, 96, 96, 114, 114, 96,
96, 96, 105, 96, 105, 96, 103, 125, 103, 103,
64, 125, 103, 103, 103, 57, 103, 54, 103, 111,
111, 112, 112, 115, 115, 111, 53, 112, 49, 115,
116, 116, 118, 118, 119, 119, 116, 32, 118, 29,
119, 126, 126, 128, 128, 129, 129, 130, 130, 131,
131, 128, 19, 129, 133, 133, 133, 133, 133, 133,
133, 133, 133, 133, 133, 133, 134, 134, 134, 134,
134, 134, 134, 134, 134, 134, 134, 134, 135, 135,
135, 135, 135, 135, 135, 135, 135, 135, 135, 135,
136, 136, 136, 136, 136, 136, 136, 136, 136, 136,
136, 136, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 138, 138, 138, 138, 138, 138,
138, 138, 138, 138, 138, 138, 139, 15, 10, 139,
139, 139, 140, 140, 9, 8, 7, 4, 3, 140,
0, 140, 141, 141, 141, 141, 141, 0, 141, 141,
141, 141, 141, 141, 142, 142, 142, 142, 142, 142,
0, 142, 142, 142, 142, 142, 143, 0, 0, 143,
143, 143, 144, 144, 144, 144, 0, 144, 144, 144,
144, 144, 144, 144, 145, 145, 145, 145, 145, 0,
145, 145, 145, 145, 145, 145, 146, 146, 146, 146,
146, 0, 146, 146, 146, 146, 146, 147, 147, 147,
147, 147, 147, 147, 147, 147, 147, 147, 147, 148,
148, 0, 148, 148, 148, 148, 148, 148, 148, 148,
148, 149, 149, 149, 149, 150, 150, 150, 150, 151,
151, 151, 151, 132, 132, 132, 132, 132, 132, 132,
132, 132, 132, 132, 132, 132, 132, 132, 132, 132,
132, 132, 132, 132, 132
} ;
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
static int yy_looking_for_trail_begin = 0;
static int yy_full_lp;
static int *yy_full_state;
#define YY_TRAILING_MASK 0x2000
#define YY_TRAILING_HEAD_MASK 0x4000
#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 = yy_full_lp; /* restore orig. accepting pos. */ \
yy_state_ptr = yy_full_state; /* restore orig. state */ \
yy_current_state = *yy_state_ptr; /* restore curr. state */ \
++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 "scan.l"
#define INITIAL 0
#line 2 "scan.l"
/*-------------------------------------------------------------------------
*
* scan.l
* lexical scanner for POSTGRES
*
* Copyright (c) 1994, Regents of the University of California
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/parser/Attic/scan.c,v 1.37 1999/03/17 20:17:13 momjian Exp $
*
*-------------------------------------------------------------------------
*/
#include <ctype.h>
#include <unistd.h>
#ifndef __linux__
#include <math.h>
#else
#include <stdlib.h>
#endif /* __linux__ */
#include <string.h>
#include <errno.h>
#include "postgres.h"
#include "miscadmin.h"
#include "nodes/pg_list.h"
#include "nodes/parsenodes.h"
#include "parser/gramparse.h"
#include "parser/keywords.h"
#include "parser/scansup.h"
#include "parse.h"
#include "utils/builtins.h"
extern char *parseString;
static char *parseCh;
/* some versions of lex define this as a macro */
#if defined(yywrap)
#undef yywrap
#endif /* yywrap */
#if defined(FLEX_SCANNER)
/* MAX_PARSE_BUFFER is defined in miscadmin.h */
#define YYLMAX MAX_PARSE_BUFFER
#define YY_NO_UNPUT
static int myinput(char* buf, int max);
#undef YY_INPUT
#define YY_INPUT(buf,result,max) {result = myinput(buf,max);}
#else
#undef input
int input();
#undef unput
void unput(char);
#endif /* FLEX_SCANNER */
extern YYSTYPE yylval;
int llen;
char literal[MAX_PARSE_BUFFER];
/* 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 condition, to which all non-conditional rules apply.
* When in an exclusive condition, only those rules defined for that condition apply.
*
* Exclusive states change parsing rules while the state is active.
* There are exclusive states for quoted strings, extended comments,
* and to eliminate parsing troubles for numeric strings.
* Exclusive states:
* <xb> binary numeric string - thomas 1997-11-16
* <xc> extended C-style comments - tgl 1997-07-12
* <xd> delimited identifiers (double-quoted identifiers) - tgl 1997-10-27
* <xh> hexadecimal numeric string - thomas 1997-11-16
* <xm> numeric strings with embedded minus sign - tgl 1997-09-05
* <xq> quoted strings - tgl 1997-07-30
*
* The "extended comment" syntax closely resembles allowable operator syntax.
* So, when in condition <xc>, only strings which would terminate the
* "extended comment" trigger any action other than "ignore".
* Be sure to match _any_ candidate comment, including those with appended
* operator-like symbols. - thomas 1997-07-14
*/
#define xb 1
#define xc 2
#define xd 3
#define xh 4
#define xm 5
#define xq 6
/* Binary number
*/
/* Hexadecimal number
*/
/* Extended quote
* xqdouble implements SQL92 embedded quote
* xqcat allows strings to cross input lines
* Note: reduction of '' and \ sequences to output text is done in scanstr(),
* not by rules here.
*/
/* Delimited quote
* Allows embedded spaces and other special characters into identifiers.
*/
/* Comments
* Ignored by the scanner and parser.
*/
/*
real [\-]?{digit}+\.{digit}+([Ee][-+]?{digit}+)?
*/
/* 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. tgl - 1997-09-08
*
* Quoted strings must allow some special characters such as single-quote
* and newline.
* Embedded single-quotes are implemented both in the SQL/92-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
*/
#line 677 "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 180 "scan.l"
#line 830 "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_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 >= 133 )
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] != 454 );
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];
if ( yy_act & YY_TRAILING_HEAD_MASK ||
yy_looking_for_trail_begin )
{
if ( yy_act == yy_looking_for_trail_begin )
{
yy_looking_for_trail_begin = 0;
yy_act &= ~YY_TRAILING_HEAD_MASK;
break;
}
}
else if ( yy_act & YY_TRAILING_MASK )
{
yy_looking_for_trail_begin = yy_act & ~YY_TRAILING_MASK;
yy_looking_for_trail_begin |= YY_TRAILING_HEAD_MASK;
}
else
{
yy_full_match = yy_cp;
yy_full_state = yy_state_ptr;
yy_full_lp = yy_lp;
break;
}
++yy_lp;
goto find_rule;
}
--yy_cp;
yy_current_state = *--yy_state_ptr;
yy_lp = 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 1:
YY_RULE_SETUP
#line 181 "scan.l"
{ /* ignore */ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 183 "scan.l"
{ /* ignore */ }
YY_BREAK
case 3:
#line 186 "scan.l"
case 4:
YY_RULE_SETUP
#line 186 "scan.l"
{ BEGIN(xc); }
YY_BREAK
case 5:
YY_RULE_SETUP
#line 188 "scan.l"
{ BEGIN(INITIAL); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 190 "scan.l"
{ /* ignore */ }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 192 "scan.l"
{
BEGIN(xb);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 8:
YY_RULE_SETUP
#line 197 "scan.l"
{
char* endptr;
BEGIN(INITIAL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,2);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad binary integer input '%s'",literal);
return ICONST;
}
YY_BREAK
case 9:
#line 208 "scan.l"
case 10:
YY_RULE_SETUP
#line 208 "scan.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
elog(ERROR,"quoted string parse buffer of %d chars exceeded",MAX_PARSE_BUFFER);
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 11:
#line 215 "scan.l"
case 12:
YY_RULE_SETUP
#line 215 "scan.l"
{
}
YY_BREAK
case 13:
YY_RULE_SETUP
#line 218 "scan.l"
{
BEGIN(xh);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 14:
YY_RULE_SETUP
#line 223 "scan.l"
{
char* endptr;
BEGIN(INITIAL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,16);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad hexadecimal integer input '%s'",literal);
return ICONST;
}
YY_BREAK
case 15:
YY_RULE_SETUP
#line 234 "scan.l"
{
BEGIN(xq);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 16:
YY_RULE_SETUP
#line 239 "scan.l"
{
BEGIN(INITIAL);
yylval.str = pstrdup(scanstr(literal));
return SCONST;
}
YY_BREAK
case 17:
#line 245 "scan.l"
case 18:
#line 246 "scan.l"
case 19:
YY_RULE_SETUP
#line 246 "scan.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
elog(ERROR,"quoted string parse buffer of %d chars exceeded",MAX_PARSE_BUFFER);
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 20:
YY_RULE_SETUP
#line 252 "scan.l"
{
}
YY_BREAK
case 21:
YY_RULE_SETUP
#line 256 "scan.l"
{
BEGIN(xd);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 22:
YY_RULE_SETUP
#line 261 "scan.l"
{
BEGIN(INITIAL);
yylval.str = pstrdup(literal);
return IDENT;
}
YY_BREAK
case 23:
YY_RULE_SETUP
#line 266 "scan.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
elog(ERROR,"quoted string parse buffer of %d chars exceeded",MAX_PARSE_BUFFER);
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 24:
YY_RULE_SETUP
#line 274 "scan.l"
{ /* ignore */ }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 275 "scan.l"
{
BEGIN(INITIAL);
return yytext[0];
}
YY_BREAK
case 26:
YY_RULE_SETUP
#line 281 "scan.l"
{ return TYPECAST; }
YY_BREAK
case 27:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp = yy_bp + 1;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 283 "scan.l"
{
BEGIN(xm);
return yytext[0];
}
YY_BREAK
case 28:
YY_RULE_SETUP
#line 287 "scan.l"
{ return yytext[0]; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 288 "scan.l"
{ return yytext[0]; }
YY_BREAK
case 30:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp -= 2;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 289 "scan.l"
{
yylval.str = pstrdup((char*)yytext);
return Op;
}
YY_BREAK
case 31:
YY_RULE_SETUP
#line 293 "scan.l"
{
if (strcmp((char*)yytext,"!=") == 0)
yylval.str = pstrdup("<>"); /* compatability */
else
yylval.str = pstrdup((char*)yytext);
return Op;
}
YY_BREAK
case 32:
YY_RULE_SETUP
#line 300 "scan.l"
{
yylval.ival = atoi((char*)&yytext[1]);
return PARAM;
}
YY_BREAK
case 33:
YY_RULE_SETUP
#line 306 "scan.l"
{
int i;
ScanKeyword *keyword;
BEGIN(xm);
for(i = 0; yytext[i]; i++)
if (isascii((unsigned char)yytext[i]) &&
isupper(yytext[i]))
yytext[i] = tolower(yytext[i]);
if (i >= NAMEDATALEN)
yytext[NAMEDATALEN-1] = '\0';
keyword = ScanKeywordLookup((char*)yytext);
if (keyword != NULL) {
return keyword->value;
}
else
{
yylval.str = pstrdup((char*)yytext);
return IDENT;
}
}
YY_BREAK
case 34:
YY_RULE_SETUP
#line 328 "scan.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad integer input '%s'",yytext);
CheckFloat8Val(yylval.dval);
elog(NOTICE,"Integer input '%s' is out of range; promoted to float", yytext);
return FCONST;
}
return ICONST;
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 346 "scan.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad float8 input '%s'",yytext);
CheckFloat8Val(yylval.dval);
return FCONST;
}
YY_BREAK
case 36:
YY_RULE_SETUP
#line 357 "scan.l"
{
char* endptr;
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad integer input '%s'",yytext);
CheckFloat8Val(yylval.dval);
elog(NOTICE,"Integer input '%s' is out of range; promoted to float", yytext);
return FCONST;
}
return ICONST;
}
YY_BREAK
case 37:
YY_RULE_SETUP
#line 374 "scan.l"
{
char* endptr;
errno = 0;
yylval.dval = strtod((char *)yytext,&endptr);
if (*endptr != '\0' || errno == ERANGE)
elog(ERROR,"Bad float input '%s'",yytext);
CheckFloat8Val(yylval.dval);
return FCONST;
}
YY_BREAK
case 38:
YY_RULE_SETUP
#line 386 "scan.l"
{
int i;
ScanKeyword *keyword;
for(i = 0; yytext[i]; i++)
if (isascii((unsigned char)yytext[i]) &&
isupper(yytext[i]))
yytext[i] = tolower(yytext[i]);
if (i >= NAMEDATALEN)
yytext[NAMEDATALEN-1] = '\0';
keyword = ScanKeywordLookup((char*)yytext);
if (keyword != NULL) {
return keyword->value;
}
else
{
yylval.str = pstrdup((char*)yytext);
return IDENT;
}
}
YY_BREAK
case 39:
YY_RULE_SETUP
#line 407 "scan.l"
{ /* ignore */ }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 409 "scan.l"
{ return yytext[0]; }
YY_BREAK
case 41:
YY_RULE_SETUP
#line 411 "scan.l"
ECHO;
YY_BREAK
#line 1300 "lex.yy.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(xb):
case YY_STATE_EOF(xc):
case YY_STATE_EOF(xd):
case YY_STATE_EOF(xh):
case YY_STATE_EOF(xm):
case YY_STATE_EOF(xq):
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;
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 >= 133 )
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 >= 133 )
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 == 132);
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;
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 411 "scan.l"
void yyerror(char message[])
{
elog(ERROR, "parser: %s at or near \"%s\"", message, yytext);
}
int yywrap()
{
return(1);
}
/*
init_io:
called by postgres before any actual parsing is done
*/
void
init_io()
{
/* it's important to set this to NULL
because input()/myinput() checks the non-nullness of parseCh
to know when to pass the string to lex/flex */
parseCh = NULL;
#if defined(FLEX_SCANNER)
if (YY_CURRENT_BUFFER)
yy_flush_buffer(YY_CURRENT_BUFFER);
#endif /* FLEX_SCANNER */
BEGIN INITIAL;
}
#if !defined(FLEX_SCANNER)
/* get lex input from a string instead of from stdin */
int
input()
{
if (parseCh == NULL)
{
parseCh = parseString;
return(*parseCh++);
}
else if (*parseCh == '\0')
return(0);
else
return(*parseCh++);
}
/* undo lex input from a string instead of from stdin */
void
unput(char c)
{
if (parseCh == NULL)
elog(FATAL, "Unput() failed.\n");
else if (c != 0)
*--parseCh = c;
}
#endif /* !defined(FLEX_SCANNER) */
#ifdef FLEX_SCANNER
/* input routine for flex to read input from a string instead of a file */
static int
myinput(char* buf, int max)
{
int len, copylen;
if (parseCh == NULL)
{
len = strlen(parseString);
if (len >= max)
copylen = max - 1;
else
copylen = len;
if (copylen > 0)
memcpy(buf, parseString, copylen);
buf[copylen] = '\0';
parseCh = parseString;
return copylen;
}
else
return 0; /* end of string */
}
#endif /* FLEX_SCANNER */
src/interfaces/ecpg/preproc/pgc.c deleted 100644 → 0
View file @ 19e4d33b
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* $Header: /cvsroot/pgsql/src/interfaces/ecpg/preproc/Attic/pgc.c,v 1.1 1999/02/28 07:25:29 scrappy 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 71
#define YY_END_OF_BUFFER 72
static yyconst short int yy_acclist[312] =
{ 0,
10, 10, 6, 6, 23, 23, 26, 26, 9, 9,
27, 27, 18, 18, 72, 71, 24, 71, 71, 60,
71, 54, 60, 71, 54, 71, 24, 60, 71, 49,
60, 71, 53, 60, 71, 52, 60, 71, 60, 71,
60, 71, 41, 60, 71,16424, 51, 60, 71, 59,
60, 71, 50, 60, 71, 50, 60, 71, 57, 60,
71, 58, 60, 71, 55, 60, 71, 56, 60, 71,
46, 71, 44, 46, 71, 44, 71, 33, 46, 71,
21, 24, 46, 71, 31, 33, 46, 71, 15, 46,
71, 31, 46, 71, 31, 33, 46, 71, 31, 33,
46, 71, 31, 46, 71, 31, 33, 46, 71, 38,
46, 71,16420, 31, 33, 46, 71, 45, 46, 71,
43, 46, 71,16419, 43, 46, 71,16419, 43, 46,
71,16419, 69, 71, 68, 71, 68, 69, 71, 24,
69, 71, 69, 71, 69, 70, 71, 66, 71, 64,
66, 71, 66, 71, 65, 71, 62, 71, 63, 71,
10, 71, 8, 71, 3, 6, 71, 3, 6, 71,
3, 71, 6, 71, 23, 71, 22, 71, 26, 71,
25, 71, 9, 71, 14, 71, 27, 71, 28, 71,
18, 71, 16, 71, 71, 4, 49, 49, 49, 49,
41,16424, 50, 50, 33, 33, 33, 34, 33, 33,
38,16420, 39,16421, 4, 33, 33, 39,16421, 29,
33, 42, 43,16419, 7, 13, 69, 4, 69, 63,
10, 6, 6, 5, 23, 26, 9, 27, 18, 17,
19, 4, 4, 49, 49, 48, 8232, 50, 32, 30,
32, 30, 32, 34, 30, 1, 33, 33, 30, 32,
4, 33, 4, 33, 4, 33, 8228, 39,16421, 39,
16421, 42, 8227, 69, 4, 69, 4, 69, 12, 5,
11, 20, 2, 4, 50, 32, 8229, 39,16421, 2,
4, 33, 32, 42, 69, 2, 4, 69, 2, 2,
2, 49, 42, 2, 69, 2, 69, 2, 47, 61,
67
} ;
static yyconst short int yy_accept[241] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 2, 3, 4, 5, 6, 7, 8,
9, 10, 11, 12, 13, 14, 15, 16, 17, 19,
20, 22, 25, 27, 30, 33, 36, 39, 41, 43,
47, 50, 53, 56, 59, 62, 65, 68, 71, 73,
76, 78, 81, 85, 89, 92, 95, 99, 103, 106,
110, 114, 118, 121, 125, 129, 133, 135, 137, 140,
143, 145, 148, 150, 153, 155, 157, 159, 161, 163,
165, 168, 171, 173, 175, 177, 179, 181, 183, 185,
187, 189, 191, 193, 195, 196, 197, 197, 198, 199,
200, 201, 203, 203, 203, 203, 204, 205, 206, 207,
207, 208, 209, 209, 210, 211, 211, 213, 215, 217,
218, 218, 218, 220, 220, 222, 223, 223, 223, 225,
226, 227, 228, 230, 231, 232, 232, 232, 233, 234,
234, 234, 235, 236, 237, 238, 238, 238, 239, 240,
240, 240, 241, 242, 242, 243, 244, 245, 246, 246,
247, 248, 249, 250, 252, 255, 256, 256, 257, 258,
259, 261, 261, 261, 261, 263, 265, 267, 268, 270,
270, 272, 272, 272, 273, 274, 275, 277, 279, 279,
279, 280, 281, 281, 281, 282, 282, 282, 283, 283,
285, 285, 285, 286, 287, 288, 288, 290, 293, 294,
295, 296, 299, 300, 301, 302, 303, 303, 304, 306,
308, 309, 309, 309, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 311, 311, 312, 312
} ;
static yyconst int yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 4, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 5, 6, 7, 8, 5, 5, 9, 10,
10, 11, 12, 13, 14, 15, 16, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 18, 19, 20,
21, 22, 5, 5, 23, 24, 25, 26, 27, 28,
23, 23, 29, 23, 23, 30, 23, 31, 23, 23,
32, 23, 33, 23, 34, 23, 23, 35, 23, 23,
36, 37, 38, 5, 23, 5, 23, 24, 25, 26,
27, 28, 23, 23, 29, 23, 23, 30, 23, 31,
23, 23, 32, 23, 33, 23, 34, 23, 23, 35,
23, 23, 39, 20, 40, 5, 1, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23
} ;
static yyconst int yy_meta[41] =
{ 0,
1, 2, 3, 4, 5, 6, 5, 5, 7, 1,
8, 5, 1, 9, 10, 5, 11, 5, 1, 5,
5, 5, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 1, 13, 1, 1, 1
} ;
static yyconst short int yy_base[270] =
{ 0,
0, 1, 17, 0, 57, 0, 96, 101, 107, 125,
143, 0, 475, 473, 174, 192, 474, 471, 461, 460,
448, 445, 0, 134, 97, 105, 446, 1006, 1006, 433,
1006, 6, 148, 1006, 98, 1006, 1006, 425, 105, 213,
1006, 1006, 0, 405, 1006, 1006, 1006, 1006, 1006, 1006,
1006, 423, 1006, 217, 1006, 221, 105, 139, 234, 146,
250, 276, 1006, 241, 254, 417, 0, 1006, 0, 0,
413, 0, 1006, 1006, 409, 1006, 1006, 0, 0, 237,
0, 307, 114, 0, 0, 1006, 0, 1006, 0, 257,
267, 1006, 0, 328, 0, 333, 332, 121, 161, 413,
354, 272, 410, 357, 350, 0, 375, 381, 232, 366,
172, 373, 176, 190, 389, 362, 0, 371, 407, 427,
379, 372, 361, 419, 362, 118, 448, 441, 363, 1006,
1006, 0, 467, 0, 0, 457, 461, 0, 0, 217,
355, 488, 0, 0, 0, 491, 494, 498, 0, 502,
505, 1006, 1006, 352, 510, 336, 508, 531, 347, 1006,
1006, 323, 1006, 1006, 329, 1006, 340, 1006, 0, 194,
339, 534, 527, 459, 0, 317, 276, 1006, 309, 307,
547, 298, 0, 125, 1006, 271, 567, 300, 553, 556,
1006, 588, 591, 594, 1006, 602, 605, 1006, 306, 613,
616, 619, 622, 310, 1006, 278, 625, 628, 274, 169,
406, 631, 634, 644, 647, 650, 239, 187, 654, 657,
660, 234, 232, 667, 200, 223, 211, 204, 197, 189,
150, 134, 127, 116, 92, 1006, 81, 1006, 1006, 687,
700, 713, 726, 739, 752, 765, 778, 791, 804, 807,
815, 823, 835, 838, 850, 863, 872, 881, 894, 907,
920, 932, 945, 958, 971, 976, 988, 0, 993
} ;
static yyconst short int yy_def[270] =
{ 0,
240, 240, 239, 3, 239, 5, 241, 241, 242, 242,
240, 11, 243, 243, 244, 244, 245, 245, 246, 246,
247, 247, 240, 240, 248, 248, 239, 239, 239, 239,
239, 239, 239, 239, 249, 239, 239, 239, 239, 239,
239, 239, 250, 250, 239, 239, 239, 239, 239, 239,
239, 251, 239, 251, 239, 239, 54, 54, 239, 54,
239, 239, 239, 252, 252, 65, 253, 239, 253, 253,
253, 253, 239, 239, 239, 239, 239, 254, 255, 239,
256, 256, 257, 82, 258, 239, 259, 239, 260, 239,
239, 239, 261, 239, 262, 263, 239, 249, 249, 239,
249, 239, 264, 239, 239, 250, 250, 251, 251, 239,
109, 239, 239, 109, 265, 239, 61, 239, 263, 265,
239, 239, 118, 239, 251, 266, 239, 239, 65, 239,
239, 253, 267, 254, 255, 239, 239, 256, 82, 257,
257, 257, 258, 259, 260, 239, 239, 239, 261, 239,
239, 239, 239, 263, 263, 155, 249, 239, 264, 239,
239, 250, 239, 239, 239, 239, 265, 239, 120, 120,
265, 239, 239, 239, 119, 119, 119, 239, 118, 239,
239, 239, 268, 266, 239, 267, 267, 187, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 263, 155,
239, 239, 250, 265, 239, 239, 239, 119, 263, 269,
267, 187, 263, 263, 239, 239, 239, 269, 267, 267,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 0, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239
} ;
static yyconst short int yy_nxt[1047] =
{ 0,
239, 91, 91, 91, 239, 29, 29, 97, 97, 97,
239, 210, 98, 92, 239, 30, 30, 31, 32, 33,
32, 31, 34, 35, 31, 31, 31, 36, 31, 37,
38, 31, 39, 40, 31, 41, 31, 42, 31, 43,
43, 43, 43, 44, 43, 43, 43, 43, 43, 43,
43, 43, 45, 31, 46, 47, 48, 49, 50, 51,
50, 52, 53, 52, 54, 55, 56, 57, 57, 56,
58, 59, 60, 61, 62, 63, 57, 57, 57, 64,
65, 64, 64, 64, 64, 64, 64, 64, 64, 64,
64, 66, 56, 49, 56, 49, 49, 68, 68, 69,
100, 70, 68, 68, 69, 94, 70, 238, 74, 74,
74, 71, 29, 94, 72, 96, 71, 237, 114, 72,
103, 239, 75, 100, 140, 76, 74, 74, 74, 142,
29, 182, 183, 95, 101, 91, 91, 91, 182, 183,
75, 95, 236, 76, 77, 77, 77, 92, 29, 97,
97, 97, 115, 116, 98, 117, 119, 101, 30, 114,
235, 120, 239, 100, 234, 78, 78, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 82, 233,
82, 82, 182, 183, 83, 82, 164, 82, 165, 84,
166, 82, 166, 82, 82, 82, 82, 101, 82, 82,
182, 183, 83, 82, 164, 82, 164, 84, 204, 82,
204, 82, 82, 82, 104, 104, 104, 232, 110, 110,
110, 231, 110, 110, 110, 226, 105, 140, 227, 102,
111, 230, 142, 112, 113, 110, 110, 110, 136, 137,
136, 229, 127, 127, 127, 109, 163, 113, 163, 228,
118, 121, 121, 121, 128, 127, 127, 127, 146, 147,
146, 224, 130, 122, 123, 223, 117, 128, 148, 148,
148, 222, 154, 104, 104, 104, 124, 110, 110, 110,
108, 211, 108, 108, 199, 105, 108, 108, 102, 114,
209, 108, 209, 125, 207, 108, 108, 108, 126, 126,
126, 126, 126, 126, 126, 126, 126, 126, 126, 126,
126, 139, 168, 139, 139, 212, 199, 140, 139, 183,
139, 213, 139, 181, 139, 179, 139, 139, 139, 150,
151, 150, 208, 97, 97, 97, 152, 155, 98, 155,
155, 168, 168, 156, 155, 112, 155, 203, 155, 160,
155, 200, 155, 155, 155, 157, 158, 157, 104, 104,
104, 161, 199, 161, 161, 140, 161, 110, 110, 110,
105, 239, 172, 172, 172, 109, 161, 179, 118, 113,
121, 121, 121, 178, 173, 178, 178, 118, 178, 112,
101, 168, 122, 169, 109, 169, 169, 174, 178, 169,
169, 162, 170, 171, 169, 171, 169, 154, 169, 169,
169, 175, 160, 175, 175, 100, 211, 176, 175, 96,
177, 219, 175, 133, 175, 131, 175, 175, 175, 168,
180, 169, 180, 169, 169, 181, 109, 169, 169, 107,
170, 102, 169, 96, 169, 239, 169, 169, 169, 127,
127, 127, 185, 90, 185, 185, 90, 185, 136, 137,
136, 128, 189, 190, 189, 88, 88, 185, 154, 191,
206, 187, 206, 187, 187, 207, 86, 188, 187, 86,
187, 80, 187, 80, 187, 239, 187, 187, 187, 192,
192, 192, 146, 147, 146, 193, 194, 193, 140, 148,
148, 148, 195, 150, 151, 150, 196, 197, 196, 157,
158, 157, 239, 198, 155, 239, 155, 155, 239, 239,
156, 155, 239, 155, 239, 155, 239, 155, 239, 155,
155, 155, 201, 158, 201, 172, 172, 172, 205, 239,
205, 205, 239, 205, 101, 239, 239, 173, 172, 172,
172, 239, 239, 205, 189, 190, 189, 189, 190, 189,
173, 191, 239, 181, 191, 239, 239, 202, 154, 239,
239, 187, 239, 187, 187, 239, 239, 188, 187, 239,
187, 239, 187, 239, 187, 239, 187, 187, 187, 192,
192, 192, 193, 194, 193, 193, 194, 193, 239, 195,
239, 239, 195, 196, 197, 196, 196, 197, 196, 239,
198, 239, 239, 198, 214, 215, 214, 201, 216, 201,
201, 216, 201, 217, 217, 217, 172, 172, 172, 214,
215, 214, 214, 215, 220, 214, 215, 214, 173, 239,
239, 207, 239, 239, 199, 214, 215, 214, 221, 215,
221, 201, 158, 201, 199, 214, 215, 220, 214, 215,
220, 221, 215, 221, 211, 239, 239, 211, 225, 225,
225, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 202, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
67, 67, 67, 67, 67, 67, 67, 67, 67, 67,
67, 67, 67, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 73, 73, 73, 79, 79, 79, 79,
79, 79, 79, 79, 79, 79, 79, 79, 79, 81,
81, 81, 81, 81, 81, 81, 81, 81, 81, 81,
81, 81, 85, 85, 85, 85, 85, 85, 85, 85,
85, 85, 85, 85, 85, 87, 87, 87, 87, 87,
87, 87, 87, 87, 87, 87, 87, 87, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 93, 93, 93, 93, 93, 93, 93, 93, 93,
93, 93, 93, 93, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 106, 106, 108,
239, 239, 108, 108, 129, 129, 129, 239, 239, 239,
239, 129, 239, 129, 129, 132, 239, 239, 132, 132,
132, 132, 132, 132, 132, 132, 132, 132, 134, 134,
135, 135, 135, 135, 135, 135, 239, 135, 135, 135,
135, 135, 135, 138, 138, 138, 138, 138, 138, 138,
239, 138, 138, 138, 138, 138, 141, 239, 239, 141,
141, 143, 143, 143, 143, 143, 239, 143, 143, 143,
143, 143, 143, 143, 144, 144, 144, 144, 144, 239,
144, 144, 144, 144, 144, 144, 144, 145, 145, 145,
145, 145, 145, 239, 145, 145, 145, 145, 145, 145,
149, 149, 149, 149, 149, 149, 239, 149, 149, 149,
149, 149, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 154, 154, 239, 154, 154,
154, 154, 154, 154, 154, 154, 154, 154, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 167, 167, 167, 167, 167, 167, 167, 167, 167,
167, 167, 167, 167, 184, 184, 184, 184, 186, 186,
239, 186, 186, 186, 186, 186, 186, 186, 186, 186,
186, 218, 218, 218, 218, 27, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239
} ;
static yyconst short int yy_chk[1047] =
{ 0,
0, 23, 23, 23, 0, 1, 2, 32, 32, 32,
0, 268, 32, 23, 0, 1, 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, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 7, 7, 7,
35, 7, 8, 8, 8, 25, 8, 237, 9, 9,
9, 7, 9, 26, 7, 39, 8, 235, 57, 8,
39, 57, 9, 98, 83, 9, 10, 10, 10, 83,
10, 126, 126, 25, 35, 24, 24, 24, 184, 184,
10, 26, 234, 10, 11, 11, 11, 24, 11, 33,
33, 33, 58, 58, 33, 58, 60, 98, 11, 60,
233, 60, 60, 99, 232, 11, 11, 11, 11, 11,
11, 11, 11, 11, 11, 11, 11, 11, 15, 231,
15, 15, 210, 210, 15, 15, 111, 15, 111, 15,
113, 15, 113, 15, 15, 15, 16, 99, 16, 16,
218, 218, 16, 16, 114, 16, 114, 16, 170, 16,
170, 16, 16, 16, 40, 40, 40, 230, 54, 54,
54, 229, 56, 56, 56, 225, 40, 140, 225, 40,
54, 228, 140, 54, 56, 59, 59, 59, 80, 80,
80, 227, 64, 64, 64, 109, 109, 59, 109, 226,
59, 61, 61, 61, 64, 65, 65, 65, 90, 90,
90, 223, 65, 61, 61, 222, 61, 65, 91, 91,
91, 217, 186, 102, 102, 102, 61, 62, 62, 62,
62, 186, 62, 62, 209, 102, 62, 62, 102, 62,
177, 62, 177, 62, 206, 62, 62, 62, 62, 62,
62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
62, 82, 204, 82, 82, 188, 199, 82, 82, 182,
82, 199, 82, 180, 82, 179, 82, 82, 82, 94,
94, 94, 176, 97, 97, 97, 94, 96, 97, 96,
96, 171, 167, 96, 96, 165, 96, 162, 96, 159,
96, 156, 96, 96, 96, 101, 101, 101, 104, 104,
104, 105, 154, 105, 105, 141, 105, 110, 110, 110,
104, 129, 118, 118, 118, 125, 105, 123, 116, 110,
121, 121, 121, 122, 118, 122, 122, 118, 122, 112,
101, 115, 121, 115, 108, 115, 115, 118, 122, 115,
115, 107, 115, 115, 115, 115, 115, 211, 115, 115,
115, 119, 103, 119, 119, 100, 211, 119, 119, 75,
119, 211, 119, 71, 119, 66, 119, 119, 119, 120,
124, 120, 124, 120, 120, 124, 52, 120, 120, 44,
120, 38, 120, 30, 120, 27, 120, 120, 120, 127,
127, 127, 128, 22, 128, 128, 21, 128, 136, 136,
136, 127, 137, 137, 137, 20, 19, 128, 133, 137,
174, 133, 174, 133, 133, 174, 18, 133, 133, 17,
133, 14, 133, 13, 133, 0, 133, 133, 133, 142,
142, 142, 146, 146, 146, 147, 147, 147, 142, 148,
148, 148, 147, 150, 150, 150, 151, 151, 151, 157,
157, 157, 0, 151, 155, 0, 155, 155, 0, 0,
155, 155, 0, 155, 0, 155, 0, 155, 0, 155,
155, 155, 158, 158, 158, 172, 172, 172, 173, 0,
173, 173, 0, 173, 157, 0, 0, 172, 181, 181,
181, 0, 0, 173, 189, 189, 189, 190, 190, 190,
181, 189, 0, 181, 190, 0, 0, 158, 187, 0,
0, 187, 0, 187, 187, 0, 0, 187, 187, 0,
187, 0, 187, 0, 187, 0, 187, 187, 187, 192,
192, 192, 193, 193, 193, 194, 194, 194, 0, 193,
0, 0, 194, 196, 196, 196, 197, 197, 197, 0,
196, 0, 0, 197, 200, 200, 200, 201, 201, 201,
202, 202, 202, 203, 203, 203, 207, 207, 207, 208,
208, 208, 212, 212, 212, 213, 213, 213, 207, 0,
0, 207, 0, 0, 213, 214, 214, 214, 215, 215,
215, 216, 216, 216, 214, 219, 219, 219, 220, 220,
220, 221, 221, 221, 219, 0, 0, 220, 224, 224,
224, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 216, 240, 240, 240,
240, 240, 240, 240, 240, 240, 240, 240, 240, 240,
241, 241, 241, 241, 241, 241, 241, 241, 241, 241,
241, 241, 241, 242, 242, 242, 242, 242, 242, 242,
242, 242, 242, 242, 242, 242, 243, 243, 243, 243,
243, 243, 243, 243, 243, 243, 243, 243, 243, 244,
244, 244, 244, 244, 244, 244, 244, 244, 244, 244,
244, 244, 245, 245, 245, 245, 245, 245, 245, 245,
245, 245, 245, 245, 245, 246, 246, 246, 246, 246,
246, 246, 246, 246, 246, 246, 246, 246, 247, 247,
247, 247, 247, 247, 247, 247, 247, 247, 247, 247,
247, 248, 248, 248, 248, 248, 248, 248, 248, 248,
248, 248, 248, 248, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 250, 250, 251,
0, 0, 251, 251, 252, 252, 252, 0, 0, 0,
0, 252, 0, 252, 252, 253, 0, 0, 253, 253,
253, 253, 253, 253, 253, 253, 253, 253, 254, 254,
255, 255, 255, 255, 255, 255, 0, 255, 255, 255,
255, 255, 255, 256, 256, 256, 256, 256, 256, 256,
0, 256, 256, 256, 256, 256, 257, 0, 0, 257,
257, 258, 258, 258, 258, 258, 0, 258, 258, 258,
258, 258, 258, 258, 259, 259, 259, 259, 259, 0,
259, 259, 259, 259, 259, 259, 259, 260, 260, 260,
260, 260, 260, 0, 260, 260, 260, 260, 260, 260,
261, 261, 261, 261, 261, 261, 0, 261, 261, 261,
261, 261, 262, 262, 262, 262, 262, 262, 262, 262,
262, 262, 262, 262, 262, 263, 263, 0, 263, 263,
263, 263, 263, 263, 263, 263, 263, 263, 264, 264,
264, 264, 264, 264, 264, 264, 264, 264, 264, 264,
264, 265, 265, 265, 265, 265, 265, 265, 265, 265,
265, 265, 265, 265, 266, 266, 266, 266, 267, 267,
0, 267, 267, 267, 267, 267, 267, 267, 267, 267,
267, 269, 269, 269, 269, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239
} ;
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
static int yy_looking_for_trail_begin = 0;
static int yy_full_lp;
static int *yy_full_state;
#define YY_TRAILING_MASK 0x2000
#define YY_TRAILING_HEAD_MASK 0x4000
#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 = yy_full_lp; /* restore orig. accepting pos. */ \
yy_state_ptr = yy_full_state; /* restore orig. state */ \
yy_current_state = *yy_state_ptr; /* restore curr. state */ \
++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
/* This is a modified version of src/backend/parser/scan.l */
#line 3 "pgc.l"
#include "config.h"
#include <ctype.h>
#include <sys/types.h>
#include <limits.h>
#ifndef PATH_MAX
#include <sys/param.h>
#define PATH_MAX MAXPATHLEN
#endif
#if defined(HAVE_STRING_H)
#include <string.h>
#else
#include <strings.h>
#endif
#include <errno.h>
#include "postgres.h"
#include "miscadmin.h"
#include "nodes/pg_list.h"
#include "nodes/parsenodes.h"
#include "parser/gramparse.h"
#include "parser/scansup.h"
#include "extern.h"
#include "preproc.h"
#include "utils/builtins.h"
/* some versions of lex define this as a macro */
#if defined(yywrap)
#undef yywrap
#endif /* yywrap */
extern YYSTYPE yylval;
int llen;
char literal[MAX_PARSE_BUFFER];
int before_comment;
struct _yy_buffer { YY_BUFFER_STATE buffer;
long lineno;
char * filename;
struct _yy_buffer * next;
} *yy_buffer = NULL;
struct _defines *defines = NULL;
static char *old;
#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 condition, to which all non-conditional rules apply.
* When in an exclusive condition, only those rules defined for that condition apply.
*
* Exclusive states change parsing rules while the state is active.
* There are exclusive states for quoted strings, extended comments,
* and to eliminate parsing troubles for numeric strings.
* Exclusive states:
* <xb> binary numeric string - thomas 1997-11-16
* <xc> extended C-style comments - tgl 1997-07-12
* <xd> delimited identifiers (double-quoted identifiers) - tgl 1997-10-27
* <xh> hexadecimal numeric string - thomas 1997-11-16
* <xm> numeric strings with embedded minus sign - tgl 1997-09-05
* <xq> quoted strings - tgl 1997-07-30
*
* The "extended comment" syntax closely resembles allowable operator syntax.
* So, when in condition <xc>, only strings which would terminate the
* "extended comment" trigger any action other than "ignore".
* Be sure to match _any_ candidate comment, including those with appended
* operator-like symbols. - thomas 1997-07-14
*/
#define xb 6
#define xc 7
#define xd 8
#define xdc 9
#define xh 10
#define xm 11
#define xq 12
/* Binary number
*/
/* Hexadecimal 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.
*/
/* Comments
* Ignored by the scanner and parser.
*/
/*
real [\-]?{digit}+\.{digit}+([Ee][-+]?{digit}+)?
*/
/* some stuff needed for ecpg */
/* 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. tgl - 1997-09-08
*
* Quoted strings must allow some special characters such as single-quote
* and newline.
* Embedded single-quotes are implemented both in the SQL/92-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
*/
#line 851 "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 178 "pgc.l"
#line 1004 "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_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 >= 240 )
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] != 1006 );
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];
if ( yy_act & YY_TRAILING_HEAD_MASK ||
yy_looking_for_trail_begin )
{
if ( yy_act == yy_looking_for_trail_begin )
{
yy_looking_for_trail_begin = 0;
yy_act &= ~YY_TRAILING_HEAD_MASK;
break;
}
}
else if ( yy_act & YY_TRAILING_MASK )
{
yy_looking_for_trail_begin = yy_act & ~YY_TRAILING_MASK;
yy_looking_for_trail_begin |= YY_TRAILING_HEAD_MASK;
yy_full_match = yy_cp;
yy_full_state = yy_state_ptr;
yy_full_lp = yy_lp;
}
else
{
yy_full_match = yy_cp;
yy_full_state = yy_state_ptr;
yy_full_lp = yy_lp;
break;
}
++yy_lp;
goto find_rule;
}
--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 179 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 181 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 183 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 184 "pgc.l"
{
before_comment = YYSTATE;
BEGIN(xc);
}
YY_BREAK
case 5:
YY_RULE_SETUP
#line 189 "pgc.l"
{ BEGIN(before_comment); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 191 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 193 "pgc.l"
{
BEGIN(xb);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 8:
YY_RULE_SETUP
#line 198 "pgc.l"
{
char* endptr;
BEGIN(SQL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,2);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad binary integer input!");
return ICONST;
}
YY_BREAK
case 9:
#line 209 "pgc.l"
case 10:
YY_RULE_SETUP
#line 209 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 11:
#line 216 "pgc.l"
case 12:
YY_RULE_SETUP
#line 216 "pgc.l"
{
}
YY_BREAK
case 13:
YY_RULE_SETUP
#line 219 "pgc.l"
{
BEGIN(xh);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 14:
YY_RULE_SETUP
#line 224 "pgc.l"
{
char* endptr;
BEGIN(SQL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,16);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad hexadecimal integer input");
return ICONST;
}
YY_BREAK
case 15:
YY_RULE_SETUP
#line 235 "pgc.l"
{
BEGIN(xq);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 16:
YY_RULE_SETUP
#line 240 "pgc.l"
{
BEGIN(SQL);
yylval.str = mm_strdup(scanstr(literal));
return SCONST;
}
YY_BREAK
case 17:
#line 246 "pgc.l"
case 18:
#line 247 "pgc.l"
case 19:
YY_RULE_SETUP
#line 247 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 20:
YY_RULE_SETUP
#line 253 "pgc.l"
{
}
YY_BREAK
case 21:
YY_RULE_SETUP
#line 257 "pgc.l"
{
BEGIN(xd);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 22:
YY_RULE_SETUP
#line 262 "pgc.l"
{
BEGIN(SQL);
yylval.str = mm_strdup(literal);
return CSTRING;
}
YY_BREAK
case 23:
YY_RULE_SETUP
#line 267 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 24:
YY_RULE_SETUP
#line 273 "pgc.l"
{
BEGIN(xdc);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 25:
YY_RULE_SETUP
#line 278 "pgc.l"
{
BEGIN(C);
yylval.str = mm_strdup(literal);
return CSTRING;
}
YY_BREAK
case 26:
YY_RULE_SETUP
#line 283 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 27:
YY_RULE_SETUP
#line 290 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 291 "pgc.l"
{
BEGIN(SQL);
return yytext[0];
}
YY_BREAK
case 29:
YY_RULE_SETUP
#line 297 "pgc.l"
{ return TYPECAST; }
YY_BREAK
case 30:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp = yy_bp + 1;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 298 "pgc.l"
{
BEGIN(xm);
return yytext[0];
}
YY_BREAK
case 31:
YY_RULE_SETUP
#line 302 "pgc.l"
{ return yytext[0]; }
YY_BREAK
case 32:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp -= 2;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 303 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext);
return Op;
}
YY_BREAK
case 33:
YY_RULE_SETUP
#line 307 "pgc.l"
{
if (strcmp((char*)yytext,"!=") == 0)
yylval.str = mm_strdup("<>"); /* compatability */
else
yylval.str = mm_strdup((char*)yytext);
return Op;
}
YY_BREAK
case 34:
YY_RULE_SETUP
#line 314 "pgc.l"
{
yylval.ival = atoi((char*)&yytext[1]);
return PARAM;
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 318 "pgc.l"
{
int i;
ScanKeyword *keyword;
char lower_text[NAMEDATALEN];
BEGIN(xm);
/* this should leave the last byte set to '\0' */
strncpy(lower_text, yytext, NAMEDATALEN-1);
for(i = 0; lower_text[i]; i++)
if (isascii((unsigned char)lower_text[i]) && isupper(lower_text[i]))
lower_text[i] = tolower(lower_text[i]);
keyword = ScanKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
keyword = ScanECPGKeywordLookup((char*)lower_text);
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 36:
YY_RULE_SETUP
#line 371 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 37:
YY_RULE_SETUP
#line 388 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad float8 input");
return FCONST;
}
YY_BREAK
case 38:
YY_RULE_SETUP
#line 398 "pgc.l"
{
char* endptr;
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 39:
YY_RULE_SETUP
#line 414 "pgc.l"
{
char* endptr;
errno = 0;
yylval.dval = strtod((char *)yytext,&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad float input");
return FCONST;
}
YY_BREAK
case 40:
YY_RULE_SETUP
#line 423 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 41:
YY_RULE_SETUP
#line 440 "pgc.l"
{
char* endptr;
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 42:
YY_RULE_SETUP
#line 456 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext+1);
return(CVARIABLE);
}
YY_BREAK
case 43:
YY_RULE_SETUP
#line 460 "pgc.l"
{
int i;
ScanKeyword *keyword;
char lower_text[NAMEDATALEN];
/* this should leave the last byte set to '\0' */
strncpy(lower_text, yytext, NAMEDATALEN-1);
for(i = 0; lower_text[i]; i++)
if (isascii((unsigned char)lower_text[i]) && isupper(lower_text[i]))
lower_text[i] = tolower(lower_text[i]);
keyword = ScanKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
keyword = ScanECPGKeywordLookup((char*)lower_text);
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 512 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 45:
YY_RULE_SETUP
#line 513 "pgc.l"
{ /*
* We may find a ';' inside a structure
* definition in a TYPE or VAR statement.
* This is not a EOL marker.
*/
if (struct_level == 0)
BEGIN C;
return SQL_SEMI; }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 521 "pgc.l"
{ return yytext[0]; }
YY_BREAK
case 47:
YY_RULE_SETUP
#line 522 "pgc.l"
{ BEGIN SQL; return SQL_START; }
YY_BREAK
case 48:
YY_RULE_SETUP
#line 523 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 49:
YY_RULE_SETUP
#line 524 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext);
return(CPP_LINE);
}
YY_BREAK
case 50:
YY_RULE_SETUP
#line 528 "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 51:
YY_RULE_SETUP
#line 565 "pgc.l"
{ return(';'); }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 566 "pgc.l"
{ return(','); }
YY_BREAK
case 53:
YY_RULE_SETUP
#line 567 "pgc.l"
{ return('*'); }
YY_BREAK
case 54:
YY_RULE_SETUP
#line 568 "pgc.l"
{ ECHO; }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 569 "pgc.l"
{ return('{'); }
YY_BREAK
case 56:
YY_RULE_SETUP
#line 570 "pgc.l"
{ return('}'); }
YY_BREAK
case 57:
YY_RULE_SETUP
#line 571 "pgc.l"
{ return('['); }
YY_BREAK
case 58:
YY_RULE_SETUP
#line 572 "pgc.l"
{ return(']'); }
YY_BREAK
case 59:
YY_RULE_SETUP
#line 573 "pgc.l"
{ return('='); }
YY_BREAK
case 60:
YY_RULE_SETUP
#line 574 "pgc.l"
{ return S_ANYTHING; }
YY_BREAK
case 61:
YY_RULE_SETUP
#line 575 "pgc.l"
{BEGIN(def_ident);}
YY_BREAK
case 62:
YY_RULE_SETUP
#line 576 "pgc.l"
{}
YY_BREAK
case 63:
YY_RULE_SETUP
#line 577 "pgc.l"
{
old = mm_strdup(yytext);
BEGIN(def);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 64:
YY_RULE_SETUP
#line 583 "pgc.l"
/* eat the whitespace */
YY_BREAK
case 65:
YY_RULE_SETUP
#line 584 "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(literal));
}
}
if (ptr == NULL)
{
this = (struct _defines *) mm_alloc(sizeof(struct _defines));
/* initial definition */
this->old = old;
this->new = mm_strdup(scanstr(literal));
this->next = defines;
defines = this;
}
BEGIN(C);
}
YY_BREAK
case 66:
YY_RULE_SETUP
#line 608 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: define statement parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 67:
YY_RULE_SETUP
#line 614 "pgc.l"
{ BEGIN(incl); }
YY_BREAK
case 68:
YY_RULE_SETUP
#line 615 "pgc.l"
/* eat the whitespace */
YY_BREAK
case 69:
YY_RULE_SETUP
#line 616 "pgc.l"
{ /* got the include file name */
struct _yy_buffer *yb;
struct _include_path *ip;
char inc_file[PATH_MAX];
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;
if (yytext[strlen(yytext) - 1] == ';')
yytext[strlen(yytext) - 1] = '\0';
yyin = NULL;
for (ip = include_paths; yyin == NULL && ip != NULL; ip = ip->next)
{
if (strlen(ip->path) + strlen(yytext) + 3 > PATH_MAX)
{
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)
{
fprintf(stderr, "Error: Cannot open include file %s in line %d\n", yytext, yylineno);
exit(NO_INCLUDE_FILE);
}
input_filename = mm_strdup(inc_file);
yy_switch_to_buffer(yy_create_buffer(yyin,YY_BUF_SIZE ));
yylineno = 0;
BEGIN C;
}
YY_BREAK
case 70:
YY_RULE_SETUP
#line 665 "pgc.l"
{ 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(xb):
case YY_STATE_EOF(xc):
case YY_STATE_EOF(xd):
case YY_STATE_EOF(xdc):
case YY_STATE_EOF(xh):
case YY_STATE_EOF(xm):
case YY_STATE_EOF(xq):
#line 666 "pgc.l"
{ 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);
}
}
YY_BREAK
case 71:
YY_RULE_SETUP
#line 688 "pgc.l"
ECHO;
YY_BREAK
#line 1908 "lex.yy.c"
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = yy_hold_char;
YY_RESTORE_YY_MORE_OFFSET
if ( yy_current_buffer->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 >= 240 )
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 >= 240 )
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 == 239);
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 688 "pgc.l"
void
lex_init(void)
{
braces_open = 0;
BEGIN C;
}
int yywrap(void)
{
return 1;
}
src/interfaces/ecpg/preproc/preproc.c deleted 100644 → 0
View file @ 19e4d33b
This source diff could not be displayed because it is too large. You can view the blob instead.
src/interfaces/ecpg/preproc/preproc.h deleted 100644 → 0
View file @ 19e4d33b
typedef union {
double dval;
int ival;
char * str;
struct when action;
struct index index;
int tagname;
struct this_type type;
enum ECPGttype type_enum;
} YYSTYPE;
#define SQL_AT 258
#define SQL_BOOL 259
#define SQL_BREAK 260
#define SQL_CALL 261
#define SQL_CONNECT 262
#define SQL_CONNECTION 263
#define SQL_CONTINUE 264
#define SQL_DEALLOCATE 265
#define SQL_DISCONNECT 266
#define SQL_ENUM 267
#define SQL_FOUND 268
#define SQL_FREE 269
#define SQL_GO 270
#define SQL_GOTO 271
#define SQL_IDENTIFIED 272
#define SQL_IMMEDIATE 273
#define SQL_INDICATOR 274
#define SQL_INT 275
#define SQL_LONG 276
#define SQL_OPEN 277
#define SQL_PREPARE 278
#define SQL_RELEASE 279
#define SQL_REFERENCE 280
#define SQL_SECTION 281
#define SQL_SEMI 282
#define SQL_SHORT 283
#define SQL_SIGNED 284
#define SQL_SQLERROR 285
#define SQL_SQLPRINT 286
#define SQL_SQLWARNING 287
#define SQL_START 288
#define SQL_STOP 289
#define SQL_STRUCT 290
#define SQL_UNSIGNED 291
#define SQL_VAR 292
#define SQL_WHENEVER 293
#define S_ANYTHING 294
#define S_AUTO 295
#define S_BOOL 296
#define S_CHAR 297
#define S_CONST 298
#define S_DOUBLE 299
#define S_ENUM 300
#define S_EXTERN 301
#define S_FLOAT 302
#define S_INT 303
#define S 304
#define S_LONG 305
#define S_REGISTER 306
#define S_SHORT 307
#define S_SIGNED 308
#define S_STATIC 309
#define S_STRUCT 310
#define S_UNION 311
#define S_UNSIGNED 312
#define S_VARCHAR 313
#define TYPECAST 314
#define ABSOLUTE 315
#define ACTION 316
#define ADD 317
#define ALL 318
#define ALTER 319
#define AND 320
#define ANY 321
#define AS 322
#define ASC 323
#define BEGIN_TRANS 324
#define BETWEEN 325
#define BOTH 326
#define BY 327
#define CASCADE 328
#define CASE 329
#define CAST 330
#define CHAR 331
#define CHARACTER 332
#define CHECK 333
#define CLOSE 334
#define COALESCE 335
#define COLLATE 336
#define COLUMN 337
#define COMMIT 338
#define CONSTRAINT 339
#define CREATE 340
#define CROSS 341
#define CURRENT 342
#define CURRENT_DATE 343
#define CURRENT_TIME 344
#define CURRENT_TIMESTAMP 345
#define CURRENT_USER 346
#define CURSOR 347
#define DAY_P 348
#define DECIMAL 349
#define DECLARE 350
#define DEFAULT 351
#define DELETE 352
#define DESC 353
#define DISTINCT 354
#define DOUBLE 355
#define DROP 356
#define ELSE 357
#define END_TRANS 358
#define EXCEPT 359
#define EXECUTE 360
#define EXISTS 361
#define EXTRACT 362
#define FALSE_P 363
#define FETCH 364
#define FLOAT 365
#define FOR 366
#define FOREIGN 367
#define FROM 368
#define FULL 369
#define GRANT 370
#define GROUP 371
#define HAVING 372
#define HOUR_P 373
#define IN 374
#define INNER_P 375
#define INSENSITIVE 376
#define INSERT 377
#define INTERSECT 378
#define INTERVAL 379
#define INTO 380
#define IS 381
#define ISOLATION 382
#define JOIN 383
#define KEY 384
#define LANGUAGE 385
#define LEADING 386
#define LEFT 387
#define LEVEL 388
#define LIKE 389
#define LOCAL 390
#define MATCH 391
#define MINUTE_P 392
#define MONTH_P 393
#define NAMES 394
#define NATIONAL 395
#define NATURAL 396
#define NCHAR 397
#define NEXT 398
#define NO 399
#define NOT 400
#define NULLIF 401
#define NULL_P 402
#define NUMERIC 403
#define OF 404
#define ON 405
#define ONLY 406
#define OPTION 407
#define OR 408
#define ORDER 409
#define OUTER_P 410
#define PARTIAL 411
#define POSITION 412
#define PRECISION 413
#define PRIMARY 414
#define PRIOR 415
#define PRIVILEGES 416
#define PROCEDURE 417
#define PUBLIC 418
#define READ 419
#define REFERENCES 420
#define RELATIVE 421
#define REVOKE 422
#define RIGHT 423
#define ROLLBACK 424
#define SCROLL 425
#define SECOND_P 426
#define SELECT 427
#define SET 428
#define SUBSTRING 429
#define TABLE 430
#define TEMP 431
#define THEN 432
#define TIME 433
#define TIMESTAMP 434
#define TIMEZONE_HOUR 435
#define TIMEZONE_MINUTE 436
#define TO 437
#define TRAILING 438
#define TRANSACTION 439
#define TRIM 440
#define TRUE_P 441
#define UNION 442
#define UNIQUE 443
#define UPDATE 444
#define USER 445
#define USING 446
#define VALUES 447
#define VARCHAR 448
#define VARYING 449
#define VIEW 450
#define WHEN 451
#define WHERE 452
#define WITH 453
#define WORK 454
#define YEAR_P 455
#define ZONE 456
#define TRIGGER 457
#define TYPE_P 458
#define ABORT_TRANS 459
#define AFTER 460
#define AGGREGATE 461
#define ANALYZE 462
#define BACKWARD 463
#define BEFORE 464
#define BINARY 465
#define CACHE 466
#define CLUSTER 467
#define COPY 468
#define CREATEDB 469
#define CREATEUSER 470
#define CYCLE 471
#define DATABASE 472
#define DELIMITERS 473
#define DO 474
#define EACH 475
#define ENCODING 476
#define EXPLAIN 477
#define EXTEND 478
#define FORWARD 479
#define FUNCTION 480
#define HANDLER 481
#define INCREMENT 482
#define INDEX 483
#define INHERITS 484
#define INSTEAD 485
#define ISNULL 486
#define LANCOMPILER 487
#define LIMIT 488
#define LISTEN 489
#define UNLISTEN 490
#define LOAD 491
#define LOCATION 492
#define LOCK_P 493
#define MAXVALUE 494
#define MINVALUE 495
#define MOVE 496
#define NEW 497
#define NOCREATEDB 498
#define NOCREATEUSER 499
#define NONE 500
#define NOTHING 501
#define NOTIFY 502
#define NOTNULL 503
#define OFFSET 504
#define OIDS 505
#define OPERATOR 506
#define PASSWORD 507
#define PROCEDURAL 508
#define RECIPE 509
#define RENAME 510
#define RESET 511
#define RETURNS 512
#define ROW 513
#define RULE 514
#define SERIAL 515
#define SEQUENCE 516
#define SETOF 517
#define SHOW 518
#define START 519
#define STATEMENT 520
#define STDIN 521
#define STDOUT 522
#define TRUSTED 523
#define UNTIL 524
#define VACUUM 525
#define VALID 526
#define VERBOSE 527
#define VERSION 528
#define IDENT 529
#define SCONST 530
#define Op 531
#define CSTRING 532
#define CVARIABLE 533
#define CPP_LINE 534
#define ICONST 535
#define PARAM 536
#define FCONST 537
#define OP 538
#define UMINUS 539
extern YYSTYPE yylval;
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment