/* Bison Grammar Scanner -*- C -*- Copyright (C) 2002-2012 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ %option debug nodefault noinput noyywrap never-interactive %option prefix="gram_" outfile="lex.yy.c" %{ /* Work around a bug in flex 2.5.31. See Debian bug 333231 . */ #undef gram_wrap #define gram_wrap() 1 #define FLEX_PREFIX(Id) gram_ ## Id #include #include #include #include #include #include #include #include #include #include #include #include #define YY_DECL GRAM_LEX_DECL #define YY_USER_INIT \ code_start = scanner_cursor = loc->start; \ /* Location of scanner cursor. */ static boundary scanner_cursor; #define YY_USER_ACTION location_compute (loc, &scanner_cursor, yytext, yyleng); static size_t no_cr_read (FILE *, char *, size_t); #define YY_INPUT(buf, result, size) ((result) = no_cr_read (yyin, buf, size)) #define RETURN_PERCENT_PARAM(Value) \ RETURN_VALUE(PERCENT_PARAM, param, param_ ## Value) #define RETURN_PERCENT_FLAG(Value) \ RETURN_VALUE(PERCENT_FLAG, uniqstr, uniqstr_new (Value)) #define RETURN_VALUE(Token, Field, Value) \ do { \ val->Field = Value; \ return Token; \ } while (0) #define ROLLBACK_CURRENT_TOKEN \ do { \ scanner_cursor.column -= mbsnwidth (yytext, yyleng, 0); \ yyless (0); \ } while (0) #define DEPRECATED(Msg) \ do { \ size_t i; \ complain (loc, Wdeprecated, \ _("deprecated directive: %s, use %s"), \ quote (yytext), quote_n (1, Msg)); \ scanner_cursor.column -= mbsnwidth (Msg, strlen (Msg), 0); \ for (i = strlen (Msg); i != 0; --i) \ unput (Msg[i - 1]); \ } while (0) /* A string representing the most recently saved token. */ static char *last_string; /* Bracketed identifier. */ static uniqstr bracketed_id_str = 0; static location bracketed_id_loc; static boundary bracketed_id_start; static int bracketed_id_context_state = 0; void gram_scanner_last_string_free (void) { STRING_FREE; } static void handle_syncline (char *, location); static unsigned long int scan_integer (char const *p, int base, location loc); static int convert_ucn_to_byte (char const *hex_text); static void unexpected_eof (boundary, char const *); static void unexpected_newline (boundary, char const *); %} /* A C-like comment in directives/rules. */ %x SC_YACC_COMMENT /* Strings and characters in directives/rules. */ %x SC_ESCAPED_STRING SC_ESCAPED_CHARACTER /* A identifier was just read in directives/rules. Special state to capture the sequence 'identifier :'. */ %x SC_AFTER_IDENTIFIER /* A complex tag, with nested angles brackets. */ %x SC_TAG /* Four types of user code: - prologue (code between '%{' '%}' in the first section, before %%); - actions, printers, union, etc, (between braced in the middle section); - epilogue (everything after the second %%). - predicate (code between '%?{' and '{' in middle section); */ %x SC_PROLOGUE SC_BRACED_CODE SC_EPILOGUE SC_PREDICATE /* C and C++ comments in code. */ %x SC_COMMENT SC_LINE_COMMENT /* Strings and characters in code. */ %x SC_STRING SC_CHARACTER /* Bracketed identifiers support. */ %x SC_BRACKETED_ID SC_RETURN_BRACKETED_ID letter [.abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_] notletter [^.abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_]{-}[%\{] id {letter}({letter}|[-0-9])* int [0-9]+ /* POSIX says that a tag must be both an id and a C union member, but historically almost any character is allowed in a tag. We disallow NUL, as this simplifies our implementation. We disallow angle bracket to match them in nested pairs: several languages use them for generics/template types. */ tag [^\0<>]+ /* Zero or more instances of backslash-newline. Following GCC, allow white space between the backslash and the newline. */ splice (\\[ \f\t\v]*\n)* /* An equal sign, with optional leading whitespaces. This is used in some deprecated constructs. */ eqopt ([[:space:]]*=)? %% %{ /* Nesting level. Either for nested braces, or nested angle brackets (but not mixed). */ int nesting PACIFY_CC (= 0); /* Parent context state, when applicable. */ int context_state PACIFY_CC (= 0); /* Location of most recent identifier, when applicable. */ location id_loc PACIFY_CC (= empty_location); /* Where containing code started, when applicable. Its initial value is relevant only when yylex is invoked in the SC_EPILOGUE start condition. */ boundary code_start = scanner_cursor; /* Where containing comment or string or character literal started, when applicable. */ boundary token_start PACIFY_CC (= scanner_cursor); %} /*-----------------------. | Scanning white space. | `-----------------------*/ { /* Comments and white space. */ "," { complain (loc, Wother, _("stray ',' treated as white space")); } [ \f\n\t\v] | "//".* continue; "/*" { token_start = loc->start; context_state = YY_START; BEGIN SC_YACC_COMMENT; } /* #line directives are not documented, and may be withdrawn or modified in future versions of Bison. */ ^"#line "{int}(" \"".*"\"")?"\n" { handle_syncline (yytext + sizeof "#line " - 1, *loc); } } /*----------------------------. | Scanning Bison directives. | `----------------------------*/ /* For directives that are also command line options, the regex must be "%..." after "[-_]"s are removed, and the directive must match the --long option name, with a single string argument. Otherwise, add exceptions to ../build-aux/cross-options.pl. */ { "%binary" return PERCENT_NONASSOC; "%code" return PERCENT_CODE; "%debug" RETURN_PERCENT_FLAG("parse.trace"); "%default-prec" return PERCENT_DEFAULT_PREC; "%define" return PERCENT_DEFINE; "%defines" return PERCENT_DEFINES; "%destructor" return PERCENT_DESTRUCTOR; "%dprec" return PERCENT_DPREC; "%error-verbose" return PERCENT_ERROR_VERBOSE; "%expect" return PERCENT_EXPECT; "%expect-rr" return PERCENT_EXPECT_RR; "%file-prefix" return PERCENT_FILE_PREFIX; "%fixed-output-files" return PERCENT_YACC; "%initial-action" return PERCENT_INITIAL_ACTION; "%glr-parser" return PERCENT_GLR_PARSER; "%language" return PERCENT_LANGUAGE; "%left" return PERCENT_LEFT; "%lex-param" RETURN_PERCENT_PARAM(lex); "%locations" RETURN_PERCENT_FLAG("locations"); "%merge" return PERCENT_MERGE; "%name-prefix" return PERCENT_NAME_PREFIX; "%no-default-prec" return PERCENT_NO_DEFAULT_PREC; "%no-lines" return PERCENT_NO_LINES; "%nonassoc" return PERCENT_NONASSOC; "%nondeterministic-parser" return PERCENT_NONDETERMINISTIC_PARSER; "%nterm" return PERCENT_NTERM; "%output" return PERCENT_OUTPUT; "%param" RETURN_PERCENT_PARAM(both); "%parse-param" RETURN_PERCENT_PARAM(parse); "%prec" return PERCENT_PREC; "%precedence" return PERCENT_PRECEDENCE; "%printer" return PERCENT_PRINTER; "%pure-parser" RETURN_PERCENT_FLAG("api.pure"); "%require" return PERCENT_REQUIRE; "%right" return PERCENT_RIGHT; "%skeleton" return PERCENT_SKELETON; "%start" return PERCENT_START; "%term" return PERCENT_TOKEN; "%token" return PERCENT_TOKEN; "%token-table" return PERCENT_TOKEN_TABLE; "%type" return PERCENT_TYPE; "%union" return PERCENT_UNION; "%verbose" return PERCENT_VERBOSE; "%yacc" return PERCENT_YACC; /* deprecated */ "%default"[-_]"prec" DEPRECATED("%default-prec"); "%error"[-_]"verbose" DEPRECATED("%define parse.error verbose"); "%expect"[-_]"rr" DEPRECATED("%expect-rr"); "%file-prefix"{eqopt} DEPRECATED("%file-prefix"); "%fixed"[-_]"output"[-_]"files" DEPRECATED("%fixed-output-files"); "%name"[-_]"prefix"{eqopt} DEPRECATED("%name-prefix"); "%no"[-_]"default"[-_]"prec" DEPRECATED("%no-default-prec"); "%no"[-_]"lines" DEPRECATED("%no-lines"); "%output"{eqopt} DEPRECATED("%output"); "%pure"[-_]"parser" DEPRECATED("%pure-parser"); "%token"[-_]"table" DEPRECATED("%token-table"); "%"{id}|"%"{notletter}([[:graph:]])+ { complain (loc, complaint, _("invalid directive: %s"), quote (yytext)); } "=" return EQUAL; "|" return PIPE; ";" return SEMICOLON; {id} { val->uniqstr = uniqstr_new (yytext); id_loc = *loc; bracketed_id_str = NULL; BEGIN SC_AFTER_IDENTIFIER; } {int} { val->integer = scan_integer (yytext, 10, *loc); return INT; } 0[xX][0-9abcdefABCDEF]+ { val->integer = scan_integer (yytext, 16, *loc); return INT; } /* Identifiers may not start with a digit. Yet, don't silently accept "1FOO" as "1 FOO". */ {int}{id} { complain (loc, complaint, _("invalid identifier: %s"), quote (yytext)); } /* Characters. */ "'" token_start = loc->start; BEGIN SC_ESCAPED_CHARACTER; /* Strings. */ "\"" token_start = loc->start; BEGIN SC_ESCAPED_STRING; /* Prologue. */ "%{" code_start = loc->start; BEGIN SC_PROLOGUE; /* Code in between braces. */ "{" { STRING_GROW; nesting = 0; code_start = loc->start; BEGIN SC_BRACED_CODE; } /* Semantic predicate. */ "%?"[ \f\n\t\v]*"{" { nesting = 0; code_start = loc->start; BEGIN SC_PREDICATE; } /* A type. */ "<*>" return TAG_ANY; "<>" return TAG_NONE; "<"{tag}">" { obstack_grow (&obstack_for_string, yytext + 1, yyleng - 2); STRING_FINISH; val->uniqstr = uniqstr_new (last_string); STRING_FREE; return TAG; } "<" { nesting = 0; token_start = loc->start; BEGIN SC_TAG; } "%%" { static int percent_percent_count; if (++percent_percent_count == 2) BEGIN SC_EPILOGUE; return PERCENT_PERCENT; } "[" { bracketed_id_str = NULL; bracketed_id_start = loc->start; bracketed_id_context_state = YY_START; BEGIN SC_BRACKETED_ID; } [^\[%A-Za-z0-9_<>{}\"\'*;|=/, \f\n\t\v]+|. { complain (loc, complaint, "%s: %s", ngettext ("invalid character", "invalid characters", yyleng), quote_mem (yytext, yyleng)); } <> { loc->start = loc->end = scanner_cursor; yyterminate (); } } /*--------------------------------------------------------------. | Supporting \0 complexifies our implementation for no expected | | added value. | `--------------------------------------------------------------*/ { \0 complain (loc, complaint, _("invalid null character")); } /*-----------------------------------------------------------------. | Scanning after an identifier, checking whether a colon is next. | `-----------------------------------------------------------------*/ { "[" { if (bracketed_id_str) { ROLLBACK_CURRENT_TOKEN; BEGIN SC_RETURN_BRACKETED_ID; *loc = id_loc; return ID; } else { bracketed_id_start = loc->start; bracketed_id_context_state = YY_START; BEGIN SC_BRACKETED_ID; } } ":" { BEGIN (bracketed_id_str ? SC_RETURN_BRACKETED_ID : INITIAL); *loc = id_loc; return ID_COLON; } . { ROLLBACK_CURRENT_TOKEN; BEGIN (bracketed_id_str ? SC_RETURN_BRACKETED_ID : INITIAL); *loc = id_loc; return ID; } <> { BEGIN (bracketed_id_str ? SC_RETURN_BRACKETED_ID : INITIAL); *loc = id_loc; return ID; } } /*--------------------------------. | Scanning bracketed identifiers. | `--------------------------------*/ { {id} { if (bracketed_id_str) { complain (loc, complaint, _("unexpected identifier in bracketed name: %s"), quote (yytext)); } else { bracketed_id_str = uniqstr_new (yytext); bracketed_id_loc = *loc; } } "]" { BEGIN bracketed_id_context_state; if (bracketed_id_str) { if (INITIAL == bracketed_id_context_state) { val->uniqstr = bracketed_id_str; bracketed_id_str = 0; *loc = bracketed_id_loc; return BRACKETED_ID; } } else complain (loc, complaint, _("an identifier expected")); } [^\].A-Za-z0-9_/ \f\n\t\v]+|. { complain (loc, complaint, "%s: %s", ngettext ("invalid character in bracketed name", "invalid characters in bracketed name", yyleng), quote_mem (yytext, yyleng)); } <> { BEGIN bracketed_id_context_state; unexpected_eof (bracketed_id_start, "]"); } } { . { ROLLBACK_CURRENT_TOKEN; val->uniqstr = bracketed_id_str; bracketed_id_str = 0; *loc = bracketed_id_loc; BEGIN INITIAL; return BRACKETED_ID; } } /*---------------------------------------------------------------. | Scanning a Yacc comment. The initial '/ *' is already eaten. | `---------------------------------------------------------------*/ { "*/" BEGIN context_state; .|\n continue; <> unexpected_eof (token_start, "*/"); BEGIN context_state; } /*------------------------------------------------------------. | Scanning a C comment. The initial '/ *' is already eaten. | `------------------------------------------------------------*/ { "*"{splice}"/" STRING_GROW; BEGIN context_state; <> unexpected_eof (token_start, "*/"); BEGIN context_state; } /*--------------------------------------------------------------. | Scanning a line comment. The initial '//' is already eaten. | `--------------------------------------------------------------*/ { "\n" STRING_GROW; BEGIN context_state; {splice} STRING_GROW; <> BEGIN context_state; } /*------------------------------------------------. | Scanning a Bison string, including its escapes. | | The initial quote is already eaten. | `------------------------------------------------*/ { "\""|"\n" { if (yytext[0] == '\n') unexpected_newline (token_start, "\""); STRING_FINISH; loc->start = token_start; val->chars = last_string; BEGIN INITIAL; return STRING; } <> { unexpected_eof (token_start, "\""); STRING_FINISH; loc->start = token_start; val->chars = last_string; BEGIN INITIAL; return STRING; } } /*----------------------------------------------------------. | Scanning a Bison character literal, decoding its escapes. | | The initial quote is already eaten. | `----------------------------------------------------------*/ { "'"|"\n" { STRING_FINISH; loc->start = token_start; val->character = last_string[0]; { /* FIXME: Eventually, make these errors. */ if (last_string[0] == '\0') { complain (loc, Wother, _("empty character literal")); /* '\0' seems dangerous even if we are about to complain. */ val->character = '\''; } else if (last_string[1] != '\0') complain (loc, Wother, _("extra characters in character literal")); } if (yytext[0] == '\n') unexpected_newline (token_start, "'"); STRING_FREE; BEGIN INITIAL; return CHAR; } <> { STRING_FINISH; loc->start = token_start; val->character = last_string[0]; { /* FIXME: Eventually, make these errors. */ if (last_string[0] == '\0') { complain (loc, Wother, _("empty character literal")); /* '\0' seems dangerous even if we are about to complain. */ val->character = '\''; } else if (last_string[1] != '\0') complain (loc, Wother, _("extra characters in character literal")); } unexpected_eof (token_start, "'"); STRING_FREE; BEGIN INITIAL; return CHAR; } } /*-----------------------------------------------------------. | Scanning a Bison nested tag. The initial angle bracket is | | already eaten. | `-----------------------------------------------------------*/ { ">" { --nesting; if (nesting < 0) { STRING_FINISH; loc->start = token_start; val->uniqstr = uniqstr_new (last_string); STRING_FREE; BEGIN INITIAL; return TAG; } STRING_GROW; } [^<>]+ STRING_GROW; "<"+ STRING_GROW; nesting += yyleng; <> { unexpected_eof (token_start, ">"); STRING_FINISH; loc->start = token_start; val->uniqstr = uniqstr_new (last_string); STRING_FREE; BEGIN INITIAL; return TAG; } } /*----------------------------. | Decode escaped characters. | `----------------------------*/ { \\[0-7]{1,3} { unsigned long int c = strtoul (yytext + 1, NULL, 8); if (!c || UCHAR_MAX < c) complain (loc, complaint, _("invalid number after \\-escape: %s"), yytext+1); else obstack_1grow (&obstack_for_string, c); } \\x[0-9abcdefABCDEF]+ { verify (UCHAR_MAX < ULONG_MAX); unsigned long int c = strtoul (yytext + 2, NULL, 16); if (!c || UCHAR_MAX < c) complain (loc, complaint, _("invalid number after \\-escape: %s"), yytext+1); else obstack_1grow (&obstack_for_string, c); } \\a obstack_1grow (&obstack_for_string, '\a'); \\b obstack_1grow (&obstack_for_string, '\b'); \\f obstack_1grow (&obstack_for_string, '\f'); \\n obstack_1grow (&obstack_for_string, '\n'); \\r obstack_1grow (&obstack_for_string, '\r'); \\t obstack_1grow (&obstack_for_string, '\t'); \\v obstack_1grow (&obstack_for_string, '\v'); /* \\[\"\'?\\] would be shorter, but it confuses xgettext. */ \\("\""|"'"|"?"|"\\") obstack_1grow (&obstack_for_string, yytext[1]); \\(u|U[0-9abcdefABCDEF]{4})[0-9abcdefABCDEF]{4} { int c = convert_ucn_to_byte (yytext); if (c <= 0) complain (loc, complaint, _("invalid number after \\-escape: %s"), yytext+1); else obstack_1grow (&obstack_for_string, c); } \\(.|\n) { char const *p = yytext + 1; /* Quote only if escaping won't make the character visible. */ if (c_isspace ((unsigned char) *p) && c_isprint ((unsigned char) *p)) p = quote (p); else p = quotearg_style_mem (escape_quoting_style, p, 1); complain (loc, complaint, _("invalid character after \\-escape: %s"), p); } } /*--------------------------------------------. | Scanning user-code characters and strings. | `--------------------------------------------*/ { {splice}|\\{splice}[^\n\[\]] STRING_GROW; } { "'" STRING_GROW; BEGIN context_state; \n unexpected_newline (token_start, "'"); BEGIN context_state; <> unexpected_eof (token_start, "'"); BEGIN context_state; } { "\"" STRING_GROW; BEGIN context_state; \n unexpected_newline (token_start, "\""); BEGIN context_state; <> unexpected_eof (token_start, "\""); BEGIN context_state; } /*---------------------------------------------------. | Strings, comments etc. can be found in user code. | `---------------------------------------------------*/ { "'" { STRING_GROW; context_state = YY_START; token_start = loc->start; BEGIN SC_CHARACTER; } "\"" { STRING_GROW; context_state = YY_START; token_start = loc->start; BEGIN SC_STRING; } "/"{splice}"*" { STRING_GROW; context_state = YY_START; token_start = loc->start; BEGIN SC_COMMENT; } "/"{splice}"/" { STRING_GROW; context_state = YY_START; BEGIN SC_LINE_COMMENT; } } /*-----------------------------------------------------------. | Scanning some code in braces (actions, predicates). The | | initial "{" is already eaten. | `-----------------------------------------------------------*/ { "{"|"<"{splice}"%" STRING_GROW; nesting++; "%"{splice}">" STRING_GROW; nesting--; /* Tokenize '<<%' correctly (as '<<' '%') rather than incorrrectly (as '<' '<%'). */ "<"{splice}"<" STRING_GROW; <> { int token = (YY_START == SC_BRACED_CODE) ? BRACED_CODE : BRACED_PREDICATE; unexpected_eof (code_start, "}"); STRING_FINISH; loc->start = code_start; val->code = last_string; BEGIN INITIAL; return token; } } { "}" { obstack_1grow (&obstack_for_string, '}'); --nesting; if (nesting < 0) { STRING_FINISH; loc->start = code_start; val->code = last_string; BEGIN INITIAL; return BRACED_CODE; } } } { "}" { --nesting; if (nesting < 0) { STRING_FINISH; loc->start = code_start; val->code = last_string; BEGIN INITIAL; return BRACED_PREDICATE; } else obstack_1grow (&obstack_for_string, '}'); } } /*--------------------------------------------------------------. | Scanning some prologue: from "%{" (already scanned) to "%}". | `--------------------------------------------------------------*/ { "%}" { STRING_FINISH; loc->start = code_start; val->chars = last_string; BEGIN INITIAL; return PROLOGUE; } <> { unexpected_eof (code_start, "%}"); STRING_FINISH; loc->start = code_start; val->chars = last_string; BEGIN INITIAL; return PROLOGUE; } } /*---------------------------------------------------------------. | Scanning the epilogue (everything after the second "%%", which | | has already been eaten). | `---------------------------------------------------------------*/ { <> { STRING_FINISH; loc->start = code_start; val->chars = last_string; BEGIN INITIAL; return EPILOGUE; } } /*-----------------------------------------------------. | By default, grow the string obstack with the input. | `-----------------------------------------------------*/ . | \n STRING_GROW; %% /* Read bytes from FP into buffer BUF of size SIZE. Return the number of bytes read. Remove '\r' from input, treating \r\n and isolated \r as \n. */ static size_t no_cr_read (FILE *fp, char *buf, size_t size) { size_t bytes_read = fread (buf, 1, size, fp); if (bytes_read) { char *w = memchr (buf, '\r', bytes_read); if (w) { char const *r = ++w; char const *lim = buf + bytes_read; for (;;) { /* Found an '\r'. Treat it like '\n', but ignore any '\n' that immediately follows. */ w[-1] = '\n'; if (r == lim) { int ch = getc (fp); if (ch != '\n' && ungetc (ch, fp) != ch) break; } else if (*r == '\n') r++; /* Copy until the next '\r'. */ do { if (r == lim) return w - buf; } while ((*w++ = *r++) != '\r'); } return w - buf; } } return bytes_read; } /*------------------------------------------------------. | Scan NUMBER for a base-BASE integer at location LOC. | `------------------------------------------------------*/ static unsigned long int scan_integer (char const *number, int base, location loc) { verify (INT_MAX < ULONG_MAX); unsigned long int num = strtoul (number, NULL, base); if (INT_MAX < num) { complain (&loc, complaint, _("integer out of range: %s"), quote (number)); num = INT_MAX; } return num; } /*------------------------------------------------------------------. | Convert universal character name UCN to a single-byte character, | | and return that character. Return -1 if UCN does not correspond | | to a single-byte character. | `------------------------------------------------------------------*/ static int convert_ucn_to_byte (char const *ucn) { verify (UCHAR_MAX <= INT_MAX); unsigned long int code = strtoul (ucn + 2, NULL, 16); /* FIXME: Currently we assume Unicode-compatible unibyte characters on ASCII hosts (i.e., Latin-1 on hosts with 8-bit bytes). On non-ASCII hosts we support only the portable C character set. These limitations should be removed once we add support for multibyte characters. */ if (UCHAR_MAX < code) return -1; #if ! ('$' == 0x24 && '@' == 0x40 && '`' == 0x60 && '~' == 0x7e) { /* A non-ASCII host. Use CODE to index into a table of the C basic execution character set, which is guaranteed to exist on all Standard C platforms. This table also includes '$', '@', and '`', which are not in the basic execution character set but which are unibyte characters on all the platforms that we know about. */ static signed char const table[] = { '\0', -1, -1, -1, -1, -1, -1, '\a', '\b', '\t', '\n', '\v', '\f', '\r', -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ' ', '!', '"', '#', '$', '%', '&', '\'', '(', ')', '*', '+', ',', '-', '.', '/', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', ':', ';', '<', '=', '>', '?', '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '[', '\\', ']', '^', '_', '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '{', '|', '}', '~' }; code = code < sizeof table ? table[code] : -1; } #endif return code; } /*---------------------------------------------------------------------. | Handle '#line INT( "FILE")?\n'. ARGS has already skipped '#line '. | `---------------------------------------------------------------------*/ static void handle_syncline (char *args, location loc) { char *file; unsigned long int lineno = strtoul (args, &file, 10); if (INT_MAX <= lineno) { complain (&loc, Wother, _("line number overflow")); lineno = INT_MAX; } file = strchr (file, '"'); if (file) { *strchr (file + 1, '"') = '\0'; current_file = uniqstr_new (file + 1); } boundary_set (&scanner_cursor, current_file, lineno, 1); } /*----------------------------------------------------------------. | For a token or comment starting at START, report message MSGID, | | which should say that an end marker was found before | | the expected TOKEN_END. | `----------------------------------------------------------------*/ static void unexpected_end (boundary start, char const *msgid, char const *token_end) { location loc; loc.start = start; loc.end = scanner_cursor; token_end = quote (token_end); /* Instead of '\'', display "'". */ if (STREQ (token_end, "'\\''")) token_end = "\"'\""; complain (&loc, complaint, _(msgid), token_end); } /*------------------------------------------------------------------------. | Report an unexpected EOF in a token or comment starting at START. | | An end of file was encountered and the expected TOKEN_END was missing. | `------------------------------------------------------------------------*/ static void unexpected_eof (boundary start, char const *token_end) { unexpected_end (start, N_("missing %s at end of file"), token_end); } /*----------------------------------------. | Likewise, but for unexpected newlines. | `----------------------------------------*/ static void unexpected_newline (boundary start, char const *token_end) { unexpected_end (start, N_("missing %s at end of line"), token_end); } /*-------------------------. | Initialize the scanner. | `-------------------------*/ void gram_scanner_initialize (void) { obstack_init (&obstack_for_string); } /*-----------------------------------------------. | Free all the memory allocated to the scanner. | `-----------------------------------------------*/ void gram_scanner_free (void) { obstack_free (&obstack_for_string, 0); /* Reclaim Flex's buffers. */ yylex_destroy (); }