142 |
|
|
143 |
static struct obstack string_obstack; |
static struct obstack string_obstack; |
144 |
|
|
145 |
|
/* A string representing the most recently saved token. */ |
146 |
|
static char *last_string; |
147 |
|
|
148 |
|
|
149 |
#define YY_OBS_GROW \ |
#define YY_OBS_GROW \ |
150 |
obstack_grow (&string_obstack, yytext, yyleng) |
obstack_grow (&string_obstack, yytext, yyleng) |
151 |
|
|
158 |
#define YY_OBS_FREE \ |
#define YY_OBS_FREE \ |
159 |
obstack_free (&string_obstack, last_string) |
obstack_free (&string_obstack, last_string) |
160 |
|
|
161 |
|
void |
162 |
|
scanner_last_string_free (void) |
163 |
|
{ |
164 |
|
YY_OBS_FREE; |
165 |
|
} |
166 |
|
|
167 |
/* Within well-formed rules, RULE_LENGTH is the number of values in |
/* Within well-formed rules, RULE_LENGTH is the number of values in |
168 |
the current rule so far, which says where to find `$0' with respect |
the current rule so far, which says where to find `$0' with respect |
208 |
/* Scanner context when scanning C code. */ |
/* Scanner context when scanning C code. */ |
209 |
int c_context IF_LINT (= 0); |
int c_context IF_LINT (= 0); |
210 |
|
|
|
/* A string representing the most recently saved token. */ |
|
|
char *last_string; |
|
|
|
|
211 |
/* At each yylex invocation, mark the current position as the |
/* At each yylex invocation, mark the current position as the |
212 |
start of the next token. */ |
start of the next token. */ |
213 |
YY_STEP; |
YY_STEP; |