You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
koffice/kexi/kexidb/parser/sqlparser.cpp

3473 lines
97 KiB

This file contains invisible Unicode characters!

This file contains invisible Unicode characters that may be processed differently from what appears below. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to reveal hidden characters.

/* A Bison parser, made by GNU Bison 2.2. */
/* Skeleton implementation for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.2"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Using locations. */
#define YYLSP_NEEDED 0
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
UMINUS = 258,
SQL_TYPE = 259,
SQL_ABS = 260,
ACOS = 261,
AMPERSAND = 262,
SQL_ABSOLUTE = 263,
ADA = 264,
ADD = 265,
ADD_DAYS = 266,
ADD_HOURS = 267,
ADD_MINUTES = 268,
ADD_MONTHS = 269,
ADD_SECONDS = 270,
ADD_YEARS = 271,
ALL = 272,
ALLOCATE = 273,
ALTER = 274,
AND = 275,
ANY = 276,
ARE = 277,
AS = 278,
ASIN = 279,
ASC = 280,
ASCII = 281,
ASSERTION = 282,
ATAN = 283,
ATAN2 = 284,
AUTHORIZATION = 285,
AUTO_INCREMENT = 286,
AVG = 287,
BEFORE = 288,
SQL_BEGIN = 289,
BETWEEN = 290,
BIGINT = 291,
BINARY = 292,
BIT = 293,
BIT_LENGTH = 294,
BITWISE_SHIFT_LEFT = 295,
BITWISE_SHIFT_RIGHT = 296,
BREAK = 297,
BY = 298,
CASCADE = 299,
CASCADED = 300,
CASE = 301,
CAST = 302,
CATALOG = 303,
CEILING = 304,
CENTER = 305,
SQL_CHAR = 306,
CHAR_LENGTH = 307,
CHARACTER_STRING_LITERAL = 308,
CHECK = 309,
CLOSE = 310,
COALESCE = 311,
COBOL = 312,
COLLATE = 313,
COLLATION = 314,
COLUMN = 315,
COMMIT = 316,
COMPUTE = 317,
CONCAT = 318,
CONCATENATION = 319,
CONNECT = 320,
CONNECTION = 321,
CONSTRAINT = 322,
CONSTRAINTS = 323,
CONTINUE = 324,
CONVERT = 325,
CORRESPONDING = 326,
COS = 327,
COT = 328,
COUNT = 329,
CREATE = 330,
CURDATE = 331,
CURRENT = 332,
CURRENT_DATE = 333,
CURRENT_TIME = 334,
CURRENT_TIMESTAMP = 335,
CURTIME = 336,
CURSOR = 337,
DATABASE = 338,
SQL_DATE = 339,
DATE_FORMAT = 340,
DATE_REMAINDER = 341,
DATE_VALUE = 342,
DAY = 343,
DAYOFMONTH = 344,
DAYOFWEEK = 345,
DAYOFYEAR = 346,
DAYS_BETWEEN = 347,
DEALLOCATE = 348,
DEC = 349,
DECLARE = 350,
DEFAULT = 351,
DEFERRABLE = 352,
DEFERRED = 353,
SQL_DELETE = 354,
DESC = 355,
DESCRIBE = 356,
DESCRIPTOR = 357,
DIAGNOSTICS = 358,
DICTIONARY = 359,
DIRECTORY = 360,
DISCONNECT = 361,
DISPLACEMENT = 362,
DISTINCT = 363,
DOMAIN_TOKEN = 364,
SQL_DOUBLE = 365,
DOUBLE_QUOTED_STRING = 366,
DROP = 367,
ELSE = 368,
END = 369,
END_EXEC = 370,
EQUAL = 371,
ESCAPE = 372,
EXCEPT = 373,
SQL_EXCEPTION = 374,
EXEC = 375,
EXECUTE = 376,
EXISTS = 377,
EXP = 378,
EXPONENT = 379,
EXTERNAL = 380,
EXTRACT = 381,
SQL_FALSE = 382,
FETCH = 383,
FIRST = 384,
SQL_FLOAT = 385,
FLOOR = 386,
FN = 387,
FOR = 388,
FOREIGN = 389,
FORTRAN = 390,
FOUND = 391,
FOUR_DIGITS = 392,
FROM = 393,
FULL = 394,
GET = 395,
GLOBAL = 396,
GO = 397,
GOTO = 398,
GRANT = 399,
GREATER_OR_EQUAL = 400,
HAVING = 401,
HOUR = 402,
HOURS_BETWEEN = 403,
IDENTITY = 404,
IFNULL = 405,
SQL_IGNORE = 406,
IMMEDIATE = 407,
SQL_IN = 408,
INCLUDE = 409,
INDEX = 410,
INDICATOR = 411,
INITIALLY = 412,
INNER = 413,
INPUT = 414,
INSENSITIVE = 415,
INSERT = 416,
INTEGER = 417,
INTERSECT = 418,
INTERVAL = 419,
INTO = 420,
IS = 421,
ISOLATION = 422,
JOIN = 423,
JUSTIFY = 424,
KEY = 425,
LANGUAGE = 426,
LAST = 427,
LCASE = 428,
LEFT = 429,
LENGTH = 430,
LESS_OR_EQUAL = 431,
LEVEL = 432,
LIKE = 433,
LINE_WIDTH = 434,
LOCAL = 435,
LOCATE = 436,
LOG = 437,
SQL_LONG = 438,
LOWER = 439,
LTRIM = 440,
LTRIP = 441,
MATCH = 442,
SQL_MAX = 443,
MICROSOFT = 444,
SQL_MIN = 445,
MINUS = 446,
MINUTE = 447,
MINUTES_BETWEEN = 448,
MOD = 449,
MODIFY = 450,
MODULE = 451,
MONTH = 452,
MONTHS_BETWEEN = 453,
MUMPS = 454,
NAMES = 455,
NATIONAL = 456,
NCHAR = 457,
NEXT = 458,
NODUP = 459,
NONE = 460,
NOT = 461,
NOT_EQUAL = 462,
NOT_EQUAL2 = 463,
NOW = 464,
SQL_NULL = 465,
SQL_IS = 466,
SQL_IS_NULL = 467,
SQL_IS_NOT_NULL = 468,
NULLIF = 469,
NUMERIC = 470,
OCTET_LENGTH = 471,
ODBC = 472,
OF = 473,
SQL_OFF = 474,
SQL_ON = 475,
ONLY = 476,
OPEN = 477,
OPTION = 478,
OR = 479,
ORDER = 480,
OUTER = 481,
OUTPUT = 482,
OVERLAPS = 483,
PAGE = 484,
PARTIAL = 485,
SQL_PASCAL = 486,
PERSISTENT = 487,
CQL_PI = 488,
PLI = 489,
POSITION = 490,
PRECISION = 491,
PREPARE = 492,
PRESERVE = 493,
PRIMARY = 494,
PRIOR = 495,
PRIVILEGES = 496,
PROCEDURE = 497,
PRODUCT = 498,
PUBLIC = 499,
QUARTER = 500,
QUIT = 501,
RAND = 502,
READ_ONLY = 503,
REAL = 504,
REFERENCES = 505,
REPEAT = 506,
REPLACE = 507,
RESTRICT = 508,
REVOKE = 509,
RIGHT = 510,
ROLLBACK = 511,
ROWS = 512,
RPAD = 513,
RTRIM = 514,
SCHEMA = 515,
SCREEN_WIDTH = 516,
SCROLL = 517,
SECOND = 518,
SECONDS_BETWEEN = 519,
SELECT = 520,
SEQUENCE = 521,
SETOPT = 522,
SET = 523,
SHOWOPT = 524,
SIGN = 525,
SIMILAR_TO = 526,
NOT_SIMILAR_TO = 527,
INTEGER_CONST = 528,
REAL_CONST = 529,
DATE_CONST = 530,
DATETIME_CONST = 531,
TIME_CONST = 532,
SIN = 533,
SQL_SIZE = 534,
SMALLINT = 535,
SOME = 536,
SPACE = 537,
SQL = 538,
SQL_TRUE = 539,
SQLCA = 540,
SQLCODE = 541,
SQLERROR = 542,
SQLSTATE = 543,
SQLWARNING = 544,
SQRT = 545,
STDEV = 546,
SUBSTRING = 547,
SUM = 548,
SYSDATE = 549,
SYSDATE_FORMAT = 550,
SYSTEM = 551,
TABLE = 552,
TAN = 553,
TEMPORARY = 554,
THEN = 555,
THREE_DIGITS = 556,
TIME = 557,
TIMESTAMP = 558,
TIMEZONE_HOUR = 559,
TIMEZONE_MINUTE = 560,
TINYINT = 561,
TO = 562,
TO_CHAR = 563,
TO_DATE = 564,
TRANSACTION = 565,
TRANSLATE = 566,
TRANSLATION = 567,
TRUNCATE = 568,
GENERAL_TITLE = 569,
TWO_DIGITS = 570,
UCASE = 571,
UNION = 572,
UNIQUE = 573,
SQL_UNKNOWN = 574,
UPDATE = 575,
UPPER = 576,
USAGE = 577,
USER = 578,
IDENTIFIER = 579,
IDENTIFIER_DOT_ASTERISK = 580,
QUERY_PARAMETER = 581,
USING = 582,
VALUE = 583,
VALUES = 584,
VARBINARY = 585,
VARCHAR = 586,
VARYING = 587,
VENDOR = 588,
VIEW = 589,
WEEK = 590,
WHEN = 591,
WHENEVER = 592,
WHERE = 593,
WHERE_CURRENT_OF = 594,
WITH = 595,
WORD_WRAPPED = 596,
WORK = 597,
WRAPPED = 598,
XOR = 599,
YEAR = 600,
YEARS_BETWEEN = 601,
SCAN_ERROR = 602,
__LAST_TOKEN = 603,
ILIKE = 604
};
#endif
/* Tokens. */
#define UMINUS 258
#define SQL_TYPE 259
#define SQL_ABS 260
#define ACOS 261
#define AMPERSAND 262
#define SQL_ABSOLUTE 263
#define ADA 264
#define ADD 265
#define ADD_DAYS 266
#define ADD_HOURS 267
#define ADD_MINUTES 268
#define ADD_MONTHS 269
#define ADD_SECONDS 270
#define ADD_YEARS 271
#define ALL 272
#define ALLOCATE 273
#define ALTER 274
#define AND 275
#define ANY 276
#define ARE 277
#define AS 278
#define ASIN 279
#define ASC 280
#define ASCII 281
#define ASSERTION 282
#define ATAN 283
#define ATAN2 284
#define AUTHORIZATION 285
#define AUTO_INCREMENT 286
#define AVG 287
#define BEFORE 288
#define SQL_BEGIN 289
#define BETWEEN 290
#define BIGINT 291
#define BINARY 292
#define BIT 293
#define BIT_LENGTH 294
#define BITWISE_SHIFT_LEFT 295
#define BITWISE_SHIFT_RIGHT 296
#define BREAK 297
#define BY 298
#define CASCADE 299
#define CASCADED 300
#define CASE 301
#define CAST 302
#define CATALOG 303
#define CEILING 304
#define CENTER 305
#define SQL_CHAR 306
#define CHAR_LENGTH 307
#define CHARACTER_STRING_LITERAL 308
#define CHECK 309
#define CLOSE 310
#define COALESCE 311
#define COBOL 312
#define COLLATE 313
#define COLLATION 314
#define COLUMN 315
#define COMMIT 316
#define COMPUTE 317
#define CONCAT 318
#define CONCATENATION 319
#define CONNECT 320
#define CONNECTION 321
#define CONSTRAINT 322
#define CONSTRAINTS 323
#define CONTINUE 324
#define CONVERT 325
#define CORRESPONDING 326
#define COS 327
#define COT 328
#define COUNT 329
#define CREATE 330
#define CURDATE 331
#define CURRENT 332
#define CURRENT_DATE 333
#define CURRENT_TIME 334
#define CURRENT_TIMESTAMP 335
#define CURTIME 336
#define CURSOR 337
#define DATABASE 338
#define SQL_DATE 339
#define DATE_FORMAT 340
#define DATE_REMAINDER 341
#define DATE_VALUE 342
#define DAY 343
#define DAYOFMONTH 344
#define DAYOFWEEK 345
#define DAYOFYEAR 346
#define DAYS_BETWEEN 347
#define DEALLOCATE 348
#define DEC 349
#define DECLARE 350
#define DEFAULT 351
#define DEFERRABLE 352
#define DEFERRED 353
#define SQL_DELETE 354
#define DESC 355
#define DESCRIBE 356
#define DESCRIPTOR 357
#define DIAGNOSTICS 358
#define DICTIONARY 359
#define DIRECTORY 360
#define DISCONNECT 361
#define DISPLACEMENT 362
#define DISTINCT 363
#define DOMAIN_TOKEN 364
#define SQL_DOUBLE 365
#define DOUBLE_QUOTED_STRING 366
#define DROP 367
#define ELSE 368
#define END 369
#define END_EXEC 370
#define EQUAL 371
#define ESCAPE 372
#define EXCEPT 373
#define SQL_EXCEPTION 374
#define EXEC 375
#define EXECUTE 376
#define EXISTS 377
#define EXP 378
#define EXPONENT 379
#define EXTERNAL 380
#define EXTRACT 381
#define SQL_FALSE 382
#define FETCH 383
#define FIRST 384
#define SQL_FLOAT 385
#define FLOOR 386
#define FN 387
#define FOR 388
#define FOREIGN 389
#define FORTRAN 390
#define FOUND 391
#define FOUR_DIGITS 392
#define FROM 393
#define FULL 394
#define GET 395
#define GLOBAL 396
#define GO 397
#define GOTO 398
#define GRANT 399
#define GREATER_OR_EQUAL 400
#define HAVING 401
#define HOUR 402
#define HOURS_BETWEEN 403
#define IDENTITY 404
#define IFNULL 405
#define SQL_IGNORE 406
#define IMMEDIATE 407
#define SQL_IN 408
#define INCLUDE 409
#define INDEX 410
#define INDICATOR 411
#define INITIALLY 412
#define INNER 413
#define INPUT 414
#define INSENSITIVE 415
#define INSERT 416
#define INTEGER 417
#define INTERSECT 418
#define INTERVAL 419
#define INTO 420
#define IS 421
#define ISOLATION 422
#define JOIN 423
#define JUSTIFY 424
#define KEY 425
#define LANGUAGE 426
#define LAST 427
#define LCASE 428
#define LEFT 429
#define LENGTH 430
#define LESS_OR_EQUAL 431
#define LEVEL 432
#define LIKE 433
#define LINE_WIDTH 434
#define LOCAL 435
#define LOCATE 436
#define LOG 437
#define SQL_LONG 438
#define LOWER 439
#define LTRIM 440
#define LTRIP 441
#define MATCH 442
#define SQL_MAX 443
#define MICROSOFT 444
#define SQL_MIN 445
#define MINUS 446
#define MINUTE 447
#define MINUTES_BETWEEN 448
#define MOD 449
#define MODIFY 450
#define MODULE 451
#define MONTH 452
#define MONTHS_BETWEEN 453
#define MUMPS 454
#define NAMES 455
#define NATIONAL 456
#define NCHAR 457
#define NEXT 458
#define NODUP 459
#define NONE 460
#define NOT 461
#define NOT_EQUAL 462
#define NOT_EQUAL2 463
#define NOW 464
#define SQL_NULL 465
#define SQL_IS 466
#define SQL_IS_NULL 467
#define SQL_IS_NOT_NULL 468
#define NULLIF 469
#define NUMERIC 470
#define OCTET_LENGTH 471
#define ODBC 472
#define OF 473
#define SQL_OFF 474
#define SQL_ON 475
#define ONLY 476
#define OPEN 477
#define OPTION 478
#define OR 479
#define ORDER 480
#define OUTER 481
#define OUTPUT 482
#define OVERLAPS 483
#define PAGE 484
#define PARTIAL 485
#define SQL_PASCAL 486
#define PERSISTENT 487
#define CQL_PI 488
#define PLI 489
#define POSITION 490
#define PRECISION 491
#define PREPARE 492
#define PRESERVE 493
#define PRIMARY 494
#define PRIOR 495
#define PRIVILEGES 496
#define PROCEDURE 497
#define PRODUCT 498
#define PUBLIC 499
#define QUARTER 500
#define QUIT 501
#define RAND 502
#define READ_ONLY 503
#define REAL 504
#define REFERENCES 505
#define REPEAT 506
#define REPLACE 507
#define RESTRICT 508
#define REVOKE 509
#define RIGHT 510
#define ROLLBACK 511
#define ROWS 512
#define RPAD 513
#define RTRIM 514
#define SCHEMA 515
#define SCREEN_WIDTH 516
#define SCROLL 517
#define SECOND 518
#define SECONDS_BETWEEN 519
#define SELECT 520
#define SEQUENCE 521
#define SETOPT 522
#define SET 523
#define SHOWOPT 524
#define SIGN 525
#define SIMILAR_TO 526
#define NOT_SIMILAR_TO 527
#define INTEGER_CONST 528
#define REAL_CONST 529
#define DATE_CONST 530
#define DATETIME_CONST 531
#define TIME_CONST 532
#define SIN 533
#define SQL_SIZE 534
#define SMALLINT 535
#define SOME 536
#define SPACE 537
#define SQL 538
#define SQL_TRUE 539
#define SQLCA 540
#define SQLCODE 541
#define SQLERROR 542
#define SQLSTATE 543
#define SQLWARNING 544
#define SQRT 545
#define STDEV 546
#define SUBSTRING 547
#define SUM 548
#define SYSDATE 549
#define SYSDATE_FORMAT 550
#define SYSTEM 551
#define TABLE 552
#define TAN 553
#define TEMPORARY 554
#define THEN 555
#define THREE_DIGITS 556
#define TIME 557
#define TIMESTAMP 558
#define TIMEZONE_HOUR 559
#define TIMEZONE_MINUTE 560
#define TINYINT 561
#define TO 562
#define TO_CHAR 563
#define TO_DATE 564
#define TRANSACTION 565
#define TRANSLATE 566
#define TRANSLATION 567
#define TRUNCATE 568
#define GENERAL_TITLE 569
#define TWO_DIGITS 570
#define UCASE 571
#define UNION 572
#define UNIQUE 573
#define SQL_UNKNOWN 574
#define UPDATE 575
#define UPPER 576
#define USAGE 577
#define USER 578
#define IDENTIFIER 579
#define IDENTIFIER_DOT_ASTERISK 580
#define QUERY_PARAMETER 581
#define USING 582
#define VALUE 583
#define VALUES 584
#define VARBINARY 585
#define VARCHAR 586
#define VARYING 587
#define VENDOR 588
#define VIEW 589
#define WEEK 590
#define WHEN 591
#define WHENEVER 592
#define WHERE 593
#define WHERE_CURRENT_OF 594
#define WITH 595
#define WORD_WRAPPED 596
#define WORK 597
#define WRAPPED 598
#define XOR 599
#define YEAR 600
#define YEARS_BETWEEN 601
#define SCAN_ERROR 602
#define __LAST_TOKEN 603
#define ILIKE 604
/* Copy the first part of user declarations. */
#line 438 "sqlparser.y"
#ifndef YYDEBUG /* compat. */
# define YYDEBUG 0
#endif
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <assert.h>
#include <limits.h>
//TODO OK?
#ifdef TQ_WS_WIN
//workaround for bug on msvc
# undef LLONG_MIN
#endif
#ifndef LLONG_MAX
# define LLONG_MAX 0x7fffffffffffffffLL
#endif
#ifndef LLONG_MIN
# define LLONG_MIN 0x8000000000000000LL
#endif
#ifndef LLONG_MAX
# define ULLONG_MAX 0xffffffffffffffffLL
#endif
#ifdef _WIN32
# include <malloc.h>
#endif
#include <tqobject.h>
#include <kdebug.h>
#include <klocale.h>
#include <tqptrlist.h>
#include <tqcstring.h>
#include <tqvariant.h>
#include <connection.h>
#include <queryschema.h>
#include <field.h>
#include <tableschema.h>
#include "parser.h"
#include "parser_p.h"
#include "sqltypes.h"
int yylex();
// using namespace std;
using namespace KexiDB;
#define YY_NO_UNPUT
#define YYSTACK_USE_ALLOCA 1
#define YYMAXDEPTH 255
extern "C"
{
int yywrap()
{
return 1;
}
}
#if 0
struct yyval
{
TQString parserUserName;
int integerValue;
KexiDBField::ColumnType coltype;
}
#endif
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
#line 511 "sqlparser.y"
{
TQString* stringValue;
TQ_LLONG integerValue;
bool booleanValue;
struct realType realValue;
KexiDB::Field::Type colType;
KexiDB::Field *field;
KexiDB::BaseExpr *expr;
KexiDB::NArgExpr *exprList;
KexiDB::ConstExpr *constExpr;
KexiDB::QuerySchema *querySchema;
SelectOptionsInternal *selectOptions;
OrderByColumnInternal::List *orderByColumns;
TQVariant *variantValue;
}
/* Line 193 of yacc.c. */
#line 883 "sqlparser.tab.c"
YYSTYPE;
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 216 of yacc.c. */
#line 896 "sqlparser.tab.c"
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#elif (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
typedef signed char yytype_int8;
#else
typedef short int yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int i)
#else
static int
YYID (i)
int i;
#endif
{
return i;
}
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined _STDLIB_H \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss;
YYSTYPE yyvs;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (YYID (0))
# endif
# endif
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (YYID (0))
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 10
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 335
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 373
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 37
/* YYNRULES -- Number of rules. */
#define YYNRULES 108
/* YYNRULES -- Number of states. */
#define YYNSTATES 176
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 604
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const yytype_uint16 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 357, 352, 370, 361,
358, 359, 351, 350, 355, 349, 356, 362, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 354,
364, 363, 365, 360, 353, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 368, 2, 369, 367, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 371, 2, 372, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 106, 107, 108, 109, 110, 111, 112, 113, 114,
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
135, 136, 137, 138, 139, 140, 141, 142, 143, 144,
145, 146, 147, 148, 149, 150, 151, 152, 153, 154,
155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
165, 166, 167, 168, 169, 170, 171, 172, 173, 174,
175, 176, 177, 178, 179, 180, 181, 182, 183, 184,
185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
195, 196, 197, 198, 199, 200, 201, 202, 203, 204,
205, 206, 207, 208, 209, 210, 211, 212, 213, 214,
215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
225, 226, 227, 228, 229, 230, 231, 232, 233, 234,
235, 236, 237, 238, 239, 240, 241, 242, 243, 244,
245, 246, 247, 248, 249, 250, 251, 252, 253, 254,
255, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
325, 326, 327, 328, 329, 330, 331, 332, 333, 334,
335, 336, 337, 338, 339, 340, 341, 342, 343, 344,
345, 346, 347, 348, 366
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint16 yyprhs[] =
{
0, 0, 3, 5, 9, 11, 14, 16, 18, 19,
27, 31, 33, 36, 40, 43, 45, 48, 51, 53,
55, 60, 65, 66, 69, 73, 76, 80, 85, 87,
89, 93, 98, 103, 106, 108, 111, 115, 120, 122,
126, 128, 130, 132, 134, 138, 142, 146, 148, 152,
156, 160, 164, 168, 170, 174, 178, 182, 186, 190,
194, 196, 199, 202, 204, 208, 212, 214, 218, 222,
226, 230, 232, 236, 240, 244, 246, 249, 252, 255,
258, 260, 262, 265, 269, 271, 273, 275, 277, 279,
283, 287, 291, 295, 298, 302, 304, 306, 309, 313,
317, 319, 321, 323, 327, 330, 332, 337, 339
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yytype_int16 yyrhs[] =
{
374, 0, -1, 375, -1, 376, 354, 375, -1, 376,
-1, 376, 354, -1, 377, -1, 384, -1, -1, 75,
297, 324, 378, 358, 379, 359, -1, 379, 355, 380,
-1, 380, -1, 324, 383, -1, 324, 383, 381, -1,
381, 382, -1, 382, -1, 239, 170, -1, 206, 210,
-1, 31, -1, 4, -1, 4, 358, 273, 359, -1,
331, 358, 273, 359, -1, -1, 385, 406, -1, 385,
406, 403, -1, 385, 403, -1, 385, 406, 386, -1,
385, 406, 403, 386, -1, 265, -1, 387, -1, 225,
43, 388, -1, 387, 225, 43, 388, -1, 225, 43,
388, 387, -1, 338, 391, -1, 389, -1, 389, 390,
-1, 389, 355, 388, -1, 389, 390, 355, 388, -1,
324, -1, 324, 356, 324, -1, 273, -1, 25, -1,
100, -1, 392, -1, 393, 20, 392, -1, 393, 224,
392, -1, 393, 344, 392, -1, 393, -1, 394, 365,
393, -1, 394, 145, 393, -1, 394, 364, 393, -1,
394, 176, 393, -1, 394, 363, 393, -1, 394, -1,
395, 207, 394, -1, 395, 208, 394, -1, 395, 178,
394, -1, 395, 153, 394, -1, 395, 271, 394, -1,
395, 272, 394, -1, 395, -1, 395, 212, -1, 395,
213, -1, 396, -1, 397, 40, 396, -1, 397, 41,
396, -1, 397, -1, 398, 350, 397, -1, 398, 349,
397, -1, 398, 370, 397, -1, 398, 371, 397, -1,
398, -1, 399, 362, 398, -1, 399, 351, 398, -1,
399, 352, 398, -1, 399, -1, 349, 399, -1, 350,
399, -1, 372, 399, -1, 206, 399, -1, 324, -1,
326, -1, 324, 401, -1, 324, 356, 324, -1, 210,
-1, 53, -1, 273, -1, 274, -1, 400, -1, 358,
391, 359, -1, 358, 402, 359, -1, 391, 355, 402,
-1, 391, 355, 391, -1, 138, 404, -1, 404, 355,
405, -1, 405, -1, 324, -1, 324, 324, -1, 324,
23, 324, -1, 406, 355, 407, -1, 407, -1, 408,
-1, 409, -1, 408, 23, 324, -1, 408, 324, -1,
391, -1, 108, 358, 408, 359, -1, 351, -1, 324,
356, 351, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 580, 580, 590, 594, 595, 605, 609, 617, 616,
626, 626, 632, 640, 656, 656, 662, 667, 672, 680,
685, 692, 699, 707, 714, 719, 725, 731, 740, 750,
756, 762, 769, 779, 788, 797, 807, 815, 827, 833,
840, 847, 851, 858, 863, 868, 872, 877, 882, 886,
890, 894, 898, 903, 908, 913, 917, 921, 925, 929,
934, 939, 943, 948, 953, 957, 962, 967, 972, 976,
980, 985, 990, 994, 998, 1003, 1009, 1013, 1017, 1021,
1025, 1033, 1039, 1046, 1053, 1060, 1066, 1083, 1089, 1094,
1102, 1112, 1117, 1126, 1171, 1176, 1184, 1212, 1223, 1239,
1245, 1254, 1263, 1268, 1277, 1289, 1333, 1342, 1351
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "UMINUS", "SQL_TYPE", "SQL_ABS", "ACOS",
"AMPERSAND", "SQL_ABSOLUTE", "ADA", "ADD", "ADD_DAYS", "ADD_HOURS",
"ADD_MINUTES", "ADD_MONTHS", "ADD_SECONDS", "ADD_YEARS", "ALL",
"ALLOCATE", "ALTER", "AND", "ANY", "ARE", "AS", "ASIN", "ASC", "ASCII",
"ASSERTION", "ATAN", "ATAN2", "AUTHORIZATION", "AUTO_INCREMENT", "AVG",
"BEFORE", "SQL_BEGIN", "BETWEEN", "BIGINT", "BINARY", "BIT",
"BIT_LENGTH", "BITWISE_SHIFT_LEFT", "BITWISE_SHIFT_RIGHT", "BREAK", "BY",
"CASCADE", "CASCADED", "CASE", "CAST", "CATALOG", "CEILING", "CENTER",
"SQL_CHAR", "CHAR_LENGTH", "CHARACTER_STRING_LITERAL", "CHECK", "CLOSE",
"COALESCE", "COBOL", "COLLATE", "COLLATION", "COLUMN", "COMMIT",
"COMPUTE", "CONCAT", "CONCATENATION", "CONNECT", "CONNECTION",
"CONSTRAINT", "CONSTRAINTS", "CONTINUE", "CONVERT", "CORRESPONDING",
"COS", "COT", "COUNT", "CREATE", "CURDATE", "CURRENT", "CURRENT_DATE",
"CURRENT_TIME", "CURRENT_TIMESTAMP", "CURTIME", "CURSOR", "DATABASE",
"SQL_DATE", "DATE_FORMAT", "DATE_REMAINDER", "DATE_VALUE", "DAY",
"DAYOFMONTH", "DAYOFWEEK", "DAYOFYEAR", "DAYS_BETWEEN", "DEALLOCATE",
"DEC", "DECLARE", "DEFAULT", "DEFERRABLE", "DEFERRED", "SQL_DELETE",
"DESC", "DESCRIBE", "DESCRIPTOR", "DIAGNOSTICS", "DICTIONARY",
"DIRECTORY", "DISCONNECT", "DISPLACEMENT", "DISTINCT", "DOMAIN_TOKEN",
"SQL_DOUBLE", "DOUBLE_QUOTED_STRING", "DROP", "ELSE", "END", "END_EXEC",
"EQUAL", "ESCAPE", "EXCEPT", "SQL_EXCEPTION", "EXEC", "EXECUTE",
"EXISTS", "EXP", "EXPONENT", "EXTERNAL", "EXTRACT", "SQL_FALSE", "FETCH",
"FIRST", "SQL_FLOAT", "FLOOR", "FN", "FOR", "FOREIGN", "FORTRAN",
"FOUND", "FOUR_DIGITS", "FROM", "FULL", "GET", "GLOBAL", "GO", "GOTO",
"GRANT", "GREATER_OR_EQUAL", "HAVING", "HOUR", "HOURS_BETWEEN",
"IDENTITY", "IFNULL", "SQL_IGNORE", "IMMEDIATE", "SQL_IN", "INCLUDE",
"INDEX", "INDICATOR", "INITIALLY", "INNER", "INPUT", "INSENSITIVE",
"INSERT", "INTEGER", "INTERSECT", "INTERVAL", "INTO", "IS", "ISOLATION",
"JOIN", "JUSTIFY", "KEY", "LANGUAGE", "LAST", "LCASE", "LEFT", "LENGTH",
"LESS_OR_EQUAL", "LEVEL", "LIKE", "LINE_WIDTH", "LOCAL", "LOCATE", "LOG",
"SQL_LONG", "LOWER", "LTRIM", "LTRIP", "MATCH", "SQL_MAX", "MICROSOFT",
"SQL_MIN", "MINUS", "MINUTE", "MINUTES_BETWEEN", "MOD", "MODIFY",
"MODULE", "MONTH", "MONTHS_BETWEEN", "MUMPS", "NAMES", "NATIONAL",
"NCHAR", "NEXT", "NODUP", "NONE", "NOT", "NOT_EQUAL", "NOT_EQUAL2",
"NOW", "SQL_NULL", "SQL_IS", "SQL_IS_NULL", "SQL_IS_NOT_NULL", "NULLIF",
"NUMERIC", "OCTET_LENGTH", "ODBC", "OF", "SQL_OFF", "SQL_ON", "ONLY",
"OPEN", "OPTION", "OR", "ORDER", "OUTER", "OUTPUT", "OVERLAPS", "PAGE",
"PARTIAL", "SQL_PASCAL", "PERSISTENT", "CQL_PI", "PLI", "POSITION",
"PRECISION", "PREPARE", "PRESERVE", "PRIMARY", "PRIOR", "PRIVILEGES",
"PROCEDURE", "PRODUCT", "PUBLIC", "QUARTER", "QUIT", "RAND", "READ_ONLY",
"REAL", "REFERENCES", "REPEAT", "REPLACE", "RESTRICT", "REVOKE", "RIGHT",
"ROLLBACK", "ROWS", "RPAD", "RTRIM", "SCHEMA", "SCREEN_WIDTH", "SCROLL",
"SECOND", "SECONDS_BETWEEN", "SELECT", "SEQUENCE", "SETOPT", "SET",
"SHOWOPT", "SIGN", "SIMILAR_TO", "NOT_SIMILAR_TO", "INTEGER_CONST",
"REAL_CONST", "DATE_CONST", "DATETIME_CONST", "TIME_CONST", "SIN",
"SQL_SIZE", "SMALLINT", "SOME", "SPACE", "SQL", "SQL_TRUE", "SQLCA",
"SQLCODE", "SQLERROR", "SQLSTATE", "SQLWARNING", "SQRT", "STDEV",
"SUBSTRING", "SUM", "SYSDATE", "SYSDATE_FORMAT", "SYSTEM", "TABLE",
"TAN", "TEMPORARY", "THEN", "THREE_DIGITS", "TIME", "TIMESTAMP",
"TIMEZONE_HOUR", "TIMEZONE_MINUTE", "TINYINT", "TO", "TO_CHAR",
"TO_DATE", "TRANSACTION", "TRANSLATE", "TRANSLATION", "TRUNCATE",
"GENERAL_TITLE", "TWO_DIGITS", "UCASE", "UNION", "UNIQUE", "SQL_UNKNOWN",
"UPDATE", "UPPER", "USAGE", "USER", "IDENTIFIER",
"IDENTIFIER_DOT_ASTERISK", "QUERY_PARAMETER", "USING", "VALUE", "VALUES",
"VARBINARY", "VARCHAR", "VARYING", "VENDOR", "VIEW", "WEEK", "WHEN",
"WHENEVER", "WHERE", "WHERE_CURRENT_OF", "WITH", "WORD_WRAPPED", "WORK",
"WRAPPED", "XOR", "YEAR", "YEARS_BETWEEN", "SCAN_ERROR", "__LAST_TOKEN",
"'-'", "'+'", "'*'", "'%'", "'@'", "';'", "','", "'.'", "'$'", "'('",
"')'", "'?'", "'''", "'/'", "'='", "'<'", "'>'", "ILIKE", "'^'", "'['",
"']'", "'&'", "'|'", "'~'", "$accept", "TopLevelStatement",
"StatementList", "Statement", "CreateTableStatement", "@1", "ColDefs",
"ColDef", "ColKeys", "ColKey", "ColType", "SelectStatement", "Select",
"SelectOptions", "WhereClause", "OrderByClause", "OrderByColumnId",
"OrderByOption", "aExpr", "aExpr2", "aExpr3", "aExpr4", "aExpr5",
"aExpr6", "aExpr7", "aExpr8", "aExpr9", "aExpr10", "aExprList",
"aExprList2", "Tables", "FlatTableList", "FlatTable", "ColViews",
"ColItem", "ColExpression", "ColWildCard", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
325, 326, 327, 328, 329, 330, 331, 332, 333, 334,
335, 336, 337, 338, 339, 340, 341, 342, 343, 344,
345, 346, 347, 348, 349, 350, 351, 352, 353, 354,
355, 356, 357, 358, 359, 360, 361, 362, 363, 364,
365, 366, 367, 368, 369, 370, 371, 372, 373, 374,
375, 376, 377, 378, 379, 380, 381, 382, 383, 384,
385, 386, 387, 388, 389, 390, 391, 392, 393, 394,
395, 396, 397, 398, 399, 400, 401, 402, 403, 404,
405, 406, 407, 408, 409, 410, 411, 412, 413, 414,
415, 416, 417, 418, 419, 420, 421, 422, 423, 424,
425, 426, 427, 428, 429, 430, 431, 432, 433, 434,
435, 436, 437, 438, 439, 440, 441, 442, 443, 444,
445, 446, 447, 448, 449, 450, 451, 452, 453, 454,
455, 456, 457, 458, 459, 460, 461, 462, 463, 464,
465, 466, 467, 468, 469, 470, 471, 472, 473, 474,
475, 476, 477, 478, 479, 480, 481, 482, 483, 484,
485, 486, 487, 488, 489, 490, 491, 492, 493, 494,
495, 496, 497, 498, 499, 500, 501, 502, 503, 504,
505, 506, 507, 508, 509, 510, 511, 512, 513, 514,
515, 516, 517, 518, 519, 520, 521, 522, 523, 524,
525, 526, 527, 528, 529, 530, 531, 532, 533, 534,
535, 536, 537, 538, 539, 540, 541, 542, 543, 544,
545, 546, 547, 548, 549, 550, 551, 552, 553, 554,
555, 556, 557, 558, 559, 560, 561, 562, 563, 564,
565, 566, 567, 568, 569, 570, 571, 572, 573, 574,
575, 576, 577, 578, 579, 580, 581, 582, 583, 584,
585, 586, 587, 588, 589, 590, 591, 592, 593, 594,
595, 596, 597, 598, 599, 600, 601, 602, 603, 45,
43, 42, 37, 64, 59, 44, 46, 36, 40, 41,
63, 39, 47, 61, 60, 62, 604, 94, 91, 93,
38, 124, 126
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint16 yyr1[] =
{
0, 373, 374, 375, 375, 375, 376, 376, 378, 377,
379, 379, 380, 380, 381, 381, 382, 382, 382, 383,
383, 383, 383, 384, 384, 384, 384, 384, 385, 386,
386, 386, 386, 387, 388, 388, 388, 388, 389, 389,
389, 390, 390, 391, 392, 392, 392, 392, 393, 393,
393, 393, 393, 393, 394, 394, 394, 394, 394, 394,
394, 395, 395, 395, 396, 396, 396, 397, 397, 397,
397, 397, 398, 398, 398, 398, 399, 399, 399, 399,
399, 399, 399, 399, 399, 399, 399, 399, 399, 400,
401, 402, 402, 403, 404, 404, 405, 405, 405, 406,
406, 407, 407, 407, 407, 408, 408, 409, 409
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 3, 1, 2, 1, 1, 0, 7,
3, 1, 2, 3, 2, 1, 2, 2, 1, 1,
4, 4, 0, 2, 3, 2, 3, 4, 1, 1,
3, 4, 4, 2, 1, 2, 3, 4, 1, 3,
1, 1, 1, 1, 3, 3, 3, 1, 3, 3,
3, 3, 3, 1, 3, 3, 3, 3, 3, 3,
1, 2, 2, 1, 3, 3, 1, 3, 3, 3,
3, 1, 3, 3, 3, 1, 2, 2, 2, 2,
1, 1, 2, 3, 1, 1, 1, 1, 1, 3,
3, 3, 3, 2, 3, 1, 1, 2, 3, 3,
1, 1, 1, 3, 2, 1, 4, 1, 3
};
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
0, 0, 28, 0, 2, 4, 6, 7, 0, 0,
1, 5, 85, 0, 0, 0, 84, 86, 87, 80,
81, 0, 0, 107, 0, 0, 105, 43, 47, 53,
60, 63, 66, 71, 75, 88, 25, 23, 100, 101,
102, 8, 3, 0, 96, 93, 95, 80, 79, 0,
0, 82, 76, 77, 0, 78, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 61, 62,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 26, 29, 24, 0, 104, 0,
0, 0, 97, 0, 0, 83, 108, 0, 0, 89,
44, 45, 46, 49, 51, 52, 50, 48, 57, 56,
54, 55, 58, 59, 64, 65, 68, 67, 69, 70,
73, 74, 72, 0, 33, 99, 0, 27, 103, 0,
106, 98, 94, 0, 90, 40, 38, 30, 34, 0,
22, 0, 11, 92, 91, 0, 32, 41, 42, 0,
35, 31, 19, 0, 12, 0, 9, 39, 36, 0,
0, 0, 18, 0, 0, 13, 15, 10, 37, 0,
0, 17, 16, 14, 20, 21
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 3, 4, 5, 6, 89, 141, 142, 165, 166,
154, 7, 8, 84, 85, 137, 138, 150, 26, 27,
28, 29, 30, 31, 32, 33, 34, 35, 51, 98,
36, 45, 46, 37, 38, 39, 40
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -336
static const yytype_int16 yypact[] =
{
-67, -271, -336, 39, -336, -311, -336, -336, -50, -265,
-336, -67, -336, -298, -262, -37, -336, -336, -336, -335,
-336, -37, -37, -336, -37, -37, -336, -336, -18, -135,
-142, -336, -7, -325, -332, -336, -336, -133, -336, -19,
-336, -336, -336, -40, -9, -291, -336, -318, -336, -309,
-37, -336, -336, -336, -292, -336, -37, -37, -37, -37,
-37, -37, -37, -37, -37, -37, -37, -37, -336, -336,
-37, -37, -37, -37, -37, -37, -37, -37, -37, -37,
-37, 26, -37, -47, -336, -153, -216, -251, -336, -284,
-273, -237, -336, -262, -231, -336, -336, -260, -263, -336,
-336, -336, -336, -336, -336, -336, -336, -336, -336, -336,
-336, -336, -336, -336, -336, -336, -336, -336, -336, -336,
-336, -336, -336, -261, -336, -336, 51, -336, -336, -227,
-336, -336, -336, -37, -336, -336, -258, -239, -25, -261,
-3, -324, -336, -260, -336, -224, -336, -336, -336, -261,
-254, -336, -256, -255, -24, -227, -336, -336, -336, -261,
-169, -168, -336, -104, -63, -24, -336, -336, -336, -250,
-249, -336, -336, -336, -336, -336
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-336, -336, 97, -336, -336, -336, -336, -44, -336, -53,
-336, -336, -336, 27, -23, -122, -336, -336, -6, -1,
18, -17, -336, -21, 8, 11, 7, -336, -336, -16,
78, -336, 23, -336, 35, 76, -336
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -1
static const yytype_uint8 yytable[] =
{
147, 152, 56, 12, 87, 14, 12, 162, 1, 81,
59, 64, 135, 12, 91, 95, 12, 151, 54, 78,
79, 49, 48, 50, 74, 75, 9, 158, 52, 53,
80, 155, 55, 72, 73, 156, 65, 168, 94, 10,
50, 60, 96, 11, 97, 76, 77, 108, 109, 110,
111, 114, 115, 112, 113, 100, 101, 102, 13, 41,
43, 13, 44, 136, 93, 66, 67, 99, 13, 123,
68, 69, 126, 128, 129, 148, 124, 103, 104, 105,
106, 107, 116, 117, 118, 119, 130, 131, 14, 120,
121, 122, 81, 95, 139, 133, 134, 140, 145, 82,
157, 159, 160, 161, 169, 170, 171, 172, 42, 174,
175, 167, 173, 127, 146, 86, 132, 144, 125, 90,
0, 0, 82, 0, 0, 0, 0, 143, 0, 70,
71, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 15, 0, 0, 15,
16, 0, 0, 16, 0, 0, 15, 0, 0, 15,
16, 0, 0, 16, 0, 0, 0, 0, 0, 0,
0, 0, 163, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 2, 0,
0, 0, 0, 0, 0, 82, 57, 0, 0, 0,
0, 0, 0, 0, 0, 164, 0, 0, 0, 0,
0, 0, 83, 17, 18, 0, 17, 18, 61, 62,
63, 0, 0, 17, 18, 0, 17, 18, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 19, 0, 20, 19, 0, 20,
0, 0, 0, 0, 47, 0, 20, 47, 0, 20,
0, 0, 0, 0, 0, 0, 0, 0, 0, 21,
22, 23, 21, 22, 23, 88, 0, 0, 24, 21,
22, 24, 21, 22, 0, 92, 0, 0, 24, 0,
0, 24, 25, 0, 0, 25, 58, 0, 153, 0,
149, 0, 25, 0, 0, 25
};
static const yytype_int16 yycheck[] =
{
25, 4, 20, 53, 23, 138, 53, 31, 75, 225,
145, 153, 273, 53, 23, 324, 53, 139, 24, 351,
352, 356, 15, 358, 349, 350, 297, 149, 21, 22,
362, 355, 25, 40, 41, 359, 178, 159, 356, 0,
358, 176, 351, 354, 50, 370, 371, 64, 65, 66,
67, 72, 73, 70, 71, 56, 57, 58, 108, 324,
358, 108, 324, 324, 355, 207, 208, 359, 108, 43,
212, 213, 225, 324, 358, 100, 82, 59, 60, 61,
62, 63, 74, 75, 76, 77, 359, 324, 138, 78,
79, 80, 225, 324, 43, 355, 359, 324, 356, 338,
324, 355, 358, 358, 273, 273, 210, 170, 11, 359,
359, 155, 165, 86, 137, 37, 93, 133, 83, 43,
-1, -1, 338, -1, -1, -1, -1, 133, -1, 271,
272, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 206, -1, -1, 206,
210, -1, -1, 210, -1, -1, 206, -1, -1, 206,
210, -1, -1, 210, -1, -1, -1, -1, -1, -1,
-1, -1, 206, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 265, -1,
-1, -1, -1, -1, -1, 338, 224, -1, -1, -1,
-1, -1, -1, -1, -1, 239, -1, -1, -1, -1,
-1, -1, 355, 273, 274, -1, 273, 274, 363, 364,
365, -1, -1, 273, 274, -1, 273, 274, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 324, -1, 326, 324, -1, 326,
-1, -1, -1, -1, 324, -1, 326, 324, -1, 326,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 349,
350, 351, 349, 350, 351, 324, -1, -1, 358, 349,
350, 358, 349, 350, -1, 324, -1, -1, 358, -1,
-1, 358, 372, -1, -1, 372, 344, -1, 331, -1,
355, -1, 372, -1, -1, 372
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint16 yystos[] =
{
0, 75, 265, 374, 375, 376, 377, 384, 385, 297,
0, 354, 53, 108, 138, 206, 210, 273, 274, 324,
326, 349, 350, 351, 358, 372, 391, 392, 393, 394,
395, 396, 397, 398, 399, 400, 403, 406, 407, 408,
409, 324, 375, 358, 324, 404, 405, 324, 399, 356,
358, 401, 399, 399, 391, 399, 20, 224, 344, 145,
176, 363, 364, 365, 153, 178, 207, 208, 212, 213,
271, 272, 40, 41, 349, 350, 370, 371, 351, 352,
362, 225, 338, 355, 386, 387, 403, 23, 324, 378,
408, 23, 324, 355, 356, 324, 351, 391, 402, 359,
392, 392, 392, 393, 393, 393, 393, 393, 394, 394,
394, 394, 394, 394, 396, 396, 397, 397, 397, 397,
398, 398, 398, 43, 391, 407, 225, 386, 324, 358,
359, 324, 405, 355, 359, 273, 324, 388, 389, 43,
324, 379, 380, 391, 402, 356, 387, 25, 100, 355,
390, 388, 4, 331, 383, 355, 359, 324, 388, 355,
358, 358, 31, 206, 239, 381, 382, 380, 388, 273,
273, 210, 170, 382, 359, 359
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (YYID (N)) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (YYID (0))
#endif
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if YYLTYPE_IS_TRIVIAL
# define YY_LOCATION_PRINT(File, Loc) \
fprintf (File, "%d.%d-%d.%d", \
(Loc).first_line, (Loc).first_column, \
(Loc).last_line, (Loc).last_column)
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, const YYSTYPE * const yyvaluep)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
const YYSTYPE * const yyvaluep;
#endif
{
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, const YYSTYPE * const yyvaluep)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
const YYSTYPE * const yyvaluep;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
#else
static void
yy_stack_print (bottom, top)
yytype_int16 *bottom;
yytype_int16 *top;
#endif
{
YYFPRINTF (stderr, "Stack now");
for (; bottom <= top; ++bottom)
YYFPRINTF (stderr, " %d", *bottom);
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (YYID (0))
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp,
int yyrule)
#else
static void
yy_reduce_print (yyvsp, yyrule
)
YYSTYPE *yyvsp;
int yyrule;
#endif
{
int yynrhs = yyr2[yyrule];
int yyi;
unsigned long int yylno = yyrline[yyrule];
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
fprintf (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
fprintf (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
const char *yystr;
#endif
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
#endif
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into YYRESULT an error message about the unexpected token
YYCHAR while in state YYSTATE. Return the number of bytes copied,
including the terminating null byte. If YYRESULT is null, do not
copy anything; just return the number of bytes that would be
copied. As a special case, return 0 if an ordinary "syntax error"
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
size calculation. */
static YYSIZE_T
yysyntax_error (char *yyresult, int yystate, int yychar)
{
int yyn = yypact[yystate];
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
return 0;
else
{
int yytype = YYTRANSLATE (yychar);
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
YYSIZE_T yysize = yysize0;
YYSIZE_T yysize1;
int yysize_overflow = 0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
int yyx;
# if 0
/* This is so xgettext sees the translatable formats that are
constructed on the fly. */
YY_("syntax error, unexpected %s");
YY_("syntax error, unexpected %s, expecting %s");
YY_("syntax error, unexpected %s, expecting %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
# endif
char *yyfmt;
char const *yyf;
static char const yyunexpected[] = "syntax error, unexpected %s";
static char const yyexpecting[] = ", expecting %s";
static char const yyor[] = " or %s";
char yyformat[sizeof yyunexpected
+ sizeof yyexpecting - 1
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
* (sizeof yyor - 1))];
char const *yyprefix = yyexpecting;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yycount = 1;
yyarg[0] = yytname[yytype];
yyfmt = yystpcpy (yyformat, yyunexpected);
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
yyformat[sizeof yyunexpected - 1] = '\0';
break;
}
yyarg[yycount++] = yytname[yyx];
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
yyfmt = yystpcpy (yyfmt, yyprefix);
yyprefix = yyor;
}
yyf = YY_(yyformat);
yysize1 = yysize + yystrlen (yyf);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
if (yysize_overflow)
return YYSIZE_MAXIMUM;
if (yyresult)
{
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
char *yyp = yyresult;
int yyi = 0;
while ((*yyp = *yyf) != '\0')
{
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyf += 2;
}
else
{
yyp++;
yyf++;
}
}
}
return yysize;
}
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yymsg, yytype, yyvaluep)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
#endif
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
/* The look-ahead symbol. */
int yychar;
/* The semantic value of the look-ahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#endif
#endif
{
int yystate;
int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Look-ahead token as an internal (translated) token number. */
int yytoken = 0;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss = yyssa;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp;
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
look-ahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to look-ahead token. */
yyn = yypact[yystate];
if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a look-ahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
if (yyn == YYFINAL)
YYACCEPT;
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the look-ahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 581 "sqlparser.y"
{
//todo: multiple statements
//todo: not only "select" statements
parser->setOperation(Parser::OP_Select);
parser->setQuerySchema((yyvsp[(1) - (1)].querySchema));
;}
break;
case 3:
#line 591 "sqlparser.y"
{
//todo: multiple statements
;}
break;
case 5:
#line 596 "sqlparser.y"
{
(yyval.querySchema) = (yyvsp[(1) - (2)].querySchema);
;}
break;
case 6:
#line 606 "sqlparser.y"
{
YYACCEPT;
;}
break;
case 7:
#line 610 "sqlparser.y"
{
(yyval.querySchema) = (yyvsp[(1) - (1)].querySchema);
;}
break;
case 8:
#line 617 "sqlparser.y"
{
parser->setOperation(Parser::OP_CreateTable);
parser->createTable((yyvsp[(3) - (3)].stringValue)->latin1());
delete (yyvsp[(3) - (3)].stringValue);
;}
break;
case 11:
#line 627 "sqlparser.y"
{
;}
break;
case 12:
#line 633 "sqlparser.y"
{
KexiDBDbg << "adding field " << *(yyvsp[(1) - (2)].stringValue) << endl;
field->setName((yyvsp[(1) - (2)].stringValue)->latin1());
parser->table()->addField(field);
field = 0;
delete (yyvsp[(1) - (2)].stringValue);
;}
break;
case 13:
#line 641 "sqlparser.y"
{
KexiDBDbg << "adding field " << *(yyvsp[(1) - (3)].stringValue) << endl;
field->setName(*(yyvsp[(1) - (3)].stringValue));
delete (yyvsp[(1) - (3)].stringValue);
parser->table()->addField(field);
// if(field->isPrimaryKey())
// parser->table()->addPrimaryKey(field->name());
// delete field;
// field = 0;
;}
break;
case 15:
#line 657 "sqlparser.y"
{
;}
break;
case 16:
#line 663 "sqlparser.y"
{
field->setPrimaryKey(true);
KexiDBDbg << "primary" << endl;
;}
break;
case 17:
#line 668 "sqlparser.y"
{
field->setNotNull(true);
KexiDBDbg << "not_null" << endl;
;}
break;
case 18:
#line 673 "sqlparser.y"
{
field->setAutoIncrement(true);
KexiDBDbg << "ainc" << endl;
;}
break;
case 19:
#line 681 "sqlparser.y"
{
field = new Field();
field->setType((yyvsp[(1) - (1)].colType));
;}
break;
case 20:
#line 686 "sqlparser.y"
{
KexiDBDbg << "sql + length" << endl;
field = new Field();
field->setPrecision((yyvsp[(3) - (4)].integerValue));
field->setType((yyvsp[(1) - (4)].colType));
;}
break;
case 21:
#line 693 "sqlparser.y"
{
field = new Field();
field->setPrecision((yyvsp[(3) - (4)].integerValue));
field->setType(Field::Text);
;}
break;
case 22:
#line 699 "sqlparser.y"
{
// SQLITE compatibillity
field = new Field();
field->setType(Field::InvalidType);
;}
break;
case 23:
#line 708 "sqlparser.y"
{
KexiDBDbg << "Select ColViews=" << (yyvsp[(2) - (2)].exprList)->debugString() << endl;
if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[(1) - (2)].querySchema), (yyvsp[(2) - (2)].exprList) )))
return 0;
;}
break;
case 24:
#line 715 "sqlparser.y"
{
if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[(1) - (3)].querySchema), (yyvsp[(2) - (3)].exprList), (yyvsp[(3) - (3)].exprList) )))
return 0;
;}
break;
case 25:
#line 720 "sqlparser.y"
{
KexiDBDbg << "Select ColViews Tables" << endl;
if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[(1) - (2)].querySchema), 0, (yyvsp[(2) - (2)].exprList) )))
return 0;
;}
break;
case 26:
#line 726 "sqlparser.y"
{
KexiDBDbg << "Select ColViews Conditions" << endl;
if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[(1) - (3)].querySchema), (yyvsp[(2) - (3)].exprList), 0, (yyvsp[(3) - (3)].selectOptions) )))
return 0;
;}
break;
case 27:
#line 732 "sqlparser.y"
{
KexiDBDbg << "Select ColViews Tables SelectOptions" << endl;
if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[(1) - (4)].querySchema), (yyvsp[(2) - (4)].exprList), (yyvsp[(3) - (4)].exprList), (yyvsp[(4) - (4)].selectOptions) )))
return 0;
;}
break;
case 28:
#line 741 "sqlparser.y"
{
KexiDBDbg << "SELECT" << endl;
// parser->createSelect();
// parser->setOperation(Parser::OP_Select);
(yyval.querySchema) = new QuerySchema();
;}
break;
case 29:
#line 751 "sqlparser.y"
{
KexiDBDbg << "WhereClause" << endl;
(yyval.selectOptions) = new SelectOptionsInternal;
(yyval.selectOptions)->whereExpr = (yyvsp[(1) - (1)].expr);
;}
break;
case 30:
#line 757 "sqlparser.y"
{
KexiDBDbg << "OrderByClause" << endl;
(yyval.selectOptions) = new SelectOptionsInternal;
(yyval.selectOptions)->orderByColumns = (yyvsp[(3) - (3)].orderByColumns);
;}
break;
case 31:
#line 763 "sqlparser.y"
{
KexiDBDbg << "WhereClause ORDER BY OrderByClause" << endl;
(yyval.selectOptions) = new SelectOptionsInternal;
(yyval.selectOptions)->whereExpr = (yyvsp[(1) - (4)].expr);
(yyval.selectOptions)->orderByColumns = (yyvsp[(4) - (4)].orderByColumns);
;}
break;
case 32:
#line 770 "sqlparser.y"
{
KexiDBDbg << "OrderByClause WhereClause" << endl;
(yyval.selectOptions) = new SelectOptionsInternal;
(yyval.selectOptions)->whereExpr = (yyvsp[(4) - (4)].expr);
(yyval.selectOptions)->orderByColumns = (yyvsp[(3) - (4)].orderByColumns);
;}
break;
case 33:
#line 780 "sqlparser.y"
{
(yyval.expr) = (yyvsp[(2) - (2)].expr);
;}
break;
case 34:
#line 789 "sqlparser.y"
{
KexiDBDbg << "ORDER BY IDENTIFIER" << endl;
(yyval.orderByColumns) = new OrderByColumnInternal::List;
OrderByColumnInternal orderByColumn;
orderByColumn.setColumnByNameOrNumber( *(yyvsp[(1) - (1)].variantValue) );
(yyval.orderByColumns)->append( orderByColumn );
delete (yyvsp[(1) - (1)].variantValue);
;}
break;
case 35:
#line 798 "sqlparser.y"
{
KexiDBDbg << "ORDER BY IDENTIFIER OrderByOption" << endl;
(yyval.orderByColumns) = new OrderByColumnInternal::List;
OrderByColumnInternal orderByColumn;
orderByColumn.setColumnByNameOrNumber( *(yyvsp[(1) - (2)].variantValue) );
orderByColumn.ascending = (yyvsp[(2) - (2)].booleanValue);
(yyval.orderByColumns)->append( orderByColumn );
delete (yyvsp[(1) - (2)].variantValue);
;}
break;
case 36:
#line 808 "sqlparser.y"
{
(yyval.orderByColumns) = (yyvsp[(3) - (3)].orderByColumns);
OrderByColumnInternal orderByColumn;
orderByColumn.setColumnByNameOrNumber( *(yyvsp[(1) - (3)].variantValue) );
(yyval.orderByColumns)->append( orderByColumn );
delete (yyvsp[(1) - (3)].variantValue);
;}
break;
case 37:
#line 816 "sqlparser.y"
{
(yyval.orderByColumns) = (yyvsp[(4) - (4)].orderByColumns);
OrderByColumnInternal orderByColumn;
orderByColumn.setColumnByNameOrNumber( *(yyvsp[(1) - (4)].variantValue) );
orderByColumn.ascending = (yyvsp[(2) - (4)].booleanValue);
(yyval.orderByColumns)->append( orderByColumn );
delete (yyvsp[(1) - (4)].variantValue);
;}
break;
case 38:
#line 828 "sqlparser.y"
{
(yyval.variantValue) = new TQVariant( *(yyvsp[(1) - (1)].stringValue) );
KexiDBDbg << "OrderByColumnId: " << *(yyval.variantValue) << endl;
delete (yyvsp[(1) - (1)].stringValue);
;}
break;
case 39:
#line 834 "sqlparser.y"
{
(yyval.variantValue) = new TQVariant( *(yyvsp[(1) - (3)].stringValue) + "." + *(yyvsp[(3) - (3)].stringValue) );
KexiDBDbg << "OrderByColumnId: " << *(yyval.variantValue) << endl;
delete (yyvsp[(1) - (3)].stringValue);
delete (yyvsp[(3) - (3)].stringValue);
;}
break;
case 40:
#line 841 "sqlparser.y"
{
(yyval.variantValue) = new TQVariant((yyvsp[(1) - (1)].integerValue));
KexiDBDbg << "OrderByColumnId: " << *(yyval.variantValue) << endl;
;}
break;
case 41:
#line 848 "sqlparser.y"
{
(yyval.booleanValue) = true;
;}
break;
case 42:
#line 852 "sqlparser.y"
{
(yyval.booleanValue) = false;
;}
break;
case 44:
#line 864 "sqlparser.y"
{
// KexiDBDbg << "AND " << $3.debugString() << endl;
(yyval.expr) = new BinaryExpr( KexiDBExpr_Logical, (yyvsp[(1) - (3)].expr), AND, (yyvsp[(3) - (3)].expr) );
;}
break;
case 45:
#line 869 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr( KexiDBExpr_Logical, (yyvsp[(1) - (3)].expr), OR, (yyvsp[(3) - (3)].expr) );
;}
break;
case 46:
#line 873 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr( KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), XOR, (yyvsp[(3) - (3)].expr) );
;}
break;
case 48:
#line 883 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), '>', (yyvsp[(3) - (3)].expr));
;}
break;
case 49:
#line 887 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), GREATER_OR_EQUAL, (yyvsp[(3) - (3)].expr));
;}
break;
case 50:
#line 891 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), '<', (yyvsp[(3) - (3)].expr));
;}
break;
case 51:
#line 895 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), LESS_OR_EQUAL, (yyvsp[(3) - (3)].expr));
;}
break;
case 52:
#line 899 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), '=', (yyvsp[(3) - (3)].expr));
;}
break;
case 54:
#line 909 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), NOT_EQUAL, (yyvsp[(3) - (3)].expr));
;}
break;
case 55:
#line 914 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), NOT_EQUAL2, (yyvsp[(3) - (3)].expr));
;}
break;
case 56:
#line 918 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), LIKE, (yyvsp[(3) - (3)].expr));
;}
break;
case 57:
#line 922 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), SQL_IN, (yyvsp[(3) - (3)].expr));
;}
break;
case 58:
#line 926 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), SIMILAR_TO, (yyvsp[(3) - (3)].expr));
;}
break;
case 59:
#line 930 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Relational, (yyvsp[(1) - (3)].expr), NOT_SIMILAR_TO, (yyvsp[(3) - (3)].expr));
;}
break;
case 61:
#line 940 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( SQL_IS_NULL, (yyvsp[(1) - (2)].expr) );
;}
break;
case 62:
#line 944 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( SQL_IS_NOT_NULL, (yyvsp[(1) - (2)].expr) );
;}
break;
case 64:
#line 954 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), BITWISE_SHIFT_LEFT, (yyvsp[(3) - (3)].expr));
;}
break;
case 65:
#line 958 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), BITWISE_SHIFT_RIGHT, (yyvsp[(3) - (3)].expr));
;}
break;
case 67:
#line 968 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '+', (yyvsp[(3) - (3)].expr));
(yyval.expr)->debug();
;}
break;
case 68:
#line 973 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '-', (yyvsp[(3) - (3)].expr));
;}
break;
case 69:
#line 977 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '&', (yyvsp[(3) - (3)].expr));
;}
break;
case 70:
#line 981 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '|', (yyvsp[(3) - (3)].expr));
;}
break;
case 72:
#line 991 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '/', (yyvsp[(3) - (3)].expr));
;}
break;
case 73:
#line 995 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '*', (yyvsp[(3) - (3)].expr));
;}
break;
case 74:
#line 999 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(KexiDBExpr_Arithm, (yyvsp[(1) - (3)].expr), '%', (yyvsp[(3) - (3)].expr));
;}
break;
case 76:
#line 1010 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( '-', (yyvsp[(2) - (2)].expr) );
;}
break;
case 77:
#line 1014 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( '+', (yyvsp[(2) - (2)].expr) );
;}
break;
case 78:
#line 1018 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( '~', (yyvsp[(2) - (2)].expr) );
;}
break;
case 79:
#line 1022 "sqlparser.y"
{
(yyval.expr) = new UnaryExpr( NOT, (yyvsp[(2) - (2)].expr) );
;}
break;
case 80:
#line 1026 "sqlparser.y"
{
(yyval.expr) = new VariableExpr( *(yyvsp[(1) - (1)].stringValue) );
//TODO: simplify this later if that's 'only one field name' expression
KexiDBDbg << " + identifier: " << *(yyvsp[(1) - (1)].stringValue) << endl;
delete (yyvsp[(1) - (1)].stringValue);
;}
break;
case 81:
#line 1034 "sqlparser.y"
{
(yyval.expr) = new QueryParameterExpr( *(yyvsp[(1) - (1)].stringValue) );
KexiDBDbg << " + query parameter: " << (yyval.expr)->debugString() << endl;
delete (yyvsp[(1) - (1)].stringValue);
;}
break;
case 82:
#line 1040 "sqlparser.y"
{
KexiDBDbg << " + function: " << *(yyvsp[(1) - (2)].stringValue) << "(" << (yyvsp[(2) - (2)].exprList)->debugString() << ")" << endl;
(yyval.expr) = new FunctionExpr(*(yyvsp[(1) - (2)].stringValue), (yyvsp[(2) - (2)].exprList));
delete (yyvsp[(1) - (2)].stringValue);
;}
break;
case 83:
#line 1047 "sqlparser.y"
{
(yyval.expr) = new VariableExpr( *(yyvsp[(1) - (3)].stringValue) + "." + *(yyvsp[(3) - (3)].stringValue) );
KexiDBDbg << " + identifier.identifier: " << *(yyvsp[(1) - (3)].stringValue) << "." << *(yyvsp[(3) - (3)].stringValue) << endl;
delete (yyvsp[(1) - (3)].stringValue);
delete (yyvsp[(3) - (3)].stringValue);
;}
break;
case 84:
#line 1054 "sqlparser.y"
{
(yyval.expr) = new ConstExpr( SQL_NULL, TQVariant() );
KexiDBDbg << " + NULL" << endl;
// $$ = new Field();
//$$->setName(TQString());
;}
break;
case 85:
#line 1061 "sqlparser.y"
{
(yyval.expr) = new ConstExpr( CHARACTER_STRING_LITERAL, *(yyvsp[(1) - (1)].stringValue) );
KexiDBDbg << " + constant " << (yyvsp[(1) - (1)].stringValue) << endl;
delete (yyvsp[(1) - (1)].stringValue);
;}
break;
case 86:
#line 1067 "sqlparser.y"
{
TQVariant val;
if ((yyvsp[(1) - (1)].integerValue) <= INT_MAX && (yyvsp[(1) - (1)].integerValue) >= INT_MIN)
val = (int)(yyvsp[(1) - (1)].integerValue);
else if ((yyvsp[(1) - (1)].integerValue) <= UINT_MAX && (yyvsp[(1) - (1)].integerValue) >= 0)
val = (uint)(yyvsp[(1) - (1)].integerValue);
else if ((yyvsp[(1) - (1)].integerValue) <= (TQ_LLONG)LLONG_MAX && (yyvsp[(1) - (1)].integerValue) >= (TQ_LLONG)LLONG_MIN)
val = (TQ_LLONG)(yyvsp[(1) - (1)].integerValue);
// if ($1 < ULLONG_MAX)
// val = (TQ_ULLONG)$1;
//TODO ok?
(yyval.expr) = new ConstExpr( INTEGER_CONST, val );
KexiDBDbg << " + int constant: " << val.toString() << endl;
;}
break;
case 87:
#line 1084 "sqlparser.y"
{
(yyval.expr) = new ConstExpr( REAL_CONST, TQPoint( (yyvsp[(1) - (1)].realValue).integer, (yyvsp[(1) - (1)].realValue).fractional ) );
KexiDBDbg << " + real constant: " << (yyvsp[(1) - (1)].realValue).integer << "." << (yyvsp[(1) - (1)].realValue).fractional << endl;
;}
break;
case 89:
#line 1095 "sqlparser.y"
{
KexiDBDbg << "(expr)" << endl;
(yyval.expr) = new UnaryExpr('(', (yyvsp[(2) - (3)].expr));
;}
break;
case 90:
#line 1103 "sqlparser.y"
{
// $$ = new NArgExpr(0, 0);
// $$->add( $1 );
// $$->add( $3 );
(yyval.exprList) = (yyvsp[(2) - (3)].exprList);
;}
break;
case 91:
#line 1113 "sqlparser.y"
{
(yyval.exprList) = (yyvsp[(3) - (3)].exprList);
(yyval.exprList)->prepend( (yyvsp[(1) - (3)].expr) );
;}
break;
case 92:
#line 1118 "sqlparser.y"
{
(yyval.exprList) = new NArgExpr(0, 0);
(yyval.exprList)->add( (yyvsp[(1) - (3)].expr) );
(yyval.exprList)->add( (yyvsp[(3) - (3)].expr) );
;}
break;
case 93:
#line 1127 "sqlparser.y"
{
(yyval.exprList) = (yyvsp[(2) - (2)].exprList);
;}
break;
case 94:
#line 1172 "sqlparser.y"
{
(yyval.exprList) = (yyvsp[(1) - (3)].exprList);
(yyval.exprList)->add((yyvsp[(3) - (3)].expr));
;}
break;
case 95:
#line 1177 "sqlparser.y"
{
(yyval.exprList) = new NArgExpr(KexiDBExpr_TableList, IDENTIFIER); //ok?
(yyval.exprList)->add((yyvsp[(1) - (1)].expr));
;}
break;
case 96:
#line 1185 "sqlparser.y"
{
KexiDBDbg << "FROM: '" << *(yyvsp[(1) - (1)].stringValue) << "'" << endl;
(yyval.expr) = new VariableExpr(*(yyvsp[(1) - (1)].stringValue));
/*
//TODO: this isn't ok for more tables:
Field::ListIterator it = parser->select()->fieldsIterator();
for(Field *item; (item = it.current()); ++it)
{
if(item->table() == dummy)
{
item->setTable(schema);
}
if(item->table() && !item->isQueryAsterisk())
{
Field *f = item->table()->field(item->name());
if(!f)
{
ParserError err(i18n("Field List Error"), i18n("Unknown column '%1' in table '%2'").arg(item->name()).arg(schema->name()), ctoken, current);
parser->setError(err);
yyerror("fieldlisterror");
}
}
}*/
delete (yyvsp[(1) - (1)].stringValue);
;}
break;
case 97:
#line 1213 "sqlparser.y"
{
//table + alias
(yyval.expr) = new BinaryExpr(
KexiDBExpr_SpecialBinary,
new VariableExpr(*(yyvsp[(1) - (2)].stringValue)), 0,
new VariableExpr(*(yyvsp[(2) - (2)].stringValue))
);
delete (yyvsp[(1) - (2)].stringValue);
delete (yyvsp[(2) - (2)].stringValue);
;}
break;
case 98:
#line 1224 "sqlparser.y"
{
//table + alias
(yyval.expr) = new BinaryExpr(
KexiDBExpr_SpecialBinary,
new VariableExpr(*(yyvsp[(1) - (3)].stringValue)), AS,
new VariableExpr(*(yyvsp[(3) - (3)].stringValue))
);
delete (yyvsp[(1) - (3)].stringValue);
delete (yyvsp[(3) - (3)].stringValue);
;}
break;
case 99:
#line 1240 "sqlparser.y"
{
(yyval.exprList) = (yyvsp[(1) - (3)].exprList);
(yyval.exprList)->add( (yyvsp[(3) - (3)].expr) );
KexiDBDbg << "ColViews: ColViews , ColItem" << endl;
;}
break;
case 100:
#line 1246 "sqlparser.y"
{
(yyval.exprList) = new NArgExpr(0,0);
(yyval.exprList)->add( (yyvsp[(1) - (1)].expr) );
KexiDBDbg << "ColViews: ColItem" << endl;
;}
break;
case 101:
#line 1255 "sqlparser.y"
{
// $$ = new Field();
// dummy->addField($$);
// $$->setExpression( $1 );
// parser->select()->addField($$);
(yyval.expr) = (yyvsp[(1) - (1)].expr);
KexiDBDbg << " added column expr: '" << (yyvsp[(1) - (1)].expr)->debugString() << "'" << endl;
;}
break;
case 102:
#line 1264 "sqlparser.y"
{
(yyval.expr) = (yyvsp[(1) - (1)].expr);
KexiDBDbg << " added column wildcard: '" << (yyvsp[(1) - (1)].expr)->debugString() << "'" << endl;
;}
break;
case 103:
#line 1269 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(
KexiDBExpr_SpecialBinary, (yyvsp[(1) - (3)].expr), AS,
new VariableExpr(*(yyvsp[(3) - (3)].stringValue))
);
KexiDBDbg << " added column expr: " << (yyval.expr)->debugString() << endl;
delete (yyvsp[(3) - (3)].stringValue);
;}
break;
case 104:
#line 1278 "sqlparser.y"
{
(yyval.expr) = new BinaryExpr(
KexiDBExpr_SpecialBinary, (yyvsp[(1) - (2)].expr), 0,
new VariableExpr(*(yyvsp[(2) - (2)].stringValue))
);
KexiDBDbg << " added column expr: " << (yyval.expr)->debugString() << endl;
delete (yyvsp[(2) - (2)].stringValue);
;}
break;
case 105:
#line 1290 "sqlparser.y"
{
(yyval.expr) = (yyvsp[(1) - (1)].expr);
;}
break;
case 106:
#line 1334 "sqlparser.y"
{
(yyval.expr) = (yyvsp[(3) - (4)].expr);
//TODO
// $$->setName("DISTINCT(" + $3->name() + ")");
;}
break;
case 107:
#line 1343 "sqlparser.y"
{
(yyval.expr) = new VariableExpr("*");
KexiDBDbg << "all columns" << endl;
// QueryAsterisk *ast = new QueryAsterisk(parser->select(), dummy);
// parser->select()->addAsterisk(ast);
// requiresTable = true;
;}
break;
case 108:
#line 1352 "sqlparser.y"
{
TQString s( *(yyvsp[(1) - (3)].stringValue) );
s += ".*";
(yyval.expr) = new VariableExpr(s);
KexiDBDbg << " + all columns from " << s << endl;
delete (yyvsp[(1) - (3)].stringValue);
;}
break;
/* Line 1267 of yacc.c. */
#line 3256 "sqlparser.tab.c"
default: break;
}
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now `shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
{
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
{
YYSIZE_T yyalloc = 2 * yysize;
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
yyalloc = YYSTACK_ALLOC_MAXIMUM;
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
if (yymsg)
yymsg_alloc = yyalloc;
else
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
}
}
if (0 < yysize && yysize <= yymsg_alloc)
{
(void) yysyntax_error (yymsg, yystate, yychar);
yyerror (yymsg);
}
else
{
yyerror (YY_("syntax error"));
if (yysize != 0)
goto yyexhaustedlab;
}
}
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse look-ahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse look-ahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule which action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (yyn != YYPACT_NINF)
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
if (yyn == YYFINAL)
YYACCEPT;
*++yyvsp = yylval;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#ifndef yyoverflow
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEOF && yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
/* Do not reclaim the symbols of the rule which action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
#line 1367 "sqlparser.y"
const char * const tname(int offset) { return yytname[offset]; }