/*

** 2001 September 15

**

** The author disclaims copyright to this source code. In place of

** a legal notice, here is a blessing:

**

** May you do good and not evil.

** May you find forgiveness for yourself and forgive others.

** May you share freely, never taking more than you give.

**

*************************************************************************

** This file contains SQLite's grammar for SQL. Process this file

** using the lemon parser generator to generate C code that runs

** the parser. Lemon will also generate a header file containing

** numeric codes for all of the tokens.

*/

// All token codes are small integers with #defines that begin with "TK_"

%token_prefix TK_

// The type of the data attached to each token is Token. This is also the

// default type for non-terminals.

//

%token_type {Token}

%default_type {Token}

// An extra argument to the constructor for the parser, which is available

// to all actions.

%extra_context {Parse *pParse}

// This code runs whenever there is a syntax error

//

%syntax_error {

UNUSED_PARAMETER(yymajor); /* Silence some compiler warnings */

if( TOKEN.z[0] ){

sqlite3ErrorMsg(pParse, "near \"%T\": syntax error", &TOKEN);

}else{

sqlite3ErrorMsg(pParse, "incomplete input");

}

}

%stack_overflow {

sqlite3ErrorMsg(pParse, "parser stack overflow");

}

// The name of the generated procedure that implements the parser

// is as follows:

%name sqlite3Parser

// The following text is included near the beginning of the C source

// code file that implements the parser.

//

%include {

#include "sqliteInt.h"

/*

** Disable all error recovery processing in the parser push-down

** automaton.

*/

#define YYNOERRORRECOVERY 1

/*

** Make yytestcase() the same as testcase()

*/

#define yytestcase(X) testcase(X)

/*

** Indicate that sqlite3ParserFree() will never be called with a null

** pointer.

*/

#define YYPARSEFREENEVERNULL 1

/*

** In the amalgamation, the parse.c file generated by lemon and the

** tokenize.c file are concatenated. In that case, sqlite3RunParser()

** has access to the the size of the yyParser object and so the parser

** engine can be allocated from stack. In that case, only the

** sqlite3ParserInit() and sqlite3ParserFinalize() routines are invoked

** and the sqlite3ParserAlloc() and sqlite3ParserFree() routines can be

** omitted.

*/

#ifdef SQLITE_AMALGAMATION

# define sqlite3Parser_ENGINEALWAYSONSTACK 1

#endif

/*

** Alternative datatype for the argument to the malloc() routine passed

** into sqlite3ParserAlloc(). The default is size_t.

*/

#define YYMALLOCARGTYPE u64

/*

** An instance of the following structure describes the event of a

** TRIGGER. "a" is the event type, one of TK_UPDATE, TK_INSERT,

** TK_DELETE, or TK_INSTEAD. If the event is of the form

**

** UPDATE ON (a,b,c)

**

** Then the "b" IdList records the list "a,b,c".

*/

struct TrigEvent { int a; IdList * b; };

struct FrameBound { int eType; Expr *pExpr; };

/*

** Disable lookaside memory allocation for objects that might be

** shared across database connections.

*/

static void disableLookaside(Parse *pParse){

sqlite3 *db = pParse->db;

pParse->disableLookaside++;

DisableLookaside;

}

} // end %include

// Input is a single SQL command

input ::= cmdlist.

cmdlist ::= cmdlist ecmd.

cmdlist ::= ecmd.

ecmd ::= SEMI.

ecmd ::= cmdx SEMI.

%ifndef SQLITE_OMIT_EXPLAIN

ecmd ::= explain cmdx SEMI. {NEVER-REDUCE}

explain ::= EXPLAIN. { pParse->explain = 1; }

explain ::= EXPLAIN QUERY PLAN. { pParse->explain = 2; }

%endif SQLITE_OMIT_EXPLAIN

cmdx ::= cmd. { sqlite3FinishCoding(pParse); }

///////////////////// Begin and end transactions. ////////////////////////////

//

cmd ::= BEGIN transtype(Y) trans_opt. {sqlite3BeginTransaction(pParse, Y);}

trans_opt ::= .

trans_opt ::= TRANSACTION.

trans_opt ::= TRANSACTION nm.

%type transtype {int}

transtype(A) ::= . {A = TK_DEFERRED;}

transtype(A) ::= DEFERRED(X). {A = @X; /*A-overwrites-X*/}

transtype(A) ::= IMMEDIATE(X). {A = @X; /*A-overwrites-X*/}

transtype(A) ::= EXCLUSIVE(X). {A = @X; /*A-overwrites-X*/}

cmd ::= COMMIT|END(X) trans_opt. {sqlite3EndTransaction(pParse,@X);}

cmd ::= ROLLBACK(X) trans_opt. {sqlite3EndTransaction(pParse,@X);}

savepoint_opt ::= SAVEPOINT.

savepoint_opt ::= .

cmd ::= SAVEPOINT nm(X). {

sqlite3Savepoint(pParse, SAVEPOINT_BEGIN, &X);

}

cmd ::= RELEASE savepoint_opt nm(X). {

sqlite3Savepoint(pParse, SAVEPOINT_RELEASE, &X);

}

cmd ::= ROLLBACK trans_opt TO savepoint_opt nm(X). {

sqlite3Savepoint(pParse, SAVEPOINT_ROLLBACK, &X);

}

///////////////////// The CREATE TABLE statement ////////////////////////////

//

cmd ::= create_table create_table_args.

create_table ::= createkw temp(T) TABLE ifnotexists(E) nm(Y) dbnm(Z). {

sqlite3StartTable(pParse,&Y,&Z,T,0,0,E);

}

createkw(A) ::= CREATE(A). {disableLookaside(pParse);}

