Version 2.4.1.

[bison.git] / src / main.c

diff --git a/src/main.c b/src/main.c
index ac11f93f60941bdd1700050f1eaafe5f8b35fa20..9b472f1e9e538f7b2f780cccf30b61c4f62664ef 100644 (file)
--- a/src/main.c
+++ b/src/main.c
@@ -1,139 +1,210 @@
-/* Top level entry point of bison,
-   Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc.
+/* Top level entry point of Bison.

 
 

-This file is part of Bison, the GNU Compiler Compiler.
+   Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002, 2004,
+   2005, 2006, 2007 Free Software Foundation, Inc.

 
 

-Bison is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 2, or (at your option)
-any later version.
+   This file is part of Bison, the GNU Compiler Compiler.

 
 

-Bison is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-GNU General Public License for more details.
+   This program is free software: you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation, either version 3 of the License, or
+   (at your option) any later version.

 
 

-You should have received a copy of the GNU General Public License
-along with Bison; see the file COPYING.  If not, write to
-the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.

 
 

+   You should have received a copy of the GNU General Public License
+   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

 
 

-#include <stdio.h>
+#include <config.h>

 #include "system.h"
 #include "system.h"

-#include "machine.h"   /* JF for MAXSHORT */

 
 

-extern int lineno;
-extern int verboseflag;
+#include <bitset_stats.h>
+#include <bitset.h>
+#include <configmake.h>
+#include <quotearg.h>
+#include <timevar.h>
+
+#include "LR0.h"
+#include "complain.h"
+#include "conflicts.h"
+#include "derives.h"
+#include "files.h"
+#include "getargs.h"
+#include "gram.h"
+#include "lalr.h"
+#include "muscle_tab.h"
+#include "nullable.h"
+#include "output.h"
+#include "print.h"
+#include "print_graph.h"
+#include "print-xml.h"
+#include "reader.h"
+#include "reduce.h"
+#include "scan-code.h"
+#include "scan-gram.h"
+#include "scan-skel.h"
+#include "symtab.h"
+#include "tables.h"
+#include "uniqstr.h"

 
 

-/* Nonzero means failure has been detected; don't write a parser file.  */
-int failure;

 
 

-/* The name this program was run with, for messages. */
-char *program_name;

 
 

-extern void getargs(), openfiles(), reader(), reduce_grammar();
-extern void set_derives(), set_nullable(), generate_states();
-extern void lalr(), initialize_conflicts(), verbose(), terse();
-extern void output(), done();
-
-
-/* VMS complained about using `int'.  */

 int
 int

