]>
Commit | Line | Data |
---|---|---|
1 | /* Bison Grammar Scanner -*- C -*- | |
2 | ||
3 | Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc. | |
4 | ||
5 | This file is part of Bison, the GNU Compiler Compiler. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
19 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA | |
20 | 02110-1301 USA | |
21 | */ | |
22 | ||
23 | %option debug nodefault nounput noyywrap never-interactive | |
24 | %option prefix="gram_" outfile="lex.yy.c" | |
25 | ||
26 | %{ | |
27 | /* Work around a bug in flex 2.5.31. See Debian bug 333231 | |
28 | <http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=333231>. */ | |
29 | #undef gram_wrap | |
30 | #define gram_wrap() 1 | |
31 | ||
32 | #include "system.h" | |
33 | ||
34 | #include <mbswidth.h> | |
35 | #include <get-errno.h> | |
36 | #include <quote.h> | |
37 | ||
38 | #include "complain.h" | |
39 | #include "files.h" | |
40 | #include "getargs.h" | |
41 | #include "gram.h" | |
42 | #include "quotearg.h" | |
43 | #include "reader.h" | |
44 | #include "uniqstr.h" | |
45 | ||
46 | #define YY_USER_INIT \ | |
47 | do \ | |
48 | { \ | |
49 | scanner_cursor.file = current_file; \ | |
50 | scanner_cursor.line = 1; \ | |
51 | scanner_cursor.column = 1; \ | |
52 | code_start = scanner_cursor; \ | |
53 | } \ | |
54 | while (0) | |
55 | ||
56 | /* Pacify "gcc -Wmissing-prototypes" when flex 2.5.31 is used. */ | |
57 | int gram_get_lineno (void); | |
58 | FILE *gram_get_in (void); | |
59 | FILE *gram_get_out (void); | |
60 | int gram_get_leng (void); | |
61 | char *gram_get_text (void); | |
62 | void gram_set_lineno (int); | |
63 | void gram_set_in (FILE *); | |
64 | void gram_set_out (FILE *); | |
65 | int gram_get_debug (void); | |
66 | void gram_set_debug (int); | |
67 | int gram_lex_destroy (void); | |
68 | ||
69 | /* Location of scanner cursor. */ | |
70 | boundary scanner_cursor; | |
71 | ||
72 | static void adjust_location (location *, char const *, size_t); | |
73 | #define YY_USER_ACTION adjust_location (loc, yytext, yyleng); | |
74 | ||
75 | static size_t no_cr_read (FILE *, char *, size_t); | |
76 | #define YY_INPUT(buf, result, size) ((result) = no_cr_read (yyin, buf, size)) | |
77 | ||
78 | ||
79 | /* OBSTACK_FOR_STRING -- Used to store all the characters that we need to | |
80 | keep (to construct ID, STRINGS etc.). Use the following macros to | |
81 | use it. | |
82 | ||
83 | Use STRING_GROW to append what has just been matched, and | |
84 | STRING_FINISH to end the string (it puts the ending 0). | |
85 | STRING_FINISH also stores this string in LAST_STRING, which can be | |
86 | used, and which is used by STRING_FREE to free the last string. */ | |
87 | ||
88 | static struct obstack obstack_for_string; | |
89 | ||
90 | /* A string representing the most recently saved token. */ | |
91 | static char *last_string; | |
92 | ||
93 | ||
94 | #define STRING_GROW \ | |
95 | obstack_grow (&obstack_for_string, yytext, yyleng) | |
96 | ||
97 | #define STRING_FINISH \ | |
98 | do { \ | |
99 | obstack_1grow (&obstack_for_string, '\0'); \ | |
100 | last_string = obstack_finish (&obstack_for_string); \ | |
101 | } while (0) | |
102 | ||
103 | #define STRING_FREE \ | |
104 | obstack_free (&obstack_for_string, last_string) | |
105 | ||
106 | void | |
107 | scanner_last_string_free (void) | |
108 | { | |
109 | STRING_FREE; | |
110 | } | |
111 | ||
112 | /* Within well-formed rules, RULE_LENGTH is the number of values in | |
113 | the current rule so far, which says where to find `$0' with respect | |
114 | to the top of the stack. It is not the same as the rule->length in | |
115 | the case of mid rule actions. | |
116 | ||
117 | Outside of well-formed rules, RULE_LENGTH has an undefined value. */ | |
118 | static int rule_length; | |
119 | ||
120 | static void handle_dollar (int token_type, char *cp, location loc); | |
121 | static void handle_at (int token_type, char *cp, location loc); | |
122 | static void handle_syncline (char *args); | |
123 | static unsigned long int scan_integer (char const *p, int base, location loc); | |
124 | static int convert_ucn_to_byte (char const *hex_text); | |
125 | static void unexpected_eof (boundary, char const *); | |
126 | static void unexpected_newline (boundary, char const *); | |
127 | ||
128 | %} | |
129 | %x SC_COMMENT SC_LINE_COMMENT SC_YACC_COMMENT | |
130 | %x SC_STRING SC_CHARACTER | |
131 | %x SC_AFTER_IDENTIFIER | |
132 | %x SC_ESCAPED_STRING SC_ESCAPED_CHARACTER | |
133 | %x SC_PRE_CODE SC_BRACED_CODE SC_PROLOGUE SC_EPILOGUE | |
134 | ||
135 | letter [.abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_] | |
136 | id {letter}({letter}|[0-9])* | |
137 | directive %{letter}({letter}|[0-9]|-)* | |
138 | int [0-9]+ | |
139 | ||
140 | /* POSIX says that a tag must be both an id and a C union member, but | |
141 | historically almost any character is allowed in a tag. We disallow | |
142 | NUL and newline, as this simplifies our implementation. */ | |
143 | tag [^\0\n>]+ | |
144 | ||
145 | /* Zero or more instances of backslash-newline. Following GCC, allow | |
146 | white space between the backslash and the newline. */ | |
147 | splice (\\[ \f\t\v]*\n)* | |
148 | ||
149 | %% | |
150 | %{ | |
151 | /* Nesting level of the current code in braces. */ | |
152 | int braces_level IF_LINT (= 0); | |
153 | ||
154 | /* Parent context state, when applicable. */ | |
155 | int context_state IF_LINT (= 0); | |
156 | ||
157 | /* Token type to return, when applicable. */ | |
158 | int token_type IF_LINT (= 0); | |
159 | ||
160 | /* Location of most recent identifier, when applicable. */ | |
161 | location id_loc IF_LINT (= empty_location); | |
162 | ||
163 | /* Where containing code started, when applicable. Its initial | |
164 | value is relevant only when yylex is invoked in the SC_EPILOGUE | |
165 | start condition. */ | |
166 | boundary code_start = scanner_cursor; | |
167 | ||
168 | /* Where containing comment or string or character literal started, | |
169 | when applicable. */ | |
170 | boundary token_start IF_LINT (= scanner_cursor); | |
171 | %} | |
172 | ||
173 | ||
174 | /*-----------------------. | |
175 | | Scanning white space. | | |
176 | `-----------------------*/ | |
177 | ||
178 | <INITIAL,SC_AFTER_IDENTIFIER,SC_PRE_CODE> | |
179 | { | |
180 | /* Comments and white space. */ | |
181 | "," warn_at (*loc, _("stray `,' treated as white space")); | |
182 | [ \f\n\t\v] | | |
183 | "//".* ; | |
184 | "/*" { | |
185 | token_start = loc->start; | |
186 | context_state = YY_START; | |
187 | BEGIN SC_YACC_COMMENT; | |
188 | } | |
189 | ||
190 | /* #line directives are not documented, and may be withdrawn or | |
191 | modified in future versions of Bison. */ | |
192 | ^"#line "{int}" \"".*"\"\n" { | |
193 | handle_syncline (yytext + sizeof "#line " - 1); | |
194 | } | |
195 | } | |
196 | ||
197 | ||
198 | /*----------------------------. | |
199 | | Scanning Bison directives. | | |
200 | `----------------------------*/ | |
201 | <INITIAL> | |
202 | { | |
203 | "%binary" return PERCENT_NONASSOC; | |
204 | "%debug" return PERCENT_DEBUG; | |
205 | "%default"[-_]"prec" return PERCENT_DEFAULT_PREC; | |
206 | "%define" return PERCENT_DEFINE; | |
207 | "%defines" return PERCENT_DEFINES; | |
208 | "%destructor" token_type = PERCENT_DESTRUCTOR; BEGIN SC_PRE_CODE; | |
209 | "%dprec" return PERCENT_DPREC; | |
210 | "%error"[-_]"verbose" return PERCENT_ERROR_VERBOSE; | |
211 | "%expect" return PERCENT_EXPECT; | |
212 | "%expect"[-_]"rr" return PERCENT_EXPECT_RR; | |
213 | "%file-prefix" return PERCENT_FILE_PREFIX; | |
214 | "%fixed"[-_]"output"[-_]"files" return PERCENT_YACC; | |
215 | "%initial-action" token_type = PERCENT_INITIAL_ACTION; BEGIN SC_PRE_CODE; | |
216 | "%glr-parser" return PERCENT_GLR_PARSER; | |
217 | "%left" return PERCENT_LEFT; | |
218 | "%lex-param" token_type = PERCENT_LEX_PARAM; BEGIN SC_PRE_CODE; | |
219 | "%locations" return PERCENT_LOCATIONS; | |
220 | "%merge" return PERCENT_MERGE; | |
221 | "%name"[-_]"prefix" return PERCENT_NAME_PREFIX; | |
222 | "%no"[-_]"default"[-_]"prec" return PERCENT_NO_DEFAULT_PREC; | |
223 | "%no"[-_]"lines" return PERCENT_NO_LINES; | |
224 | "%nonassoc" return PERCENT_NONASSOC; | |
225 | "%nondeterministic-parser" return PERCENT_NONDETERMINISTIC_PARSER; | |
226 | "%nterm" return PERCENT_NTERM; | |
227 | "%output" return PERCENT_OUTPUT; | |
228 | "%parse-param" token_type = PERCENT_PARSE_PARAM; BEGIN SC_PRE_CODE; | |
229 | "%prec" rule_length--; return PERCENT_PREC; | |
230 | "%printer" token_type = PERCENT_PRINTER; BEGIN SC_PRE_CODE; | |
231 | "%pure"[-_]"parser" return PERCENT_PURE_PARSER; | |
232 | "%require" return PERCENT_REQUIRE; | |
233 | "%right" return PERCENT_RIGHT; | |
234 | "%skeleton" return PERCENT_SKELETON; | |
235 | "%start" return PERCENT_START; | |
236 | "%term" return PERCENT_TOKEN; | |
237 | "%token" return PERCENT_TOKEN; | |
238 | "%token"[-_]"table" return PERCENT_TOKEN_TABLE; | |
239 | "%type" return PERCENT_TYPE; | |
240 | "%union" token_type = PERCENT_UNION; BEGIN SC_PRE_CODE; | |
241 | "%verbose" return PERCENT_VERBOSE; | |
242 | "%yacc" return PERCENT_YACC; | |
243 | ||
244 | {directive} { | |
245 | complain_at (*loc, _("invalid directive: %s"), quote (yytext)); | |
246 | } | |
247 | ||
248 | "=" return EQUAL; | |
249 | "|" rule_length = 0; return PIPE; | |
250 | ";" return SEMICOLON; | |
251 | ||
252 | {id} { | |
253 | val->symbol = symbol_get (yytext, *loc); | |
254 | id_loc = *loc; | |
255 | rule_length++; | |
256 | BEGIN SC_AFTER_IDENTIFIER; | |
257 | } | |
258 | ||
259 | {int} { | |
260 | val->integer = scan_integer (yytext, 10, *loc); | |
261 | return INT; | |
262 | } | |
263 | 0[xX][0-9abcdefABCDEF]+ { | |
264 | val->integer = scan_integer (yytext, 16, *loc); | |
265 | return INT; | |
266 | } | |
267 | ||
268 | /* Characters. We don't check there is only one. */ | |
269 | "'" STRING_GROW; token_start = loc->start; BEGIN SC_ESCAPED_CHARACTER; | |
270 | ||
271 | /* Strings. */ | |
272 | "\"" token_start = loc->start; BEGIN SC_ESCAPED_STRING; | |
273 | ||
274 | /* Prologue. */ | |
275 | "%{" code_start = loc->start; BEGIN SC_PROLOGUE; | |
276 | ||
277 | /* Code in between braces. */ | |
278 | "{" { | |
279 | STRING_GROW; | |
280 | token_type = BRACED_CODE; | |
281 | braces_level = 0; | |
282 | code_start = loc->start; | |
283 | BEGIN SC_BRACED_CODE; | |
284 | } | |
285 | ||
286 | /* A type. */ | |
287 | "<"{tag}">" { | |
288 | obstack_grow (&obstack_for_string, yytext + 1, yyleng - 2); | |
289 | STRING_FINISH; | |
290 | val->uniqstr = uniqstr_new (last_string); | |
291 | STRING_FREE; | |
292 | return TYPE; | |
293 | } | |
294 | ||
295 | "%%" { | |
296 | static int percent_percent_count; | |
297 | if (++percent_percent_count == 2) | |
298 | BEGIN SC_EPILOGUE; | |
299 | return PERCENT_PERCENT; | |
300 | } | |
301 | ||
302 | . { | |
303 | complain_at (*loc, _("invalid character: %s"), quote (yytext)); | |
304 | } | |
305 | ||
306 | <<EOF>> { | |
307 | loc->start = loc->end = scanner_cursor; | |
308 | yyterminate (); | |
309 | } | |
310 | } | |
311 | ||
312 | ||
313 | /*-----------------------------------------------------------------. | |
314 | | Scanning after an identifier, checking whether a colon is next. | | |
315 | `-----------------------------------------------------------------*/ | |
316 | ||
317 | <SC_AFTER_IDENTIFIER> | |
318 | { | |
319 | ":" { | |
320 | rule_length = 0; | |
321 | *loc = id_loc; | |
322 | BEGIN INITIAL; | |
323 | return ID_COLON; | |
324 | } | |
325 | . { | |
326 | scanner_cursor.column -= mbsnwidth (yytext, yyleng, 0); | |
327 | yyless (0); | |
328 | *loc = id_loc; | |
329 | BEGIN INITIAL; | |
330 | return ID; | |
331 | } | |
332 | <<EOF>> { | |
333 | *loc = id_loc; | |
334 | BEGIN INITIAL; | |
335 | return ID; | |
336 | } | |
337 | } | |
338 | ||
339 | ||
340 | /*---------------------------------------------------------------. | |
341 | | Scanning a Yacc comment. The initial `/ *' is already eaten. | | |
342 | `---------------------------------------------------------------*/ | |
343 | ||
344 | <SC_YACC_COMMENT> | |
345 | { | |
346 | "*/" BEGIN context_state; | |
347 | .|\n ; | |
348 | <<EOF>> unexpected_eof (token_start, "*/"); BEGIN context_state; | |
349 | } | |
350 | ||
351 | ||
352 | /*------------------------------------------------------------. | |
353 | | Scanning a C comment. The initial `/ *' is already eaten. | | |
354 | `------------------------------------------------------------*/ | |
355 | ||
356 | <SC_COMMENT> | |
357 | { | |
358 | "*"{splice}"/" STRING_GROW; BEGIN context_state; | |
359 | <<EOF>> unexpected_eof (token_start, "*/"); BEGIN context_state; | |
360 | } | |
361 | ||
362 | ||
363 | /*--------------------------------------------------------------. | |
364 | | Scanning a line comment. The initial `//' is already eaten. | | |
365 | `--------------------------------------------------------------*/ | |
366 | ||
367 | <SC_LINE_COMMENT> | |
368 | { | |
369 | "\n" STRING_GROW; BEGIN context_state; | |
370 | {splice} STRING_GROW; | |
371 | <<EOF>> BEGIN context_state; | |
372 | } | |
373 | ||
374 | ||
375 | /*------------------------------------------------. | |
376 | | Scanning a Bison string, including its escapes. | | |
377 | | The initial quote is already eaten. | | |
378 | `------------------------------------------------*/ | |
379 | ||
380 | <SC_ESCAPED_STRING> | |
381 | { | |
382 | "\"" { | |
383 | STRING_FINISH; | |
384 | loc->start = token_start; | |
385 | val->chars = last_string; | |
386 | rule_length++; | |
387 | BEGIN INITIAL; | |
388 | return STRING; | |
389 | } | |
390 | \n unexpected_newline (token_start, "\""); BEGIN INITIAL; | |
391 | <<EOF>> unexpected_eof (token_start, "\""); BEGIN INITIAL; | |
392 | } | |
393 | ||
394 | /*----------------------------------------------------------. | |
395 | | Scanning a Bison character literal, decoding its escapes. | | |
396 | | The initial quote is already eaten. | | |
397 | `----------------------------------------------------------*/ | |
398 | ||
399 | <SC_ESCAPED_CHARACTER> | |
400 | { | |
401 | "'" { | |
402 | unsigned char last_string_1; | |
403 | STRING_GROW; | |
404 | STRING_FINISH; | |
405 | loc->start = token_start; | |
406 | val->symbol = symbol_get (quotearg_style (escape_quoting_style, | |
407 | last_string), | |
408 | *loc); | |
409 | symbol_class_set (val->symbol, token_sym, *loc); | |
410 | last_string_1 = last_string[1]; | |
411 | symbol_user_token_number_set (val->symbol, last_string_1, *loc); | |
412 | STRING_FREE; | |
413 | rule_length++; | |
414 | BEGIN INITIAL; | |
415 | return ID; | |
416 | } | |
417 | \n unexpected_newline (token_start, "'"); BEGIN INITIAL; | |
418 | <<EOF>> unexpected_eof (token_start, "'"); BEGIN INITIAL; | |
419 | } | |
420 | ||
421 | <SC_ESCAPED_CHARACTER,SC_ESCAPED_STRING> | |
422 | { | |
423 | \0 complain_at (*loc, _("invalid null character")); | |
424 | } | |
425 | ||
426 | ||
427 | /*----------------------------. | |
428 | | Decode escaped characters. | | |
429 | `----------------------------*/ | |
430 | ||
431 | <SC_ESCAPED_STRING,SC_ESCAPED_CHARACTER> | |
432 | { | |
433 | \\[0-7]{1,3} { | |
434 | unsigned long int c = strtoul (yytext + 1, 0, 8); | |
435 | if (UCHAR_MAX < c) | |
436 | complain_at (*loc, _("invalid escape sequence: %s"), quote (yytext)); | |
437 | else if (! c) | |
438 | complain_at (*loc, _("invalid null character: %s"), quote (yytext)); | |
439 | else | |
440 | obstack_1grow (&obstack_for_string, c); | |
441 | } | |
442 | ||
443 | \\x[0-9abcdefABCDEF]+ { | |
444 | unsigned long int c; | |
445 | set_errno (0); | |
446 | c = strtoul (yytext + 2, 0, 16); | |
447 | if (UCHAR_MAX < c || get_errno ()) | |
448 | complain_at (*loc, _("invalid escape sequence: %s"), quote (yytext)); | |
449 | else if (! c) | |
450 | complain_at (*loc, _("invalid null character: %s"), quote (yytext)); | |
451 | else | |
452 | obstack_1grow (&obstack_for_string, c); | |
453 | } | |
454 | ||
455 | \\a obstack_1grow (&obstack_for_string, '\a'); | |
456 | \\b obstack_1grow (&obstack_for_string, '\b'); | |
457 | \\f obstack_1grow (&obstack_for_string, '\f'); | |
458 | \\n obstack_1grow (&obstack_for_string, '\n'); | |
459 | \\r obstack_1grow (&obstack_for_string, '\r'); | |
460 | \\t obstack_1grow (&obstack_for_string, '\t'); | |
461 | \\v obstack_1grow (&obstack_for_string, '\v'); | |
462 | ||
463 | /* \\[\"\'?\\] would be shorter, but it confuses xgettext. */ | |
464 | \\("\""|"'"|"?"|"\\") obstack_1grow (&obstack_for_string, yytext[1]); | |
465 | ||
466 | \\(u|U[0-9abcdefABCDEF]{4})[0-9abcdefABCDEF]{4} { | |
467 | int c = convert_ucn_to_byte (yytext); | |
468 | if (c < 0) | |
469 | complain_at (*loc, _("invalid escape sequence: %s"), quote (yytext)); | |
470 | else if (! c) | |
471 | complain_at (*loc, _("invalid null character: %s"), quote (yytext)); | |
472 | else | |
473 | obstack_1grow (&obstack_for_string, c); | |
474 | } | |
475 | \\(.|\n) { | |
476 | complain_at (*loc, _("unrecognized escape sequence: %s"), quote (yytext)); | |
477 | STRING_GROW; | |
478 | } | |
479 | } | |
480 | ||
481 | /*--------------------------------------------. | |
482 | | Scanning user-code characters and strings. | | |
483 | `--------------------------------------------*/ | |
484 | ||
485 | <SC_CHARACTER,SC_STRING> | |
486 | { | |
487 | {splice}|\\{splice}[^\n$@\[\]] STRING_GROW; | |
488 | } | |
489 | ||
490 | <SC_CHARACTER> | |
491 | { | |
492 | "'" STRING_GROW; BEGIN context_state; | |
493 | \n unexpected_newline (token_start, "'"); BEGIN context_state; | |
494 | <<EOF>> unexpected_eof (token_start, "'"); BEGIN context_state; | |
495 | } | |
496 | ||
497 | <SC_STRING> | |
498 | { | |
499 | "\"" STRING_GROW; BEGIN context_state; | |
500 | \n unexpected_newline (token_start, "\""); BEGIN context_state; | |
501 | <<EOF>> unexpected_eof (token_start, "\""); BEGIN context_state; | |
502 | } | |
503 | ||
504 | ||
505 | /*---------------------------------------------------. | |
506 | | Strings, comments etc. can be found in user code. | | |
507 | `---------------------------------------------------*/ | |
508 | ||
509 | <SC_BRACED_CODE,SC_PROLOGUE,SC_EPILOGUE> | |
510 | { | |
511 | "'" { | |
512 | STRING_GROW; | |
513 | context_state = YY_START; | |
514 | token_start = loc->start; | |
515 | BEGIN SC_CHARACTER; | |
516 | } | |
517 | "\"" { | |
518 | STRING_GROW; | |
519 | context_state = YY_START; | |
520 | token_start = loc->start; | |
521 | BEGIN SC_STRING; | |
522 | } | |
523 | "/"{splice}"*" { | |
524 | STRING_GROW; | |
525 | context_state = YY_START; | |
526 | token_start = loc->start; | |
527 | BEGIN SC_COMMENT; | |
528 | } | |
529 | "/"{splice}"/" { | |
530 | STRING_GROW; | |
531 | context_state = YY_START; | |
532 | BEGIN SC_LINE_COMMENT; | |
533 | } | |
534 | } | |
535 | ||
536 | ||
537 | /*---------------------------------------------------------------. | |
538 | | Scanning after %union etc., possibly followed by white space. | | |
539 | | For %union only, allow arbitrary C code to appear before the | | |
540 | | following brace, as an extension to POSIX. | | |
541 | `---------------------------------------------------------------*/ | |
542 | ||
543 | <SC_PRE_CODE> | |
544 | { | |
545 | . { | |
546 | bool valid = yytext[0] == '{' || token_type == PERCENT_UNION; | |
547 | scanner_cursor.column -= mbsnwidth (yytext, yyleng, 0); | |
548 | yyless (0); | |
549 | ||
550 | if (valid) | |
551 | { | |
552 | braces_level = -1; | |
553 | code_start = loc->start; | |
554 | BEGIN SC_BRACED_CODE; | |
555 | } | |
556 | else | |
557 | { | |
558 | complain_at (*loc, _("missing `{' in %s"), | |
559 | token_name (token_type)); | |
560 | obstack_sgrow (&obstack_for_string, "{}"); | |
561 | STRING_FINISH; | |
562 | val->chars = last_string; | |
563 | BEGIN INITIAL; | |
564 | return token_type; | |
565 | } | |
566 | } | |
567 | ||
568 | <<EOF>> unexpected_eof (scanner_cursor, "{}"); BEGIN INITIAL; | |
569 | } | |
570 | ||
571 | ||
572 | /*---------------------------------------------------------------. | |
573 | | Scanning some code in braces (%union and actions). The initial | | |
574 | | "{" is already eaten. | | |
575 | `---------------------------------------------------------------*/ | |
576 | ||
577 | <SC_BRACED_CODE> | |
578 | { | |
579 | "{"|"<"{splice}"%" STRING_GROW; braces_level++; | |
580 | "%"{splice}">" STRING_GROW; braces_level--; | |
581 | "}" { | |
582 | bool outer_brace = --braces_level < 0; | |
583 | ||
584 | /* As an undocumented Bison extension, append `;' before the last | |
585 | brace in braced code, so that the user code can omit trailing | |
586 | `;'. But do not append `;' if emulating Yacc, since Yacc does | |
587 | not append one. | |
588 | ||
589 | FIXME: Bison should warn if a semicolon seems to be necessary | |
590 | here, and should omit the semicolon if it seems unnecessary | |
591 | (e.g., after ';', '{', or '}', each followed by comments or | |
592 | white space). Such a warning shouldn't depend on --yacc; it | |
593 | should depend on a new --pedantic option, which would cause | |
594 | Bison to warn if it detects an extension to POSIX. --pedantic | |
595 | should also diagnose other Bison extensions like %yacc. | |
596 | Perhaps there should also be a GCC-style --pedantic-errors | |
597 | option, so that such warnings are diagnosed as errors. */ | |
598 | if (outer_brace && token_type == BRACED_CODE && ! yacc_flag) | |
599 | obstack_1grow (&obstack_for_string, ';'); | |
600 | ||
601 | obstack_1grow (&obstack_for_string, '}'); | |
602 | ||
603 | if (outer_brace) | |
604 | { | |
605 | STRING_FINISH; | |
606 | rule_length++; | |
607 | loc->start = code_start; | |
608 | val->chars = last_string; | |
609 | BEGIN INITIAL; | |
610 | return token_type; | |
611 | } | |
612 | } | |
613 | ||
614 | /* Tokenize `<<%' correctly (as `<<' `%') rather than incorrrectly | |
615 | (as `<' `<%'). */ | |
616 | "<"{splice}"<" STRING_GROW; | |
617 | ||
618 | "$"("<"{tag}">")?(-?[0-9]+|"$") handle_dollar (token_type, yytext, *loc); | |
619 | "@"(-?[0-9]+|"$") handle_at (token_type, yytext, *loc); | |
620 | ||
621 | "$" { | |
622 | warn_at (*loc, _("stray `$'")); | |
623 | obstack_sgrow (&obstack_for_string, "$]["); | |
624 | } | |
625 | "@" { | |
626 | warn_at (*loc, _("stray `@'")); | |
627 | obstack_sgrow (&obstack_for_string, "@@"); | |
628 | } | |
629 | ||
630 | <<EOF>> unexpected_eof (code_start, "}"); BEGIN INITIAL; | |
631 | } | |
632 | ||
633 | ||
634 | /*--------------------------------------------------------------. | |
635 | | Scanning some prologue: from "%{" (already scanned) to "%}". | | |
636 | `--------------------------------------------------------------*/ | |
637 | ||
638 | <SC_PROLOGUE> | |
639 | { | |
640 | "%}" { | |
641 | STRING_FINISH; | |
642 | loc->start = code_start; | |
643 | val->chars = last_string; | |
644 | BEGIN INITIAL; | |
645 | return PROLOGUE; | |
646 | } | |
647 | ||
648 | <<EOF>> unexpected_eof (code_start, "%}"); BEGIN INITIAL; | |
649 | } | |
650 | ||
651 | ||
652 | /*---------------------------------------------------------------. | |
653 | | Scanning the epilogue (everything after the second "%%", which | | |
654 | | has already been eaten). | | |
655 | `---------------------------------------------------------------*/ | |
656 | ||
657 | <SC_EPILOGUE> | |
658 | { | |
659 | <<EOF>> { | |
660 | STRING_FINISH; | |
661 | loc->start = code_start; | |
662 | val->chars = last_string; | |
663 | BEGIN INITIAL; | |
664 | return EPILOGUE; | |
665 | } | |
666 | } | |
667 | ||
668 | ||
669 | /*-----------------------------------------. | |
670 | | Escape M4 quoting characters in C code. | | |
671 | `-----------------------------------------*/ | |
672 | ||
673 | <SC_COMMENT,SC_LINE_COMMENT,SC_STRING,SC_CHARACTER,SC_BRACED_CODE,SC_PROLOGUE,SC_EPILOGUE> | |
674 | { | |
675 | \$ obstack_sgrow (&obstack_for_string, "$]["); | |
676 | \@ obstack_sgrow (&obstack_for_string, "@@"); | |
677 | \[ obstack_sgrow (&obstack_for_string, "@{"); | |
678 | \] obstack_sgrow (&obstack_for_string, "@}"); | |
679 | } | |
680 | ||
681 | ||
682 | /*-----------------------------------------------------. | |
683 | | By default, grow the string obstack with the input. | | |
684 | `-----------------------------------------------------*/ | |
685 | ||
686 | <SC_COMMENT,SC_LINE_COMMENT,SC_BRACED_CODE,SC_PROLOGUE,SC_EPILOGUE,SC_STRING,SC_CHARACTER,SC_ESCAPED_STRING,SC_ESCAPED_CHARACTER>. | | |
687 | <SC_COMMENT,SC_LINE_COMMENT,SC_BRACED_CODE,SC_PROLOGUE,SC_EPILOGUE>\n STRING_GROW; | |
688 | ||
689 | %% | |
690 | ||
691 | /* Keeps track of the maximum number of semantic values to the left of | |
692 | a handle (those referenced by $0, $-1, etc.) are required by the | |
693 | semantic actions of this grammar. */ | |
694 | int max_left_semantic_context = 0; | |
695 | ||
696 | /* Set *LOC and adjust scanner cursor to account for token TOKEN of | |
697 | size SIZE. */ | |
698 | ||
699 | static void | |
700 | adjust_location (location *loc, char const *token, size_t size) | |
701 | { | |
702 | int line = scanner_cursor.line; | |
703 | int column = scanner_cursor.column; | |
704 | char const *p0 = token; | |
705 | char const *p = token; | |
706 | char const *lim = token + size; | |
707 | ||
708 | loc->start = scanner_cursor; | |
709 | ||
710 | for (p = token; p < lim; p++) | |
711 | switch (*p) | |
712 | { | |
713 | case '\n': | |
714 | line++; | |
715 | column = 1; | |
716 | p0 = p + 1; | |
717 | break; | |
718 | ||
719 | case '\t': | |
720 | column += mbsnwidth (p0, p - p0, 0); | |
721 | column += 8 - ((column - 1) & 7); | |
722 | p0 = p + 1; | |
723 | break; | |
724 | } | |
725 | ||
726 | scanner_cursor.line = line; | |
727 | scanner_cursor.column = column + mbsnwidth (p0, p - p0, 0); | |
728 | ||
729 | loc->end = scanner_cursor; | |
730 | } | |
731 | ||
732 | ||
733 | /* Read bytes from FP into buffer BUF of size SIZE. Return the | |
734 | number of bytes read. Remove '\r' from input, treating \r\n | |
735 | and isolated \r as \n. */ | |
736 | ||
737 | static size_t | |
738 | no_cr_read (FILE *fp, char *buf, size_t size) | |
739 | { | |
740 | size_t bytes_read = fread (buf, 1, size, fp); | |
741 | if (bytes_read) | |
742 | { | |
743 | char *w = memchr (buf, '\r', bytes_read); | |
744 | if (w) | |
745 | { | |
746 | char const *r = ++w; | |
747 | char const *lim = buf + bytes_read; | |
748 | ||
749 | for (;;) | |
750 | { | |
751 | /* Found an '\r'. Treat it like '\n', but ignore any | |
752 | '\n' that immediately follows. */ | |
753 | w[-1] = '\n'; | |
754 | if (r == lim) | |
755 | { | |
756 | int ch = getc (fp); | |
757 | if (ch != '\n' && ungetc (ch, fp) != ch) | |
758 | break; | |
759 | } | |
760 | else if (*r == '\n') | |
761 | r++; | |
762 | ||
763 | /* Copy until the next '\r'. */ | |
764 | do | |
765 | { | |
766 | if (r == lim) | |
767 | return w - buf; | |
768 | } | |
769 | while ((*w++ = *r++) != '\r'); | |
770 | } | |
771 | ||
772 | return w - buf; | |
773 | } | |
774 | } | |
775 | ||
776 | return bytes_read; | |
777 | } | |
778 | ||
779 | ||
780 | /*------------------------------------------------------------------. | |
781 | | TEXT is pointing to a wannabee semantic value (i.e., a `$'). | | |
782 | | | | |
783 | | Possible inputs: $[<TYPENAME>]($|integer) | | |
784 | | | | |
785 | | Output to OBSTACK_FOR_STRING a reference to this semantic value. | | |
786 | `------------------------------------------------------------------*/ | |
787 | ||
788 | static inline bool | |
789 | handle_action_dollar (char *text, location loc) | |
790 | { | |
791 | const char *type_name = NULL; | |
792 | char *cp = text + 1; | |
793 | ||
794 | if (! current_rule) | |
795 | return false; | |
796 | ||
797 | /* Get the type name if explicit. */ | |
798 | if (*cp == '<') | |
799 | { | |
800 | type_name = ++cp; | |
801 | while (*cp != '>') | |
802 | ++cp; | |
803 | *cp = '\0'; | |
804 | ++cp; | |
805 | } | |
806 | ||
807 | if (*cp == '$') | |
808 | { | |
809 | if (!type_name) | |
810 | type_name = symbol_list_n_type_name_get (current_rule, loc, 0); | |
811 | if (!type_name && typed) | |
812 | complain_at (loc, _("$$ of `%s' has no declared type"), | |
813 | current_rule->sym->tag); | |
814 | if (!type_name) | |
815 | type_name = ""; | |
816 | obstack_fgrow1 (&obstack_for_string, | |
817 | "]b4_lhs_value([%s])[", type_name); | |
818 | } | |
819 | else | |
820 | { | |
821 | long int num; | |
822 | set_errno (0); | |
823 | num = strtol (cp, 0, 10); | |
824 | ||
825 | if (INT_MIN <= num && num <= rule_length && ! get_errno ()) | |
826 | { | |
827 | int n = num; | |
828 | if (1-n > max_left_semantic_context) | |
829 | max_left_semantic_context = 1-n; | |
830 | if (!type_name && n > 0) | |
831 | type_name = symbol_list_n_type_name_get (current_rule, loc, n); | |
832 | if (!type_name && typed) | |
833 | complain_at (loc, _("$%d of `%s' has no declared type"), | |
834 | n, current_rule->sym->tag); | |
835 | if (!type_name) | |
836 | type_name = ""; | |
837 | obstack_fgrow3 (&obstack_for_string, | |
838 | "]b4_rhs_value(%d, %d, [%s])[", | |
839 | rule_length, n, type_name); | |
840 | } | |
841 | else | |
842 | complain_at (loc, _("integer out of range: %s"), quote (text)); | |
843 | } | |
844 | ||
845 | return true; | |
846 | } | |
847 | ||
848 | ||
849 | /*----------------------------------------------------------------. | |
850 | | Map `$?' onto the proper M4 symbol, depending on its TOKEN_TYPE | | |
851 | | (are we in an action?). | | |
852 | `----------------------------------------------------------------*/ | |
853 | ||
854 | static void | |
855 | handle_dollar (int token_type, char *text, location loc) | |
856 | { | |
857 | switch (token_type) | |
858 | { | |
859 | case BRACED_CODE: | |
860 | if (handle_action_dollar (text, loc)) | |
861 | return; | |
862 | break; | |
863 | ||
864 | case PERCENT_DESTRUCTOR: | |
865 | case PERCENT_INITIAL_ACTION: | |
866 | case PERCENT_PRINTER: | |
867 | if (text[1] == '$') | |
868 | { | |
869 | obstack_sgrow (&obstack_for_string, "]b4_dollar_dollar["); | |
870 | return; | |
871 | } | |
872 | break; | |
873 | ||
874 | default: | |
875 | break; | |
876 | } | |
877 | ||
878 | complain_at (loc, _("invalid value: %s"), quote (text)); | |
879 | } | |
880 | ||
881 | ||
882 | /*------------------------------------------------------. | |
883 | | TEXT is a location token (i.e., a `@...'). Output to | | |
884 | | OBSTACK_FOR_STRING a reference to this location. | | |
885 | `------------------------------------------------------*/ | |
886 | ||
887 | static inline bool | |
888 | handle_action_at (char *text, location loc) | |
889 | { | |
890 | char *cp = text + 1; | |
891 | locations_flag = true; | |
892 | ||
893 | if (! current_rule) | |
894 | return false; | |
895 | ||
896 | if (*cp == '$') | |
897 | obstack_sgrow (&obstack_for_string, "]b4_lhs_location["); | |
898 | else | |
899 | { | |
900 | long int num; | |
901 | set_errno (0); | |
902 | num = strtol (cp, 0, 10); | |
903 | ||
904 | if (INT_MIN <= num && num <= rule_length && ! get_errno ()) | |
905 | { | |
906 | int n = num; | |
907 | obstack_fgrow2 (&obstack_for_string, "]b4_rhs_location(%d, %d)[", | |
908 | rule_length, n); | |
909 | } | |
910 | else | |
911 | complain_at (loc, _("integer out of range: %s"), quote (text)); | |
912 | } | |
913 | ||
914 | return true; | |
915 | } | |
916 | ||
917 | ||
918 | /*----------------------------------------------------------------. | |
919 | | Map `@?' onto the proper M4 symbol, depending on its TOKEN_TYPE | | |
920 | | (are we in an action?). | | |
921 | `----------------------------------------------------------------*/ | |
922 | ||
923 | static void | |
924 | handle_at (int token_type, char *text, location loc) | |
925 | { | |
926 | switch (token_type) | |
927 | { | |
928 | case BRACED_CODE: | |
929 | handle_action_at (text, loc); | |
930 | return; | |
931 | ||
932 | case PERCENT_INITIAL_ACTION: | |
933 | case PERCENT_DESTRUCTOR: | |
934 | case PERCENT_PRINTER: | |
935 | if (text[1] == '$') | |
936 | { | |
937 | obstack_sgrow (&obstack_for_string, "]b4_at_dollar["); | |
938 | return; | |
939 | } | |
940 | break; | |
941 | ||
942 | default: | |
943 | break; | |
944 | } | |
945 | ||
946 | complain_at (loc, _("invalid value: %s"), quote (text)); | |
947 | } | |
948 | ||
949 | ||
950 | /*------------------------------------------------------. | |
951 | | Scan NUMBER for a base-BASE integer at location LOC. | | |
952 | `------------------------------------------------------*/ | |
953 | ||
954 | static unsigned long int | |
955 | scan_integer (char const *number, int base, location loc) | |
956 | { | |
957 | unsigned long int num; | |
958 | set_errno (0); | |
959 | num = strtoul (number, 0, base); | |
960 | if (INT_MAX < num || get_errno ()) | |
961 | { | |
962 | complain_at (loc, _("integer out of range: %s"), quote (number)); | |
963 | num = INT_MAX; | |
964 | } | |
965 | return num; | |
966 | } | |
967 | ||
968 | ||
969 | /*------------------------------------------------------------------. | |
970 | | Convert universal character name UCN to a single-byte character, | | |
971 | | and return that character. Return -1 if UCN does not correspond | | |
972 | | to a single-byte character. | | |
973 | `------------------------------------------------------------------*/ | |
974 | ||
975 | static int | |
976 | convert_ucn_to_byte (char const *ucn) | |
977 | { | |
978 | unsigned long int code = strtoul (ucn + 2, 0, 16); | |
979 | ||
980 | /* FIXME: Currently we assume Unicode-compatible unibyte characters | |
981 | on ASCII hosts (i.e., Latin-1 on hosts with 8-bit bytes). On | |
982 | non-ASCII hosts we support only the portable C character set. | |
983 | These limitations should be removed once we add support for | |
984 | multibyte characters. */ | |
985 | ||
986 | if (UCHAR_MAX < code) | |
987 | return -1; | |
988 | ||
989 | #if ! ('$' == 0x24 && '@' == 0x40 && '`' == 0x60 && '~' == 0x7e) | |
990 | { | |
991 | /* A non-ASCII host. Use CODE to index into a table of the C | |
992 | basic execution character set, which is guaranteed to exist on | |
993 | all Standard C platforms. This table also includes '$', '@', | |
994 | and '`', which are not in the basic execution character set but | |
995 | which are unibyte characters on all the platforms that we know | |
996 | about. */ | |
997 | static signed char const table[] = | |
998 | { | |
999 | '\0', -1, -1, -1, -1, -1, -1, '\a', | |
1000 | '\b', '\t', '\n', '\v', '\f', '\r', -1, -1, | |
1001 | -1, -1, -1, -1, -1, -1, -1, -1, | |
1002 | -1, -1, -1, -1, -1, -1, -1, -1, | |
1003 | ' ', '!', '"', '#', '$', '%', '&', '\'', | |
1004 | '(', ')', '*', '+', ',', '-', '.', '/', | |
1005 | '0', '1', '2', '3', '4', '5', '6', '7', | |
1006 | '8', '9', ':', ';', '<', '=', '>', '?', | |
1007 | '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', | |
1008 | 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', | |
1009 | 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', | |
1010 | 'X', 'Y', 'Z', '[', '\\', ']', '^', '_', | |
1011 | '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', | |
1012 | 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', | |
1013 | 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', | |
1014 | 'x', 'y', 'z', '{', '|', '}', '~' | |
1015 | }; | |
1016 | ||
1017 | code = code < sizeof table ? table[code] : -1; | |
1018 | } | |
1019 | #endif | |
1020 | ||
1021 | return code; | |
1022 | } | |
1023 | ||
1024 | ||
1025 | /*----------------------------------------------------------------. | |
1026 | | Handle `#line INT "FILE"'. ARGS has already skipped `#line '. | | |
1027 | `----------------------------------------------------------------*/ | |
1028 | ||
1029 | static void | |
1030 | handle_syncline (char *args) | |
1031 | { | |
1032 | int lineno = strtol (args, &args, 10); | |
1033 | const char *file = NULL; | |
1034 | file = strchr (args, '"') + 1; | |
1035 | *strchr (file, '"') = 0; | |
1036 | scanner_cursor.file = current_file = uniqstr_new (file); | |
1037 | scanner_cursor.line = lineno; | |
1038 | scanner_cursor.column = 1; | |
1039 | } | |
1040 | ||
1041 | ||
1042 | /*----------------------------------------------------------------. | |
1043 | | For a token or comment starting at START, report message MSGID, | | |
1044 | | which should say that an end marker was found before | | |
1045 | | the expected TOKEN_END. | | |
1046 | `----------------------------------------------------------------*/ | |
1047 | ||
1048 | static void | |
1049 | unexpected_end (boundary start, char const *msgid, char const *token_end) | |
1050 | { | |
1051 | location loc; | |
1052 | loc.start = start; | |
1053 | loc.end = scanner_cursor; | |
1054 | complain_at (loc, _(msgid), token_end); | |
1055 | } | |
1056 | ||
1057 | ||
1058 | /*------------------------------------------------------------------------. | |
1059 | | Report an unexpected EOF in a token or comment starting at START. | | |
1060 | | An end of file was encountered and the expected TOKEN_END was missing. | | |
1061 | `------------------------------------------------------------------------*/ | |
1062 | ||
1063 | static void | |
1064 | unexpected_eof (boundary start, char const *token_end) | |
1065 | { | |
1066 | unexpected_end (start, N_("missing `%s' at end of file"), token_end); | |
1067 | } | |
1068 | ||
1069 | ||
1070 | /*----------------------------------------. | |
1071 | | Likewise, but for unexpected newlines. | | |
1072 | `----------------------------------------*/ | |
1073 | ||
1074 | static void | |
1075 | unexpected_newline (boundary start, char const *token_end) | |
1076 | { | |
1077 | unexpected_end (start, N_("missing `%s' at end of line"), token_end); | |
1078 | } | |
1079 | ||
1080 | ||
1081 | /*-------------------------. | |
1082 | | Initialize the scanner. | | |
1083 | `-------------------------*/ | |
1084 | ||
1085 | void | |
1086 | scanner_initialize (void) | |
1087 | { | |
1088 | obstack_init (&obstack_for_string); | |
1089 | } | |
1090 | ||
1091 | ||
1092 | /*-----------------------------------------------. | |
1093 | | Free all the memory allocated to the scanner. | | |
1094 | `-----------------------------------------------*/ | |
1095 | ||
1096 | void | |
1097 | scanner_free (void) | |
1098 | { | |
1099 | obstack_free (&obstack_for_string, 0); | |
1100 | /* Reclaim Flex's buffers. */ | |
1101 | yy_delete_buffer (YY_CURRENT_BUFFER); | |
1102 | } |