%type ifnotexists {int}

ifnotexists(A) ::= . {A = 0;}

ifnotexists(A) ::= IF NOT EXISTS. {A = 1;}

%type temp {int}

%ifndef SQLITE_OMIT_TEMPDB

temp(A) ::= TEMP. {A = 1;}

%endif SQLITE_OMIT_TEMPDB

temp(A) ::= . {A = 0;}

create_table_args ::= LP columnlist conslist_opt(X) RP(E) table_options(F). {

sqlite3EndTable(pParse,&X,&E,F,0);

}

create_table_args ::= AS select(S). {

sqlite3EndTable(pParse,0,0,0,S);

sqlite3SelectDelete(pParse->db, S);

}

%type table_options {int}

table_options(A) ::= . {A = 0;}

table_options(A) ::= WITHOUT nm(X). {

if( X.n==5 && sqlite3_strnicmp(X.z,"rowid",5)==0 ){

A = TF_WithoutRowid | TF_NoVisibleRowid;

}else{

A = 0;

sqlite3ErrorMsg(pParse, "unknown table option: %.*s", X.n, X.z);

}

}

columnlist ::= columnlist COMMA columnname carglist.

columnlist ::= columnname carglist.

columnname(A) ::= nm(A) typetoken(Y). {sqlite3AddColumn(pParse,&A,&Y);}

// Declare some tokens early in order to influence their values, to

// improve performance and reduce the executable size. The goal here is

// to get the "jump" operations in ISNULL through ESCAPE to have numeric

// values that are early enough so that all jump operations are clustered

// at the beginning.

//

%token ABORT ACTION AFTER ANALYZE ASC ATTACH BEFORE BEGIN BY CASCADE CAST.

%token CONFLICT DATABASE DEFERRED DESC DETACH EACH END EXCLUSIVE EXPLAIN FAIL.

%token OR AND NOT IS MATCH LIKE_KW BETWEEN IN ISNULL NOTNULL NE EQ.

%token GT LE LT GE ESCAPE.

// The following directive causes tokens ABORT, AFTER, ASC, etc. to

// fallback to ID if they will not parse as their original value.

// This obviates the need for the "id" nonterminal.

//

%fallback ID

ABORT ACTION AFTER ANALYZE ASC ATTACH BEFORE BEGIN BY CASCADE CAST COLUMNKW

CONFLICT DATABASE DEFERRED DESC DETACH DO

EACH END EXCLUSIVE EXPLAIN FAIL FOR

IGNORE IMMEDIATE INITIALLY INSTEAD LIKE_KW MATCH NO PLAN

QUERY KEY OF OFFSET PRAGMA RAISE RECURSIVE RELEASE REPLACE RESTRICT ROW ROWS

ROLLBACK SAVEPOINT TEMP TRIGGER VACUUM VIEW VIRTUAL WITH WITHOUT

NULLS FIRST LAST

%ifdef SQLITE_OMIT_COMPOUND_SELECT

EXCEPT INTERSECT UNION

%endif SQLITE_OMIT_COMPOUND_SELECT

%ifndef SQLITE_OMIT_WINDOWFUNC

CURRENT FOLLOWING PARTITION PRECEDING RANGE UNBOUNDED

EXCLUDE GROUPS OTHERS TIES

%endif SQLITE_OMIT_WINDOWFUNC

%ifndef SQLITE_OMIT_GENERATED_COLUMNS

GENERATED ALWAYS

%endif

REINDEX RENAME CTIME_KW IF

.

%wildcard ANY.

// Define operator precedence early so that this is the first occurrence

// of the operator tokens in the grammer. Keeping the operators together

// causes them to be assigned integer values that are close together,

// which keeps parser tables smaller.

//

// The token values assigned to these symbols is determined by the order

// in which lemon first sees them. It must be the case that ISNULL/NOTNULL,

// NE/EQ, GT/LE, and GE/LT are separated by only a single value. See

// the sqlite3ExprIfFalse() routine for additional information on this

// constraint.

//

%left OR.

%left AND.

%right NOT.

%left IS MATCH LIKE_KW BETWEEN IN ISNULL NOTNULL NE EQ.

%left GT LE LT GE.

%right ESCAPE.

%left BITAND BITOR LSHIFT RSHIFT.

%left PLUS MINUS.

%left STAR SLASH REM.

%left CONCAT.

%left COLLATE.

%right BITNOT.

%nonassoc ON.

// An IDENTIFIER can be a generic identifier, or one of several

// keywords. Any non-standard keyword can also be an identifier.

//

%token_class id ID|INDEXED.

// And "ids" is an identifer-or-string.

//

%token_class ids ID|STRING.

// The name of a column or table can be any of the following:

//

%type nm {Token}

nm(A) ::= id(A).

nm(A) ::= STRING(A).

nm(A) ::= JOIN_KW(A).

// A typetoken is really zero or more tokens that form a type name such

// as can be found after the column name in a CREATE TABLE statement.

// Multiple tokens are concatenated to form the value of the typetoken.

//

%type typetoken {Token}

typetoken(A) ::= . {A.n = 0; A.z = 0;}

typetoken(A) ::= typename(A).

typetoken(A) ::= typename(A) LP signed RP(Y). {

A.n = (int)(&Y.z[Y.n] - A.z);

}

typetoken(A) ::= typename(A) LP signed COMMA signed RP(Y). {

A.n = (int)(&Y.z[Y.n] - A.z);

}

%type typename {Token}

typename(A) ::= ids(A).

typename(A) ::= typename(A) ids(Y). {A.n=Y.n+(int)(Y.z-A.z);}

signed ::= plus_num.

signed ::= minus_num.

// The scanpt non-terminal takes a value which is a pointer to the

