1 /* Top level entry point of Bison.
3 Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002, 2004,
4 2005, 2006, 2007 Free Software Foundation, Inc.
6 This file is part of Bison, the GNU Compiler Compiler.
8 This program is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include <bitset_stats.h>
26 #include <configmake.h>
32 #include "conflicts.h"
38 #include "muscle_tab.h"
42 #include "print_graph.h"
43 #include "print-xml.h"
46 #include "scan-code.h"
47 #include "scan-gram.h"
48 #include "scan-skel.h"
56 main (int argc
, char *argv
[])
58 program_name
= argv
[0];
59 setlocale (LC_ALL
, "");
60 (void) bindtextdomain (PACKAGE
, LOCALEDIR
);
61 (void) bindtextdomain ("bison-runtime", LOCALEDIR
);
62 (void) textdomain (PACKAGE
);
68 timevar_report
= trace_flag
& trace_time
;
70 timevar_start (TV_TOTAL
);
72 if (trace_flag
& trace_bitsets
)
73 bitset_stats_enable ();
77 /* Read the input. Copy some parts of it to FGUARD, FACTION, FTABLE
78 and FATTRS. In file reader.c. The other parts are recorded in
79 the grammar; see gram.h. */
81 timevar_push (TV_READER
);
83 timevar_pop (TV_READER
);
88 /* Find useless nonterminals and productions and reduce the grammar. */
89 timevar_push (TV_REDUCE
);
91 timevar_pop (TV_REDUCE
);
93 /* Record other info about the grammar. In files derives and
95 timevar_push (TV_SETS
);
98 timevar_pop (TV_SETS
);
100 /* Convert to nondeterministic finite state machine. In file LR0.
101 See state.h for more info. */
102 timevar_push (TV_LR0
);
104 timevar_pop (TV_LR0
);
106 /* make it deterministic. In file lalr. */
107 timevar_push (TV_LALR
);
109 timevar_pop (TV_LALR
);
111 /* Find and record any conflicts: places where one token of
112 lookahead is not enough to disambiguate the parsing. In file
113 conflicts. Also resolve s/r conflicts based on precedence
115 timevar_push (TV_CONFLICTS
);
118 state_number
*old_to_new
= xnmalloc (nstates
, sizeof *old_to_new
);
119 state_number nstates_old
= nstates
;
120 state_remove_unreachable_states (old_to_new
);
121 lalr_update_state_numbers (old_to_new
, nstates_old
);
122 conflicts_update_state_numbers (old_to_new
, nstates_old
);
126 timevar_pop (TV_CONFLICTS
);
128 /* Compute the parser tables. */
129 timevar_push (TV_ACTIONS
);
131 timevar_pop (TV_ACTIONS
);
133 grammar_rules_never_reduced_report
134 (_("rule never reduced because of conflicts"));
136 /* Output file names. */
137 compute_output_file_names ();
139 /* Output the detailed report on the grammar. */
142 timevar_push (TV_REPORT
);
144 timevar_pop (TV_REPORT
);
147 /* Output the graph. */
150 timevar_push (TV_GRAPH
);
152 timevar_pop (TV_GRAPH
);
158 timevar_push (TV_XML
);
160 timevar_pop (TV_XML
);
163 /* Stop if there were errors, to avoid trashing previous output
165 if (complaint_issued
)
168 /* Lookahead tokens are no longer needed. */
169 timevar_push (TV_FREE
);
171 timevar_pop (TV_FREE
);
173 /* Output the tables and the parser to ftable. In file output. */
174 timevar_push (TV_PARSER
);
176 timevar_pop (TV_PARSER
);
178 timevar_push (TV_FREE
);
186 output_file_names_free ();
188 /* The scanner memory cannot be released right after parsing, as it
189 contains things such as user actions, prologue, epilogue etc. */
190 gram_scanner_free ();
193 code_scanner_free ();
194 skel_scanner_free ();
196 timevar_pop (TV_FREE
);
198 if (trace_flag
& trace_bitsets
)
199 bitset_stats_dump (stderr
);
203 /* Stop timing and print the times. */
204 timevar_stop (TV_TOTAL
);
205 timevar_print (stderr
);
207 return complaint_issued
? EXIT_FAILURE
: EXIT_SUCCESS
;