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