// input text just past the last token that has been shifted into

// the parser. By surrounding some phrase in the grammar with two

// scanpt non-terminals, we can capture the input text for that phrase.

// For example:

//

// something ::= .... scanpt(A) phrase scanpt(Z).

//

// The text that is parsed as "phrase" is a string starting at A

// and containing (int)(Z-A) characters. There might be some extra

// whitespace on either end of the text, but that can be removed in

// post-processing, if needed.

//

%type scanpt {const char*}

scanpt(A) ::= . {

assert( yyLookahead!=YYNOCODE );

A = yyLookaheadToken.z;

}

scantok(A) ::= . {

assert( yyLookahead!=YYNOCODE );

A = yyLookaheadToken;

}

// "carglist" is a list of additional constraints that come after the

// column name and column type in a CREATE TABLE statement.

//

carglist ::= carglist ccons.

carglist ::= .

ccons ::= CONSTRAINT nm(X). {pParse->constraintName = X;}

ccons ::= DEFAULT scantok(A) term(X).

{sqlite3AddDefaultValue(pParse,X,A.z,&A.z[A.n]);}

ccons ::= DEFAULT LP(A) expr(X) RP(Z).

{sqlite3AddDefaultValue(pParse,X,A.z+1,Z.z);}

ccons ::= DEFAULT PLUS(A) scantok(Z) term(X).

{sqlite3AddDefaultValue(pParse,X,A.z,&Z.z[Z.n]);}

ccons ::= DEFAULT MINUS(A) scantok(Z) term(X). {

Expr *p = sqlite3PExpr(pParse, TK_UMINUS, X, 0);

sqlite3AddDefaultValue(pParse,p,A.z,&Z.z[Z.n]);

}

ccons ::= DEFAULT scantok id(X). {

Expr *p = tokenExpr(pParse, TK_STRING, X);

if( p ){

sqlite3ExprIdToTrueFalse(p);

testcase( p->op==TK_TRUEFALSE && sqlite3ExprTruthValue(p) );

}

sqlite3AddDefaultValue(pParse,p,X.z,X.z+X.n);

}

// In addition to the type name, we also care about the primary key and

// UNIQUE constraints.

//

ccons ::= NULL onconf.

ccons ::= NOT NULL onconf(R). {sqlite3AddNotNull(pParse, R);}

ccons ::= PRIMARY KEY sortorder(Z) onconf(R) autoinc(I).

{sqlite3AddPrimaryKey(pParse,0,R,I,Z);}

ccons ::= UNIQUE onconf(R). {sqlite3CreateIndex(pParse,0,0,0,0,R,0,0,0,0,

SQLITE_IDXTYPE_UNIQUE);}

ccons ::= CHECK LP expr(X) RP. {sqlite3AddCheckConstraint(pParse,X);}

ccons ::= REFERENCES nm(T) eidlist_opt(TA) refargs(R).

{sqlite3CreateForeignKey(pParse,0,&T,TA,R);}

ccons ::= defer_subclause(D). {sqlite3DeferForeignKey(pParse,D);}

ccons ::= COLLATE ids(C). {sqlite3AddCollateType(pParse, &C);}

ccons ::= GENERATED ALWAYS AS generated.

ccons ::= AS generated.

generated ::= LP expr(E) RP. {sqlite3AddGenerated(pParse,E,0);}

generated ::= LP expr(E) RP ID(TYPE). {sqlite3AddGenerated(pParse,E,&TYPE);}

// The optional AUTOINCREMENT keyword

%type autoinc {int}

autoinc(X) ::= . {X = 0;}

autoinc(X) ::= AUTOINCR. {X = 1;}

// The next group of rules parses the arguments to a REFERENCES clause

// that determine if the referential integrity checking is deferred or

// or immediate and which determine what action to take if a ref-integ

// check fails.

//

%type refargs {int}

refargs(A) ::= . { A = OE_None*0x0101; /* EV: R-19803-45884 */}

refargs(A) ::= refargs(A) refarg(Y). { A = (A & ~Y.mask) | Y.value; }

%type refarg {struct {int value; int mask;}}

refarg(A) ::= MATCH nm. { A.value = 0; A.mask = 0x000000; }

refarg(A) ::= ON INSERT refact. { A.value = 0; A.mask = 0x000000; }

refarg(A) ::= ON DELETE refact(X). { A.value = X; A.mask = 0x0000ff; }

refarg(A) ::= ON UPDATE refact(X). { A.value = X<<8; A.mask = 0x00ff00; }

%type refact {int}

refact(A) ::= SET NULL. { A = OE_SetNull; /* EV: R-33326-45252 */}

refact(A) ::= SET DEFAULT. { A = OE_SetDflt; /* EV: R-33326-45252 */}

refact(A) ::= CASCADE. { A = OE_Cascade; /* EV: R-33326-45252 */}

refact(A) ::= RESTRICT. { A = OE_Restrict; /* EV: R-33326-45252 */}

refact(A) ::= NO ACTION. { A = OE_None; /* EV: R-33326-45252 */}

%type defer_subclause {int}

defer_subclause(A) ::= NOT DEFERRABLE init_deferred_pred_opt. {A = 0;}

defer_subclause(A) ::= DEFERRABLE init_deferred_pred_opt(X). {A = X;}

%type init_deferred_pred_opt {int}

init_deferred_pred_opt(A) ::= . {A = 0;}

init_deferred_pred_opt(A) ::= INITIALLY DEFERRED. {A = 1;}

init_deferred_pred_opt(A) ::= INITIALLY IMMEDIATE. {A = 0;}

conslist_opt(A) ::= . {A.n = 0; A.z = 0;}

