]>
Commit | Line | Data |
---|---|---|
742e4900 | 1 | /* Compute lookahead criteria for bison, |
779e7ceb | 2 | |
2073e1b6 | 3 | Copyright (C) 1984, 1986, 1989, 2000, 2002, 2004, 2006 Free Software |
779e7ceb | 4 | Foundation, Inc. |
720d742f AD |
5 | |
6 | This file is part of Bison, the GNU Compiler Compiler. | |
7 | ||
8 | Bison 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 2, or (at your option) | |
11 | any later version. | |
12 | ||
13 | Bison 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 Bison; see the file COPYING. If not, write to | |
0fb669f9 PE |
20 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
21 | Boston, MA 02110-1301, USA. */ | |
720d742f AD |
22 | |
23 | #ifndef LALR_H_ | |
24 | # define LALR_H_ | |
25 | ||
b78d8c23 PE |
26 | # include <bitset.h> |
27 | # include <bitsetv.h> | |
a70083a3 | 28 | |
b0299a2e AD |
29 | /* Import the definition of RULE_T. */ |
30 | # include "gram.h" | |
a70083a3 | 31 | |
b78d8c23 PE |
32 | /* Import the definition of CORE, TRANSITIONS and REDUCTIONS. */ |
33 | # include "state.h" | |
34 | ||
2073e1b6 AD |
35 | |
36 | /** Build the LALR(1) automaton. | |
37 | ||
38 | Compute how to make the finite state machine deterministic; find | |
742e4900 | 39 | which rules need lookahead in each state, and which lookahead |
2073e1b6 | 40 | tokens they accept. |
720d742f | 41 | |
2073e1b6 AD |
42 | Builds: |
43 | - #goto_map | |
44 | - #from_state | |
45 | - #to_state | |
46 | */ | |
d33cb3ae | 47 | void lalr (void); |
720d742f | 48 | |
3325ddc4 | 49 | |
2073e1b6 | 50 | /** Release the information related to lookahead tokens. |
3325ddc4 | 51 | |
2073e1b6 AD |
52 | Can be performed once the action tables are computed. */ |
53 | void lalr_free (void); | |
720d742f | 54 | |
720d742f | 55 | |
2073e1b6 AD |
56 | typedef size_t goto_number; |
57 | # define GOTO_NUMBER_MAXIMUM ((goto_number) -1) | |
720d742f | 58 | |
2073e1b6 | 59 | /** Index into #from_state and #to_state. |
43591cec AD |
60 | |
61 | All the transitions that accept a particular variable are grouped | |
62 | together and GOTO_MAP[I - NTOKENS] is the index in FROM_STATE and | |
63 | TO_STATE of the first of them. */ | |
b78d8c23 | 64 | extern goto_number *goto_map; |
2073e1b6 AD |
65 | |
66 | /** State number which a transition leads from. */ | |
b78d8c23 | 67 | extern state_number *from_state; |
2073e1b6 AD |
68 | |
69 | /** State number it leads to. */ | |
b78d8c23 | 70 | extern state_number *to_state; |
720d742f | 71 | |
720d742f | 72 | |
720d742f | 73 | #endif /* !LALR_H_ */ |