7
7
/* Next is all token values, in a form suitable for use by makeheaders.
8
8
** This section will be null unless lemon is run with the -m switch.
9
9
*/
10
- /*
10
+ /*
11
11
** These constants (all generated automatically by the parser generator)
12
12
** specify the various kinds of tokens (terminals) that the parser
13
- ** understands.
13
+ ** understands.
14
14
**
15
15
** Each symbol here is a terminal symbol in the grammar.
16
16
*/
28
28
** and nonterminals. "int" is used otherwise.
29
29
** YYNOCODE is a number of type YYCODETYPE which corresponds
30
30
** to no legal terminal or nonterminal number. This
31
- ** number is used to fill in empty slots of the hash
31
+ ** number is used to fill in empty slots of the hash
32
32
** table.
33
33
** YYFALLBACK If defined, this indicates that one or more tokens
34
34
** have fall-back values which should be used if the
37
37
** and nonterminal numbers. "unsigned char" is
38
38
** used if there are fewer than 250 rules and
39
39
** states combined. "int" is used otherwise.
40
- ** ParseTOKENTYPE is the data type used for minor tokens given
40
+ ** ParseTOKENTYPE is the data type used for minor tokens given
41
41
** directly to the parser from the tokenizer.
42
42
** YYMINORTYPE is the data type used for all minor tokens.
43
43
** This is typically a union of many types, one of
61
61
/* Next are that tables used to determine what action to take based on the
62
62
** current state and lookahead token. These tables are used to implement
63
63
** functions that take a state number and lookahead value and return an
64
- ** action integer.
64
+ ** action integer.
65
65
**
66
66
** Suppose the action integer is N. Then the action is determined as
67
67
** follows
86
86
** If the index value yy_shift_ofst[S]+X is out of range or if the value
87
87
** yy_lookahead[yy_shift_ofst[S]+X] is not equal to X or if yy_shift_ofst[S]
88
88
** is equal to YY_SHIFT_USE_DFLT, it means that the action is not in the table
89
- ** and that yy_default[S] should be used instead.
89
+ ** and that yy_default[S] should be used instead.
90
90
**
91
91
** The formula above is for computing the action when the lookahead is
92
92
** a terminal symbol. If the lookahead is a non-terminal (as occurs after
110
110
111
111
/* The next table maps tokens into fallback tokens. If a construct
112
112
** like the following:
113
- **
113
+ **
114
114
** %fallback ID X Y Z.
115
115
**
116
116
** appears in the grammer, then ID becomes a fallback token for X, Y,
@@ -162,10 +162,10 @@ static char *yyTracePrompt = 0;
162
162
#endif /* NDEBUG */
163
163
164
164
#ifndef NDEBUG
165
- /*
165
+ /*
166
166
** Turn parser tracing on by giving a stream to which to write the trace
167
167
** and a prompt to preface each trace message. Tracing is turned off
168
- ** by making either argument NULL
168
+ ** by making either argument NULL
169
169
**
170
170
** Inputs:
171
171
** <ul>
@@ -190,7 +190,7 @@ void ParseTrace(FILE *TraceFILE, char *zTracePrompt){
190
190
#ifndef NDEBUG
191
191
/* For tracing shifts, the names of all terminals and nonterminals
192
192
** are required. The following table supplies these names */
193
- static const char * yyTokenName [] = {
193
+ static const char * yyTokenName [] = {
194
194
%%
195
195
};
196
196
#endif /* NDEBUG */
@@ -219,7 +219,7 @@ const char *ParseTokenName(int tokenType){
219
219
#endif
220
220
}
221
221
222
- /*
222
+ /*
223
223
** This function allocates a new parser.
224
224
** The only argument is a pointer to a function which works like
225
225
** malloc.
@@ -250,7 +250,7 @@ static void yy_destructor(YYCODETYPE yymajor, YYMINORTYPE *yypminor){
250
250
/* Here is inserted the actions which take place when a
251
251
** terminal or non-terminal is destroyed. This can happen
252
252
** when the symbol is popped from the stack during a
253
- ** reduce or during error processing or when a parser is
253
+ ** reduce or during error processing or when a parser is
254
254
** being destroyed before it is finished parsing.
255
255
**
256
256
** Note: during a reduce, the only symbols destroyed are those
@@ -288,7 +288,7 @@ static int yy_pop_parser_stack(yyParser *pParser){
288
288
return yymajor ;
289
289
}
290
290
291
- /*
291
+ /*
292
292
** Deallocate and destroy a parser. Destructors are all called for
293
293
** all stack elements before shutting the parser down.
294
294
**
@@ -324,7 +324,7 @@ static int yy_find_shift_action(
324
324
){
325
325
int i ;
326
326
int stateno = pParser -> yystack [pParser -> yyidx ].stateno ;
327
-
327
+
328
328
/* if( pParser->yyidx<0 ) return YY_NO_ACTION; */
329
329
i = yy_shift_ofst [stateno ];
330
330
if ( i == YY_SHIFT_USE_DFLT ){
@@ -368,7 +368,7 @@ static int yy_find_reduce_action(
368
368
){
369
369
int i ;
370
370
int stateno = pParser -> yystack [pParser -> yyidx ].stateno ;
371
-
371
+
372
372
i = yy_reduce_ofst [stateno ];
373
373
if ( i == YY_REDUCE_USE_DFLT ){
374
374
return yy_default [stateno ];
@@ -454,7 +454,7 @@ static void yy_reduce(
454
454
ParseARG_FETCH ;
455
455
yymsp = & yypParser -> yystack [yypParser -> yyidx ];
456
456
#ifndef NDEBUG
457
- if ( yyTraceFILE && yyruleno >=0
457
+ if ( yyTraceFILE && yyruleno >=0
458
458
&& yyruleno < sizeof (yyRuleName )/sizeof (yyRuleName [0 ]) ){
459
459
fprintf (yyTraceFILE , "%sReduce [%s].\n" , yyTracePrompt ,
460
460
yyRuleName [yyruleno ]);
@@ -607,7 +607,7 @@ void Parse(
607
607
#ifdef YYERRORSYMBOL
608
608
/* A syntax error has occurred.
609
609
** The response to an error depends upon whether or not the
610
- ** grammar defines an error token "ERROR".
610
+ ** grammar defines an error token "ERROR".
611
611
**
612
612
** This is what we do if the grammar does define ERROR:
613
613
**
0 commit comments