]> git.saurik.com Git - bison.git/blob - src/main.c
gnulib: update
[bison.git] / src / main.c
1 /* Top level entry point of Bison.
2
3 Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000-2002, 2004-2015 Free
4 Software Foundation, Inc.
5
6 This file is part of Bison, the GNU Compiler Compiler.
7
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.
12
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.
17
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/>. */
20
21 #include <config.h>
22 #include "system.h"
23
24 #include <bitset_stats.h>
25 #include <bitset.h>
26 #include <configmake.h>
27 #include <progname.h>
28 #include <quotearg.h>
29 #include <timevar.h>
30
31 #include "LR0.h"
32 #include "closeout.h"
33 #include "complain.h"
34 #include "conflicts.h"
35 #include "derives.h"
36 #include "files.h"
37 #include "getargs.h"
38 #include "gram.h"
39 #include "lalr.h"
40 #include "ielr.h"
41 #include "muscle-tab.h"
42 #include "nullable.h"
43 #include "output.h"
44 #include "print.h"
45 #include "print_graph.h"
46 #include "print-xml.h"
47 #include <quote.h>
48 #include "reader.h"
49 #include "reduce.h"
50 #include "scan-code.h"
51 #include "scan-gram.h"
52 #include "scan-skel.h"
53 #include "symtab.h"
54 #include "tables.h"
55 #include "uniqstr.h"
56
57
58 int
59 main (int argc, char *argv[])
60 {
61 set_program_name (argv[0]);
62 setlocale (LC_ALL, "");
63 (void) bindtextdomain (PACKAGE, LOCALEDIR);
64 (void) bindtextdomain ("bison-runtime", LOCALEDIR);
65 (void) textdomain (PACKAGE);
66
67 {
68 char const *cp = getenv ("LC_CTYPE");
69 if (cp && STREQ (cp, "C"))
70 set_custom_quoting (&quote_quoting_options, "'", "'");
71 else
72 set_quoting_style (&quote_quoting_options, locale_quoting_style);
73 }
74
75 atexit (close_stdout);
76
77 uniqstrs_new ();
78 muscle_init ();
79 complain_init ();
80
81 getargs (argc, argv);
82
83 timevar_report = trace_flag & trace_time;
84 init_timevar ();
85 timevar_start (TV_TOTAL);
86
87 if (trace_flag & trace_bitsets)
88 bitset_stats_enable ();
89
90 /* Read the input. Copy some parts of it to FGUARD, FACTION, FTABLE
91 and FATTRS. In file reader.c. The other parts are recorded in
92 the grammar; see gram.h. */
93
94 timevar_push (TV_READER);
95 reader ();
96 timevar_pop (TV_READER);
97
98 if (complaint_status == status_complaint)
99 goto finish;
100
101 /* Find useless nonterminals and productions and reduce the grammar. */
102 timevar_push (TV_REDUCE);
103 reduce_grammar ();
104 timevar_pop (TV_REDUCE);
105
106 /* Record other info about the grammar. In files derives and
107 nullable. */
108 timevar_push (TV_SETS);
109 derives_compute ();
110 nullable_compute ();
111 timevar_pop (TV_SETS);
112
113 /* Compute LR(0) parser states. See state.h for more info. */
114 timevar_push (TV_LR0);
115 generate_states ();
116 timevar_pop (TV_LR0);
117
118 /* Add lookahead sets to parser states. Except when LALR(1) is
119 requested, split states to eliminate LR(1)-relative
120 inadequacies. */
121 ielr ();
122
123 /* Find and record any conflicts: places where one token of
124 lookahead is not enough to disambiguate the parsing. In file
125 conflicts. Also resolve s/r conflicts based on precedence
126 declarations. */
127 timevar_push (TV_CONFLICTS);
128 conflicts_solve ();
129 if (!muscle_percent_define_flag_if ("lr.keep-unreachable-state"))
130 {
131 state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new);
132 state_number nstates_old = nstates;
133 state_remove_unreachable_states (old_to_new);
134 lalr_update_state_numbers (old_to_new, nstates_old);
135 conflicts_update_state_numbers (old_to_new, nstates_old);
136 free (old_to_new);
137 }
138 conflicts_print ();
139 timevar_pop (TV_CONFLICTS);
140
141 /* Compute the parser tables. */
142 timevar_push (TV_ACTIONS);
143 tables_generate ();
144 timevar_pop (TV_ACTIONS);
145
146 grammar_rules_useless_report (_("rule useless in parser due to conflicts"));
147
148 print_precedence_warnings ();
149
150 /* Output file names. */
151 compute_output_file_names ();
152
153 /* Output the detailed report on the grammar. */
154 if (report_flag)
155 {
156 timevar_push (TV_REPORT);
157 print_results ();
158 timevar_pop (TV_REPORT);
159 }
160
161 /* Output the graph. */
162 if (graph_flag)
163 {
164 timevar_push (TV_GRAPH);
165 print_graph ();
166 timevar_pop (TV_GRAPH);
167 }
168
169 /* Output xml. */
170 if (xml_flag)
171 {
172 timevar_push (TV_XML);
173 print_xml ();
174 timevar_pop (TV_XML);
175 }
176
177 /* Stop if there were errors, to avoid trashing previous output
178 files. */
179 if (complaint_status == status_complaint)
180 goto finish;
181
182 /* Lookahead tokens are no longer needed. */
183 timevar_push (TV_FREE);
184 lalr_free ();
185 timevar_pop (TV_FREE);
186
187 /* Output the tables and the parser to ftable. In file output. */
188 timevar_push (TV_PARSER);
189 output ();
190 timevar_pop (TV_PARSER);
191
192 timevar_push (TV_FREE);
193 nullable_free ();
194 derives_free ();
195 tables_free ();
196 states_free ();
197 reduce_free ();
198 conflicts_free ();
199 grammar_free ();
200 output_file_names_free ();
201
202 /* The scanner memory cannot be released right after parsing, as it
203 contains things such as user actions, prologue, epilogue etc. */
204 gram_scanner_free ();
205 muscle_free ();
206 uniqstrs_free ();
207 code_scanner_free ();
208 skel_scanner_free ();
209 quotearg_free ();
210 timevar_pop (TV_FREE);
211
212 if (trace_flag & trace_bitsets)
213 bitset_stats_dump (stderr);
214
215 finish:
216
217 /* Stop timing and print the times. */
218 timevar_stop (TV_TOTAL);
219 timevar_print (stderr);
220
221 cleanup_caret ();
222
223 return complaint_status ? EXIT_FAILURE : EXIT_SUCCESS;
224 }