conslist_opt(A) ::= COMMA(A) conslist.

conslist ::= conslist tconscomma tcons.

conslist ::= tcons.

tconscomma ::= COMMA. {pParse->constraintName.n = 0;}

tconscomma ::= .

tcons ::= CONSTRAINT nm(X). {pParse->constraintName = X;}

tcons ::= PRIMARY KEY LP sortlist(X) autoinc(I) RP onconf(R).

{sqlite3AddPrimaryKey(pParse,X,R,I,0);}

tcons ::= UNIQUE LP sortlist(X) RP onconf(R).

{sqlite3CreateIndex(pParse,0,0,0,X,R,0,0,0,0,

SQLITE_IDXTYPE_UNIQUE);}

tcons ::= CHECK LP expr(E) RP onconf.

{sqlite3AddCheckConstraint(pParse,E);}

tcons ::= FOREIGN KEY LP eidlist(FA) RP

REFERENCES nm(T) eidlist_opt(TA) refargs(R) defer_subclause_opt(D). {

sqlite3CreateForeignKey(pParse, FA, &T, TA, R);

sqlite3DeferForeignKey(pParse, D);

}

%type defer_subclause_opt {int}

defer_subclause_opt(A) ::= . {A = 0;}

defer_subclause_opt(A) ::= defer_subclause(A).

// The following is a non-standard extension that allows us to declare the

// default behavior when there is a constraint conflict.

//

%type onconf {int}

%type orconf {int}

%type resolvetype {int}

onconf(A) ::= . {A = OE_Default;}

onconf(A) ::= ON CONFLICT resolvetype(X). {A = X;}

orconf(A) ::= . {A = OE_Default;}

orconf(A) ::= OR resolvetype(X). {A = X;}

resolvetype(A) ::= raisetype(A).

resolvetype(A) ::= IGNORE. {A = OE_Ignore;}

resolvetype(A) ::= REPLACE. {A = OE_Replace;}

////////////////////////// The DROP TABLE /////////////////////////////////////

//

cmd ::= DROP TABLE ifexists(E) fullname(X). {

sqlite3DropTable(pParse, X, 0, E);

}

%type ifexists {int}

ifexists(A) ::= IF EXISTS. {A = 1;}

ifexists(A) ::= . {A = 0;}

///////////////////// The CREATE VIEW statement /////////////////////////////

//

%ifndef SQLITE_OMIT_VIEW

cmd ::= createkw(X) temp(T) VIEW ifnotexists(E) nm(Y) dbnm(Z) eidlist_opt(C)

AS select(S). {

sqlite3CreateView(pParse, &X, &Y, &Z, C, S, T, E);

}

cmd ::= DROP VIEW ifexists(E) fullname(X). {

sqlite3DropTable(pParse, X, 1, E);

}

%endif SQLITE_OMIT_VIEW

//////////////////////// The SELECT statement /////////////////////////////////

//

cmd ::= select(X). {

SelectDest dest = {SRT_Output, 0, 0, 0, 0, 0};

sqlite3Select(pParse, X, &dest);

sqlite3SelectDelete(pParse->db, X);

}

%type select {Select*}

%destructor select {sqlite3SelectDelete(pParse->db, $$);}

%type selectnowith {Select*}

%destructor selectnowith {sqlite3SelectDelete(pParse->db, $$);}

%type oneselect {Select*}

%destructor oneselect {sqlite3SelectDelete(pParse->db, $$);}

%include {

/*

** For a compound SELECT statement, make sure p->pPrior->pNext==p for

** all elements in the list. And make sure list length does not exceed

** SQLITE_LIMIT_COMPOUND_SELECT.

*/

static void parserDoubleLinkSelect(Parse *pParse, Select *p){

assert( p!=0 );

if( p->pPrior ){

Select *pNext = 0, *pLoop;

int mxSelect, cnt = 0;

for(pLoop=p; pLoop; pNext=pLoop, pLoop=pLoop->pPrior, cnt++){

pLoop->pNext = pNext;

pLoop->selFlags |= SF_Compound;

}

if( (p->selFlags & SF_MultiValue)==0 &&

(mxSelect = pParse->db->aLimit[SQLITE_LIMIT_COMPOUND_SELECT])>0 &&

cnt>mxSelect

){

sqlite3ErrorMsg(pParse, "too many terms in compound SELECT");

}

}

}

}

%ifndef SQLITE_OMIT_CTE

select(A) ::= WITH wqlist(W) selectnowith(X). {

Select *p = X;

if( p ){

p->pWith = W;

parserDoubleLinkSelect(pParse, p);

}else{

sqlite3WithDelete(pParse->db, W);

}

A = p;

}

select(A) ::= WITH RECURSIVE wqlist(W) selectnowith(X). {

Select *p = X;

if( p ){

p->pWith = W;

parserDoubleLinkSelect(pParse, p);

}else{

sqlite3WithDelete(pParse->db, W);

}

A = p;

}

%endif /* SQLITE_OMIT_CTE */

select(A) ::= selectnowith(X). {

Select *p = X;

if( p ){

parserDoubleLinkSelect(pParse, p);

}

A = p; /*A-overwrites-X*/

}

selectnowith(A) ::= oneselect(A).

%ifndef SQLITE_OMIT_COMPOUND_SELECT

