]> git.saurik.com Git - bison.git/blob - src/symtab.c
Code cleanup.
[bison.git] / src / symtab.c
1 /* Symbol table manager for Bison.
2
3 Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004, 2005, 2006, 2007,
4 2008, 2009
5 Free Software Foundation, Inc.
6
7 This file is part of Bison, the GNU Compiler Compiler.
8
9 This program is free software: you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation, either version 3 of the License, or
12 (at your option) any later version.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21
22 #include <config.h>
23 #include "system.h"
24
25 #include <hash.h>
26 #include <quotearg.h>
27
28 #include "complain.h"
29 #include "gram.h"
30 #include "symtab.h"
31
32 /*-------------------------------------------------------------------.
33 | Symbols sorted by tag. Allocated by the first invocation of |
34 | symbols_do, after which no more symbols should be created. |
35 `-------------------------------------------------------------------*/
36
37 static symbol **symbols_sorted = NULL;
38
39 /*------------------------.
40 | Distinguished symbols. |
41 `------------------------*/
42
43 symbol *errtoken = NULL;
44 symbol *undeftoken = NULL;
45 symbol *endtoken = NULL;
46 symbol *accept = NULL;
47 symbol *startsymbol = NULL;
48 location startsymbol_location;
49
50 /*---------------------------------------.
51 | Default %destructor's and %printer's. |
52 `---------------------------------------*/
53
54 static code_props default_tagged_destructor = CODE_PROPS_NONE_INIT;
55 static code_props default_tagless_destructor = CODE_PROPS_NONE_INIT;
56 static code_props default_tagged_printer = CODE_PROPS_NONE_INIT;
57 static code_props default_tagless_printer = CODE_PROPS_NONE_INIT;
58
59 /*---------------------------------.
60 | Create a new symbol, named TAG. |
61 `---------------------------------*/
62
63 static symbol *
64 symbol_new (uniqstr tag, location loc)
65 {
66 symbol *res = xmalloc (sizeof *res);
67
68 uniqstr_assert (tag);
69
70 /* If the tag is not a string (starts with a double quote), check
71 that it is valid for Yacc. */
72 if (tag[0] != '\"' && tag[0] != '\'' && strchr (tag, '-'))
73 yacc_at (loc, _("POSIX Yacc forbids dashes in symbol names: %s"),
74 tag);
75
76 res->tag = tag;
77 res->location = loc;
78
79 res->type_name = NULL;
80 code_props_none_init (&res->destructor);
81 code_props_none_init (&res->printer);
82
83 res->number = NUMBER_UNDEFINED;
84 res->prec = 0;
85 res->assoc = undef_assoc;
86 res->user_token_number = USER_NUMBER_UNDEFINED;
87
88 res->alias = NULL;
89 res->class = unknown_sym;
90 res->declared = false;
91
92 if (nsyms == SYMBOL_NUMBER_MAXIMUM)
93 fatal (_("too many symbols in input grammar (limit is %d)"),
94 SYMBOL_NUMBER_MAXIMUM);
95 nsyms++;
96 return res;
97 }
98
99 /*----------------------------------------.
100 | Create a new semantic type, named TAG. |
101 `----------------------------------------*/
102
103 static semantic_type *
104 semantic_type_new (uniqstr tag)
105 {
106 semantic_type *res = xmalloc (sizeof *res);
107
108 uniqstr_assert (tag);
109 res->tag = tag;
110 code_props_none_init (&res->destructor);
111 code_props_none_init (&res->printer);
112
113 return res;
114 }
115
116
117 /*-----------------.
118 | Print a symbol. |
119 `-----------------*/
120
121 #define SYMBOL_ATTR_PRINT(Attr) \
122 if (s->Attr) \
123 fprintf (f, " %s { %s }", #Attr, s->Attr)
124
125 #define SYMBOL_CODE_PRINT(Attr) \
126 if (s->Attr.code) \
127 fprintf (f, " %s { %s }", #Attr, s->Attr.code)
128
129 void
130 symbol_print (symbol *s, FILE *f)
131 {
132 if (s)
133 {
134 fprintf (f, "\"%s\"", s->tag);
135 SYMBOL_ATTR_PRINT (type_name);
136 SYMBOL_CODE_PRINT (destructor);
137 SYMBOL_CODE_PRINT (printer);
138 }
139 else
140 fprintf (f, "<NULL>");
141 }
142
143 #undef SYMBOL_ATTR_PRINT
144 #undef SYMBOL_CODE_PRINT
145
146 /*------------------------------------------------------------------.
147 | Complain that S's WHAT is redeclared at SECOND, and was first set |
148 | at FIRST. |
149 `------------------------------------------------------------------*/
150
151 static void
152 symbol_redeclaration (symbol *s, const char *what, location first,
153 location second)
154 {
155 complain_at (second, _("%s redeclaration for %s"), what, s->tag);
156 complain_at (first, _("previous declaration"));
157 }
158
159 static void
160 semantic_type_redeclaration (semantic_type *s, const char *what, location first,
161 location second)
162 {
163 complain_at (second, _("%s redeclaration for <%s>"), what, s->tag);
164 complain_at (first, _("previous declaration"));
165 }
166
167
168
169 /*-----------------------------------------------------------------.
170 | Set the TYPE_NAME associated with SYM. Does nothing if passed 0 |
171 | as TYPE_NAME. |
172 `-----------------------------------------------------------------*/
173
174 void
175 symbol_type_set (symbol *sym, uniqstr type_name, location loc)
176 {
177 if (type_name)
178 {
179 if (sym->type_name)
180 symbol_redeclaration (sym, "%type", sym->type_location, loc);
181 uniqstr_assert (type_name);
182 sym->type_name = type_name;
183 sym->type_location = loc;
184 }
185 }
186
187 /*-----------------------------------------.
188 | Set the DESTRUCTOR associated with SYM. |
189 `-----------------------------------------*/
190
191 void
192 symbol_destructor_set (symbol *sym, code_props const *destructor)
193 {
194 if (sym->destructor.code)
195 symbol_redeclaration (sym, "%destructor", sym->destructor.location,
196 destructor->location);
197 sym->destructor = *destructor;
198 }
199
200 /*------------------------------------------.
201 | Set the DESTRUCTOR associated with TYPE. |
202 `------------------------------------------*/
203
204 void
205 semantic_type_destructor_set (semantic_type *type,
206 code_props const *destructor)
207 {
208 if (type->destructor.code)
209 semantic_type_redeclaration (type, "%destructor",
210 type->destructor.location,
211 destructor->location);
212 type->destructor = *destructor;
213 }
214
215 /*---------------------------------------.
216 | Get the computed %destructor for SYM. |
217 `---------------------------------------*/
218
219 code_props const *
220 symbol_destructor_get (symbol const *sym)
221 {
222 /* Per-symbol %destructor. */
223 if (sym->destructor.code)
224 return &sym->destructor;
225
226 /* Per-type %destructor. */
227 if (sym->type_name)
228 {
229 code_props const *destructor =
230 &semantic_type_get (sym->type_name)->destructor;
231 if (destructor->code)
232 return destructor;
233 }
234
235 /* Apply default %destructor's only to user-defined symbols. */
236 if (sym->tag[0] == '$' || sym == errtoken)
237 return &code_props_none;
238
239 if (sym->type_name)
240 return &default_tagged_destructor;
241 return &default_tagless_destructor;
242 }
243
244 /*--------------------------------------.
245 | Set the PRINTER associated with SYM. |
246 `--------------------------------------*/
247
248 void
249 symbol_printer_set (symbol *sym, code_props const *printer)
250 {
251 if (sym->printer.code)
252 symbol_redeclaration (sym, "%printer",
253 sym->printer.location, printer->location);
254 sym->printer = *printer;
255 }
256
257 /*---------------------------------------.
258 | Set the PRINTER associated with TYPE. |
259 `---------------------------------------*/
260
261 void
262 semantic_type_printer_set (semantic_type *type, code_props const *printer)
263 {
264 if (type->printer.code)
265 semantic_type_redeclaration (type, "%printer",
266 type->printer.location, printer->location);
267 type->printer = *printer;
268 }
269
270 /*------------------------------------.
271 | Get the computed %printer for SYM. |
272 `------------------------------------*/
273
274 code_props const *
275 symbol_printer_get (symbol const *sym)
276 {
277 /* Per-symbol %printer. */
278 if (sym->printer.code)
279 return &sym->printer;
280
281 /* Per-type %printer. */
282 if (sym->type_name)
283 {
284 code_props const *printer = &semantic_type_get (sym->type_name)->printer;
285 if (printer->code)
286 return printer;
287 }
288
289 /* Apply the default %printer only to user-defined symbols. */
290 if (sym->tag[0] == '$' || sym == errtoken)
291 return &code_props_none;
292
293 if (sym->type_name)
294 return &default_tagged_printer;
295 return &default_tagless_printer;
296 }
297
298 /*-----------------------------------------------------------------.
299 | Set the PRECEDENCE associated with SYM. Does nothing if invoked |
300 | with UNDEF_ASSOC as ASSOC. |
301 `-----------------------------------------------------------------*/
302
303 void
304 symbol_precedence_set (symbol *sym, int prec, assoc a, location loc)
305 {
306 if (a != undef_assoc)
307 {
308 if (sym->prec != 0)
309 symbol_redeclaration (sym, assoc_to_string (a), sym->prec_location,
310 loc);
311 sym->prec = prec;
312 sym->assoc = a;
313 sym->prec_location = loc;
314 }
315
316 /* Only terminals have a precedence. */
317 symbol_class_set (sym, token_sym, loc, false);
318 }
319
320
321 /*------------------------------------.
322 | Set the CLASS associated with SYM. |
323 `------------------------------------*/
324
325 void
326 symbol_class_set (symbol *sym, symbol_class class, location loc, bool declaring)
327 {
328 if (sym->class != unknown_sym && sym->class != class)
329 {
330 complain_at (loc, _("symbol %s redefined"), sym->tag);
331 sym->declared = false;
332 }
333
334 if (class == nterm_sym && sym->class != nterm_sym)
335 sym->number = nvars++;
336 else if (class == token_sym && sym->number == NUMBER_UNDEFINED)
337 sym->number = ntokens++;
338
339 sym->class = class;
340
341 if (declaring)
342 {
343 if (sym->declared)
344 warn_at (loc, _("symbol %s redeclared"), sym->tag);
345 sym->declared = true;
346 }
347 }
348
349
350 /*------------------------------------------------.
351 | Set the USER_TOKEN_NUMBER associated with SYM. |
352 `------------------------------------------------*/
353
354 void
355 symbol_user_token_number_set (symbol *sym, int user_token_number, location loc)
356 {
357 int *user_token_numberp;
358
359 if (sym->user_token_number != USER_NUMBER_HAS_STRING_ALIAS)
360 user_token_numberp = &sym->user_token_number;
361 else
362 user_token_numberp = &sym->alias->user_token_number;
363 if (*user_token_numberp != USER_NUMBER_UNDEFINED
364 && *user_token_numberp != user_token_number)
365 complain_at (loc, _("redefining user token number of %s"), sym->tag);
366
367 *user_token_numberp = user_token_number;
368 /* User defined $end token? */
369 if (user_token_number == 0)
370 {
371 endtoken = sym;
372 endtoken->number = 0;
373 /* It is always mapped to 0, so it was already counted in
374 NTOKENS. */
375 --ntokens;
376 }
377 }
378
379
380 /*----------------------------------------------------------.
381 | If SYM is not defined, report an error, and consider it a |
382 | nonterminal. |
383 `----------------------------------------------------------*/
384
385 static inline bool
386 symbol_check_defined (symbol *sym)
387 {
388 if (sym->class == unknown_sym)
389 {
390 complain_at
391 (sym->location,
392 _("symbol %s is used, but is not defined as a token and has no rules"),
393 sym->tag);
394 sym->class = nterm_sym;
395 sym->number = nvars++;
396 }
397
398 return true;
399 }
400
401 static bool
402 symbol_check_defined_processor (void *sym, void *null ATTRIBUTE_UNUSED)
403 {
404 return symbol_check_defined (sym);
405 }
406
407
408 void
409 symbol_make_alias (symbol *sym, symbol *str, location loc)
410 {
411 if (str->alias)
412 warn_at (loc, _("symbol `%s' used more than once as a literal string"),
413 str->tag);
414 else if (sym->alias)
415 warn_at (loc, _("symbol `%s' given more than one literal string"),
416 sym->tag);
417 else
418 {
419 str->class = token_sym;
420 str->user_token_number = sym->user_token_number;
421 sym->user_token_number = USER_NUMBER_HAS_STRING_ALIAS;
422 str->alias = sym;
423 sym->alias = str;
424 str->number = sym->number;
425 symbol_type_set (str, sym->type_name, loc);
426 }
427 }
428
429
430 /*---------------------------------------------------------.
431 | Check that THIS, and its alias, have same precedence and |
432 | associativity. |
433 `---------------------------------------------------------*/
434
435 static inline void
436 symbol_check_alias_consistency (symbol *this)
437 {
438 symbol *sym = this;
439 symbol *str = this->alias;
440
441 /* Check only the symbol in the symbol-string pair. */
442 if (!(this->alias
443 && this->user_token_number == USER_NUMBER_HAS_STRING_ALIAS))
444 return;
445
446 if (str->type_name != sym->type_name)
447 {
448 if (str->type_name)
449 symbol_type_set (sym, str->type_name, str->type_location);
450 else
451 symbol_type_set (str, sym->type_name, sym->type_location);
452 }
453
454
455 if (str->destructor.code || sym->destructor.code)
456 {
457 if (str->destructor.code)
458 symbol_destructor_set (sym, &str->destructor);
459 else
460 symbol_destructor_set (str, &sym->destructor);
461 }
462
463 if (str->printer.code || sym->printer.code)
464 {
465 if (str->printer.code)
466 symbol_printer_set (sym, &str->printer);
467 else
468 symbol_printer_set (str, &sym->printer);
469 }
470
471 if (sym->prec || str->prec)
472 {
473 if (str->prec)
474 symbol_precedence_set (sym, str->prec, str->assoc,
475 str->prec_location);
476 else
477 symbol_precedence_set (str, sym->prec, sym->assoc,
478 sym->prec_location);
479 }
480 }
481
482 static bool
483 symbol_check_alias_consistency_processor (void *this,
484 void *null ATTRIBUTE_UNUSED)
485 {
486 symbol_check_alias_consistency (this);
487 return true;
488 }
489
490
491 /*-------------------------------------------------------------------.
492 | Assign a symbol number, and write the definition of the token name |
493 | into FDEFINES. Put in SYMBOLS. |
494 `-------------------------------------------------------------------*/
495
496 static inline bool
497 symbol_pack (symbol *this)
498 {
499 aver (this->number != NUMBER_UNDEFINED);
500 if (this->class == nterm_sym)
501 this->number += ntokens;
502 else if (this->user_token_number == USER_NUMBER_HAS_STRING_ALIAS)
503 return true;
504
505 symbols[this->number] = this;
506 return true;
507 }
508
509 static bool
510 symbol_pack_processor (void *this, void *null ATTRIBUTE_UNUSED)
511 {
512 return symbol_pack (this);
513 }
514
515
516 static void
517 user_token_number_redeclaration (int num, symbol *first, symbol *second)
518 {
519 /* User token numbers are not assigned during the parsing, but in a
520 second step, via a traversal of the symbol table sorted on tag.
521
522 However, error messages make more sense if we keep the first
523 declaration first. */
524 if (location_cmp (first->location, second->location) > 0)
525 {
526 symbol* tmp = first;
527 first = second;
528 second = tmp;
529 }
530 complain_at (second->location,
531 _("user token number %d redeclaration for %s"),
532 num, second->tag);
533 complain_at (first->location, _("previous declaration for %s"),
534 first->tag);
535 }
536
537 /*--------------------------------------------------.
538 | Put THIS in TOKEN_TRANSLATIONS if it is a token. |
539 `--------------------------------------------------*/
540
541 static inline bool
542 symbol_translation (symbol *this)
543 {
544 /* Non-terminal? */
545 if (this->class == token_sym
546 && this->user_token_number != USER_NUMBER_HAS_STRING_ALIAS)
547 {
548 /* A token which translation has already been set? */
549 if (token_translations[this->user_token_number] != undeftoken->number)
550 user_token_number_redeclaration
551 (this->user_token_number,
552 symbols[token_translations[this->user_token_number]],
553 this);
554
555 token_translations[this->user_token_number] = this->number;
556 }
557
558 return true;
559 }
560
561 static bool
562 symbol_translation_processor (void *this, void *null ATTRIBUTE_UNUSED)
563 {
564 return symbol_translation (this);
565 }
566
567
568 /*---------------------------------------.
569 | Symbol and semantic type hash tables. |
570 `---------------------------------------*/
571
572 /* Initial capacity of symbol and semantic type hash table. */
573 #define HT_INITIAL_CAPACITY 257
574
575 static struct hash_table *symbol_table = NULL;
576 static struct hash_table *semantic_type_table = NULL;
577
578 static inline bool
579 hash_compare_symbol (const symbol *m1, const symbol *m2)
580 {
581 /* Since tags are unique, we can compare the pointers themselves. */
582 return UNIQSTR_EQ (m1->tag, m2->tag);
583 }
584
585 static inline bool
586 hash_compare_semantic_type (const semantic_type *m1, const semantic_type *m2)
587 {
588 /* Since names are unique, we can compare the pointers themselves. */
589 return UNIQSTR_EQ (m1->tag, m2->tag);
590 }
591
592 static bool
593 hash_symbol_comparator (void const *m1, void const *m2)
594 {
595 return hash_compare_symbol (m1, m2);
596 }
597
598 static bool
599 hash_semantic_type_comparator (void const *m1, void const *m2)
600 {
601 return hash_compare_semantic_type (m1, m2);
602 }
603
604 static inline size_t
605 hash_symbol (const symbol *m, size_t tablesize)
606 {
607 /* Since tags are unique, we can hash the pointer itself. */
608 return ((uintptr_t) m->tag) % tablesize;
609 }
610
611 static inline size_t
612 hash_semantic_type (const semantic_type *m, size_t tablesize)
613 {
614 /* Since names are unique, we can hash the pointer itself. */
615 return ((uintptr_t) m->tag) % tablesize;
616 }
617
618 static size_t
619 hash_symbol_hasher (void const *m, size_t tablesize)
620 {
621 return hash_symbol (m, tablesize);
622 }
623
624 static size_t
625 hash_semantic_type_hasher (void const *m, size_t tablesize)
626 {
627 return hash_semantic_type (m, tablesize);
628 }
629
630 /*-------------------------------.
631 | Create the symbol hash table. |
632 `-------------------------------*/
633
634 void
635 symbols_new (void)
636 {
637 symbol_table = hash_initialize (HT_INITIAL_CAPACITY,
638 NULL,
639 hash_symbol_hasher,
640 hash_symbol_comparator,
641 free);
642 semantic_type_table = hash_initialize (HT_INITIAL_CAPACITY,
643 NULL,
644 hash_semantic_type_hasher,
645 hash_semantic_type_comparator,
646 free);
647 }
648
649
650 /*----------------------------------------------------------------.
651 | Find the symbol named KEY, and return it. If it does not exist |
652 | yet, create it. |
653 `----------------------------------------------------------------*/
654
655 symbol *
656 symbol_from_uniqstr (const uniqstr key, location loc)
657 {
658 symbol probe;
659 symbol *entry;
660
661 probe.tag = key;
662 entry = hash_lookup (symbol_table, &probe);
663
664 if (!entry)
665 {
666 /* First insertion in the hash. */
667 aver (!symbols_sorted);
668 entry = symbol_new (key, loc);
669 if (!hash_insert (symbol_table, entry))
670 xalloc_die ();
671 }
672 return entry;
673 }
674
675
676 /*-----------------------------------------------------------------------.
677 | Find the semantic type named KEY, and return it. If it does not exist |
678 | yet, create it. |
679 `-----------------------------------------------------------------------*/
680
681 semantic_type *
682 semantic_type_from_uniqstr (const uniqstr key)
683 {
684 semantic_type probe;
685 semantic_type *entry;
686
687 probe.tag = key;
688 entry = hash_lookup (semantic_type_table, &probe);
689
690 if (!entry)
691 {
692 /* First insertion in the hash. */
693 entry = semantic_type_new (key);
694 if (!hash_insert (semantic_type_table, entry))
695 xalloc_die ();
696 }
697 return entry;
698 }
699
700
701 /*----------------------------------------------------------------.
702 | Find the symbol named KEY, and return it. If it does not exist |
703 | yet, create it. |
704 `----------------------------------------------------------------*/
705
706 symbol *
707 symbol_get (const char *key, location loc)
708 {
709 return symbol_from_uniqstr (uniqstr_new (key), loc);
710 }
711
712
713 /*-----------------------------------------------------------------------.
714 | Find the semantic type named KEY, and return it. If it does not exist |
715 | yet, create it. |
716 `-----------------------------------------------------------------------*/
717
718 semantic_type *
719 semantic_type_get (const char *key)
720 {
721 return semantic_type_from_uniqstr (uniqstr_new (key));
722 }
723
724
725 /*------------------------------------------------------------------.
726 | Generate a dummy nonterminal, whose name cannot conflict with the |
727 | user's names. |
728 `------------------------------------------------------------------*/
729
730 symbol *
731 dummy_symbol_get (location loc)
732 {
733 /* Incremented for each generated symbol. */
734 static int dummy_count = 0;
735 static char buf[256];
736
737 symbol *sym;
738
739 sprintf (buf, "$@%d", ++dummy_count);
740 sym = symbol_get (buf, loc);
741 sym->class = nterm_sym;
742 sym->number = nvars++;
743 return sym;
744 }
745
746 bool
747 symbol_is_dummy (const symbol *sym)
748 {
749 return sym->tag[0] == '@' || (sym->tag[0] == '$' && sym->tag[1] == '@');
750 }
751
752 /*-------------------.
753 | Free the symbols. |
754 `-------------------*/
755
756 void
757 symbols_free (void)
758 {
759 hash_free (symbol_table);
760 hash_free (semantic_type_table);
761 free (symbols);
762 free (symbols_sorted);
763 }
764
765
766 /*---------------------------------------------------------------.
767 | Look for undefined symbols, report an error, and consider them |
768 | terminals. |
769 `---------------------------------------------------------------*/
770
771 static int
772 symbols_cmp (symbol const *a, symbol const *b)
773 {
774 return strcmp (a->tag, b->tag);
775 }
776
777 static int
778 symbols_cmp_qsort (void const *a, void const *b)
779 {
780 return symbols_cmp (*(symbol * const *)a, *(symbol * const *)b);
781 }
782
783 static void
784 symbols_do (Hash_processor processor, void *processor_data)
785 {
786 size_t count = hash_get_n_entries (symbol_table);
787 if (!symbols_sorted)
788 {
789 symbols_sorted = xnmalloc (count, sizeof *symbols_sorted);
790 hash_get_entries (symbol_table, (void**)symbols_sorted, count);
791 qsort (symbols_sorted, count, sizeof *symbols_sorted,
792 symbols_cmp_qsort);
793 }
794 {
795 size_t i;
796 for (i = 0; i < count; ++i)
797 processor (symbols_sorted[i], processor_data);
798 }
799 }
800
801 /*--------------------------------------------------------------.
802 | Check that all the symbols are defined. Report any undefined |
803 | symbols and consider them nonterminals. |
804 `--------------------------------------------------------------*/
805
806 void
807 symbols_check_defined (void)
808 {
809 symbols_do (symbol_check_defined_processor, NULL);
810 }
811
812 /*------------------------------------------------------------------.
813 | Set TOKEN_TRANSLATIONS. Check that no two symbols share the same |
814 | number. |
815 `------------------------------------------------------------------*/
816
817 static void
818 symbols_token_translations_init (void)
819 {
820 bool num_256_available_p = true;
821 int i;
822
823 /* Find the highest user token number, and whether 256, the POSIX
824 preferred user token number for the error token, is used. */
825 max_user_token_number = 0;
826 for (i = 0; i < ntokens; ++i)
827 {
828 symbol *this = symbols[i];
829 if (this->user_token_number != USER_NUMBER_UNDEFINED)
830 {
831 if (this->user_token_number > max_user_token_number)
832 max_user_token_number = this->user_token_number;
833 if (this->user_token_number == 256)
834 num_256_available_p = false;
835 }
836 }
837
838 /* If 256 is not used, assign it to error, to follow POSIX. */
839 if (num_256_available_p
840 && errtoken->user_token_number == USER_NUMBER_UNDEFINED)
841 errtoken->user_token_number = 256;
842
843 /* Set the missing user numbers. */
844 if (max_user_token_number < 256)
845 max_user_token_number = 256;
846
847 for (i = 0; i < ntokens; ++i)
848 {
849 symbol *this = symbols[i];
850 if (this->user_token_number == USER_NUMBER_UNDEFINED)
851 this->user_token_number = ++max_user_token_number;
852 if (this->user_token_number > max_user_token_number)
853 max_user_token_number = this->user_token_number;
854 }
855
856 token_translations = xnmalloc (max_user_token_number + 1,
857 sizeof *token_translations);
858
859 /* Initialize all entries for literal tokens to 2, the internal
860 token number for $undefined, which represents all invalid inputs.
861 */
862 for (i = 0; i < max_user_token_number + 1; i++)
863 token_translations[i] = undeftoken->number;
864 symbols_do (symbol_translation_processor, NULL);
865 }
866
867
868 /*----------------------------------------------------------------.
869 | Assign symbol numbers, and write definition of token names into |
870 | FDEFINES. Set up vectors SYMBOL_TABLE, TAGS of symbols. |
871 `----------------------------------------------------------------*/
872
873 void
874 symbols_pack (void)
875 {
876 symbols_do (symbol_check_alias_consistency_processor, NULL);
877
878 symbols = xcalloc (nsyms, sizeof *symbols);
879 symbols_do (symbol_pack_processor, NULL);
880
881 /* Aliases leave empty slots in symbols, so remove them. */
882 {
883 int writei;
884 int readi;
885 int nsyms_old = nsyms;
886 for (writei = 0, readi = 0; readi < nsyms_old; readi += 1)
887 {
888 if (symbols[readi] == NULL)
889 {
890 nsyms -= 1;
891 ntokens -= 1;
892 }
893 else
894 {
895 symbols[writei] = symbols[readi];
896 symbols[writei]->number = writei;
897 if (symbols[writei]->alias)
898 symbols[writei]->alias->number = writei;
899 writei += 1;
900 }
901 }
902 }
903 symbols = xnrealloc (symbols, nsyms, sizeof *symbols);
904
905 symbols_token_translations_init ();
906
907 if (startsymbol->class == unknown_sym)
908 fatal_at (startsymbol_location,
909 _("the start symbol %s is undefined"),
910 startsymbol->tag);
911 else if (startsymbol->class == token_sym)
912 fatal_at (startsymbol_location,
913 _("the start symbol %s is a token"),
914 startsymbol->tag);
915 }
916
917
918 /*--------------------------------------------------.
919 | Set default tagged/tagless %destructor/%printer. |
920 `--------------------------------------------------*/
921
922 void
923 default_tagged_destructor_set (code_props const *destructor)
924 {
925 if (default_tagged_destructor.code)
926 {
927 complain_at (destructor->location,
928 _("redeclaration for default tagged %%destructor"));
929 complain_at (default_tagged_destructor.location,
930 _("previous declaration"));
931 }
932 default_tagged_destructor = *destructor;
933 }
934
935 void
936 default_tagless_destructor_set (code_props const *destructor)
937 {
938 if (default_tagless_destructor.code)
939 {
940 complain_at (destructor->location,
941 _("redeclaration for default tagless %%destructor"));
942 complain_at (default_tagless_destructor.location,
943 _("previous declaration"));
944 }
945 default_tagless_destructor = *destructor;
946 }
947
948 void
949 default_tagged_printer_set (code_props const *printer)
950 {
951 if (default_tagged_printer.code)
952 {
953 complain_at (printer->location,
954 _("redeclaration for default tagged %%printer"));
955 complain_at (default_tagged_printer.location,
956 _("previous declaration"));
957 }
958 default_tagged_printer = *printer;
959 }
960
961 void
962 default_tagless_printer_set (code_props const *printer)
963 {
964 if (default_tagless_printer.code)
965 {
966 complain_at (printer->location,
967 _("redeclaration for default tagless %%printer"));
968 complain_at (default_tagless_printer.location,
969 _("previous declaration"));
970 }
971 default_tagless_printer = *printer;
972 }