#include <ctype.h>
//#define DEBUG_CHARS
-#define MAX_PUTBACK 2
+#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;
static
-void error_prefix_at(lexer_t *this, const char *input_name, unsigned linenr)
+void error_prefix_at(const char *input_name, unsigned linenr)
{
- (void) this;
fprintf(stderr, "%s:%d: Error: ", input_name, linenr);
}
static
-void error_prefix(lexer_t *this)
+void error_prefix()
{
- error_prefix_at(this, this->source_position.input_name,
- this->source_position.linenr);
+ error_prefix_at(source_position.input_name, source_position.linenr);
}
static
-void parse_error(lexer_t *this, const char *msg)
+void parse_error(const char *msg)
{
- error_prefix(this);
+ error_prefix();
fprintf(stderr, "%s\n", msg);
}
static inline
-void next_char(lexer_t *this)
+void next_char()
{
- this->bufpos++;
- if(this->bufpos >= this->bufend) {
- size_t s = fread(this->buf + MAX_PUTBACK, 1,
- sizeof(this->buf) - MAX_PUTBACK, this->input);
+ bufpos++;
+ if(bufpos >= bufend) {
+ size_t s = fread(buf + MAX_PUTBACK, 1, sizeof(buf) - MAX_PUTBACK,
+ input);
if(s == 0) {
- this->c = EOF;
+ c = EOF;
return;
}
- this->bufpos = this->buf + MAX_PUTBACK;
- this->bufend = this->buf + MAX_PUTBACK + s;
+ bufpos = buf + MAX_PUTBACK;
+ bufend = buf + MAX_PUTBACK + s;
}
- this->c = *(this->bufpos);
+ c = *(bufpos);
#ifdef DEBUG_CHARS
- printf("nchar '%c'\n", this->c);
+ printf("nchar '%c'\n", c);
#endif
}
static inline
-void put_back(lexer_t *this, int c)
+void put_back(int pc)
{
- char *p = (char*) this->bufpos - 1;
- this->bufpos--;
- assert(p >= this->buf);
- *p = c;
+ char *p = (char*) bufpos - 1;
+ bufpos--;
+ assert(p >= buf);
+ *p = pc;
#ifdef DEBUG_CHARS
- printf("putback '%c'\n", c);
+ printf("putback '%c'\n", pc);
#endif
}
+
static
-int replace_trigraph(lexer_t *this)
+int replace_trigraph(void)
{
#define MATCH_TRIGRAPH(ch,replacement) \
case ch: \
- this->c = replacement; \
+ c = replacement; \
return 1;
- switch(this->c) {
+ switch(c) {
MATCH_TRIGRAPH('=', '#')
MATCH_TRIGRAPH('(', '[')
MATCH_TRIGRAPH('/', '\\')
return 0;
}
-#define SKIP_TRIGRAPHS(no_trigraph_code) \
+#define SKIP_TRIGRAPHS(custom_putback, no_trigraph_code) \
case '?': \
- next_char(this); \
- if(this->c != '?') { \
- put_back(this, this->c); \
- this->c = '?'; \
+ next_char(); \
+ if(c != '?') { \
+ custom_putback; \
+ put_back(c); \
+ c = '?'; \
no_trigraph_code; \
} \
- next_char(this); \
- if(replace_trigraph(this)) \
+ next_char(); \
+ if(replace_trigraph()) { \
break; \
- put_back(this, '?'); \
- put_back(this, this->c); \
- this->c = '?'; \
+ } \
+ custom_putback; \
+ put_back('?'); \
+ put_back(c); \
+ c = '?'; \
no_trigraph_code;
#define EAT_NEWLINE(newline_code) \
- if(this->c == '\r') { \
- next_char(this); \
- if(this->c == '\n') \
- next_char(this); \
- this->source_position.linenr++; \
+ if(c == '\r') { \
+ next_char(); \
+ if(c == '\n') \
+ next_char(); \
+ source_position.linenr++; \
newline_code; \
- } else if(this->c == '\n') { \
- next_char(this); \
- this->source_position.linenr++; \
+ } else if(c == '\n') { \
+ next_char(); \
+ source_position.linenr++; \
newline_code; \
}
+#define SYMBOL_CHARS \
+ case 'a': \
+ case 'b': \
+ case 'c': \
+ case 'd': \
+ case 'e': \
+ case 'f': \
+ case 'g': \
+ case 'h': \
+ case 'i': \
+ case 'j': \
+ case 'k': \
+ case 'l': \
+ case 'm': \
+ case 'n': \
+ case 'o': \
+ case 'p': \
+ case 'q': \
+ case 'r': \
+ case 's': \
+ case 't': \
+ case 'u': \
+ case 'v': \
+ case 'w': \
+ case 'x': \
+ case 'y': \
+ case 'z': \
+ case 'A': \
+ case 'B': \
+ case 'C': \
+ case 'D': \
+ case 'E': \
+ case 'F': \
+ case 'G': \
+ case 'H': \
+ case 'I': \
+ case 'J': \
+ case 'K': \
+ case 'L': \
+ case 'M': \
+ case 'N': \
+ case 'O': \
+ case 'P': \
+ case 'Q': \
+ case 'R': \
+ case 'S': \
+ case 'T': \
+ case 'U': \
+ case 'V': \
+ case 'W': \
+ case 'X': \
+ case 'Y': \
+ case 'Z': \
+ case '_':
+
static
-void parse_symbol(lexer_t *this, token_t *token)
+void parse_symbol(token_t *token)
{
symbol_t *symbol;
char *string;
- obstack_1grow(&symbol_obstack, this->c);
- next_char(this);
+ obstack_1grow(&symbol_obstack, c);
+ next_char();
while(1) {
- switch(this->c) {
+ switch(c) {
case '\\':
- next_char(this);
+ next_char();
EAT_NEWLINE(break;)
goto end_symbol;
- case 'A' ... 'Z':
- case 'a' ... 'z':
- case '_':
- obstack_1grow(&symbol_obstack, this->c);
- next_char(this);
+ SYMBOL_CHARS
+ obstack_1grow(&symbol_obstack, c);
+ next_char();
break;
case '?':
- next_char(this);
- if(this->c != '?') {
- put_back(this, this->c);
- this->c = '?';
+ next_char();
+ if(c != '?') {
+ put_back(c);
+ c = '?';
goto end_symbol;
}
- next_char(this);
- if(replace_trigraph(this))
+ next_char();
+ if(replace_trigraph())
break;
- put_back(this, '?');
- put_back(this, this->c);
- this->c = '?';
+ put_back('?');
+ put_back(c);
+ c = '?';
goto end_symbol;
default:
string = obstack_finish(&symbol_obstack);
symbol = symbol_table_insert(string);
- if(symbol->ID > 0) {
- token->type = symbol->ID;
- } else {
- token->type = T_IDENTIFIER;
- }
+ token->type = symbol->ID;
token->v.symbol = symbol;
if(symbol->string != string) {
}
}
-#if 0
-static
-preprocessor_token_type_t parse_pp_symbol(lexer_t *this)
-{
- do {
- obstack_1grow(&symbol_obstack, this->c);
- next_char(this);
- } while(is_ident_char(this->c));
- obstack_1grow(&symbol_obstack, '\0');
-
- char *string = obstack_finish(&symbol_obstack);
- symbol_t *symbol = preprocessor_symbol_table_find(string);
- obstack_free(&symbol_obstack, string);
-
- if(symbol == 0)
- return TP_ERROR;
-
- return symbol->ID;
-}
-#endif
-
static
-void parse_number_hex(lexer_t *this, token_t *token)
+void parse_number_hex(token_t *token)
{
- assert(this->c == 'x' || this->c == 'X');
- next_char(this);
+ assert(c == 'x' || c == 'X');
+ next_char();
- if (!isdigit(this->c) &&
- !('A' <= this->c && this->c <= 'F') &&
- !('a' <= this->c && this->c <= 'f')) {
- parse_error(this, "premature end of hex number literal");
+ if (!isdigit(c) &&
+ !('A' <= c && c <= 'F') &&
+ !('a' <= c && c <= 'f')) {
+ parse_error("premature end of hex number literal");
token->type = T_ERROR;
return;
}
int value = 0;
for(;;) {
- if (isdigit(this->c)) {
- value = 16 * value + this->c - '0';
- } else if ('A' <= this->c && this->c <= 'F') {
- value = 16 * value + this->c - 'A' + 10;
- } else if ('a' <= this->c && this->c <= 'f') {
- value = 16 * value + this->c - 'a' + 10;
+ 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;
return;
}
- next_char(this);
+ next_char();
}
}
static
-void parse_number_oct(lexer_t *this, token_t *token)
+void parse_number_oct(token_t *token)
{
- assert(this->c == 'o' || this->c == 'O');
- next_char(this);
+ assert(c == 'o' || c == 'O');
+ next_char();
int value = 0;
for(;;) {
- if ('0' <= this->c && this->c <= '7') {
- value = 8 * value + this->c - '0';
+ if ('0' <= c && c <= '7') {
+ value = 8 * value + c - '0';
} else {
token->type = T_INTEGER;
token->v.intvalue = value;
return;
}
- next_char(this);
+ next_char();
}
}
static
-void parse_number_dec(lexer_t *this, token_t *token, int first_char)
+void parse_number_dec(token_t *token, int first_char)
{
int value = 0;
if(first_char > 0) {
}
for(;;) {
- if (isdigit(this->c)) {
- value = 10 * value + this->c - '0';
+ if (isdigit(c)) {
+ value = 10 * value + c - '0';
} else {
token->type = T_INTEGER;
token->v.intvalue = value;
return;
}
- next_char(this);
+ next_char();
}
}
static
-void parse_number(lexer_t *this, token_t *token)
+void parse_number(token_t *token)
{
// TODO check for overflow
// TODO check for various invalid inputs sequences
- if (this->c == '0') {
- next_char(this);
- switch (this->c) {
+ if (c == '0') {
+ next_char();
+ switch (c) {
case 'X':
- case 'x': parse_number_hex(this, token); break;
+ case 'x': parse_number_hex(token); break;
case 'o':
- case 'O': parse_number_oct(this, token); break;
- default: parse_number_dec(this, token, '0');
+ case 'O': parse_number_oct(token); break;
+ default: parse_number_dec(token, '0');
}
} else {
- parse_number_dec(this, token, 0);
+ parse_number_dec(token, 0);
}
}
static
-int parse_escape_sequence(lexer_t *this)
+int parse_escape_sequence()
{
while(1) {
- int c = this->c;
- next_char(this);
+ int ec = c;
+ next_char();
- switch(c) {
+ switch(ec) {
case '"': return '"';
case '\'': return'\'';
case '\\':
case 't': return '\t';
case 'v': return '\v';
case 'x': /* TODO parse hex number ... */
- parse_error(this, "hex escape sequences not implemented yet");
+ parse_error("hex escape sequences not implemented yet");
return EOF;
- case 0 ... 8: /* TODO parse octal number ... */
- parse_error(this, "octal escape sequences not implemented yet");
+ 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(this->c != '?') {
+ if(c != '?') {
return '?';
}
/* might be a trigraph */
- next_char(this);
- if(replace_trigraph(this)) {
+ next_char();
+ if(replace_trigraph()) {
break;
}
- put_back(this, this->c);
- this->c = '?';
+ put_back(c);
+ c = '?';
return '?';
case EOF:
- parse_error(this, "reached end of file while parsing escape sequence");
+ parse_error("reached end of file while parsing escape sequence");
return EOF;
default:
- parse_error(this, "unknown escape sequence");
+ parse_error("unknown escape sequence");
return EOF;
}
}
}
static
-void parse_string_literal(lexer_t *this, token_t *token)
+void parse_string_literal(token_t *token)
{
- unsigned start_linenr = this->source_position.linenr;
+ unsigned start_linenr = source_position.linenr;
char *string;
const char *result;
- assert(this->c == '"');
- next_char(this);
+ assert(c == '"');
+ next_char();
while(1) {
- switch(this->c) {
- SKIP_TRIGRAPHS(
+ switch(c) {
+ SKIP_TRIGRAPHS(,
obstack_1grow(&symbol_obstack, '?');
- next_char(this);
+ next_char();
break;
)
case '\\':
- next_char(this);
+ next_char();
EAT_NEWLINE(break;)
- int c = parse_escape_sequence(this);
- obstack_1grow(&symbol_obstack, c);
+ int ec = parse_escape_sequence();
+ obstack_1grow(&symbol_obstack, ec);
break;
case EOF:
- error_prefix_at(this, this->source_position.input_name,
- start_linenr);
+ error_prefix_at(source_position.input_name, start_linenr);
fprintf(stderr, "string has no end\n");
token->type = T_ERROR;
return;
case '"':
- next_char(this);
+ next_char();
goto end_of_string;
default:
- obstack_1grow(&symbol_obstack, this->c);
- next_char(this);
+ obstack_1grow(&symbol_obstack, c);
+ next_char();
break;
}
}
string = obstack_finish(&symbol_obstack);
/* check if there is already a copy of the string */
- result = strset_insert(&this->stringset, string);
+ result = strset_insert(&stringset, string);
if(result != string) {
obstack_free(&symbol_obstack, string);
}
#define MATCH_NEWLINE(code) \
case '\r': \
- next_char(this); \
- if(this->c == '\n') { \
- next_char(this); \
+ next_char(); \
+ if(c == '\n') { \
+ next_char(); \
} \
- this->source_position.linenr++; \
+ source_position.linenr++; \
code; \
case '\n': \
- next_char(this); \
- this->source_position.linenr++; \
+ next_char(); \
+ source_position.linenr++; \
code;
static
-void parse_character_constant(lexer_t *this, token_t *token)
+void parse_character_constant(token_t *token)
{
- assert(this->c == '\'');
- next_char(this);
+ assert(c == '\'');
+ next_char();
int found_char = 0;
while(1) {
- switch(this->c) {
- SKIP_TRIGRAPHS(
+ switch(c) {
+ SKIP_TRIGRAPHS(,
found_char = '?';
break;
)
case '\\':
- next_char(this);
+ next_char();
EAT_NEWLINE(break;)
found_char = '\\';
break;
MATCH_NEWLINE(
- parse_error(this, "newline while parsing character constant");
+ parse_error("newline while parsing character constant");
break;
)
case '\'':
- next_char(this);
+ next_char();
goto end_of_char_constant;
case EOF:
- parse_error(this, "EOF while parsing character constant");
+ parse_error("EOF while parsing character constant");
token->type = T_ERROR;
return;
default:
if(found_char != 0) {
- parse_error(this, "more than 1 characters in character "
+ parse_error("more than 1 characters in character "
"constant");
goto end_of_char_constant;
} else {
- found_char = this->c;
- next_char(this);
+ found_char = c;
+ next_char();
}
break;
}
}
static
-void skip_multiline_comment(lexer_t *this)
+void skip_multiline_comment(void)
{
- unsigned start_linenr = this->source_position.linenr;
+ unsigned start_linenr = source_position.linenr;
+ int had_star = 0;
while(1) {
- switch(this->c) {
+ switch(c) {
case '*':
- next_char(this);
- if(this->c == '/') {
- next_char(this);
+ next_char();
+ had_star = 1;
+ break;
+
+ case '/':
+ next_char();
+ if(had_star) {
return;
}
+ had_star = 0;
break;
+
+ case '\\':
+ next_char();
+ EAT_NEWLINE(break;)
+ had_star = 0;
+ break;
+
case '?':
- next_char(this);
- if(this->c != '?')
+ next_char();
+ if(c != '?') {
+ had_star = 0;
break;
- next_char(this);
- if(replace_trigraph(this))
+ }
+ next_char();
+ if(replace_trigraph())
break;
- put_back(this, '?');
+ put_back(c);
+ c = '?';
+ had_star = 0;
/* we don't put back the 2nd ? as the comment text is discarded
* anyway */
break;
- MATCH_NEWLINE(break;)
+ MATCH_NEWLINE(had_star = 0; break;)
case EOF:
- error_prefix_at(this, this->source_position.input_name,
- start_linenr);
+ error_prefix_at(source_position.input_name, start_linenr);
fprintf(stderr, "at end of file while looking for comment end\n");
return;
default:
- next_char(this);
+ had_star = 0;
+ next_char();
break;
}
}
}
static
-void skip_line_comment(lexer_t *this)
+void skip_line_comment(void)
{
while(1) {
- switch(this->c) {
+ switch(c) {
case '?':
- next_char(this);
- if(this->c != '?')
+ next_char();
+ if(c != '?')
break;
- next_char(this);
- if(replace_trigraph(this))
+ next_char();
+ if(replace_trigraph())
break;
- put_back(this, '?');
+ put_back('?');
/* we don't put back the 2nd ? as the comment text is discarded
* anyway */
break;
case '\\':
- next_char(this);
- if(this->c == '\n') {
- next_char(this);
- this->source_position.linenr++;
+ next_char();
+ if(c == '\n') {
+ next_char();
+ source_position.linenr++;
}
break;
return;
default:
- next_char(this);
+ next_char();
break;
}
}
}
static
-void parse_preprocessor_directive(lexer_t *this, token_t *result_token)
+void lexer_next_preprocessing_token(token_t *token);
+
+static token_t pp_token;
+
+static inline
+void next_pp_token(void)
{
- (void) result_token;
- /* skip whitespaces */
- while(this->c == ' ' || this->c == '\t' || this->c == '\r') {
- next_char(this);
- }
+ lexer_next_preprocessing_token(&pp_token);
}
-void preprocessor_next_token(lexer_t *this, token_t *token)
+static
+void eat_until_newline(void)
{
- /* skip whitespaces */
- while(this->c == ' ' || this->c == '\t' || this->c == '\r') {
- next_char(this);
- }
+ /* TODO */
+}
- switch(this->c) {
- case 'A' ... 'Z':
- case 'a' ... 'z':
- case '_':
- parse_symbol(this, token);
+static
+void error_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) {
+ parse_error("expected identifier after #define\n");
+ eat_until_newline();
}
}
-void lexer_next_token(lexer_t *this, token_t *token)
+static
+void ifdef_directive(int is_ifndef)
{
- int line_begin = 0;
+ (void) is_ifndef;
+ token_t temptoken;
+ lexer_next_preprocessing_token(&temptoken);
+ //expect_identifier();
+ //extect_newline();
+}
- while(1) {
- switch(this->c) {
- case ' ':
- case '\t':
- next_char(this);
- break;
+static
+void endif_directive(void)
+{
+ //expect_newline();
+}
- MATCH_NEWLINE(break;)
+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;
+ next_pp_token();
+ }
+ if(pp_token.type == T_STRING_LITERAL) {
+ source_position.input_name = pp_token.v.string;
+ next_pp_token();
+ }
- case 'A' ... 'Z':
- case 'a' ... 'z':
- case '_':
- parse_symbol(this, token);
- return;
+ while(pp_token.type != T_EOF && pp_token.type != '\n') {
+ next_pp_token();
+ }
+}
- case '0' ... '9':
- parse_number(this, token);
- return;
+static
+void parse_preprocessor_identifier(void)
+{
+ assert(pp_token.type == T_IDENTIFIER);
+ symbol_t *symbol = pp_token.v.symbol;
- case '"':
- parse_string_literal(this, token);
- return;
+ switch(symbol->pp_ID) {
+ case TP_include:
+ printf("include - enable header name parsing!\n");
+ break;
+ case TP_define:
+ define_directive();
+ break;
+ case TP_ifdef:
+ ifdef_directive(0);
+ break;
+ case TP_ifndef:
+ ifdef_directive(1);
+ break;
+ case TP_endif:
+ endif_directive();
+ break;
+ case TP_line:
+ next_pp_token();
+ parse_line_directive();
+ break;
+ case TP_if:
+ case TP_else:
+ case TP_elif:
+ case TP_undef:
+ case TP_error:
+ error_directive();
+ break;
+ case TP_pragma:
+ break;
+ }
+}
- case '\'':
- parse_character_constant(this, token);
- return;
+static
+void parse_preprocessor_directive(token_t *result_token)
+{
+ next_pp_token();
- case '\\':
- next_char(this);
- if(this->c == '\n') {
- next_char(this);
- this->source_position.linenr++;
- break;
- } else {
- parse_error(this, "unexpected '\\' found");
- token->type = T_ERROR;
- }
- return;
+ switch(pp_token.type) {
+ case T_IDENTIFIER:
+ parse_preprocessor_identifier();
+ break;
+ case T_INTEGER:
+ parse_line_directive();
+ break;
+ }
+
+ lexer_next_token(result_token);
+}
#define MAYBE_PROLOG \
- next_char(this); \
+ next_char(); \
while(1) { \
- switch(this->c) {
+ switch(c) {
#define MAYBE(ch, set_type) \
case ch: \
- next_char(this); \
+ next_char(); \
token->type = set_type; \
return;
#define ELSE_CODE(code) \
- SKIP_TRIGRAPHS( \
+ SKIP_TRIGRAPHS(, \
code; \
) \
\
case '\\': \
- next_char(this); \
- if(this->c == '\n') { \
- next_char(this); \
- this->source_position.linenr++; \
- break; \
- } \
+ next_char(); \
+ EAT_NEWLINE(break;) \
/* fallthrough */ \
default: \
code; \
return; \
)
+static
+void eat_whitespace()
+{
+ while(1) {
+ switch(c) {
+ case ' ':
+ case '\t':
+ next_char();
+ break;
+
+ case '\r':
+ case '\n':
+ return;
+
+ case '\\':
+ next_char();
+ if(c == '\n') {
+ next_char();
+ source_position.linenr++;
+ break;
+ }
+
+ put_back(c);
+ c = '\\';
+ return;
+
+ SKIP_TRIGRAPHS(,
+ return;
+ )
+
+ case '/':
+ next_char();
+ while(1) {
+ switch(c) {
+ case '*':
+ next_char();
+ skip_multiline_comment();
+ eat_whitespace();
+ return;
+ case '/':
+ next_char();
+ skip_line_comment();
+ eat_whitespace();
+ return;
+
+ SKIP_TRIGRAPHS(
+ put_back('?');
+ ,
+ c = '/';
+ return;
+ )
+
+ case '\\':
+ next_char();
+ EAT_NEWLINE(break;)
+ /* fallthrough */
+ default:
+ return;
+ }
+ }
+ break;
+
+ default:
+ return;
+ }
+ }
+}
+
+static
+void lexer_next_preprocessing_token(token_t *token)
+{
+ while(1) {
+ switch(c) {
+ case ' ':
+ case '\t':
+ next_char();
+ break;
+
+ MATCH_NEWLINE(
+ eat_whitespace();
+ if(c == '#') {
+ next_char();
+ parse_preprocessor_directive(token);
+ return;
+ }
+ token->type = '\n';
+ return;
+ )
+
+ SYMBOL_CHARS
+ parse_symbol(token);
+ return;
+
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ parse_number(token);
+ return;
+
+ case '"':
+ parse_string_literal(token);
+ 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;
+ }
+ return;
+
case '.':
MAYBE_PROLOG
case '.':
MAYBE_PROLOG
MAYBE('.', T_DOTDOTDOT)
ELSE_CODE(
- put_back(this, this->c);
- this->c = '.';
+ put_back(c);
+ c = '.';
token->type = '.';
return;
)
MAYBE_PROLOG
MAYBE('=', T_SLASHEQUAL)
case '*':
- next_char(this);
- skip_multiline_comment(this);
- lexer_next_token(this, token);
+ next_char();
+ skip_multiline_comment();
+ lexer_next_preprocessing_token(token);
return;
case '/':
- next_char(this);
- skip_line_comment(this);
- lexer_next_token(this, token);
+ next_char();
+ skip_line_comment();
+ lexer_next_preprocessing_token(token);
return;
ELSE('/')
case '%':
MAYBE_PROLOG
MAYBE(':', T_PERCENTCOLONPERCENTCOLON)
ELSE_CODE(
- put_back(this, this->c);
- this->c = '%';
+ put_back(c);
+ c = '%';
token->type = T_PERCENTCOLON;
return;
)
case '#':
MAYBE_PROLOG
MAYBE('#', T_HASHHASH)
- ELSE_CODE(
- if(line_begin) {
- parse_preprocessor_directive(this, token);
- return;
- } else {
- token->type = '#';
- return;
- }
- )
+ ELSE('#')
case '?':
- next_char(this);
+ next_char();
/* just a simple ? */
- if(this->c != '?') {
+ if(c != '?') {
token->type = '?';
return;
}
/* might be a trigraph */
- next_char(this);
- if(replace_trigraph(this)) {
+ next_char();
+ if(replace_trigraph()) {
break;
}
- put_back(this, this->c);
- this->c = '?';
+ put_back(c);
+ c = '?';
token->type = '?';
return;
case '~':
case ';':
case ',':
- token->type = this->c;
- next_char(this);
+ token->type = c;
+ next_char();
return;
case EOF:
return;
default:
- next_char(this);
- error_prefix(this);
- fprintf(stderr, "unknown character '%c' found\n", this->c);
+ next_char();
+ error_prefix();
+ fprintf(stderr, "unknown character '%c' found\n", c);
token->type = T_ERROR;
return;
}
}
}
-void lexer_init(lexer_t *this, FILE *stream, const char *input_name)
+void lexer_next_token(token_t *token)
{
- memset(this, 0, sizeof(this[0]));
+ do {
+ lexer_next_preprocessing_token(token);
+ } while(token->type == '\n');
+}
- this->input = stream;
+void init_lexer(void)
+{
+ strset_init(&stringset);
+}
- this->source_position.linenr = 0;
- this->source_position.input_name = input_name;
- strset_init(&this->stringset);
+void lexer_open_stream(FILE *stream, const char *input_name)
+{
+ input = stream;
+ source_position.linenr = 0;
+ source_position.input_name = input_name;
/* we place a virtual '\n' at the beginning so the lexer knows we're at the
* beginning of a line */
- this->c = '\n';
+ c = '\n';
}
-void lexer_destroy(lexer_t *this)
+void exit_lexer(void)
{
- (void) this;
+ strset_destroy(&stringset);
}
static __attribute__((unused))