selectnowith(A) ::= selectnowith(A) multiselect_op(Y) oneselect(Z). {

Select *pRhs = Z;

Select *pLhs = A;

if( pRhs && pRhs->pPrior ){

SrcList *pFrom;

Token x;

x.n = 0;

parserDoubleLinkSelect(pParse, pRhs);

pFrom = sqlite3SrcListAppendFromTerm(pParse,0,0,0,&x,pRhs,0,0);

pRhs = sqlite3SelectNew(pParse,0,pFrom,0,0,0,0,0,0);

}

if( pRhs ){

pRhs->op = (u8)Y;

pRhs->pPrior = pLhs;

if( ALWAYS(pLhs) ) pLhs->selFlags &= ~SF_MultiValue;

pRhs->selFlags &= ~SF_MultiValue;

if( Y!=TK_ALL ) pParse->hasCompound = 1;

}else{

sqlite3SelectDelete(pParse->db, pLhs);

}

A = pRhs;

}

%type multiselect_op {int}

multiselect_op(A) ::= UNION(OP). {A = @OP; /*A-overwrites-OP*/}

multiselect_op(A) ::= UNION ALL. {A = TK_ALL;}

multiselect_op(A) ::= EXCEPT|INTERSECT(OP). {A = @OP; /*A-overwrites-OP*/}

%endif SQLITE_OMIT_COMPOUND_SELECT

oneselect(A) ::= SELECT distinct(D) selcollist(W) from(X) where_opt(Y)

groupby_opt(P) having_opt(Q)

orderby_opt(Z) limit_opt(L). {

A = sqlite3SelectNew(pParse,W,X,Y,P,Q,Z,D,L);

}

%ifndef SQLITE_OMIT_WINDOWFUNC

oneselect(A) ::= SELECT distinct(D) selcollist(W) from(X) where_opt(Y)

groupby_opt(P) having_opt(Q) window_clause(R)

orderby_opt(Z) limit_opt(L). {

A = sqlite3SelectNew(pParse,W,X,Y,P,Q,Z,D,L);

if( A ){

A->pWinDefn = R;

}else{

sqlite3WindowListDelete(pParse->db, R);

}

}

%endif

oneselect(A) ::= values(A).

%type values {Select*}

%destructor values {sqlite3SelectDelete(pParse->db, $$);}

values(A) ::= VALUES LP nexprlist(X) RP. {

A = sqlite3SelectNew(pParse,X,0,0,0,0,0,SF_Values,0);

}

values(A) ::= values(A) COMMA LP nexprlist(Y) RP. {

Select *pRight, *pLeft = A;

pRight = sqlite3SelectNew(pParse,Y,0,0,0,0,0,SF_Values|SF_MultiValue,0);

if( ALWAYS(pLeft) ) pLeft->selFlags &= ~SF_MultiValue;

if( pRight ){

pRight->op = TK_ALL;

pRight->pPrior = pLeft;

A = pRight;

}else{

A = pLeft;

}

}

// The "distinct" nonterminal is true (1) if the DISTINCT keyword is

// present and false (0) if it is not.

//

%type distinct {int}

distinct(A) ::= DISTINCT. {A = SF_Distinct;}

distinct(A) ::= ALL. {A = SF_All;}

distinct(A) ::= . {A = 0;}

// selcollist is a list of expressions that are to become the return

// values of the SELECT statement. The "*" in statements like

// "SELECT * FROM ..." is encoded as a special expression with an

// opcode of TK_ASTERISK.

//

%type selcollist {ExprList*}

%destructor selcollist {sqlite3ExprListDelete(pParse->db, $$);}

%type sclp {ExprList*}

%destructor sclp {sqlite3ExprListDelete(pParse->db, $$);}

sclp(A) ::= selcollist(A) COMMA.

sclp(A) ::= . {A = 0;}

selcollist(A) ::= sclp(A) scanpt(B) expr(X) scanpt(Z) as(Y). {

A = sqlite3ExprListAppend(pParse, A, X);

if( Y.n>0 ) sqlite3ExprListSetName(pParse, A, &Y, 1);

sqlite3ExprListSetSpan(pParse,A,B,Z);

}

selcollist(A) ::= sclp(A) scanpt STAR. {

Expr *p = sqlite3Expr(pParse->db, TK_ASTERISK, 0);

A = sqlite3ExprListAppend(pParse, A, p);

}

selcollist(A) ::= sclp(A) scanpt nm(X) DOT STAR. {

Expr *pRight = sqlite3PExpr(pParse, TK_ASTERISK, 0, 0);

Expr *pLeft = sqlite3ExprAlloc(pParse->db, TK_ID, &X, 1);

Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight);

A = sqlite3ExprListAppend(pParse,A, pDot);

}

// An option "AS <id>" phrase that can follow one of the expressions that

// define the result set, or one of the tables in the FROM clause.

//

%type as {Token}

as(X) ::= AS nm(Y). {X = Y;}

as(X) ::= ids(X).

as(X) ::= . {X.n = 0; X.z = 0;}

%type seltablist {SrcList*}

%destructor seltablist {sqlite3SrcListDelete(pParse->db, $$);}

%type stl_prefix {SrcList*}

%destructor stl_prefix {sqlite3SrcListDelete(pParse->db, $$);}

%type from {SrcList*}

%destructor from {sqlite3SrcListDelete(pParse->db, $$);}

// A complete FROM clause.

//

from(A) ::= . {A = sqlite3DbMallocZero(pParse->db, sizeof(*A));}

from(A) ::= FROM seltablist(X). {

A = X;

sqlite3SrcListShiftJoinType(A);

}

// "seltablist" is a "Select Table List" - the content of the FROM clause

// in a SELECT statement. "stl_prefix" is a prefix of this list.

//

stl_prefix(A) ::= seltablist(A) joinop(Y). {

if( ALWAYS(A && A->nSrc>0) ) A->a[A->nSrc-1].fg.jointype = (u8)Y;

}

stl_prefix(A) ::= . {A = 0;}

seltablist(A) ::= stl_prefix(A) nm(Y) dbnm(D) as(Z) indexed_opt(I)

