#include "symlist.h"
#include "symtab.h"
+static void check_and_convert_grammar (void);
+
static symbol_list *grammar = NULL;
static bool start_flag = false;
merger_list *merge_functions;
symbol_typed_p (const symbol_list *s)
{
return (s->sym->type_name
- || s->midrule && s->midrule->used);
+ || (s->midrule && s->midrule->used));
}
/*----------------------------------------------------------------.
rule_number ruleno = 0;
symbol_list *p = grammar;
- ritem = xnmalloc (nritems, sizeof *ritem);
+ ritem = xnmalloc (nritems + 1, sizeof *ritem);
+
+ /* This sentinel is used by build_relations in gram.c. */
+ *ritem++ = 0;
+
rules = xnmalloc (nrules, sizeof *rules);
while (p)
p = p->next;
}
- if (itemno != nritems)
- abort ();
+ assert (itemno == nritems);
if (trace_flag & trace_sets)
ritem_print (stderr);
scanner_initialize ();
gram_parse ();
- /* If something went wrong during the parsing, don't try to
- continue. */
- if (complaint_issued)
- return;
+ if (! complaint_issued)
+ check_and_convert_grammar ();
+
+ xfclose (gram_in);
+}
+
+
+/*-------------------------------------------------------------.
+| Check the grammar that has just been read, and convert it to |
+| internal form. |
+`-------------------------------------------------------------*/
- /* Grammar has been read. Do some checking */
+static void
+check_and_convert_grammar (void)
+{
+ /* Grammar has been read. Do some checking. */
if (nrules == 0)
fatal (_("no rules in the input grammar"));
endtoken->user_token_number = 0;
}
- /* Insert the initial rule, which line is that of the first rule
+ /* Insert the initial rule, whose line is that of the first rule
(not that of the start symbol):
accept: %start EOF. */
grammar = p;
}
- if (! (nsyms <= SYMBOL_NUMBER_MAXIMUM && nsyms == ntokens + nvars))
- abort ();
-
- xfclose (gram_in);
+ assert (nsyms <= SYMBOL_NUMBER_MAXIMUM && nsyms == ntokens + nvars);
/* Assign the symbols their symbol numbers. Write #defines for the
token symbols into FDEFINES if requested. */