+/*
+ * This file is part of cparser.
+ * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
+ *
+ * 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 2
+ * 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, write to the Free Software
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
+ * 02111-1307, USA.
+ */
#include <config.h>
-#include "lexer_t.h"
+#include "diagnostic.h"
+#include "lexer.h"
+#include "symbol_t.h"
#include "token_t.h"
#include "symbol_table_t.h"
#include "adt/error.h"
+#include "adt/strset.h"
+#include "adt/util.h"
+#include "types.h"
+#include "type_t.h"
+#include "target_architecture.h"
+#include "parser.h"
+#include "warning.h"
+#include "lang_features.h"
#include <assert.h>
#include <errno.h>
#include <string.h>
+#include <stdbool.h>
#include <ctype.h>
//#define DEBUG_CHARS
#define MAX_PUTBACK 3
-static int c;
-source_position_t source_position;
-static FILE *input;
-static char buf[1027];
-static const char *bufend;
-static const char *bufpos;
-static strset_t stringset;
-//static FILE **input_stack;
-//static char **buf_stack;
+#ifdef _WIN32
+/* No strtold on windows and no replacement yet */
+#define strtold(s, e) strtod(s, e)
+#endif
-static
-void error_prefix_at(const char *input_name, unsigned linenr)
+static int c;
+token_t lexer_token;
+symbol_t *symbol_L;
+static FILE *input;
+static char buf[1024 + MAX_PUTBACK];
+static const char *bufend;
+static const char *bufpos;
+static strset_t stringset;
+bool allow_dollar_in_symbol = true;
+
+/**
+ * Prints a parse error message at the current token.
+ *
+ * @param msg the error message
+ */
+static void parse_error(const char *msg)
{
- fprintf(stderr, "%s:%d: Error: ", input_name, linenr);
+ errorf(&lexer_token.source_position, "%s", msg);
}
-static
-void error_prefix()
+/**
+ * Prints an internal error message at the current token.
+ *
+ * @param msg the error message
+ */
+static NORETURN internal_error(const char *msg)
{
- error_prefix_at(source_position.input_name, source_position.linenr);
+ internal_errorf(&lexer_token.source_position, "%s", msg);
}
-static
-void parse_error(const char *msg)
+static inline void next_real_char(void)
{
- error_prefix();
- fprintf(stderr, "%s\n", msg);
-}
+ assert(bufpos <= bufend);
+ if (bufpos >= bufend) {
+ if (input == NULL) {
+ c = EOF;
+ return;
+ }
-static inline
-void next_char()
-{
- bufpos++;
- if(bufpos >= bufend) {
size_t s = fread(buf + MAX_PUTBACK, 1, sizeof(buf) - MAX_PUTBACK,
input);
if(s == 0) {
bufpos = buf + MAX_PUTBACK;
bufend = buf + MAX_PUTBACK + s;
}
- c = *(bufpos);
-#ifdef DEBUG_CHARS
- printf("nchar '%c'\n", c);
-#endif
+ c = *bufpos++;
}
-static inline
-void put_back(int pc)
+/**
+ * Put a character back into the buffer.
+ *
+ * @param pc the character to put back
+ */
+static inline void put_back(int pc)
{
- char *p = (char*) bufpos - 1;
- bufpos--;
- assert(p >= buf);
- *p = pc;
+ assert(bufpos > buf);
+ *(--bufpos - buf + buf) = (char) pc;
#ifdef DEBUG_CHARS
printf("putback '%c'\n", pc);
#endif
}
+static inline void next_char(void);
+
+#define MATCH_NEWLINE(code) \
+ case '\r': \
+ next_char(); \
+ if(c == '\n') { \
+ next_char(); \
+ } \
+ lexer_token.source_position.linenr++; \
+ code \
+ case '\n': \
+ next_char(); \
+ lexer_token.source_position.linenr++; \
+ code
-static
-int replace_trigraph(void)
+#define eat(c_type) do { assert(c == c_type); next_char(); } while(0)
+
+static void maybe_concat_lines(void)
{
-#define MATCH_TRIGRAPH(ch,replacement) \
- case ch: \
- c = replacement; \
- return 1;
+ eat('\\');
switch(c) {
- MATCH_TRIGRAPH('=', '#')
- MATCH_TRIGRAPH('(', '[')
- MATCH_TRIGRAPH('/', '\\')
- MATCH_TRIGRAPH(')', ']')
- MATCH_TRIGRAPH('\'', '^')
- MATCH_TRIGRAPH('<', '{')
- MATCH_TRIGRAPH('!', '|')
- MATCH_TRIGRAPH('>', '}')
- MATCH_TRIGRAPH('-', '~')
+ MATCH_NEWLINE(return;)
+
default:
break;
}
- return 0;
-}
-
-#define SKIP_TRIGRAPHS(custom_putback, no_trigraph_code) \
- case '?': \
- next_char(); \
- if(c != '?') { \
- custom_putback; \
- put_back(c); \
- c = '?'; \
- no_trigraph_code; \
- } \
- next_char(); \
- if(replace_trigraph()) { \
- break; \
- } \
- custom_putback; \
- put_back('?'); \
- put_back(c); \
- c = '?'; \
- no_trigraph_code;
-
-#define EAT_NEWLINE(newline_code) \
- if(c == '\r') { \
- next_char(); \
- if(c == '\n') \
- next_char(); \
- source_position.linenr++; \
- newline_code; \
- } else if(c == '\n') { \
- next_char(); \
- source_position.linenr++; \
- newline_code; \
+ put_back(c);
+ c = '\\';
+}
+
+/**
+ * Set c to the next input character, ie.
+ * after expanding trigraphs.
+ */
+static inline void next_char(void)
+{
+ next_real_char();
+
+ /* filter trigraphs */
+ if(UNLIKELY(c == '\\')) {
+ maybe_concat_lines();
+ goto end_of_next_char;
+ }
+
+ if(LIKELY(c != '?'))
+ goto end_of_next_char;
+
+ next_real_char();
+ if(LIKELY(c != '?')) {
+ put_back(c);
+ c = '?';
+ goto end_of_next_char;
}
+ next_real_char();
+ switch(c) {
+ case '=': c = '#'; break;
+ case '(': c = '['; break;
+ case '/': c = '\\'; maybe_concat_lines(); break;
+ case ')': c = ']'; break;
+ case '\'': c = '^'; break;
+ case '<': c = '{'; break;
+ case '!': c = '|'; break;
+ case '>': c = '}'; break;
+ case '-': c = '~'; break;
+ default:
+ put_back(c);
+ put_back('?');
+ c = '?';
+ break;
+ }
+
+end_of_next_char:;
+#ifdef DEBUG_CHARS
+ printf("nchar '%c'\n", c);
+#endif
+}
+
#define SYMBOL_CHARS \
+ case '$': if (!allow_dollar_in_symbol) goto dollar_sign; \
case 'a': \
case 'b': \
case 'c': \
case '8': \
case '9':
-static
-void parse_symbol(token_t *token)
+/**
+ * Read a symbol from the input and build
+ * the lexer_token.
+ */
+static void parse_symbol(void)
{
symbol_t *symbol;
char *string;
- obstack_1grow(&symbol_obstack, c);
+ obstack_1grow(&symbol_obstack, (char) c);
next_char();
while(1) {
switch(c) {
- case '\\':
- next_char();
- EAT_NEWLINE(break;)
- goto end_symbol;
-
DIGITS
SYMBOL_CHARS
- obstack_1grow(&symbol_obstack, c);
+ obstack_1grow(&symbol_obstack, (char) c);
next_char();
break;
- case '?':
- next_char();
- if(c != '?') {
- put_back(c);
- c = '?';
- goto end_symbol;
- }
- next_char();
- if(replace_trigraph())
- break;
- put_back('?');
- put_back(c);
- c = '?';
- goto end_symbol;
-
default:
+dollar_sign:
goto end_symbol;
}
}
+
end_symbol:
obstack_1grow(&symbol_obstack, '\0');
string = obstack_finish(&symbol_obstack);
symbol = symbol_table_insert(string);
- token->type = symbol->ID;
- token->v.symbol = symbol;
+ lexer_token.type = symbol->ID;
+ lexer_token.v.symbol = symbol;
if(symbol->string != string) {
obstack_free(&symbol_obstack, string);
}
}
-static
-void parse_number_hex(token_t *token)
+static void parse_integer_suffix(bool is_oct_hex)
{
- assert(c == 'x' || c == 'X');
- next_char();
+ bool is_unsigned = false;
+ bool min_long = false;
+ bool min_longlong = false;
+ bool not_traditional = false;
+ int pos = 0;
+ char suffix[4];
+
+ if (c == 'U' || c == 'u') {
+ not_traditional = true;
+ suffix[pos++] = toupper(c);
+ is_unsigned = true;
+ next_char();
+ if (c == 'L' || c == 'l') {
+ suffix[pos++] = toupper(c);
+ min_long = true;
+ next_char();
+ if (c == 'L' || c == 'l') {
+ suffix[pos++] = toupper(c);
+ min_longlong = true;
+ next_char();
+ }
+ }
+ } else if (c == 'l' || c == 'L') {
+ suffix[pos++] = toupper(c);
+ min_long = true;
+ next_char();
+ if (c == 'l' || c == 'L') {
+ not_traditional = true;
+ suffix[pos++] = toupper(c);
+ min_longlong = true;
+ next_char();
+ if (c == 'u' || c == 'U') {
+ suffix[pos++] = toupper(c);
+ is_unsigned = true;
+ next_char();
+ }
+ } else if (c == 'u' || c == 'U') {
+ not_traditional = true;
+ suffix[pos++] = toupper(c);
+ is_unsigned = true;
+ next_char();
+ lexer_token.datatype = type_unsigned_long;
+ }
+ }
- if (!isdigit(c) &&
- !('A' <= c && c <= 'F') &&
- !('a' <= c && c <= 'f')) {
- parse_error("premature end of hex number literal");
- token->type = T_ERROR;
- return;
+ if (warning.traditional && not_traditional) {
+ suffix[pos] = '\0';
+ warningf(&lexer_token.source_position,
+ "traditional C rejects the '%s' suffix", suffix);
}
+ if (!is_unsigned) {
+ long long v = lexer_token.v.intvalue;
+ if (!min_long) {
+ if (v >= TARGET_INT_MIN && v <= TARGET_INT_MAX) {
+ lexer_token.datatype = type_int;
+ return;
+ } else if (is_oct_hex && v >= 0 && v <= TARGET_UINT_MAX) {
+ lexer_token.datatype = type_unsigned_int;
+ return;
+ }
+ }
+ if (!min_longlong) {
+ if (v >= TARGET_LONG_MIN && v <= TARGET_LONG_MAX) {
+ lexer_token.datatype = type_long;
+ return;
+ } else if (is_oct_hex && v >= 0 && (unsigned long long)v <= (unsigned long long)TARGET_ULONG_MAX) {
+ lexer_token.datatype = type_unsigned_long;
+ return;
+ }
+ }
+ unsigned long long uv = (unsigned long long) v;
+ if (is_oct_hex && uv > (unsigned long long) TARGET_LONGLONG_MAX) {
+ lexer_token.datatype = type_unsigned_long_long;
+ return;
+ }
- int value = 0;
- for(;;) {
- if (isdigit(c)) {
- value = 16 * value + c - '0';
- } else if ('A' <= c && c <= 'F') {
- value = 16 * value + c - 'A' + 10;
- } else if ('a' <= c && c <= 'f') {
- value = 16 * value + c - 'a' + 10;
- } else {
- token->type = T_INTEGER;
- token->v.intvalue = value;
+ lexer_token.datatype = type_long_long;
+ } else {
+ unsigned long long v = (unsigned long long) lexer_token.v.intvalue;
+ if (!min_long && v <= TARGET_UINT_MAX) {
+ lexer_token.datatype = type_unsigned_int;
+ return;
+ }
+ if (!min_longlong && v <= TARGET_ULONG_MAX) {
+ lexer_token.datatype = type_unsigned_long;
return;
}
+ lexer_token.datatype = type_unsigned_long_long;
+ }
+}
+
+static void parse_floating_suffix(void)
+{
+ switch(c) {
+ /* TODO: do something useful with the suffixes... */
+ case 'f':
+ case 'F':
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects the 'F' suffix");
+ }
next_char();
+ lexer_token.datatype = type_float;
+ break;
+ case 'l':
+ case 'L':
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects the 'F' suffix");
+ }
+ next_char();
+ lexer_token.datatype = type_long_double;
+ break;
+ default:
+ lexer_token.datatype = type_double;
+ break;
}
}
-static
-void parse_number_oct(token_t *token)
+/**
+ * A replacement for strtoull. Only those parts needed for
+ * our parser are implemented.
+ */
+static unsigned long long parse_int_string(const char *s, const char **endptr, int base) {
+ unsigned long long v = 0;
+
+ switch (base) {
+ case 16:
+ for (;; ++s) {
+ /* check for overrun */
+ if (v >= 0x1000000000000000ULL)
+ break;
+ switch (tolower(*s)) {
+ case '0': v <<= 4; break;
+ case '1': v <<= 4; v |= 0x1; break;
+ case '2': v <<= 4; v |= 0x2; break;
+ case '3': v <<= 4; v |= 0x3; break;
+ case '4': v <<= 4; v |= 0x4; break;
+ case '5': v <<= 4; v |= 0x5; break;
+ case '6': v <<= 4; v |= 0x6; break;
+ case '7': v <<= 4; v |= 0x7; break;
+ case '8': v <<= 4; v |= 0x8; break;
+ case '9': v <<= 4; v |= 0x9; break;
+ case 'a': v <<= 4; v |= 0xa; break;
+ case 'b': v <<= 4; v |= 0xb; break;
+ case 'c': v <<= 4; v |= 0xc; break;
+ case 'd': v <<= 4; v |= 0xd; break;
+ case 'e': v <<= 4; v |= 0xe; break;
+ case 'f': v <<= 4; v |= 0xf; break;
+ default:
+ goto end;
+ }
+ }
+ break;
+ case 8:
+ for (;; ++s) {
+ /* check for overrun */
+ if (v >= 0x2000000000000000ULL)
+ break;
+ switch (tolower(*s)) {
+ case '0': v <<= 3; break;
+ case '1': v <<= 3; v |= 1; break;
+ case '2': v <<= 3; v |= 2; break;
+ case '3': v <<= 3; v |= 3; break;
+ case '4': v <<= 3; v |= 4; break;
+ case '5': v <<= 3; v |= 5; break;
+ case '6': v <<= 3; v |= 6; break;
+ case '7': v <<= 3; v |= 7; break;
+ default:
+ goto end;
+ }
+ }
+ break;
+ case 10:
+ for (;; ++s) {
+ /* check for overrun */
+ if (v > 0x1999999999999999ULL)
+ break;
+ switch (tolower(*s)) {
+ case '0': v *= 10; break;
+ case '1': v *= 10; v += 1; break;
+ case '2': v *= 10; v += 2; break;
+ case '3': v *= 10; v += 3; break;
+ case '4': v *= 10; v += 4; break;
+ case '5': v *= 10; v += 5; break;
+ case '6': v *= 10; v += 6; break;
+ case '7': v *= 10; v += 7; break;
+ case '8': v *= 10; v += 8; break;
+ case '9': v *= 10; v += 9; break;
+ default:
+ goto end;
+ }
+ }
+ break;
+ default:
+ assert(0);
+ break;
+ }
+end:
+ *endptr = s;
+ return v;
+}
+
+/**
+ * Parses a hex number including hex floats and set the
+ * lexer_token.
+ */
+static void parse_number_hex(void)
{
- assert(c == 'o' || c == 'O');
+ bool is_float = false;
+ assert(c == 'x' || c == 'X');
next_char();
- int value = 0;
- for(;;) {
- if ('0' <= c && c <= '7') {
- value = 8 * value + c - '0';
- } else {
- token->type = T_INTEGER;
- token->v.intvalue = value;
- return;
+ obstack_1grow(&symbol_obstack, '0');
+ obstack_1grow(&symbol_obstack, 'x');
+
+ while(isxdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+
+ if (c == '.') {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+
+ while (isxdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
}
+ is_float = true;
+ }
+ if (c == 'p' || c == 'P') {
+ obstack_1grow(&symbol_obstack, (char) c);
next_char();
+
+ if (c == '-' || c == '+') {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+
+ while (isxdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+ is_float = true;
+ }
+
+ obstack_1grow(&symbol_obstack, '\0');
+ char *string = obstack_finish(&symbol_obstack);
+ if(*string == '\0') {
+ parse_error("invalid hex number");
+ lexer_token.type = T_ERROR;
+ obstack_free(&symbol_obstack, string);
+ return;
}
+
+ if (is_float) {
+ char *endptr;
+ lexer_token.type = T_FLOATINGPOINT;
+ lexer_token.v.floatvalue = strtold(string, &endptr);
+
+ if(*endptr != '\0') {
+ parse_error("invalid hex float literal");
+ }
+
+ parse_floating_suffix();
+ } else {
+ const char *endptr;
+ lexer_token.type = T_INTEGER;
+ lexer_token.v.intvalue = parse_int_string(string + 2, &endptr, 16);
+ if(*endptr != '\0') {
+ parse_error("hex number literal too long");
+ }
+ parse_integer_suffix(true);
+ }
+
+ obstack_free(&symbol_obstack, string);
}
-static
-void parse_number_dec(token_t *token, int first_char)
+/**
+ * Returns true if the given char is a octal digit.
+ *
+ * @param char the character to check
+ */
+static inline bool is_octal_digit(int chr)
{
- int value = 0;
- if(first_char > 0) {
- assert(first_char >= '0' && first_char <= '9');
- value = first_char - '0';
+ switch(chr) {
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ return true;
+ default:
+ return false;
}
+}
- for(;;) {
- if (isdigit(c)) {
- value = 10 * value + c - '0';
- } else {
- token->type = T_INTEGER;
- token->v.intvalue = value;
- return;
- }
+/**
+ * Parses a octal number and set the lexer_token.
+ */
+static void parse_number_oct(void)
+{
+ while(is_octal_digit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
next_char();
}
+ obstack_1grow(&symbol_obstack, '\0');
+ char *string = obstack_finish(&symbol_obstack);
+
+ const char *endptr;
+ lexer_token.type = T_INTEGER;
+ lexer_token.v.intvalue = parse_int_string(string, &endptr, 8);
+ if(*endptr != '\0') {
+ parse_error("octal number literal too long");
+ }
+
+ obstack_free(&symbol_obstack, string);
+ parse_integer_suffix(true);
}
-static
-void parse_number(token_t *token)
+/**
+ * Parses a decimal including float number and set the
+ * lexer_token.
+ */
+static void parse_number_dec(void)
{
- // TODO check for overflow
- // TODO check for various invalid inputs sequences
+ bool is_float = false;
+ while (isdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+
+ if (c == '.') {
+ obstack_1grow(&symbol_obstack, '.');
+ next_char();
+
+ while (isdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+ is_float = true;
+ }
+ if(c == 'e' || c == 'E') {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+
+ if(c == '-' || c == '+') {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+ while(isdigit(c)) {
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
+ }
+ is_float = true;
+ }
+
+ obstack_1grow(&symbol_obstack, '\0');
+ char *string = obstack_finish(&symbol_obstack);
+
+ if(is_float) {
+ char *endptr;
+ lexer_token.type = T_FLOATINGPOINT;
+ lexer_token.v.floatvalue = strtold(string, &endptr);
+
+ if(*endptr != '\0') {
+ parse_error("invalid number literal");
+ }
+
+ parse_floating_suffix();
+ } else {
+ const char *endptr;
+ lexer_token.type = T_INTEGER;
+ lexer_token.v.intvalue = parse_int_string(string, &endptr, 10);
+
+ if(*endptr != '\0') {
+ parse_error("invalid number literal");
+ }
+
+ parse_integer_suffix(false);
+ }
+ obstack_free(&symbol_obstack, string);
+}
+
+/**
+ * Parses a number and sets the lexer_token.
+ */
+static void parse_number(void)
+{
if (c == '0') {
next_char();
switch (c) {
case 'X':
- case 'x': parse_number_hex(token); break;
- case 'o':
- case 'O': parse_number_oct(token); break;
- default: parse_number_dec(token, '0');
+ case 'x':
+ parse_number_hex();
+ break;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ parse_number_oct();
+ break;
+ case '8':
+ case '9':
+ next_char();
+ parse_error("invalid octal number");
+ lexer_token.type = T_ERROR;
+ return;
+ case '.':
+ case 'e':
+ case 'E':
+ default:
+ obstack_1grow(&symbol_obstack, '0');
+ parse_number_dec();
+ return;
}
} else {
- parse_number_dec(token, 0);
+ parse_number_dec();
+ }
+}
+
+/**
+ * Returns the value of a digit.
+ * The only portable way to do it ...
+ */
+static int digit_value(int digit) {
+ switch (digit) {
+ case '0': return 0;
+ case '1': return 1;
+ case '2': return 2;
+ case '3': return 3;
+ case '4': return 4;
+ case '5': return 5;
+ case '6': return 6;
+ case '7': return 7;
+ case '8': return 8;
+ case '9': return 9;
+ case 'a':
+ case 'A': return 10;
+ case 'b':
+ case 'B': return 11;
+ case 'c':
+ case 'C': return 12;
+ case 'd':
+ case 'D': return 13;
+ case 'e':
+ case 'E': return 14;
+ case 'f':
+ case 'F': return 15;
+ default:
+ internal_error("wrong character given");
+ }
+}
+
+/**
+ * Parses an octal character sequence.
+ *
+ * @param first_digit the already read first digit
+ */
+static int parse_octal_sequence(const int first_digit)
+{
+ assert(is_octal_digit(first_digit));
+ int value = digit_value(first_digit);
+ if (!is_octal_digit(c)) return value;
+ value = 8 * value + digit_value(c);
+ next_char();
+ if (!is_octal_digit(c)) return value;
+ value = 8 * value + digit_value(c);
+ next_char();
+
+ if(char_is_signed) {
+ return (signed char) value;
+ } else {
+ return (unsigned char) value;
}
}
-static
-int parse_escape_sequence()
+/**
+ * Parses a hex character sequence.
+ */
+static int parse_hex_sequence(void)
{
- while(1) {
- int ec = c;
+ int value = 0;
+ while(isxdigit(c)) {
+ value = 16 * value + digit_value(c);
next_char();
+ }
- switch(ec) {
- case '"': return '"';
- case '\'': return'\'';
- case '\\':
- EAT_NEWLINE(break;)
- return '\\';
- case 'a': return '\a';
- case 'b': return '\b';
- case 'f': return '\f';
- case 'n': return '\n';
- case 'r': return '\r';
- case 't': return '\t';
- case 'v': return '\v';
- case 'x': /* TODO parse hex number ... */
- parse_error("hex escape sequences not implemented yet");
- return EOF;
- case '0':
- case '1':
- case '2':
- case '3':
- case '4':
- case '5':
- case '6':
- case '7':
- /* TODO parse octal number ... */
- parse_error("octal escape sequences not implemented yet");
- return EOF;
- case '?':
- if(c != '?') {
- return '?';
- }
- /* might be a trigraph */
- next_char();
- if(replace_trigraph()) {
- break;
- }
- put_back(c);
- c = '?';
- return '?';
-
- case EOF:
- parse_error("reached end of file while parsing escape sequence");
- return EOF;
- default:
- parse_error("unknown escape sequence");
- return EOF;
- }
+ if(char_is_signed) {
+ return (signed char) value;
+ } else {
+ return (unsigned char) value;
}
}
-static
-void parse_string_literal(token_t *token)
+/**
+ * Parse an escape sequence.
+ */
+static int parse_escape_sequence(void)
{
- unsigned start_linenr = source_position.linenr;
- char *string;
- const char *result;
+ eat('\\');
- assert(c == '"');
+ int ec = c;
next_char();
+ switch (ec) {
+ case '"': return '"';
+ case '\'': return '\'';
+ case '\\': return '\\';
+ case '?': return '\?';
+ case 'a': return '\a';
+ case 'b': return '\b';
+ case 'f': return '\f';
+ case 'n': return '\n';
+ case 'r': return '\r';
+ case 't': return '\t';
+ case 'v': return '\v';
+ case 'x':
+ return parse_hex_sequence();
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ return parse_octal_sequence(ec);
+ case EOF:
+ parse_error("reached end of file while parsing escape sequence");
+ return EOF;
+ case 'e':
+ if (c_mode & _GNUC)
+ return 27; /* hopefully 27 is ALWAYS the code for ESACAPE */
+ /*fallthrough*/
+ default:
+ parse_error("unknown escape sequence");
+ return EOF;
+ }
+}
+
+/**
+ * Concatenate two strings.
+ */
+string_t concat_strings(const string_t *const s1, const string_t *const s2)
+{
+ const size_t len1 = s1->size - 1;
+ const size_t len2 = s2->size - 1;
+
+ char *const concat = obstack_alloc(&symbol_obstack, len1 + len2 + 1);
+ memcpy(concat, s1->begin, len1);
+ memcpy(concat + len1, s2->begin, len2 + 1);
+
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects string constant concatenation");
+ }
+#if 0 /* TODO hash */
+ const char *result = strset_insert(&stringset, concat);
+ if(result != concat) {
+ obstack_free(&symbol_obstack, concat);
+ }
+
+ return result;
+#else
+ return (string_t){ concat, len1 + len2 + 1 };
+#endif
+}
+
+/**
+ * Concatenate a string and a wide string.
+ */
+wide_string_t concat_string_wide_string(const string_t *const s1, const wide_string_t *const s2)
+{
+ const size_t len1 = s1->size - 1;
+ const size_t len2 = s2->size - 1;
+
+ wchar_rep_t *const concat = obstack_alloc(&symbol_obstack, (len1 + len2 + 1) * sizeof(*concat));
+ const char *const src = s1->begin;
+ for (size_t i = 0; i != len1; ++i) {
+ concat[i] = src[i];
+ }
+ memcpy(concat + len1, s2->begin, (len2 + 1) * sizeof(*concat));
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects string constant concatenation");
+ }
+
+ return (wide_string_t){ concat, len1 + len2 + 1 };
+}
+
+/**
+ * Concatenate two wide strings.
+ */
+wide_string_t concat_wide_strings(const wide_string_t *const s1, const wide_string_t *const s2)
+{
+ const size_t len1 = s1->size - 1;
+ const size_t len2 = s2->size - 1;
+
+ wchar_rep_t *const concat = obstack_alloc(&symbol_obstack, (len1 + len2 + 1) * sizeof(*concat));
+ memcpy(concat, s1->begin, len1 * sizeof(*concat));
+ memcpy(concat + len1, s2->begin, (len2 + 1) * sizeof(*concat));
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects string constant concatenation");
+ }
+
+ return (wide_string_t){ concat, len1 + len2 + 1 };
+}
+
+/**
+ * Concatenate a wide string and a string.
+ */
+wide_string_t concat_wide_string_string(const wide_string_t *const s1, const string_t *const s2)
+{
+ const size_t len1 = s1->size - 1;
+ const size_t len2 = s2->size - 1;
+
+ wchar_rep_t *const concat = obstack_alloc(&symbol_obstack, (len1 + len2 + 1) * sizeof(*concat));
+ memcpy(concat, s1->begin, len1 * sizeof(*concat));
+ const char *const src = s2->begin;
+ for (size_t i = 0; i != len2 + 1; ++i) {
+ concat[i] = src[i];
+ }
+ if (warning.traditional) {
+ warningf(&lexer_token.source_position,
+ "traditional C rejects string constant concatenation");
+ }
+
+ return (wide_string_t){ concat, len1 + len2 + 1 };
+}
+
+/**
+ * Parse a string literal and set lexer_token.
+ */
+static void parse_string_literal(void)
+{
+ const unsigned start_linenr = lexer_token.source_position.linenr;
+
+ eat('"');
+
+ int tc;
while(1) {
switch(c) {
- SKIP_TRIGRAPHS(,
- obstack_1grow(&symbol_obstack, '?');
- next_char();
- break;
- )
-
case '\\':
- next_char();
- EAT_NEWLINE(break;)
- int ec = parse_escape_sequence();
- obstack_1grow(&symbol_obstack, ec);
+ tc = parse_escape_sequence();
+ obstack_1grow(&symbol_obstack, (char) tc);
break;
- case EOF:
- error_prefix_at(source_position.input_name, start_linenr);
- fprintf(stderr, "string has no end\n");
- token->type = T_ERROR;
+ case EOF: {
+ source_position_t source_position;
+ source_position.input_name = lexer_token.source_position.input_name;
+ source_position.linenr = start_linenr;
+ errorf(&source_position, "string has no end");
+ lexer_token.type = T_ERROR;
return;
+ }
case '"':
next_char();
goto end_of_string;
default:
- obstack_1grow(&symbol_obstack, c);
+ obstack_1grow(&symbol_obstack, (char) c);
next_char();
break;
}
/* add finishing 0 to the string */
obstack_1grow(&symbol_obstack, '\0');
- string = obstack_finish(&symbol_obstack);
+ const size_t size = (size_t)obstack_object_size(&symbol_obstack);
+ const char *const string = obstack_finish(&symbol_obstack);
+#if 0 /* TODO hash */
/* check if there is already a copy of the string */
result = strset_insert(&stringset, string);
if(result != string) {
obstack_free(&symbol_obstack, string);
}
+#else
+ const char *const result = string;
+#endif
- token->type = T_STRING_LITERAL;
- token->v.string = result;
+ lexer_token.type = T_STRING_LITERAL;
+ lexer_token.v.string.begin = result;
+ lexer_token.v.string.size = size;
}
-#define MATCH_NEWLINE(code) \
- case '\r': \
- next_char(); \
- if(c == '\n') { \
- next_char(); \
- } \
- source_position.linenr++; \
- code; \
- case '\n': \
- next_char(); \
- source_position.linenr++; \
- code;
+/**
+ * Parse a wide character constant and set lexer_token.
+ */
+static void parse_wide_character_constant(void)
+{
+ const unsigned start_linenr = lexer_token.source_position.linenr;
+
+ eat('\'');
+
+ while(1) {
+ switch(c) {
+ case '\\': {
+ wchar_rep_t tc = parse_escape_sequence();
+ obstack_grow(&symbol_obstack, &tc, sizeof(tc));
+ break;
+ }
-static
-void parse_character_constant(token_t *token)
+ MATCH_NEWLINE(
+ parse_error("newline while parsing character constant");
+ break;
+ )
+
+ case '\'':
+ next_char();
+ goto end_of_wide_char_constant;
+
+ case EOF: {
+ source_position_t source_position = lexer_token.source_position;
+ source_position.linenr = start_linenr;
+ errorf(&source_position, "EOF while parsing character constant");
+ lexer_token.type = T_ERROR;
+ return;
+ }
+
+ default: {
+ wchar_rep_t tc = (wchar_rep_t) c;
+ obstack_grow(&symbol_obstack, &tc, sizeof(tc));
+ next_char();
+ break;
+ }
+ }
+ }
+
+end_of_wide_char_constant:;
+ size_t size = (size_t) obstack_object_size(&symbol_obstack);
+ assert(size % sizeof(wchar_rep_t) == 0);
+ size /= sizeof(wchar_rep_t);
+
+ const wchar_rep_t *string = obstack_finish(&symbol_obstack);
+
+ lexer_token.type = T_WIDE_CHARACTER_CONSTANT;
+ lexer_token.v.wide_string.begin = string;
+ lexer_token.v.wide_string.size = size;
+ lexer_token.datatype = type_wchar_t;
+}
+
+/**
+ * Parse a wide string literal and set lexer_token.
+ */
+static void parse_wide_string_literal(void)
{
- assert(c == '\'');
+ const unsigned start_linenr = lexer_token.source_position.linenr;
+
+ assert(c == '"');
next_char();
- int found_char = 0;
while(1) {
switch(c) {
- SKIP_TRIGRAPHS(,
- found_char = '?';
+ case '\\': {
+ wchar_rep_t tc = parse_escape_sequence();
+ obstack_grow(&symbol_obstack, &tc, sizeof(tc));
break;
- )
+ }
- case '\\':
+ case EOF: {
+ source_position_t source_position;
+ source_position.input_name = lexer_token.source_position.input_name;
+ source_position.linenr = start_linenr;
+ errorf(&source_position, "string has no end");
+ lexer_token.type = T_ERROR;
+ return;
+ }
+
+ case '"':
+ next_char();
+ goto end_of_string;
+
+ default: {
+ wchar_rep_t tc = c;
+ obstack_grow(&symbol_obstack, &tc, sizeof(tc));
next_char();
- EAT_NEWLINE(break;)
- found_char = '\\';
break;
+ }
+ }
+ }
+
+end_of_string:;
+
+ /* TODO: concatenate multiple strings separated by whitespace... */
+
+ /* add finishing 0 to the string */
+ wchar_rep_t nul = L'\0';
+ obstack_grow(&symbol_obstack, &nul, sizeof(nul));
+ const size_t size = (size_t)obstack_object_size(&symbol_obstack) / sizeof(wchar_rep_t);
+ const wchar_rep_t *const string = obstack_finish(&symbol_obstack);
+
+#if 0 /* TODO hash */
+ /* check if there is already a copy of the string */
+ const wchar_rep_t *const result = strset_insert(&stringset, string);
+ if(result != string) {
+ obstack_free(&symbol_obstack, string);
+ }
+#else
+ const wchar_rep_t *const result = string;
+#endif
+
+ lexer_token.type = T_WIDE_STRING_LITERAL;
+ lexer_token.v.wide_string.begin = result;
+ lexer_token.v.wide_string.size = size;
+}
+
+/**
+ * Parse a character constant and set lexer_token.
+ */
+static void parse_character_constant(void)
+{
+ const unsigned start_linenr = lexer_token.source_position.linenr;
+
+ eat('\'');
+
+ while(1) {
+ switch(c) {
+ case '\\': {
+ int tc = parse_escape_sequence();
+ obstack_1grow(&symbol_obstack, (char) tc);
+ break;
+ }
MATCH_NEWLINE(
parse_error("newline while parsing character constant");
next_char();
goto end_of_char_constant;
- case EOF:
- parse_error("EOF while parsing character constant");
- token->type = T_ERROR;
+ case EOF: {
+ source_position_t source_position;
+ source_position.input_name = lexer_token.source_position.input_name;
+ source_position.linenr = start_linenr;
+ errorf(&source_position, "EOF while parsing character constant");
+ lexer_token.type = T_ERROR;
return;
+ }
default:
- if(found_char != 0) {
- parse_error("more than 1 characters in character "
- "constant");
- goto end_of_char_constant;
- } else {
- found_char = c;
- next_char();
- }
+ obstack_1grow(&symbol_obstack, (char) c);
+ next_char();
break;
+
}
}
-end_of_char_constant:
- token->type = T_INTEGER;
- token->v.intvalue = found_char;
+end_of_char_constant:;
+ const size_t size = (size_t)obstack_object_size(&symbol_obstack);
+ const char *const string = obstack_finish(&symbol_obstack);
+
+ lexer_token.type = T_CHARACTER_CONSTANT;
+ lexer_token.v.string.begin = string;
+ lexer_token.v.string.size = size;
+ lexer_token.datatype = c_mode & _CXX && size == 1 ? type_char : type_int;
}
-static
-void skip_multiline_comment(void)
+/**
+ * Skip a multiline comment.
+ */
+static void skip_multiline_comment(void)
{
- unsigned start_linenr = source_position.linenr;
- int had_star = 0;
+ unsigned start_linenr = lexer_token.source_position.linenr;
while(1) {
switch(c) {
- case '*':
- next_char();
- had_star = 1;
- break;
-
case '/':
next_char();
- if(had_star) {
- return;
+ if (c == '*') {
+ /* nested comment, warn here */
+ if (warning.comment) {
+ warningf(&lexer_token.source_position, "'/*' within comment");
+ }
}
- had_star = 0;
- break;
-
- case '\\':
- next_char();
- EAT_NEWLINE(break;)
- had_star = 0;
break;
-
- case '?':
+ case '*':
next_char();
- if(c != '?') {
- had_star = 0;
- break;
+ if(c == '/') {
+ next_char();
+ return;
}
- next_char();
- if(replace_trigraph())
- break;
- put_back(c);
- c = '?';
- had_star = 0;
- /* we don't put back the 2nd ? as the comment text is discarded
- * anyway */
break;
- MATCH_NEWLINE(had_star = 0; break;)
+ MATCH_NEWLINE(break;)
- case EOF:
- error_prefix_at(source_position.input_name, start_linenr);
- fprintf(stderr, "at end of file while looking for comment end\n");
+ case EOF: {
+ source_position_t source_position;
+ source_position.input_name = lexer_token.source_position.input_name;
+ source_position.linenr = start_linenr;
+ errorf(&source_position, "at end of file while looking for comment end");
return;
+ }
+
default:
- had_star = 0;
next_char();
break;
}
}
}
-static
-void skip_line_comment(void)
+/**
+ * Skip a single line comment.
+ */
+static void skip_line_comment(void)
{
while(1) {
switch(c) {
- case '?':
- next_char();
- if(c != '?')
- break;
- next_char();
- if(replace_trigraph())
- break;
- put_back('?');
- /* we don't put back the 2nd ? as the comment text is discarded
- * anyway */
- break;
+ case EOF:
+ return;
+
+ case '\n':
+ case '\r':
+ return;
case '\\':
next_char();
- if(c == '\n') {
- next_char();
- source_position.linenr++;
+ if (c == '\n' || c == '\r') {
+ if (warning.comment)
+ warningf(&lexer_token.source_position, "multi-line comment");
+ return;
}
break;
- case EOF:
- case '\r':
- case '\n':
- return;
-
default:
next_char();
break;
}
}
+/** The current preprocessor token. */
static token_t pp_token;
-static inline
-void next_pp_token(void)
+/**
+ * Read the next preprocessor token.
+ */
+static inline void next_pp_token(void)
{
- lexer_next_preprocessing_token(&pp_token);
+ lexer_next_preprocessing_token();
+ pp_token = lexer_token;
}
-static
-void eat_until_newline(void)
+/**
+ * Eat all preprocessor tokens until newline.
+ */
+static void eat_until_newline(void)
{
while(pp_token.type != '\n' && pp_token.type != T_EOF) {
next_pp_token();
}
}
-static
-void error_directive(void)
+/**
+ * Handle the define directive.
+ */
+static void define_directive(void)
{
- error_prefix();
- fprintf(stderr, "#error directive: \n");
-
- /* parse pp-tokens until new-line */
-}
-
-static
-void define_directive(void)
-{
- token_t temptoken;
-
- lexer_next_preprocessing_token(&temptoken);
- if(temptoken.type != T_IDENTIFIER) {
+ lexer_next_preprocessing_token();
+ if(lexer_token.type != T_IDENTIFIER) {
parse_error("expected identifier after #define\n");
eat_until_newline();
}
}
-static
-void ifdef_directive(int is_ifndef)
+/**
+ * Handle the ifdef directive.
+ */
+static void ifdef_directive(int is_ifndef)
{
(void) is_ifndef;
- token_t temptoken;
- lexer_next_preprocessing_token(&temptoken);
+ lexer_next_preprocessing_token();
//expect_identifier();
//extect_newline();
}
-static
-void endif_directive(void)
+/**
+ * Handle the endif directive.
+ */
+static void endif_directive(void)
{
//expect_newline();
}
-static
-void parse_line_directive(void)
+/**
+ * Parse the line directive.
+ */
+static void parse_line_directive(void)
{
if(pp_token.type != T_INTEGER) {
parse_error("expected integer");
} else {
- source_position.linenr = pp_token.v.intvalue - 1;
+ lexer_token.source_position.linenr = (unsigned int)(pp_token.v.intvalue - 1);
next_pp_token();
}
if(pp_token.type == T_STRING_LITERAL) {
- source_position.input_name = pp_token.v.string;
+ lexer_token.source_position.input_name = pp_token.v.string.begin;
next_pp_token();
}
eat_until_newline();
}
-static
-void parse_preprocessor_identifier(void)
+/**
+ * STDC pragmas.
+ */
+typedef enum stdc_pragma_kind_t {
+ STDC_UNKNOWN,
+ STDC_FP_CONTRACT,
+ STDC_FENV_ACCESS,
+ STDC_CX_LIMITED_RANGE
+} stdc_pragma_kind_t;
+
+/**
+ * STDC pragma values.
+ */
+typedef enum stdc_pragma_value_kind_t {
+ STDC_VALUE_UNKNOWN,
+ STDC_VALUE_ON,
+ STDC_VALUE_OFF,
+ STDC_VALUE_DEFAULT
+} stdc_pragma_value_kind_t;
+
+/**
+ * Parse a pragma directive.
+ */
+static void parse_pragma(void) {
+ bool unknown_pragma = true;
+
+ next_pp_token();
+ if (pp_token.v.symbol->pp_ID == TP_STDC) {
+ stdc_pragma_kind_t kind = STDC_UNKNOWN;
+ /* a STDC pragma */
+ if (c_mode & _C99) {
+ next_pp_token();
+
+ switch (pp_token.v.symbol->pp_ID) {
+ case TP_FP_CONTRACT:
+ kind = STDC_FP_CONTRACT;
+ break;
+ case TP_FENV_ACCESS:
+ kind = STDC_FENV_ACCESS;
+ break;
+ case TP_CX_LIMITED_RANGE:
+ kind = STDC_CX_LIMITED_RANGE;
+ break;
+ default:
+ break;
+ }
+ if (kind != STDC_UNKNOWN) {
+ stdc_pragma_value_kind_t value = STDC_VALUE_UNKNOWN;
+ next_pp_token();
+ switch (pp_token.v.symbol->pp_ID) {
+ case TP_ON:
+ value = STDC_VALUE_ON;
+ break;
+ case TP_OFF:
+ value = STDC_VALUE_OFF;
+ break;
+ case TP_DEFAULT:
+ value = STDC_VALUE_DEFAULT;
+ break;
+ default:
+ break;
+ }
+ if (value != STDC_VALUE_UNKNOWN) {
+ unknown_pragma = false;
+ } else {
+ errorf(&pp_token.source_position, "bad STDC pragma argument");
+ }
+ }
+ }
+ } else {
+ unknown_pragma = true;
+ }
+ eat_until_newline();
+ if (unknown_pragma && warning.unknown_pragmas) {
+ warningf(&pp_token.source_position, "encountered unknown #pragma");
+ }
+}
+
+/**
+ * Parse a preprocessor non-null directive.
+ */
+static void parse_preprocessor_identifier(void)
{
assert(pp_token.type == T_IDENTIFIER);
symbol_t *symbol = pp_token.v.symbol;
case TP_elif:
case TP_undef:
case TP_error:
- error_directive();
+ /* TODO; output the rest of the line */
+ parse_error("#error directive: ");
break;
case TP_pragma:
+ parse_pragma();
break;
}
}
-static
-void parse_preprocessor_directive()
+/**
+ * Parse a preprocessor directive.
+ */
+static void parse_preprocessor_directive(void)
{
next_pp_token();
case T_INTEGER:
parse_line_directive();
break;
+ case '\n':
+ /* NULL directive, see ยง 6.10.7 */
+ break;
default:
parse_error("invalid preprocessor directive");
eat_until_newline();
#define MAYBE(ch, set_type) \
case ch: \
next_char(); \
- token->type = set_type; \
+ lexer_token.type = set_type; \
return;
#define ELSE_CODE(code) \
- SKIP_TRIGRAPHS(, \
- code; \
- ) \
- \
- case '\\': \
- next_char(); \
- EAT_NEWLINE(break;) \
- /* fallthrough */ \
default: \
- code; \
+ code \
} \
} /* end of while(1) */ \
break;
#define ELSE(set_type) \
ELSE_CODE( \
- token->type = set_type; \
+ lexer_token.type = set_type; \
return; \
)
-void lexer_next_preprocessing_token(token_t *token)
+void lexer_next_preprocessing_token(void)
{
while(1) {
switch(c) {
break;
MATCH_NEWLINE(
- token->type = '\n';
+ lexer_token.type = '\n';
return;
)
SYMBOL_CHARS
- parse_symbol(token);
+ parse_symbol();
+ /* might be a wide string ( L"string" ) */
+ if(lexer_token.type == T_IDENTIFIER &&
+ lexer_token.v.symbol == symbol_L) {
+ if(c == '"') {
+ parse_wide_string_literal();
+ } else if(c == '\'') {
+ parse_wide_character_constant();
+ }
+ }
return;
DIGITS
- parse_number(token);
+ parse_number();
return;
case '"':
- parse_string_literal(token);
+ parse_string_literal();
return;
case '\'':
- parse_character_constant(token);
- return;
-
- case '\\':
- next_char();
- if(c == '\n') {
- next_char();
- source_position.linenr++;
- break;
- } else {
- parse_error("unexpected '\\' found");
- token->type = T_ERROR;
- }
+ parse_character_constant();
return;
case '.':
MAYBE_PROLOG
+ DIGITS
+ put_back(c);
+ c = '.';
+ parse_number_dec();
+ return;
+
case '.':
MAYBE_PROLOG
MAYBE('.', T_DOTDOTDOT)
ELSE_CODE(
put_back(c);
c = '.';
- token->type = '.';
+ lexer_token.type = '.';
return;
)
ELSE('.')
ELSE('+')
case '-':
MAYBE_PROLOG
+ MAYBE('>', T_MINUSGREATER)
MAYBE('-', T_MINUSMINUS)
MAYBE('=', T_MINUSEQUAL)
ELSE('-')
case '*':
next_char();
skip_multiline_comment();
- lexer_next_preprocessing_token(token);
+ lexer_next_preprocessing_token();
return;
case '/':
next_char();
skip_line_comment();
- lexer_next_preprocessing_token(token);
+ lexer_next_preprocessing_token();
return;
ELSE('/')
case '%':
MAYBE_PROLOG
- MAYBE('>', T_PERCENTGREATER)
+ MAYBE('>', '}')
MAYBE('=', T_PERCENTEQUAL)
case ':':
MAYBE_PROLOG
case '%':
MAYBE_PROLOG
- MAYBE(':', T_PERCENTCOLONPERCENTCOLON)
+ MAYBE(':', T_HASHHASH)
ELSE_CODE(
put_back(c);
c = '%';
- token->type = T_PERCENTCOLON;
+ lexer_token.type = '#';
return;
)
- ELSE(T_PERCENTCOLON)
+ ELSE('#')
ELSE('%')
case '<':
MAYBE_PROLOG
- MAYBE(':', T_LESSCOLON)
- MAYBE('%', T_LESSPERCENT)
+ MAYBE(':', '[')
+ MAYBE('%', '{')
+ MAYBE('=', T_LESSEQUAL)
case '<':
MAYBE_PROLOG
MAYBE('=', T_LESSLESSEQUAL)
ELSE('<')
case '>':
MAYBE_PROLOG
+ MAYBE('=', T_GREATEREQUAL)
case '>':
MAYBE_PROLOG
MAYBE('=', T_GREATERGREATEREQUAL)
ELSE('|')
case ':':
MAYBE_PROLOG
- MAYBE('>', T_COLONGREATER)
+ MAYBE('>', ']')
ELSE(':')
case '=':
MAYBE_PROLOG
ELSE('#')
case '?':
- next_char();
- /* just a simple ? */
- if(c != '?') {
- token->type = '?';
- return;
- }
- /* might be a trigraph */
- next_char();
- if(replace_trigraph()) {
- break;
- }
- put_back(c);
- c = '?';
- token->type = '?';
- return;
-
case '[':
case ']':
case '(':
case '~':
case ';':
case ',':
- token->type = c;
+ case '\\':
+ lexer_token.type = c;
next_char();
return;
case EOF:
- token->type = T_EOF;
+ lexer_token.type = T_EOF;
return;
default:
+dollar_sign:
+ errorf(&lexer_token.source_position, "unknown character '%c' found", c);
next_char();
- error_prefix();
- fprintf(stderr, "unknown character '%c' found\n", c);
- token->type = T_ERROR;
+ lexer_token.type = T_ERROR;
return;
}
}
}
-void lexer_next_token(token_t *token)
+void lexer_next_token(void)
{
- lexer_next_preprocessing_token(token);
- if(token->type != '\n')
- return;
+ lexer_next_preprocessing_token();
+ while (lexer_token.type == '\n') {
newline_found:
- do {
- lexer_next_preprocessing_token(token);
- } while(token->type == '\n');
+ lexer_next_preprocessing_token();
+ }
- if(token->type == '#') {
+ if (lexer_token.type == '#') {
parse_preprocessor_directive();
goto newline_found;
}
void init_lexer(void)
{
strset_init(&stringset);
+ symbol_L = symbol_table_insert("L");
}
void lexer_open_stream(FILE *stream, const char *input_name)
{
- input = stream;
- source_position.linenr = 0;
- source_position.input_name = input_name;
+ input = stream;
+ lexer_token.source_position.linenr = 0;
+ lexer_token.source_position.input_name = input_name;
+
+ bufpos = NULL;
+ bufend = NULL;
+
+ /* place a virtual \n at the beginning so the lexer knows that we're
+ * at the beginning of a line */
+ c = '\n';
+}
+
+void lexer_open_buffer(const char *buffer, size_t len, const char *input_name)
+{
+ input = NULL;
+ lexer_token.source_position.linenr = 0;
+ lexer_token.source_position.input_name = input_name;
+
+ bufpos = buffer;
+ bufend = buffer + len;
- /* we place a virtual '\n' at the beginning so the lexer knows we're at the
- * beginning of a line */
+ /* place a virtual \n at the beginning so the lexer knows that we're
+ * at the beginning of a line */
c = '\n';
}
static __attribute__((unused))
void dbg_pos(const source_position_t source_position)
{
- fprintf(stdout, "%s:%d\n", source_position.input_name, source_position.linenr);
+ fprintf(stdout, "%s:%u\n", source_position.input_name,
+ source_position.linenr);
fflush(stdout);
}