on_opt(N) using_opt(U). {

A = sqlite3SrcListAppendFromTerm(pParse,A,&Y,&D,&Z,0,N,U);

sqlite3SrcListIndexedBy(pParse, A, &I);

}

seltablist(A) ::= stl_prefix(A) nm(Y) dbnm(D) LP exprlist(E) RP as(Z)

on_opt(N) using_opt(U). {

A = sqlite3SrcListAppendFromTerm(pParse,A,&Y,&D,&Z,0,N,U);

sqlite3SrcListFuncArgs(pParse, A, E);

}

%ifndef SQLITE_OMIT_SUBQUERY

seltablist(A) ::= stl_prefix(A) LP select(S) RP

as(Z) on_opt(N) using_opt(U). {

A = sqlite3SrcListAppendFromTerm(pParse,A,0,0,&Z,S,N,U);

}

seltablist(A) ::= stl_prefix(A) LP seltablist(F) RP

as(Z) on_opt(N) using_opt(U). {

if( A==0 && Z.n==0 && N==0 && U==0 ){

A = F;

}else if( F->nSrc==1 ){

A = sqlite3SrcListAppendFromTerm(pParse,A,0,0,&Z,0,N,U);

if( A ){

struct SrcList_item *pNew = &A->a[A->nSrc-1];

struct SrcList_item *pOld = F->a;

pNew->zName = pOld->zName;

pNew->zDatabase = pOld->zDatabase;

pNew->pSelect = pOld->pSelect;

if( pOld->fg.isTabFunc ){

pNew->u1.pFuncArg = pOld->u1.pFuncArg;

pOld->u1.pFuncArg = 0;

pOld->fg.isTabFunc = 0;

pNew->fg.isTabFunc = 1;

}

pOld->zName = pOld->zDatabase = 0;

pOld->pSelect = 0;

}

sqlite3SrcListDelete(pParse->db, F);

}else{

Select *pSubquery;

sqlite3SrcListShiftJoinType(F);

pSubquery = sqlite3SelectNew(pParse,0,F,0,0,0,0,SF_NestedFrom,0);

A = sqlite3SrcListAppendFromTerm(pParse,A,0,0,&Z,pSubquery,N,U);

}

}

%endif SQLITE_OMIT_SUBQUERY

%type dbnm {Token}

dbnm(A) ::= . {A.z=0; A.n=0;}

dbnm(A) ::= DOT nm(X). {A = X;}

%type fullname {SrcList*}

%destructor fullname {sqlite3SrcListDelete(pParse->db, $$);}

fullname(A) ::= nm(X). {

A = sqlite3SrcListAppend(pParse,0,&X,0);

if( IN_RENAME_OBJECT && A ) sqlite3RenameTokenMap(pParse, A->a[0].zName, &X);

}

fullname(A) ::= nm(X) DOT nm(Y). {

A = sqlite3SrcListAppend(pParse,0,&X,&Y);

if( IN_RENAME_OBJECT && A ) sqlite3RenameTokenMap(pParse, A->a[0].zName, &Y);

}

%type xfullname {SrcList*}

%destructor xfullname {sqlite3SrcListDelete(pParse->db, $$);}

xfullname(A) ::= nm(X).

{A = sqlite3SrcListAppend(pParse,0,&X,0); /*A-overwrites-X*/}

xfullname(A) ::= nm(X) DOT nm(Y).

{A = sqlite3SrcListAppend(pParse,0,&X,&Y); /*A-overwrites-X*/}

xfullname(A) ::= nm(X) DOT nm(Y) AS nm(Z). {

A = sqlite3SrcListAppend(pParse,0,&X,&Y); /*A-overwrites-X*/

if( A ) A->a[0].zAlias = sqlite3NameFromToken(pParse->db, &Z);

}

xfullname(A) ::= nm(X) AS nm(Z). {

A = sqlite3SrcListAppend(pParse,0,&X,0); /*A-overwrites-X*/

if( A ) A->a[0].zAlias = sqlite3NameFromToken(pParse->db, &Z);

}

%type joinop {int}

joinop(X) ::= COMMA|JOIN. { X = JT_INNER; }

joinop(X) ::= JOIN_KW(A) JOIN.

{X = sqlite3JoinType(pParse,&A,0,0); /*X-overwrites-A*/}

joinop(X) ::= JOIN_KW(A) nm(B) JOIN.

{X = sqlite3JoinType(pParse,&A,&B,0); /*X-overwrites-A*/}

joinop(X) ::= JOIN_KW(A) nm(B) nm(C) JOIN.

{X = sqlite3JoinType(pParse,&A,&B,&C);/*X-overwrites-A*/}

// There is a parsing abiguity in an upsert statement that uses a

// SELECT on the RHS of a the INSERT:

//

// INSERT INTO tab SELECT * FROM aaa JOIN bbb ON CONFLICT ...

// here ----^^

//

// When the ON token is encountered, the parser does not know if it is

// the beginning of an ON CONFLICT clause, or the beginning of an ON

// clause associated with the JOIN. The conflict is resolved in favor

// of the JOIN. If an ON CONFLICT clause is intended, insert a dummy

// WHERE clause in between, like this:

//

// INSERT INTO tab SELECT * FROM aaa JOIN bbb WHERE true ON CONFLICT ...

//

// The [AND] and [OR] precedence marks in the rules for on_opt cause the

// ON in this context to always be interpreted as belonging to the JOIN.

//

%type on_opt {Expr*}

%destructor on_opt {sqlite3ExprDelete(pParse->db, $$);}

on_opt(N) ::= ON expr(E). {N = E;}

on_opt(N) ::= . [OR] {N = 0;}

