X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/c6f1a33c06db52ed122d0922885602cf37f99941..38e71ff8c8b5a0d0c6ad7dc064ebad9fe5163b18:/src/main.c diff --git a/src/main.c b/src/main.c index 6b73f9eb..ce470f3a 100644 --- a/src/main.c +++ b/src/main.c @@ -1,5 +1,5 @@ /* Top level entry point of bison, - Copyright 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002 + Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -24,6 +24,7 @@ #include "bitset_stats.h" #include "bitset.h" #include "getargs.h" +#include "struniq.h" #include "symtab.h" #include "gram.h" #include "files.h" @@ -51,8 +52,10 @@ main (int argc, char *argv[]) { program_name = argv[0]; setlocale (LC_ALL, ""); - bindtextdomain (PACKAGE, LOCALEDIR); - textdomain (PACKAGE); + (void) bindtextdomain (PACKAGE, LOCALEDIR); + (void) textdomain (PACKAGE); + + struniqs_new (); getargs (argc, argv); @@ -73,8 +76,8 @@ main (int argc, char *argv[]) reader (); timevar_pop (TV_READER); - if (complain_message_count) - exit (1); + if (complaint_issued) + goto finish; /* Find useless nonterminals and productions and reduce the grammar. */ timevar_push (TV_REDUCE); @@ -84,8 +87,8 @@ main (int argc, char *argv[]) /* Record other info about the grammar. In files derives and nullable. */ timevar_push (TV_SETS); - set_derives (); - set_nullable (); + derives_compute (); + nullable_compute (); timevar_pop (TV_SETS); /* Convert to nondeterministic finite state machine. In file LR0. @@ -108,6 +111,14 @@ main (int argc, char *argv[]) conflicts_print (); timevar_pop (TV_CONFLICTS); + /* Compute the parser tables. */ + timevar_push (TV_ACTIONS); + tables_generate (); + timevar_pop (TV_ACTIONS); + + grammar_rules_never_reduced_report + (_("rule never reduced because of conflicts")); + /* Output file names. */ compute_output_file_names (); @@ -119,11 +130,6 @@ main (int argc, char *argv[]) timevar_pop (TV_REPORT); } - /* Stop if there were errors, to avoid trashing previous output - files. */ - if (complain_message_count) - exit (1); - /* Output the VCG graph. */ if (graph_flag) { @@ -132,10 +138,15 @@ main (int argc, char *argv[]) timevar_pop (TV_GRAPH); } - /* Compute the parser tables. */ - timevar_push (TV_ACTIONS); - tables_generate (); - timevar_pop (TV_ACTIONS); + /* Stop if there were errors, to avoid trashing previous output + files. */ + if (complaint_issued) + goto finish; + + /* Lookaheads are no longer needed. */ + timevar_push (TV_FREE); + lalr_free (); + timevar_pop (TV_FREE); /* Output the tables and the parser to ftable. In file output. */ timevar_push (TV_PARSER); @@ -143,18 +154,19 @@ main (int argc, char *argv[]) timevar_pop (TV_PARSER); timevar_push (TV_FREE); + nullable_free (); + derives_free (); tables_free (); states_free (); reduce_free (); conflicts_free (); - free_nullable (); - free_derives (); grammar_free (); /* The scanner memory cannot be released right after parsing, as it contains things such as user actions, prologue, epilogue etc. */ scanner_free (); muscle_free (); + struniqs_free (); /* If using alloca.c, flush the alloca'ed memory for the benefit of people running Bison as a library in IDEs. */ #if C_ALLOCA @@ -165,9 +177,11 @@ main (int argc, char *argv[]) if (trace_flag & trace_bitsets) bitset_stats_dump (stderr); + finish: + /* Stop timing and print the times. */ timevar_stop (TV_TOTAL); timevar_print (stderr); - return complain_message_count ? EXIT_FAILURE : EXIT_SUCCESS; + return complaint_issued ? EXIT_FAILURE : EXIT_SUCCESS; }