Index: third_party/sqlite/src/tool/lempar.c |
diff --git a/third_party/sqlite/src/tool/lempar.c b/third_party/sqlite/src/tool/lempar.c |
index fe56d2dc1661eb9c2468ab9b0c763238e79f6252..312507e5f13d040afff652285c08ac469ae0c5c0 100644 |
--- a/third_party/sqlite/src/tool/lempar.c |
+++ b/third_party/sqlite/src/tool/lempar.c |
@@ -1,64 +1,91 @@ |
-/* Driver template for the LEMON parser generator. |
-** The author disclaims copyright to this source code. |
+/* |
+** 2000-05-29 |
+** |
+** 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. |
+** |
+************************************************************************* |
+** Driver template for the LEMON parser generator. |
+** |
+** The "lemon" program processes an LALR(1) input grammar file, then uses |
+** this template to construct a parser. The "lemon" program inserts text |
+** at each "%%" line. Also, any "P-a-r-s-e" identifer prefix (without the |
+** interstitial "-" characters) contained in this template is changed into |
+** the value of the %name directive from the grammar. Otherwise, the content |
+** of this template is copied straight through into the generate parser |
+** source file. |
+** |
+** The following is the concatenation of all %include directives from the |
+** input grammar file: |
*/ |
-/* First off, code is included that follows the "include" declaration |
-** in the input grammar file. */ |
#include <stdio.h> |
+/************ Begin %include sections from the grammar ************************/ |
%% |
-/* Next is all token values, in a form suitable for use by makeheaders. |
-** This section will be null unless lemon is run with the -m switch. |
-*/ |
-/* |
-** These constants (all generated automatically by the parser generator) |
-** specify the various kinds of tokens (terminals) that the parser |
-** understands. |
-** |
-** Each symbol here is a terminal symbol in the grammar. |
-*/ |
+/**************** End of %include directives **********************************/ |
+/* These constants specify the various numeric values for terminal symbols |
+** in a format understandable to "makeheaders". This section is blank unless |
+** "lemon" is run with the "-m" command-line option. |
+***************** Begin makeheaders token definitions *************************/ |
%% |
-/* Make sure the INTERFACE macro is defined. |
-*/ |
-#ifndef INTERFACE |
-# define INTERFACE 1 |
-#endif |
-/* The next thing included is series of defines which control |
+/**************** End makeheaders token definitions ***************************/ |
+ |
+/* The next sections is a series of control #defines. |
** various aspects of the generated parser. |
-** YYCODETYPE is the data type used for storing terminal |
-** and nonterminal numbers. "unsigned char" is |
-** used if there are fewer than 250 terminals |
-** and nonterminals. "int" is used otherwise. |
-** YYNOCODE is a number of type YYCODETYPE which corresponds |
-** to no legal terminal or nonterminal number. This |
-** number is used to fill in empty slots of the hash |
-** table. |
+** YYCODETYPE is the data type used to store the integer codes |
+** that represent terminal and non-terminal symbols. |
+** "unsigned char" is used if there are fewer than |
+** 256 symbols. Larger types otherwise. |
+** YYNOCODE is a number of type YYCODETYPE that is not used for |
+** any terminal or nonterminal symbol. |
** YYFALLBACK If defined, this indicates that one or more tokens |
-** have fall-back values which should be used if the |
-** original value of the token will not parse. |
-** YYACTIONTYPE is the data type used for storing terminal |
-** and nonterminal numbers. "unsigned char" is |
-** used if there are fewer than 250 rules and |
-** states combined. "int" is used otherwise. |
-** ParseTOKENTYPE is the data type used for minor tokens given |
-** directly to the parser from the tokenizer. |
-** YYMINORTYPE is the data type used for all minor tokens. |
+** (also known as: "terminal symbols") have fall-back |
+** values which should be used if the original symbol |
+** would not parse. This permits keywords to sometimes |
+** be used as identifiers, for example. |
+** YYACTIONTYPE is the data type used for "action codes" - numbers |
+** that indicate what to do in response to the next |
+** token. |
+** ParseTOKENTYPE is the data type used for minor type for terminal |
+** symbols. Background: A "minor type" is a semantic |
+** value associated with a terminal or non-terminal |
+** symbols. For example, for an "ID" terminal symbol, |
+** the minor type might be the name of the identifier. |
+** Each non-terminal can have a different minor type. |
+** Terminal symbols all have the same minor type, though. |
+** This macros defines the minor type for terminal |
+** symbols. |
+** YYMINORTYPE is the data type used for all minor types. |
** This is typically a union of many types, one of |
** which is ParseTOKENTYPE. The entry in the union |
-** for base tokens is called "yy0". |
+** for terminal symbols is called "yy0". |
** YYSTACKDEPTH is the maximum depth of the parser's stack. If |
** zero the stack is dynamically sized using realloc() |
** ParseARG_SDECL A static variable declaration for the %extra_argument |
** ParseARG_PDECL A parameter declaration for the %extra_argument |
** ParseARG_STORE Code to store %extra_argument into yypParser |
** ParseARG_FETCH Code to extract %extra_argument from yypParser |
-** YYNSTATE the combined number of states. |
-** YYNRULE the number of rules in the grammar |
** YYERRORSYMBOL is the code number of the error symbol. If not |
** defined, then do no error processing. |
+** YYNSTATE the combined number of states. |
+** YYNRULE the number of rules in the grammar |
+** YY_MAX_SHIFT Maximum value for shift actions |
+** YY_MIN_SHIFTREDUCE Minimum value for shift-reduce actions |
+** YY_MAX_SHIFTREDUCE Maximum value for shift-reduce actions |
+** YY_MIN_REDUCE Maximum value for reduce actions |
+** YY_ERROR_ACTION The yy_action[] code for syntax error |
+** YY_ACCEPT_ACTION The yy_action[] code for accept |
+** YY_NO_ACTION The yy_action[] code for no-op |
*/ |
+#ifndef INTERFACE |
+# define INTERFACE 1 |
+#endif |
+/************* Begin control #defines *****************************************/ |
%% |
-#define YY_NO_ACTION (YYNSTATE+YYNRULE+2) |
-#define YY_ACCEPT_ACTION (YYNSTATE+YYNRULE+1) |
-#define YY_ERROR_ACTION (YYNSTATE+YYNRULE) |
+/************* End control #defines *******************************************/ |
/* The yyzerominor constant is used to initialize instances of |
** YYMINORTYPE objects to zero. */ |
@@ -85,16 +112,20 @@ static const YYMINORTYPE yyzerominor = { 0 }; |
** Suppose the action integer is N. Then the action is determined as |
** follows |
** |
-** 0 <= N < YYNSTATE Shift N. That is, push the lookahead |
+** 0 <= N <= YY_MAX_SHIFT Shift N. That is, push the lookahead |
** token onto the stack and goto state N. |
** |
-** YYNSTATE <= N < YYNSTATE+YYNRULE Reduce by rule N-YYNSTATE. |
+** N between YY_MIN_SHIFTREDUCE Shift to an arbitrary state then |
+** and YY_MAX_SHIFTREDUCE reduce by rule N-YY_MIN_SHIFTREDUCE. |
** |
-** N == YYNSTATE+YYNRULE A syntax error has occurred. |
+** N between YY_MIN_REDUCE Reduce by rule N-YY_MIN_REDUCE |
+** and YY_MAX_REDUCE |
+ |
+** N == YY_ERROR_ACTION A syntax error has occurred. |
** |
-** N == YYNSTATE+YYNRULE+1 The parser accepts its input. |
+** N == YY_ACCEPT_ACTION The parser accepts its input. |
** |
-** N == YYNSTATE+YYNRULE+2 No such action. Denotes unused |
+** N == YY_NO_ACTION No such action. Denotes unused |
** slots in the yy_action[] table. |
** |
** The action table is constructed as a single large table named yy_action[]. |
@@ -123,11 +154,13 @@ static const YYMINORTYPE yyzerominor = { 0 }; |
** yy_reduce_ofst[] For each state, the offset into yy_action for |
** shifting non-terminals after a reduce. |
** yy_default[] Default action for each state. |
-*/ |
+** |
+*********** Begin parsing tables **********************************************/ |
%% |
+/********** End of lemon-generated parsing tables *****************************/ |
-/* The next table maps tokens into fallback tokens. If a construct |
-** like the following: |
+/* The next table maps tokens (terminal symbols) into fallback tokens. |
+** If a construct like the following: |
** |
** %fallback ID X Y Z. |
** |
@@ -135,6 +168,10 @@ static const YYMINORTYPE yyzerominor = { 0 }; |
** and Z. Whenever one of the tokens X, Y, or Z is input to the parser |
** but it does not parse, the type of the token is changed to ID and |
** the parse is retried before an error is thrown. |
+** |
+** This feature can be used, for example, to cause some keywords in a language |
+** to revert to identifiers if they keyword does not apply in the context where |
+** it appears. |
*/ |
#ifdef YYFALLBACK |
static const YYCODETYPE yyFallback[] = { |
@@ -153,9 +190,13 @@ static const YYCODETYPE yyFallback[] = { |
** + The semantic value stored at this level of the stack. This is |
** the information used by the action routines in the grammar. |
** It is sometimes called the "minor" token. |
+** |
+** After the "shift" half of a SHIFTREDUCE action, the stateno field |
+** actually contains the reduce action for the second half of the |
+** SHIFTREDUCE. |
*/ |
struct yyStackEntry { |
- YYACTIONTYPE stateno; /* The state-number */ |
+ YYACTIONTYPE stateno; /* The state-number, or reduce action in SHIFTREDUCE */ |
YYCODETYPE major; /* The major token value. This is the code |
** number for the token at this stack level */ |
YYMINORTYPE minor; /* The user-supplied minor token value. This |
@@ -253,6 +294,15 @@ static void yyGrowStack(yyParser *p){ |
} |
#endif |
+/* Datatype of the argument to the memory allocated passed as the |
+** second argument to ParseAlloc() below. This can be changed by |
+** putting an appropriate #define in the %include section of the input |
+** grammar. |
+*/ |
+#ifndef YYMALLOCARGTYPE |
+# define YYMALLOCARGTYPE size_t |
+#endif |
+ |
/* |
** This function allocates a new parser. |
** The only argument is a pointer to a function which works like |
@@ -265,9 +315,9 @@ static void yyGrowStack(yyParser *p){ |
** A pointer to a parser. This pointer is used in subsequent calls |
** to Parse and ParseFree. |
*/ |
-void *ParseAlloc(void *(*mallocProc)(size_t)){ |
+void *ParseAlloc(void *(*mallocProc)(YYMALLOCARGTYPE)){ |
yyParser *pParser; |
- pParser = (yyParser*)(*mallocProc)( (size_t)sizeof(yyParser) ); |
+ pParser = (yyParser*)(*mallocProc)( (YYMALLOCARGTYPE)sizeof(yyParser) ); |
if( pParser ){ |
pParser->yyidx = -1; |
#ifdef YYTRACKMAXSTACKDEPTH |
@@ -282,10 +332,12 @@ void *ParseAlloc(void *(*mallocProc)(size_t)){ |
return pParser; |
} |
-/* The following function deletes the value associated with a |
-** symbol. The symbol can be either a terminal or nonterminal. |
-** "yymajor" is the symbol code, and "yypminor" is a pointer to |
-** the value. |
+/* The following function deletes the "minor type" or semantic value |
+** associated with a symbol. The symbol can be either a terminal |
+** or nonterminal. "yymajor" is the symbol code, and "yypminor" is |
+** a pointer to the value to be deleted. The code used to do the |
+** deletions is derived from the %destructor and/or %token_destructor |
+** directives of the input grammar. |
*/ |
static void yy_destructor( |
yyParser *yypParser, /* The parser */ |
@@ -301,10 +353,12 @@ static void yy_destructor( |
** being destroyed before it is finished parsing. |
** |
** Note: during a reduce, the only symbols destroyed are those |
- ** which appear on the RHS of the rule, but which are not used |
+ ** which appear on the RHS of the rule, but which are *not* used |
** inside the C code. |
*/ |
+/********* Begin destructor definitions ***************************************/ |
%% |
+/********* End destructor definitions *****************************************/ |
default: break; /* If no destructor action specified: do nothing */ |
} |
} |
@@ -314,45 +368,37 @@ static void yy_destructor( |
** |
** If there is a destructor routine associated with the token which |
** is popped from the stack, then call it. |
-** |
-** Return the major token number for the symbol popped. |
*/ |
-static int yy_pop_parser_stack(yyParser *pParser){ |
- YYCODETYPE yymajor; |
- yyStackEntry *yytos = &pParser->yystack[pParser->yyidx]; |
- |
- if( pParser->yyidx<0 ) return 0; |
+static void yy_pop_parser_stack(yyParser *pParser){ |
+ yyStackEntry *yytos; |
+ assert( pParser->yyidx>=0 ); |
+ yytos = &pParser->yystack[pParser->yyidx--]; |
#ifndef NDEBUG |
- if( yyTraceFILE && pParser->yyidx>=0 ){ |
+ if( yyTraceFILE ){ |
fprintf(yyTraceFILE,"%sPopping %s\n", |
yyTracePrompt, |
yyTokenName[yytos->major]); |
} |
#endif |
- yymajor = yytos->major; |
- yy_destructor(pParser, yymajor, &yytos->minor); |
- pParser->yyidx--; |
- return yymajor; |
+ yy_destructor(pParser, yytos->major, &yytos->minor); |
} |
/* |
-** Deallocate and destroy a parser. Destructors are all called for |
+** Deallocate and destroy a parser. Destructors are called for |
** all stack elements before shutting the parser down. |
** |
-** Inputs: |
-** <ul> |
-** <li> A pointer to the parser. This should be a pointer |
-** obtained from ParseAlloc. |
-** <li> A pointer to a function used to reclaim memory obtained |
-** from malloc. |
-** </ul> |
+** If the YYPARSEFREENEVERNULL macro exists (for example because it |
+** is defined in a %include section of the input grammar) then it is |
+** assumed that the input pointer is never NULL. |
*/ |
void ParseFree( |
void *p, /* The parser to be deleted */ |
void (*freeProc)(void*) /* Function used to reclaim memory */ |
){ |
yyParser *pParser = (yyParser*)p; |
+#ifndef YYPARSEFREENEVERNULL |
if( pParser==0 ) return; |
+#endif |
while( pParser->yyidx>=0 ) yy_pop_parser_stack(pParser); |
#if YYSTACKDEPTH<=0 |
free(pParser->yystack); |
@@ -373,10 +419,6 @@ int ParseStackPeak(void *p){ |
/* |
** Find the appropriate action for a parser given the terminal |
** look-ahead token iLookAhead. |
-** |
-** If the look-ahead token is YYNOCODE, then check to see if the action is |
-** independent of the look-ahead. If it is, return the action, otherwise |
-** return YY_NO_ACTION. |
*/ |
static int yy_find_shift_action( |
yyParser *pParser, /* The parser */ |
@@ -385,63 +427,64 @@ static int yy_find_shift_action( |
int i; |
int stateno = pParser->yystack[pParser->yyidx].stateno; |
- if( stateno>YY_SHIFT_COUNT |
- || (i = yy_shift_ofst[stateno])==YY_SHIFT_USE_DFLT ){ |
- return yy_default[stateno]; |
- } |
- assert( iLookAhead!=YYNOCODE ); |
- i += iLookAhead; |
- if( i<0 || i>=YY_ACTTAB_COUNT || yy_lookahead[i]!=iLookAhead ){ |
- if( iLookAhead>0 ){ |
+ if( stateno>=YY_MIN_REDUCE ) return stateno; |
+ assert( stateno <= YY_SHIFT_COUNT ); |
+ do{ |
+ i = yy_shift_ofst[stateno]; |
+ if( i==YY_SHIFT_USE_DFLT ) return yy_default[stateno]; |
+ assert( iLookAhead!=YYNOCODE ); |
+ i += iLookAhead; |
+ if( i<0 || i>=YY_ACTTAB_COUNT || yy_lookahead[i]!=iLookAhead ){ |
+ if( iLookAhead>0 ){ |
#ifdef YYFALLBACK |
- YYCODETYPE iFallback; /* Fallback token */ |
- if( iLookAhead<sizeof(yyFallback)/sizeof(yyFallback[0]) |
- && (iFallback = yyFallback[iLookAhead])!=0 ){ |
+ YYCODETYPE iFallback; /* Fallback token */ |
+ if( iLookAhead<sizeof(yyFallback)/sizeof(yyFallback[0]) |
+ && (iFallback = yyFallback[iLookAhead])!=0 ){ |
#ifndef NDEBUG |
- if( yyTraceFILE ){ |
- fprintf(yyTraceFILE, "%sFALLBACK %s => %s\n", |
- yyTracePrompt, yyTokenName[iLookAhead], yyTokenName[iFallback]); |
- } |
+ if( yyTraceFILE ){ |
+ fprintf(yyTraceFILE, "%sFALLBACK %s => %s\n", |
+ yyTracePrompt, yyTokenName[iLookAhead], yyTokenName[iFallback]); |
+ } |
#endif |
- return yy_find_shift_action(pParser, iFallback); |
- } |
+ assert( yyFallback[iFallback]==0 ); /* Fallback loop must terminate */ |
+ iLookAhead = iFallback; |
+ continue; |
+ } |
#endif |
#ifdef YYWILDCARD |
- { |
- int j = i - iLookAhead + YYWILDCARD; |
- if( |
+ { |
+ int j = i - iLookAhead + YYWILDCARD; |
+ if( |
#if YY_SHIFT_MIN+YYWILDCARD<0 |
- j>=0 && |
+ j>=0 && |
#endif |
#if YY_SHIFT_MAX+YYWILDCARD>=YY_ACTTAB_COUNT |
- j<YY_ACTTAB_COUNT && |
+ j<YY_ACTTAB_COUNT && |
#endif |
- yy_lookahead[j]==YYWILDCARD |
- ){ |
+ yy_lookahead[j]==YYWILDCARD |
+ ){ |
#ifndef NDEBUG |
- if( yyTraceFILE ){ |
- fprintf(yyTraceFILE, "%sWILDCARD %s => %s\n", |
- yyTracePrompt, yyTokenName[iLookAhead], yyTokenName[YYWILDCARD]); |
- } |
+ if( yyTraceFILE ){ |
+ fprintf(yyTraceFILE, "%sWILDCARD %s => %s\n", |
+ yyTracePrompt, yyTokenName[iLookAhead], |
+ yyTokenName[YYWILDCARD]); |
+ } |
#endif /* NDEBUG */ |
- return yy_action[j]; |
+ return yy_action[j]; |
+ } |
} |
- } |
#endif /* YYWILDCARD */ |
+ } |
+ return yy_default[stateno]; |
+ }else{ |
+ return yy_action[i]; |
} |
- return yy_default[stateno]; |
- }else{ |
- return yy_action[i]; |
- } |
+ }while(1); |
} |
/* |
** Find the appropriate action for a parser given the non-terminal |
** look-ahead token iLookAhead. |
-** |
-** If the look-ahead token is YYNOCODE, then check to see if the action is |
-** independent of the look-ahead. If it is, return the action, otherwise |
-** return YY_NO_ACTION. |
*/ |
static int yy_find_reduce_action( |
int stateno, /* Current state number */ |
@@ -484,11 +527,33 @@ static void yyStackOverflow(yyParser *yypParser, YYMINORTYPE *yypMinor){ |
while( yypParser->yyidx>=0 ) yy_pop_parser_stack(yypParser); |
/* Here code is inserted which will execute if the parser |
** stack every overflows */ |
+/******** Begin %stack_overflow code ******************************************/ |
%% |
+/******** End %stack_overflow code ********************************************/ |
ParseARG_STORE; /* Suppress warning about unused %extra_argument var */ |
} |
/* |
+** Print tracing information for a SHIFT action |
+*/ |
+#ifndef NDEBUG |
+static void yyTraceShift(yyParser *yypParser, int yyNewState){ |
+ if( yyTraceFILE ){ |
+ if( yyNewState<YYNSTATE ){ |
+ fprintf(yyTraceFILE,"%sShift '%s', go to state %d\n", |
+ yyTracePrompt,yyTokenName[yypParser->yystack[yypParser->yyidx].major], |
+ yyNewState); |
+ }else{ |
+ fprintf(yyTraceFILE,"%sShift '%s'\n", |
+ yyTracePrompt,yyTokenName[yypParser->yystack[yypParser->yyidx].major]); |
+ } |
+ } |
+} |
+#else |
+# define yyTraceShift(X,Y) |
+#endif |
+ |
+/* |
** Perform a shift action. |
*/ |
static void yy_shift( |
@@ -522,16 +587,7 @@ static void yy_shift( |
yytos->stateno = (YYACTIONTYPE)yyNewState; |
yytos->major = (YYCODETYPE)yyMajor; |
yytos->minor = *yypMinor; |
-#ifndef NDEBUG |
- if( yyTraceFILE && yypParser->yyidx>0 ){ |
- int i; |
- fprintf(yyTraceFILE,"%sShift %d\n",yyTracePrompt,yyNewState); |
- fprintf(yyTraceFILE,"%sStack:",yyTracePrompt); |
- for(i=1; i<=yypParser->yyidx; i++) |
- fprintf(yyTraceFILE," %s",yyTokenName[yypParser->yystack[i].major]); |
- fprintf(yyTraceFILE,"\n"); |
- } |
-#endif |
+ yyTraceShift(yypParser, yyNewState); |
} |
/* The following table contains information about every rule that |
@@ -564,29 +620,13 @@ static void yy_reduce( |
#ifndef NDEBUG |
if( yyTraceFILE && yyruleno>=0 |
&& yyruleno<(int)(sizeof(yyRuleName)/sizeof(yyRuleName[0])) ){ |
- fprintf(yyTraceFILE, "%sReduce [%s].\n", yyTracePrompt, |
- yyRuleName[yyruleno]); |
+ yysize = yyRuleInfo[yyruleno].nrhs; |
+ fprintf(yyTraceFILE, "%sReduce [%s], go to state %d.\n", yyTracePrompt, |
+ yyRuleName[yyruleno], yymsp[-yysize].stateno); |
} |
#endif /* NDEBUG */ |
- |
- /* Silence complaints from purify about yygotominor being uninitialized |
- ** in some cases when it is copied into the stack after the following |
- ** switch. yygotominor is uninitialized when a rule reduces that does |
- ** not set the value of its left-hand side nonterminal. Leaving the |
- ** value of the nonterminal uninitialized is utterly harmless as long |
- ** as the value is never used. So really the only thing this code |
- ** accomplishes is to quieten purify. |
- ** |
- ** 2007-01-16: The wireshark project (www.wireshark.org) reports that |
- ** without this code, their parser segfaults. I'm not sure what there |
- ** parser is doing to make this happen. This is the second bug report |
- ** from wireshark this week. Clearly they are stressing Lemon in ways |
- ** that it has not been previously stressed... (SQLite ticket #2172) |
- */ |
- /*memset(&yygotominor, 0, sizeof(yygotominor));*/ |
yygotominor = yyzerominor; |
- |
switch( yyruleno ){ |
/* Beginning here are the reduction cases. A typical example |
** follows: |
@@ -596,15 +636,18 @@ static void yy_reduce( |
** #line <lineno> <thisfile> |
** break; |
*/ |
+/********** Begin reduce actions **********************************************/ |
%% |
+/********** End reduce actions ************************************************/ |
}; |
+ assert( yyruleno>=0 && yyruleno<sizeof(yyRuleInfo)/sizeof(yyRuleInfo[0]) ); |
yygoto = yyRuleInfo[yyruleno].lhs; |
yysize = yyRuleInfo[yyruleno].nrhs; |
yypParser->yyidx -= yysize; |
yyact = yy_find_reduce_action(yymsp[-yysize].stateno,(YYCODETYPE)yygoto); |
- if( yyact < YYNSTATE ){ |
-#ifdef NDEBUG |
- /* If we are not debugging and the reduce action popped at least |
+ if( yyact <= YY_MAX_SHIFTREDUCE ){ |
+ if( yyact>YY_MAX_SHIFT ) yyact += YY_MIN_REDUCE - YY_MIN_SHIFTREDUCE; |
+ /* If the reduce action popped at least |
** one element off the stack, then we can push the new element back |
** onto the stack here, and skip the stack overflow test in yy_shift(). |
** That gives a significant speed improvement. */ |
@@ -614,13 +657,12 @@ static void yy_reduce( |
yymsp->stateno = (YYACTIONTYPE)yyact; |
yymsp->major = (YYCODETYPE)yygoto; |
yymsp->minor = yygotominor; |
- }else |
-#endif |
- { |
+ yyTraceShift(yypParser, yyact); |
+ }else{ |
yy_shift(yypParser,yyact,yygoto,&yygotominor); |
} |
}else{ |
- assert( yyact == YYNSTATE + YYNRULE + 1 ); |
+ assert( yyact == YY_ACCEPT_ACTION ); |
yy_accept(yypParser); |
} |
} |
@@ -641,7 +683,9 @@ static void yy_parse_failed( |
while( yypParser->yyidx>=0 ) yy_pop_parser_stack(yypParser); |
/* Here code is inserted which will be executed whenever the |
** parser fails */ |
+/************ Begin %parse_failure code ***************************************/ |
%% |
+/************ End %parse_failure code *****************************************/ |
ParseARG_STORE; /* Suppress warning about unused %extra_argument variable */ |
} |
#endif /* YYNOERRORRECOVERY */ |
@@ -656,7 +700,9 @@ static void yy_syntax_error( |
){ |
ParseARG_FETCH; |
#define TOKEN (yyminor.yy0) |
+/************ Begin %syntax_error code ****************************************/ |
%% |
+/************ End %syntax_error code ******************************************/ |
ParseARG_STORE; /* Suppress warning about unused %extra_argument variable */ |
} |
@@ -675,7 +721,9 @@ static void yy_accept( |
while( yypParser->yyidx>=0 ) yy_pop_parser_stack(yypParser); |
/* Here code is inserted which will be executed whenever the |
** parser accepts */ |
+/*********** Begin %parse_accept code *****************************************/ |
%% |
+/*********** End %parse_accept code *******************************************/ |
ParseARG_STORE; /* Suppress warning about unused %extra_argument variable */ |
} |
@@ -706,7 +754,9 @@ void Parse( |
){ |
YYMINORTYPE yyminorunion; |
int yyact; /* The parser action. */ |
+#if !defined(YYERRORSYMBOL) && !defined(YYNOERRORRECOVERY) |
int yyendofinput; /* True if we are at the end of input */ |
+#endif |
#ifdef YYERRORSYMBOL |
int yyerrorhit = 0; /* True if yymajor has invoked an error */ |
#endif |
@@ -727,26 +777,34 @@ void Parse( |
yypParser->yyerrcnt = -1; |
yypParser->yystack[0].stateno = 0; |
yypParser->yystack[0].major = 0; |
+#ifndef NDEBUG |
+ if( yyTraceFILE ){ |
+ fprintf(yyTraceFILE,"%sInitialize. Empty stack. State 0\n", |
+ yyTracePrompt); |
+ } |
+#endif |
} |
yyminorunion.yy0 = yyminor; |
+#if !defined(YYERRORSYMBOL) && !defined(YYNOERRORRECOVERY) |
yyendofinput = (yymajor==0); |
+#endif |
ParseARG_STORE; |
#ifndef NDEBUG |
if( yyTraceFILE ){ |
- fprintf(yyTraceFILE,"%sInput %s\n",yyTracePrompt,yyTokenName[yymajor]); |
+ fprintf(yyTraceFILE,"%sInput '%s'\n",yyTracePrompt,yyTokenName[yymajor]); |
} |
#endif |
do{ |
yyact = yy_find_shift_action(yypParser,(YYCODETYPE)yymajor); |
- if( yyact<YYNSTATE ){ |
- assert( !yyendofinput ); /* Impossible to shift the $ token */ |
+ if( yyact <= YY_MAX_SHIFTREDUCE ){ |
+ if( yyact > YY_MAX_SHIFT ) yyact += YY_MIN_REDUCE - YY_MIN_SHIFTREDUCE; |
yy_shift(yypParser,yyact,yymajor,&yyminorunion); |
yypParser->yyerrcnt--; |
yymajor = YYNOCODE; |
- }else if( yyact < YYNSTATE + YYNRULE ){ |
- yy_reduce(yypParser,yyact-YYNSTATE); |
+ }else if( yyact <= YY_MAX_REDUCE ){ |
+ yy_reduce(yypParser,yyact-YY_MIN_REDUCE); |
}else{ |
assert( yyact == YY_ERROR_ACTION ); |
#ifdef YYERRORSYMBOL |
@@ -796,7 +854,7 @@ void Parse( |
yymx != YYERRORSYMBOL && |
(yyact = yy_find_reduce_action( |
yypParser->yystack[yypParser->yyidx].stateno, |
- YYERRORSYMBOL)) >= YYNSTATE |
+ YYERRORSYMBOL)) >= YY_MIN_REDUCE |
){ |
yy_pop_parser_stack(yypParser); |
} |
@@ -846,5 +904,15 @@ void Parse( |
#endif |
} |
}while( yymajor!=YYNOCODE && yypParser->yyidx>=0 ); |
+#ifndef NDEBUG |
+ if( yyTraceFILE ){ |
+ int i; |
+ fprintf(yyTraceFILE,"%sReturn. Stack=",yyTracePrompt); |
+ for(i=1; i<=yypParser->yyidx; i++) |
+ fprintf(yyTraceFILE,"%c%s", i==1 ? '[' : ' ', |
+ yyTokenName[yypParser->yystack[i].major]); |
+ fprintf(yyTraceFILE,"]\n"); |
+ } |
+#endif |
return; |
} |