// Note that this block abuses the Token type just a little. If there is

// no "INDEXED BY" clause, the returned token is empty (z==0 && n==0). If

// there is an INDEXED BY clause, then the token is populated as per normal,

// with z pointing to the token data and n containing the number of bytes

// in the token.

//

// If there is a "NOT INDEXED" clause, then (z==0 && n==1), which is

// normally illegal. The sqlite3SrcListIndexedBy() function

// recognizes and interprets this as a special case.

//

%type indexed_opt {Token}

indexed_opt(A) ::= . {A.z=0; A.n=0;}

indexed_opt(A) ::= INDEXED BY nm(X). {A = X;}

indexed_opt(A) ::= NOT INDEXED. {A.z=0; A.n=1;}

%type using_opt {IdList*}

%destructor using_opt {sqlite3IdListDelete(pParse->db, $$);}

using_opt(U) ::= USING LP idlist(L) RP. {U = L;}

using_opt(U) ::= . {U = 0;}

%type orderby_opt {ExprList*}

%destructor orderby_opt {sqlite3ExprListDelete(pParse->db, $$);}

// the sortlist non-terminal stores a list of expression where each

// expression is optionally followed by ASC or DESC to indicate the

// sort order.

//

%type sortlist {ExprList*}

%destructor sortlist {sqlite3ExprListDelete(pParse->db, $$);}

orderby_opt(A) ::= . {A = 0;}

orderby_opt(A) ::= ORDER BY sortlist(X). {A = X;}

sortlist(A) ::= sortlist(A) COMMA expr(Y) sortorder(Z) nulls(X). {

A = sqlite3ExprListAppend(pParse,A,Y);

sqlite3ExprListSetSortOrder(A,Z,X);

}

sortlist(A) ::= expr(Y) sortorder(Z) nulls(X). {

A = sqlite3ExprListAppend(pParse,0,Y); /*A-overwrites-Y*/

sqlite3ExprListSetSortOrder(A,Z,X);

}

%type sortorder {int}

sortorder(A) ::= ASC. {A = SQLITE_SO_ASC;}

sortorder(A) ::= DESC. {A = SQLITE_SO_DESC;}

sortorder(A) ::= . {A = SQLITE_SO_UNDEFINED;}

%type nulls {int}

nulls(A) ::= NULLS FIRST. {A = SQLITE_SO_ASC;}

nulls(A) ::= NULLS LAST. {A = SQLITE_SO_DESC;}

nulls(A) ::= . {A = SQLITE_SO_UNDEFINED;}

%type groupby_opt {ExprList*}

%destructor groupby_opt {sqlite3ExprListDelete(pParse->db, $$);}

groupby_opt(A) ::= . {A = 0;}

groupby_opt(A) ::= GROUP BY nexprlist(X). {A = X;}

%type having_opt {Expr*}

%destructor having_opt {sqlite3ExprDelete(pParse->db, $$);}

having_opt(A) ::= . {A = 0;}

having_opt(A) ::= HAVING expr(X). {A = X;}

%type limit_opt {Expr*}

// The destructor for limit_opt will never fire in the current grammar.

// The limit_opt non-terminal only occurs at the end of a single production

// rule for SELECT statements. As soon as the rule that create the

// limit_opt non-terminal reduces, the SELECT statement rule will also

// reduce. So there is never a limit_opt non-terminal on the stack

// except as a transient. So there is never anything to destroy.

//

//%destructor limit_opt {sqlite3ExprDelete(pParse->db, $$);}

limit_opt(A) ::= . {A = 0;}

limit_opt(A) ::= LIMIT expr(X).

{A = sqlite3PExpr(pParse,TK_LIMIT,X,0);}

limit_opt(A) ::= LIMIT expr(X) OFFSET expr(Y).

{A = sqlite3PExpr(pParse,TK_LIMIT,X,Y);}

limit_opt(A) ::= LIMIT expr(X) COMMA expr(Y).

{A = sqlite3PExpr(pParse,TK_LIMIT,Y,X);}

/////////////////////////// The DELETE statement /////////////////////////////

//

%ifdef SQLITE_ENABLE_UPDATE_DELETE_LIMIT

cmd ::= with DELETE FROM xfullname(X) indexed_opt(I) where_opt(W)

orderby_opt(O) limit_opt(L). {

sqlite3SrcListIndexedBy(pParse, X, &I);

#ifndef SQLITE_ENABLE_UPDATE_DELETE_LIMIT

sqlite3ExprListDelete(pParse->db, O); O = 0;

sqlite3ExprDelete(pParse->db, L); L = 0;

#endif

sqlite3DeleteFrom(pParse,X,W,O,L);

}

%endif

%ifndef SQLITE_ENABLE_UPDATE_DELETE_LIMIT

cmd ::= with DELETE FROM xfullname(X) indexed_opt(I) where_opt(W). {

sqlite3SrcListIndexedBy(pParse, X, &I);

sqlite3DeleteFrom(pParse,X,W,0,0);

}

%endif

%type where_opt {Expr*}

%destructor where_opt {sqlite3ExprDelete(pParse->db, $$);}

where_opt(A) ::= . {A = 0;}

where_opt(A) ::= WHERE expr(X). {A = X;}

////////////////////////// The UPDATE command ////////////////////////////////

//

%ifdef SQLITE_ENABLE_UPDATE_DELETE_LIMIT

cmd ::= with UPDATE orconf(R) xfullname(X) indexed_opt(I) SET setlist(Y)

where_opt(W) orderby_opt(O) limit_opt(L). {

sqlite3SrcListIndexedBy(pParse, X, &I);

sqlite3ExprListCheckLength(pParse,Y,"set list");

sqlite3Update(pParse,X,Y,W,R,O,L,0);

}

