2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
22 #include "adt/strutil.h"
24 #include "diagnostic.h"
28 #include "symbol_table_t.h"
29 #include "adt/error.h"
30 #include "adt/strset.h"
36 #include "lang_features.h"
48 #define MAX_PUTBACK 16 // 3 would be enough, but 16 gives a nicer alignment
51 static input_t *input;
52 static utf32 input_buf[BUF_SIZE + MAX_PUTBACK];
53 static const utf32 *bufpos;
54 static const utf32 *bufend;
56 static source_position_t lexer_pos;
58 static symbol_t *symbol_L;
59 static strset_t stringset;
60 bool allow_dollar_in_symbol = true;
63 * Prints a parse error message at the current token.
65 * @param msg the error message
67 static void parse_error(const char *msg)
69 errorf(&lexer_pos, "%s", msg);
73 * Prints an internal error message at the current token.
75 * @param msg the error message
77 static NORETURN internal_error(const char *msg)
79 internal_errorf(&lexer_pos, "%s", msg);
82 static inline void next_real_char(void)
84 assert(bufpos <= bufend);
85 if (bufpos >= bufend) {
86 size_t n = decode(input, input_buf+MAX_PUTBACK, BUF_SIZE);
91 bufpos = input_buf + MAX_PUTBACK;
99 * Put a character back into the buffer.
101 * @param pc the character to put back
103 static inline void put_back(utf32 const pc)
105 *(--bufpos - input_buf + input_buf) = pc;
109 static inline void next_char(void);
118 lexer_pos.lineno++; \
119 lexer_pos.colno = 1; \
121 newline // Let it look like an ordinary case label.
123 #define eat(c_type) (assert(c == c_type), next_char())
125 static void maybe_concat_lines(void)
142 * Set c to the next input character, ie.
143 * after expanding trigraphs.
145 static inline void next_char(void)
149 /* filter trigraphs */
150 if (UNLIKELY(c == '\\')) {
151 maybe_concat_lines();
155 if (LIKELY(c != '?'))
159 if (LIKELY(c != '?')) {
167 case '=': c = '#'; break;
168 case '(': c = '['; break;
169 case '/': c = '\\'; maybe_concat_lines(); break;
170 case ')': c = ']'; break;
171 case '\'': c = '^'; break;
172 case '<': c = '{'; break;
173 case '!': c = '|'; break;
174 case '>': c = '}'; break;
175 case '-': c = '~'; break;
184 #define SYMBOL_CHARS \
185 case '$': if (!allow_dollar_in_symbol) goto dollar_sign; \
252 static bool is_universal_char_valid(utf32 const v)
255 if (v < 0xA0U && v != 0x24 && v != 0x40 && v != 0x60)
257 if (0xD800 <= v && v <= 0xDFFF)
262 static int digit_value(utf32 digit);
264 static utf32 parse_universal_char(unsigned const n_digits)
267 for (unsigned k = n_digits; k != 0; --k) {
269 v = 16 * v + digit_value(c);
272 errorf(&lexer_pos, "short universal character name, expected %u more digits", k);
276 if (!is_universal_char_valid(v)) {
277 errorf(&lexer_pos, "\\%c%0*X is not a valid universal character name", n_digits == 4 ? 'u' : 'U', (int)n_digits, v);
282 static bool is_universal_char_valid_identifier(utf32 const v)
285 if ( v == 0x000A8) return true;
286 if ( v == 0x000AA) return true;
287 if ( v == 0x000AD) return true;
288 if ( v == 0x000AF) return true;
289 if (0x000B2 <= v && v <= 0x000B5) return true;
290 if (0x000B7 <= v && v <= 0x000BA) return true;
291 if (0x000BC <= v && v <= 0x000BE) return true;
292 if (0x000C0 <= v && v <= 0x000D6) return true;
293 if (0x000D8 <= v && v <= 0x000F6) return true;
294 if (0x000F8 <= v && v <= 0x000FF) return true;
295 if (0x00100 <= v && v <= 0x0167F) return true;
296 if (0x01681 <= v && v <= 0x0180D) return true;
297 if (0x0180F <= v && v <= 0x01FFF) return true;
298 if (0x0200B <= v && v <= 0x0200D) return true;
299 if (0x0202A <= v && v <= 0x0202E) return true;
300 if (0x0203F <= v && v <= 0x02040) return true;
301 if ( v == 0x02054) return true;
302 if (0x02060 <= v && v <= 0x0206F) return true;
303 if (0x02070 <= v && v <= 0x0218F) return true;
304 if (0x02460 <= v && v <= 0x024FF) return true;
305 if (0x02776 <= v && v <= 0x02793) return true;
306 if (0x02C00 <= v && v <= 0x02DFF) return true;
307 if (0x02E80 <= v && v <= 0x02FFF) return true;
308 if (0x03004 <= v && v <= 0x03007) return true;
309 if (0x03021 <= v && v <= 0x0302F) return true;
310 if (0x03031 <= v && v <= 0x0303F) return true;
311 if (0x03040 <= v && v <= 0x0D7FF) return true;
312 if (0x0F900 <= v && v <= 0x0FD3D) return true;
313 if (0x0FD40 <= v && v <= 0x0FDCF) return true;
314 if (0x0FDF0 <= v && v <= 0x0FE44) return true;
315 if (0x0FE47 <= v && v <= 0x0FFFD) return true;
316 if (0x10000 <= v && v <= 0x1FFFD) return true;
317 if (0x20000 <= v && v <= 0x2FFFD) return true;
318 if (0x30000 <= v && v <= 0x3FFFD) return true;
319 if (0x40000 <= v && v <= 0x4FFFD) return true;
320 if (0x50000 <= v && v <= 0x5FFFD) return true;
321 if (0x60000 <= v && v <= 0x6FFFD) return true;
322 if (0x70000 <= v && v <= 0x7FFFD) return true;
323 if (0x80000 <= v && v <= 0x8FFFD) return true;
324 if (0x90000 <= v && v <= 0x9FFFD) return true;
325 if (0xA0000 <= v && v <= 0xAFFFD) return true;
326 if (0xB0000 <= v && v <= 0xBFFFD) return true;
327 if (0xC0000 <= v && v <= 0xCFFFD) return true;
328 if (0xD0000 <= v && v <= 0xDFFFD) return true;
329 if (0xE0000 <= v && v <= 0xEFFFD) return true;
333 static bool is_universal_char_valid_identifier_start(utf32 const v)
336 if (0x0300 <= v && v <= 0x036F) return false;
337 if (0x1DC0 <= v && v <= 0x1DFF) return false;
338 if (0x20D0 <= v && v <= 0x20FF) return false;
339 if (0xFE20 <= v && v <= 0xFE2F) return false;
344 * Read a symbol from the input and build
347 static void parse_symbol(void)
353 obstack_1grow(&symbol_obstack, (char) c);
362 case 'U': n = 8; goto universal;
363 case 'u': n = 4; goto universal;
366 utf32 const v = parse_universal_char(n);
367 if (!is_universal_char_valid_identifier(v)) {
368 if (is_universal_char_valid(v)) {
369 errorf(&lexer_pos, "universal character \\%c%0*X is not valid in an identifier", n == 4 ? 'u' : 'U', (int)n, v);
371 } else if (obstack_object_size(&symbol_obstack) == 0 && !is_universal_char_valid_identifier_start(v)) {
372 errorf(&lexer_pos, "universal character \\%c%0*X is not valid as start of an identifier", n == 4 ? 'u' : 'U', (int)n, v);
374 obstack_grow_symbol(&symbol_obstack, v);
392 obstack_1grow(&symbol_obstack, '\0');
394 char *string = obstack_finish(&symbol_obstack);
395 symbol_t *symbol = symbol_table_insert(string);
397 lexer_token.kind = symbol->ID;
398 lexer_token.base.symbol = symbol;
400 if (symbol->string != string) {
401 obstack_free(&symbol_obstack, string);
405 static string_t identify_string(char *string, size_t len)
409 const char *result = strset_insert(&stringset, concat);
410 if (result != concat) {
411 obstack_free(&symbol_obstack, concat);
414 const char *result = string;
416 return (string_t) {result, len};
420 * parse suffixes like 'LU' or 'f' after numbers
422 static void parse_number_suffix(void)
424 assert(obstack_object_size(&symbol_obstack) == 0);
428 obstack_1grow(&symbol_obstack, (char) c);
437 if (obstack_object_size(&symbol_obstack) == 0) {
438 lexer_token.number.suffix.begin = NULL;
439 lexer_token.number.suffix.size = 0;
443 obstack_1grow(&symbol_obstack, '\0');
444 size_t size = obstack_object_size(&symbol_obstack) - 1;
445 char *string = obstack_finish(&symbol_obstack);
447 lexer_token.number.suffix = identify_string(string, size);
450 static void parse_exponent(void)
452 if (c == '-' || c == '+') {
453 obstack_1grow(&symbol_obstack, (char)c);
459 obstack_1grow(&symbol_obstack, (char)c);
461 } while (isdigit(c));
463 errorf(&lexer_token.base.source_position, "exponent has no digits");
468 * Parses a hex number including hex floats and set the
471 static void parse_number_hex(void)
473 bool is_float = false;
474 bool has_digits = false;
476 while (isxdigit(c)) {
478 obstack_1grow(&symbol_obstack, (char) c);
484 obstack_1grow(&symbol_obstack, (char) c);
487 while (isxdigit(c)) {
489 obstack_1grow(&symbol_obstack, (char) c);
493 if (c == 'p' || c == 'P') {
495 obstack_1grow(&symbol_obstack, (char) c);
498 } else if (is_float) {
499 errorf(&lexer_token.base.source_position,
500 "hexadecimal floatingpoint constant requires an exponent");
502 obstack_1grow(&symbol_obstack, '\0');
504 size_t size = obstack_object_size(&symbol_obstack) - 1;
505 char *string = obstack_finish(&symbol_obstack);
506 lexer_token.number.number = identify_string(string, size);
508 lexer_token.kind = is_float ? T_FLOATINGPOINT : T_INTEGER;
511 errorf(&lexer_token.base.source_position, "invalid number literal '%S'", &lexer_token.number.number);
512 lexer_token.number.number.begin = "0";
513 lexer_token.number.number.size = 1;
516 parse_number_suffix();
519 static void parse_number_bin(void)
521 bool has_digits = false;
523 while (c == '0' || c == '1') {
525 obstack_1grow(&symbol_obstack, (char)c);
528 obstack_1grow(&symbol_obstack, '\0');
530 size_t const size = obstack_object_size(&symbol_obstack) - 1;
531 char *const string = obstack_finish(&symbol_obstack);
532 lexer_token.number.number = identify_string(string, size);
533 lexer_token.kind = T_INTEGER;
536 errorf(&lexer_token.base.source_position, "invalid number literal '%S'", &lexer_token.number.number);
537 lexer_token.number.number.begin = "0";
538 lexer_token.number.number.size = 1;
541 parse_number_suffix();
545 * Returns true if the given char is a octal digit.
547 * @param char the character to check
549 static bool is_octal_digit(utf32 chr)
551 return '0' <= chr && chr <= '7';
555 * Parses a number and sets the lexer_token.
557 static void parse_number(void)
559 bool is_float = false;
560 bool has_digits = false;
562 assert(obstack_object_size(&symbol_obstack) == 0);
564 obstack_1grow(&symbol_obstack, (char)c);
566 if (c == 'x' || c == 'X') {
567 obstack_1grow(&symbol_obstack, (char)c);
571 } else if (c == 'b' || c == 'B') {
572 /* GCC extension: binary constant 0x[bB][01]+. */
573 obstack_1grow(&symbol_obstack, (char)c);
583 obstack_1grow(&symbol_obstack, (char) c);
589 obstack_1grow(&symbol_obstack, '.');
594 obstack_1grow(&symbol_obstack, (char) c);
598 if (c == 'e' || c == 'E') {
600 obstack_1grow(&symbol_obstack, 'e');
605 obstack_1grow(&symbol_obstack, '\0');
606 size_t size = obstack_object_size(&symbol_obstack) - 1;
607 char *string = obstack_finish(&symbol_obstack);
608 lexer_token.number.number = identify_string(string, size);
611 lexer_token.kind = T_FLOATINGPOINT;
613 lexer_token.kind = T_INTEGER;
615 if (string[0] == '0') {
616 /* check for invalid octal digits */
617 for (size_t i= 0; i < size; ++i) {
620 errorf(&lexer_token.base.source_position, "invalid digit '%c' in octal number", t);
626 errorf(&lexer_token.base.source_position, "invalid number literal '%S'",
627 &lexer_token.number.number);
630 parse_number_suffix();
634 * Returns the value of a digit.
635 * The only portable way to do it ...
637 static int digit_value(utf32 const digit)
663 internal_error("wrong character given");
668 * Parses an octal character sequence.
670 * @param first_digit the already read first digit
672 static utf32 parse_octal_sequence(utf32 const first_digit)
674 assert(is_octal_digit(first_digit));
675 utf32 value = digit_value(first_digit);
676 if (!is_octal_digit(c)) return value;
677 value = 8 * value + digit_value(c);
679 if (!is_octal_digit(c)) return value;
680 value = 8 * value + digit_value(c);
686 * Parses a hex character sequence.
688 static utf32 parse_hex_sequence(void)
691 while (isxdigit(c)) {
692 value = 16 * value + digit_value(c);
699 * Parse an escape sequence.
701 static utf32 parse_escape_sequence(void)
709 case '"': return '"';
710 case '\'': return '\'';
711 case '\\': return '\\';
712 case '?': return '\?';
713 case 'a': return '\a';
714 case 'b': return '\b';
715 case 'f': return '\f';
716 case 'n': return '\n';
717 case 'r': return '\r';
718 case 't': return '\t';
719 case 'v': return '\v';
721 return parse_hex_sequence();
730 return parse_octal_sequence(ec);
732 parse_error("reached end of file while parsing escape sequence");
734 /* \E is not documented, but handled, by GCC. It is acceptable according
735 * to §6.11.4, whereas \e is not. */
739 return 27; /* hopefully 27 is ALWAYS the code for ESCAPE */
742 case 'U': return parse_universal_char(8);
743 case 'u': return parse_universal_char(4);
748 /* §6.4.4.4:8 footnote 64 */
749 parse_error("unknown escape sequence");
753 string_t make_string(const char *string)
755 size_t len = strlen(string) + 1;
756 char *const space = obstack_alloc(&symbol_obstack, len);
757 memcpy(space, string, len);
759 return identify_string(space, len);
762 static void parse_string(utf32 const delim, token_kind_t const kind, string_encoding_t const enc, char const *const context)
769 utf32 const tc = parse_escape_sequence();
770 if (enc == STRING_ENCODING_CHAR) {
772 warningf(WARN_OTHER, &lexer_pos, "escape sequence out of range");
774 obstack_1grow(&symbol_obstack, tc);
776 obstack_grow_symbol(&symbol_obstack, tc);
782 errorf(&lexer_pos, "newline while parsing %s", context);
786 errorf(&lexer_token.base.source_position, "EOF while parsing %s", context);
794 obstack_grow_symbol(&symbol_obstack, c);
802 obstack_1grow(&symbol_obstack, '\0');
803 size_t const size = obstack_object_size(&symbol_obstack) - 1;
804 char *const string = obstack_finish(&symbol_obstack);
806 lexer_token.kind = kind;
807 lexer_token.string.encoding = enc;
808 lexer_token.string.string = identify_string(string, size);
812 * Parse a string literal and set lexer_token.
814 static void parse_string_literal(string_encoding_t const enc)
816 parse_string('"', T_STRING_LITERAL, enc, "string literal");
820 * Parse a character constant and set lexer_token.
822 static void parse_character_constant(string_encoding_t const enc)
824 parse_string('\'', T_CHARACTER_CONSTANT, enc, "character constant");
825 if (lexer_token.string.string.size == 0) {
826 errorf(&lexer_token.base.source_position, "empty character constant");
831 * Skip a multiline comment.
833 static void skip_multiline_comment(void)
840 /* nested comment, warn here */
841 warningf(WARN_COMMENT, &lexer_pos, "'/*' within comment");
856 errorf(&lexer_token.base.source_position,
857 "at end of file while looking for comment end");
869 * Skip a single line comment.
871 static void skip_line_comment(void)
884 if (c == '\n' || c == '\r') {
885 warningf(WARN_COMMENT, &lexer_pos, "multi-line comment");
897 /** The current preprocessor token. */
898 static token_t pp_token;
901 * Read the next preprocessor token.
903 static inline void next_pp_token(void)
905 lexer_next_preprocessing_token();
906 pp_token = lexer_token;
910 * Eat all preprocessor tokens until newline.
912 static void eat_until_newline(void)
914 while (pp_token.kind != '\n' && pp_token.kind != T_EOF) {
920 * Parse the line directive.
922 static void parse_line_directive(void)
924 if (pp_token.kind != T_INTEGER) {
925 parse_error("expected integer");
927 /* use offset -1 as this is about the next line */
928 lexer_pos.lineno = atoi(pp_token.number.number.begin) - 1;
931 if (pp_token.kind == T_STRING_LITERAL && pp_token.string.encoding == STRING_ENCODING_CHAR) {
932 lexer_pos.input_name = pp_token.string.string.begin;
933 lexer_pos.is_system_header = false;
936 /* attempt to parse numeric flags as outputted by gcc preprocessor */
937 while (pp_token.kind == T_INTEGER) {
939 * 1 - indicates start of a new file
940 * 2 - indicates return from a file
941 * 3 - indicates system header
942 * 4 - indicates implicit extern "C" in C++ mode
944 * currently we're only interested in "3"
946 if (streq(pp_token.number.number.begin, "3")) {
947 lexer_pos.is_system_header = true;
959 typedef enum stdc_pragma_kind_t {
963 STDC_CX_LIMITED_RANGE
964 } stdc_pragma_kind_t;
967 * STDC pragma values.
969 typedef enum stdc_pragma_value_kind_t {
974 } stdc_pragma_value_kind_t;
977 * Parse a pragma directive.
979 static void parse_pragma(void)
982 if (pp_token.kind != T_IDENTIFIER) {
983 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
984 "expected identifier after #pragma");
989 stdc_pragma_kind_t kind = STDC_UNKNOWN;
990 if (pp_token.base.symbol->pp_ID == TP_STDC && c_mode & _C99) {
994 switch (pp_token.base.symbol->pp_ID) {
995 case TP_FP_CONTRACT: kind = STDC_FP_CONTRACT; break;
996 case TP_FENV_ACCESS: kind = STDC_FENV_ACCESS; break;
997 case TP_CX_LIMITED_RANGE: kind = STDC_CX_LIMITED_RANGE; break;
1000 if (kind != STDC_UNKNOWN) {
1002 stdc_pragma_value_kind_t value;
1003 switch (pp_token.base.symbol->pp_ID) {
1004 case TP_ON: value = STDC_VALUE_ON; break;
1005 case TP_OFF: value = STDC_VALUE_OFF; break;
1006 case TP_DEFAULT: value = STDC_VALUE_DEFAULT; break;
1007 default: value = STDC_VALUE_UNKNOWN; break;
1009 if (value == STDC_VALUE_UNKNOWN) {
1010 kind = STDC_UNKNOWN;
1011 errorf(&pp_token.base.source_position, "bad STDC pragma argument");
1015 eat_until_newline();
1016 if (kind == STDC_UNKNOWN) {
1017 warningf(WARN_UNKNOWN_PRAGMAS, &pp_token.base.source_position,
1018 "encountered unknown #pragma");
1023 * Parse a preprocessor non-null directive.
1025 static void parse_preprocessor_identifier(void)
1027 assert(pp_token.kind == T_IDENTIFIER);
1028 switch (pp_token.base.symbol->pp_ID) {
1031 parse_line_directive();
1037 /* TODO; output the rest of the line */
1038 parse_error("#error directive");
1044 * Parse a preprocessor directive.
1046 static void parse_preprocessor_directive(void)
1050 switch (pp_token.kind) {
1052 parse_preprocessor_identifier();
1055 parse_line_directive();
1058 /* NULL directive, see §6.10.7 */
1061 parse_error("invalid preprocessor directive");
1062 eat_until_newline();
1067 #define MAYBE_PROLOG \
1072 #define MAYBE(ch, set_type) \
1075 lexer_token.kind = set_type; \
1078 /* must use this as last thing */
1079 #define MAYBE_MODE(ch, set_type, mode) \
1081 if (c_mode & mode) { \
1083 lexer_token.kind = set_type; \
1088 #define ELSE_CODE(code) \
1093 } /* end of while (true) */ \
1095 #define ELSE(set_type) \
1097 lexer_token.kind = set_type; \
1100 void lexer_next_preprocessing_token(void)
1103 lexer_token.base.source_position = lexer_pos;
1104 lexer_token.base.symbol = NULL;
1113 lexer_token.kind = '\n';
1118 /* might be a wide string ( L"string" ) */
1119 string_encoding_t const enc = STRING_ENCODING_WIDE;
1120 if (lexer_token.base.symbol == symbol_L) {
1122 case '"': parse_string_literal(enc); break;
1123 case '\'': parse_character_constant(enc); break;
1134 parse_string_literal(STRING_ENCODING_CHAR);
1138 parse_character_constant(STRING_ENCODING_CHAR);
1151 MAYBE('.', T_DOTDOTDOT)
1155 lexer_token.kind = '.';
1160 MAYBE('&', T_ANDAND)
1161 MAYBE('=', T_ANDEQUAL)
1165 MAYBE('=', T_ASTERISKEQUAL)
1169 MAYBE('+', T_PLUSPLUS)
1170 MAYBE('=', T_PLUSEQUAL)
1174 MAYBE('>', T_MINUSGREATER)
1175 MAYBE('-', T_MINUSMINUS)
1176 MAYBE('=', T_MINUSEQUAL)
1180 MAYBE('=', T_EXCLAMATIONMARKEQUAL)
1184 MAYBE('=', T_SLASHEQUAL)
1187 skip_multiline_comment();
1188 lexer_next_preprocessing_token();
1192 skip_line_comment();
1193 lexer_next_preprocessing_token();
1199 MAYBE('=', T_PERCENTEQUAL)
1204 MAYBE(':', T_HASHHASH)
1208 lexer_token.kind = '#';
1216 MAYBE('=', T_LESSEQUAL)
1219 MAYBE('=', T_LESSLESSEQUAL)
1224 MAYBE('=', T_GREATEREQUAL)
1227 MAYBE('=', T_GREATERGREATEREQUAL)
1228 ELSE(T_GREATERGREATER)
1232 MAYBE('=', T_CARETEQUAL)
1236 MAYBE('=', T_PIPEEQUAL)
1237 MAYBE('|', T_PIPEPIPE)
1242 MAYBE_MODE(':', T_COLONCOLON, _CXX)
1246 MAYBE('=', T_EQUALEQUAL)
1250 MAYBE('#', T_HASHHASH)
1255 if (c == 'U' || c == 'u') {
1260 lexer_token.kind = '\\';
1274 lexer_token.kind = c;
1279 lexer_token.kind = T_EOF;
1284 errorf(&lexer_pos, "unknown character '%c' found", c);
1291 void lexer_next_token(void)
1293 lexer_next_preprocessing_token();
1295 while (lexer_token.kind == '\n') {
1297 lexer_next_preprocessing_token();
1300 if (lexer_token.kind == '#') {
1301 parse_preprocessor_directive();
1306 void init_lexer(void)
1308 strset_init(&stringset);
1309 symbol_L = symbol_table_insert("L");
1312 static void input_error(unsigned delta_lines, unsigned delta_cols,
1313 const char *message)
1315 lexer_pos.lineno += delta_lines;
1316 lexer_pos.colno += delta_cols;
1317 errorf(&lexer_pos, "%s", message);
1320 void lexer_switch_input(input_t *new_input, const char *input_name)
1322 lexer_pos.lineno = 0;
1323 lexer_pos.colno = 0;
1324 lexer_pos.input_name = input_name;
1326 set_input_error_callback(input_error);
1331 /* place a virtual \n at the beginning so the lexer knows that we're
1332 * at the beginning of a line */
1336 void exit_lexer(void)
1338 strset_destroy(&stringset);
1341 static __attribute__((unused))
1342 void dbg_pos(const source_position_t source_position)
1344 fprintf(stdout, "%s:%u:%u\n", source_position.input_name,
1345 source_position.lineno, (unsigned)source_position.colno);