-main(argc, argv)
-int argc;
-char *argv[];
+main (int argc, char *argv[])

 {
   program_name = argv[0];
 {
   program_name = argv[0];

-  failure = 0;
-  lineno = 0;
-  getargs(argc, argv);
-  openfiles();
+  setlocale (LC_ALL, "");
+  (void) bindtextdomain (PACKAGE, LOCALEDIR);
+  (void) bindtextdomain ("bison-runtime", LOCALEDIR);
+  (void) textdomain (PACKAGE);

 
 

-  /* read the input.  Copy some parts of it to fguard, faction, ftable and fattrs.
-     In file reader.c.
-     The other parts are recorded in the grammar; see gram.h.  */
-  reader();
+  uniqstrs_new ();

 
 

-  /* find useless nonterminals and productions and reduce the grammar.  In
-     file reduce.c */
-  reduce_grammar();
+  getargs (argc, argv);

 
 

-  /* record other info about the grammar.  In files derives and nullable.  */
-  set_derives();
-  set_nullable();
+  timevar_report = trace_flag & trace_time;
+  init_timevar ();
+  timevar_start (TV_TOTAL);

 
 

-  /* convert to nondeterministic finite state machine.  In file LR0.
-     See state.h for more info.  */
-  generate_states();
-
-  /* make it deterministic.  In file lalr.  */
-  lalr();
-
-  /* Find and record any conflicts: places where one token of lookahead is not
-     enough to disambiguate the parsing.  In file conflicts.
-     Also resolve s/r conflicts based on precedence declarations.  */
-  initialize_conflicts();
-
-  /* print information about results, if requested.  In file print. */
-  if (verboseflag)
-    verbose();
-  else
-    terse();
-
-  /* output the tables and the parser to ftable.  In file output. */
-  output();
-  done(failure);
-}
+  if (trace_flag & trace_bitsets)
+    bitset_stats_enable ();

 
 

-/* functions to report errors which prevent a parser from being generated */
+  muscle_init ();

 
 

-void
-fatal(s)
-char *s;
-{
-  extern char *infile;
+  /* Read the input.  Copy some parts of it to FGUARD, FACTION, FTABLE
+     and FATTRS.  In file reader.c.  The other parts are recorded in
+     the grammar; see gram.h.  */

 
 

-  if (infile == 0)
-    fprintf(stderr, "fatal error: %s\n", s);
-  else
-    fprintf(stderr, "\"%s\", line %d: %s\n", infile, lineno, s);
-  done(1);
-}
+  timevar_push (TV_READER);
+  reader ();
+  timevar_pop (TV_READER);

 
 

+  if (complaint_issued)
+    goto finish;

 
 

-/* JF changed to accept/deal with variable args.
-   DO NOT change this to use varargs.  It will appear to work
-   but will break on systems that don't have the necessary library
-   functions.  This is the ONLY safe way to write such a function.  */
-/*VARARGS1*/
+  /* Find useless nonterminals and productions and reduce the grammar. */
+  timevar_push (TV_REDUCE);
+  reduce_grammar ();
+  timevar_pop (TV_REDUCE);

 
 

-void
-fatals(fmt,x1,x2,x3,x4,x5,x6,x7,x8)
-char *fmt;
-{
-  char buffer[200];
-
-  sprintf(buffer, fmt, x1,x2,x3,x4,x5,x6,x7,x8);
-  fatal(buffer);
-}
-
-
-void
-toomany(s)
-char *s;
-{
-  char buffer[200];
-
-       /* JF new msg */
-  sprintf(buffer, "limit of %d exceeded, too many %s", MAXSHORT, s);
-  fatal(buffer);
-}
+  /* Record other info about the grammar.  In files derives and
+     nullable.  */
+  timevar_push (TV_SETS);
+  derives_compute ();
+  nullable_compute ();
+  timevar_pop (TV_SETS);

 
 

+  /* Convert to nondeterministic finite state machine.  In file LR0.
+     See state.h for more info.  */
+  timevar_push (TV_LR0);
+  generate_states ();
+  timevar_pop (TV_LR0);

 
 

-void
-berror(s)
-char *s;
-{
-  fprintf(stderr, "internal error, %s\n", s);
-  abort();
+  /* make it deterministic.  In file lalr.  */
+  timevar_push (TV_LALR);
+  lalr ();
+  timevar_pop (TV_LALR);
+
+  /* Find and record any conflicts: places where one token of
+     lookahead is not enough to disambiguate the parsing.  In file
+     conflicts.  Also resolve s/r conflicts based on precedence
+     declarations.  */
+  timevar_push (TV_CONFLICTS);
+  conflicts_solve ();
+  muscle_percent_define_default ("lr.keep_unreachable_states", "false");
+  if (!muscle_percent_define_flag_if ("lr.keep_unreachable_states"))
+    {
+      state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new);
+      state_number nstates_old = nstates;
+      state_remove_unreachable_states (old_to_new);
+      lalr_update_state_numbers (old_to_new, nstates_old);
+      conflicts_update_state_numbers (old_to_new, nstates_old);
+      free (old_to_new);
+    }
+  conflicts_print ();
+  timevar_pop (TV_CONFLICTS);
+
+  /* Compute the parser tables.  */
+  timevar_push (TV_ACTIONS);
+  tables_generate ();
+  timevar_pop (TV_ACTIONS);
+
+  grammar_rules_useless_report
+    (_("rule useless in parser due to conflicts"));
+
+  /* Output file names. */
+  compute_output_file_names ();
+
+  /* Output the detailed report on the grammar.  */
+  if (report_flag)
+    {
+      timevar_push (TV_REPORT);
+      print_results ();
+      timevar_pop (TV_REPORT);
+    }
+
+  /* Output the graph.  */
+  if (graph_flag)
+    {
+      timevar_push (TV_GRAPH);
+      print_graph ();
+      timevar_pop (TV_GRAPH);
+    }
+
+  /* Output xml.  */
+  if (xml_flag)
+    {
+      timevar_push (TV_XML);
+      print_xml ();
+      timevar_pop (TV_XML);
+    }
+
+  /* Stop if there were errors, to avoid trashing previous output
+     files.  */
+  if (complaint_issued)
+    goto finish;
+
+  /* Lookahead tokens 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);
+  output ();
+  timevar_pop (TV_PARSER);
+
+  timevar_push (TV_FREE);
+  nullable_free ();
+  derives_free ();
+  tables_free ();
+  states_free ();
+  reduce_free ();
+  conflicts_free ();
+  grammar_free ();
+  output_file_names_free ();
+
+  /* The scanner memory cannot be released right after parsing, as it
+     contains things such as user actions, prologue, epilogue etc.  */
+  gram_scanner_free ();
+  muscle_free ();
+  uniqstrs_free ();
+  code_scanner_free ();
+  skel_scanner_free ();
+  quotearg_free ();
+  timevar_pop (TV_FREE);
+
+  if (trace_flag & trace_bitsets)
+    bitset_stats_dump (stderr);
+
+ finish:
+
+  /* Stop timing and print the times.  */
+  timevar_stop (TV_TOTAL);
+  timevar_print (stderr);
+
+  return complaint_issued ? EXIT_FAILURE : EXIT_SUCCESS;

 }
 }