]>
Commit | Line | Data |
---|---|---|
1 | /* Top level entry point of Bison. | |
2 | ||
3 | Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002, 2004, | |
4 | 2005, 2006, 2007, 2008, 2009 Free 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 <quotearg.h> | |
28 | #include <timevar.h> | |
29 | ||
30 | #include "LR0.h" | |
31 | #include "complain.h" | |
32 | #include "conflicts.h" | |
33 | #include "derives.h" | |
34 | #include "files.h" | |
35 | #include "getargs.h" | |
36 | #include "gram.h" | |
37 | #include "lalr.h" | |
38 | #include "ielr.h" | |
39 | #include "muscle-tab.h" | |
40 | #include "nullable.h" | |
41 | #include "output.h" | |
42 | #include "print.h" | |
43 | #include "print_graph.h" | |
44 | #include "print-xml.h" | |
45 | #include "reader.h" | |
46 | #include "reduce.h" | |
47 | #include "scan-code.h" | |
48 | #include "scan-gram.h" | |
49 | #include "scan-skel.h" | |
50 | #include "symtab.h" | |
51 | #include "tables.h" | |
52 | #include "uniqstr.h" | |
53 | ||
54 | ||
55 | ||
56 | int | |
57 | main (int argc, char *argv[]) | |
58 | { | |
59 | program_name = argv[0]; | |
60 | setlocale (LC_ALL, ""); | |
61 | (void) bindtextdomain (PACKAGE, LOCALEDIR); | |
62 | (void) bindtextdomain ("bison-runtime", LOCALEDIR); | |
63 | (void) textdomain (PACKAGE); | |
64 | ||
65 | uniqstrs_new (); | |
66 | muscle_init (); | |
67 | ||
68 | getargs (argc, argv); | |
69 | ||
70 | timevar_report = trace_flag & trace_time; | |
71 | init_timevar (); | |
72 | timevar_start (TV_TOTAL); | |
73 | ||
74 | if (trace_flag & trace_bitsets) | |
75 | bitset_stats_enable (); | |
76 | ||
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. */ | |
80 | ||
81 | timevar_push (TV_READER); | |
82 | reader (); | |
83 | timevar_pop (TV_READER); | |
84 | ||
85 | if (complaint_issued) | |
86 | goto finish; | |
87 | ||
88 | /* Find useless nonterminals and productions and reduce the grammar. */ | |
89 | timevar_push (TV_REDUCE); | |
90 | reduce_grammar (); | |
91 | timevar_pop (TV_REDUCE); | |
92 | ||
93 | /* Record other info about the grammar. In files derives and | |
94 | nullable. */ | |
95 | timevar_push (TV_SETS); | |
96 | derives_compute (); | |
97 | nullable_compute (); | |
98 | timevar_pop (TV_SETS); | |
99 | ||
100 | /* Convert to nondeterministic finite state machine. In file LR0. | |
101 | See state.h for more info. */ | |
102 | timevar_push (TV_LR0); | |
103 | generate_states (); | |
104 | timevar_pop (TV_LR0); | |
105 | ||
106 | /* Make it deterministic by computing lookahead sets. Except when LALR(1) is | |
107 | requested, split states to eliminate LR(1)-relative inadequacies. In file | |
108 | lalr and ielr. */ | |
109 | ielr (); | |
110 | ||
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 | |
114 | declarations. */ | |
115 | timevar_push (TV_CONFLICTS); | |
116 | conflicts_solve (); | |
117 | if (!muscle_percent_define_flag_if ("lr.keep-unreachable-states")) | |
118 | { | |
119 | state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new); | |
120 | state_number nstates_old = nstates; | |
121 | state_remove_unreachable_states (old_to_new); | |
122 | lalr_update_state_numbers (old_to_new, nstates_old); | |
123 | conflicts_update_state_numbers (old_to_new, nstates_old); | |
124 | free (old_to_new); | |
125 | } | |
126 | conflicts_print (); | |
127 | timevar_pop (TV_CONFLICTS); | |
128 | ||
129 | /* Compute the parser tables. */ | |
130 | timevar_push (TV_ACTIONS); | |
131 | tables_generate (); | |
132 | timevar_pop (TV_ACTIONS); | |
133 | ||
134 | grammar_rules_useless_report | |
135 | (_("rule useless in parser due to conflicts")); | |
136 | ||
137 | /* Output file names. */ | |
138 | compute_output_file_names (); | |
139 | ||
140 | /* Output the detailed report on the grammar. */ | |
141 | if (report_flag) | |
142 | { | |
143 | timevar_push (TV_REPORT); | |
144 | print_results (); | |
145 | timevar_pop (TV_REPORT); | |
146 | } | |
147 | ||
148 | /* Output the graph. */ | |
149 | if (graph_flag) | |
150 | { | |
151 | timevar_push (TV_GRAPH); | |
152 | print_graph (); | |
153 | timevar_pop (TV_GRAPH); | |
154 | } | |
155 | ||
156 | /* Output xml. */ | |
157 | if (xml_flag) | |
158 | { | |
159 | timevar_push (TV_XML); | |
160 | print_xml (); | |
161 | timevar_pop (TV_XML); | |
162 | } | |
163 | ||
164 | /* Stop if there were errors, to avoid trashing previous output | |
165 | files. */ | |
166 | if (complaint_issued) | |
167 | goto finish; | |
168 | ||
169 | /* Lookahead tokens are no longer needed. */ | |
170 | timevar_push (TV_FREE); | |
171 | lalr_free (); | |
172 | timevar_pop (TV_FREE); | |
173 | ||
174 | /* Output the tables and the parser to ftable. In file output. */ | |
175 | timevar_push (TV_PARSER); | |
176 | output (); | |
177 | timevar_pop (TV_PARSER); | |
178 | ||
179 | timevar_push (TV_FREE); | |
180 | nullable_free (); | |
181 | derives_free (); | |
182 | tables_free (); | |
183 | states_free (); | |
184 | reduce_free (); | |
185 | conflicts_free (); | |
186 | grammar_free (); | |
187 | output_file_names_free (); | |
188 | ||
189 | /* The scanner memory cannot be released right after parsing, as it | |
190 | contains things such as user actions, prologue, epilogue etc. */ | |
191 | gram_scanner_free (); | |
192 | muscle_free (); | |
193 | uniqstrs_free (); | |
194 | code_scanner_free (); | |
195 | skel_scanner_free (); | |
196 | quotearg_free (); | |
197 | timevar_pop (TV_FREE); | |
198 | ||
199 | if (trace_flag & trace_bitsets) | |
200 | bitset_stats_dump (stderr); | |
201 | ||
202 | finish: | |
203 | ||
204 | /* Stop timing and print the times. */ | |
205 | timevar_stop (TV_TOTAL); | |
206 | timevar_print (stderr); | |
207 | ||
208 | return complaint_issued ? EXIT_FAILURE : EXIT_SUCCESS; | |
209 | } |