%endif

%ifndef SQLITE_ENABLE_UPDATE_DELETE_LIMIT

cmd ::= with UPDATE orconf(R) xfullname(X) indexed_opt(I) SET setlist(Y)

where_opt(W). {

sqlite3SrcListIndexedBy(pParse, X, &I);

sqlite3ExprListCheckLength(pParse,Y,"set list");

sqlite3Update(pParse,X,Y,W,R,0,0,0);

}

%endif

%type setlist {ExprList*}

%destructor setlist {sqlite3ExprListDelete(pParse->db, $$);}

setlist(A) ::= setlist(A) COMMA nm(X) EQ expr(Y). {

A = sqlite3ExprListAppend(pParse, A, Y);

sqlite3ExprListSetName(pParse, A, &X, 1);

}

setlist(A) ::= setlist(A) COMMA LP idlist(X) RP EQ expr(Y). {

A = sqlite3ExprListAppendVector(pParse, A, X, Y);

}

setlist(A) ::= nm(X) EQ expr(Y). {

A = sqlite3ExprListAppend(pParse, 0, Y);

sqlite3ExprListSetName(pParse, A, &X, 1);

}

setlist(A) ::= LP idlist(X) RP EQ expr(Y). {

A = sqlite3ExprListAppendVector(pParse, 0, X, Y);

}

////////////////////////// The INSERT command /////////////////////////////////

//

cmd ::= with insert_cmd(R) INTO xfullname(X) idlist_opt(F) select(S)

upsert(U). {

sqlite3Insert(pParse, X, S, F, R, U);

}

cmd ::= with insert_cmd(R) INTO xfullname(X) idlist_opt(F) DEFAULT VALUES.

{

sqlite3Insert(pParse, X, 0, F, R, 0);

}

%type upsert {Upsert*}

// Because upsert only occurs at the tip end of the INSERT rule for cmd,

// there is never a case where the value of the upsert pointer will not

// be destroyed by the cmd action. So comment-out the destructor to

// avoid unreachable code.

//%destructor upsert {sqlite3UpsertDelete(pParse->db,$$);}

upsert(A) ::= . { A = 0; }

upsert(A) ::= ON CONFLICT LP sortlist(T) RP where_opt(TW)

DO UPDATE SET setlist(Z) where_opt(W).

{ A = sqlite3UpsertNew(pParse->db,T,TW,Z,W);}

upsert(A) ::= ON CONFLICT LP sortlist(T) RP where_opt(TW) DO NOTHING.

{ A = sqlite3UpsertNew(pParse->db,T,TW,0,0); }

upsert(A) ::= ON CONFLICT DO NOTHING.

{ A = sqlite3UpsertNew(pParse->db,0,0,0,0); }

%type insert_cmd {int}

insert_cmd(A) ::= INSERT orconf(R). {A = R;}

insert_cmd(A) ::= REPLACE. {A = OE_Replace;}

%type idlist_opt {IdList*}

%destructor idlist_opt {sqlite3IdListDelete(pParse->db, $$);}

%type idlist {IdList*}

%destructor idlist {sqlite3IdListDelete(pParse->db, $$);}

idlist_opt(A) ::= . {A = 0;}

idlist_opt(A) ::= LP idlist(X) RP. {A = X;}

idlist(A) ::= idlist(A) COMMA nm(Y).

{A = sqlite3IdListAppend(pParse,A,&Y);}

idlist(A) ::= nm(Y).

{A = sqlite3IdListAppend(pParse,0,&Y); /*A-overwrites-Y*/}

/////////////////////////// Expression Processing /////////////////////////////

//

%type expr {Expr*}

%destructor expr {sqlite3ExprDelete(pParse->db, $$);}

%type term {Expr*}

%destructor term {sqlite3ExprDelete(pParse->db, $$);}

%include {

/* Construct a new Expr object from a single identifier. Use the

** new Expr to populate pOut. Set the span of pOut to be the identifier

** that created the expression.

*/

static Expr *tokenExpr(Parse *pParse, int op, Token t){

Expr *p = sqlite3DbMallocRawNN(pParse->db, sizeof(Expr)+t.n+1);

if( p ){

/* memset(p, 0, sizeof(Expr)); */

p->op = (u8)op;

p->affExpr = 0;

p->flags = EP_Leaf;

p->iAgg = -1;

p->pLeft = p->pRight = 0;

p->x.pList = 0;

p->pAggInfo = 0;

p->y.pTab = 0;

p->op2 = 0;

p->iTable = 0;

p->iColumn = 0;

p->u.zToken = (char*)&p[1];

memcpy(p->u.zToken, t.z, t.n);

p->u.zToken[t.n] = 0;

if( sqlite3Isquote(p->u.zToken[0]) ){

sqlite3DequoteExpr(p);

}

#if SQLITE_MAX_EXPR_DEPTH>0

p->nHeight = 1;

#endif

if( IN_RENAME_OBJECT ){

return (Expr*)sqlite3RenameTokenMap(pParse, (void*)p, &t);

}

}

return p;

}

}

expr(A) ::= term(A).

expr(A) ::= LP expr(X) RP. {A = X;}

expr(A) ::= id(X). {A=tokenExpr(pParse,TK_ID,X); /*A-overwrites-X*/}

expr(A) ::= JOIN_KW(X). {A=tokenExpr(pParse,TK_ID,X); /*A-overwrites-X*/}

expr(A) ::= nm(X) DOT nm(Y). {

Expr *temp1 = sqlite3ExprAlloc(pParse->db, TK_ID, &X, 1);

Expr *temp2 = sqlite3ExprAlloc(pParse->db, TK_ID, &Y, 1);