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