X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/a70083a3ed3fc3f69e0bed00220614f9d8263994..e0c653e7e660c353c59b054de571474450aa4c92:/src/lalr.h?ds=inline diff --git a/src/lalr.h b/src/lalr.h index c0abb2c7..c65c9b48 100644 --- a/src/lalr.h +++ b/src/lalr.h @@ -1,85 +1,83 @@ -/* Compute look-ahead criteria for bison, - Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc. +/* Compute lookahead criteria for bison, + + Copyright (C) 1984, 1986, 1989, 2000, 2002, 2004, 2006, 2007 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. - Bison is free software; you can redistribute it and/or modify + 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 2, or (at your option) - any later version. + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - Bison is distributed in the hope that it will be useful, + 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 Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ + along with this program. If not, see . */ #ifndef LALR_H_ # define LALR_H_ +# include +# include -/* Import the definition of CORE, SHIFTS and REDUCTIONS. */ -# include "state.h" - - -/* Compute how to make the finite state machine deterministic; find - which rules need lookahead in each state, and which lookahead - tokens they accept. */ +/* Import the definition of RULE_T. */ +# include "gram.h" -void lalr PARAMS ((void)); - - -/* lalr() builds these data structures. */ +/* Import the definition of CORE, TRANSITIONS and REDUCTIONS. */ +# include "state.h" -/* goto_map, from_state and to_state --record each shift transition - which accepts a variable (a nonterminal). - from_state[t] is the state number which a transition leads from and - to_state[t] is the state number it leads to. All the transitions - that accept a particular variable are grouped together and - goto_map[i - ntokens] is the index in from_state and to_state of - the first of them. */ +/** Build the LALR(1) automaton. -extern short *goto_map; -extern short *from_state; -extern short *to_state; + Compute how to make the finite state machine deterministic; find + which rules need lookahead in each state, and which lookahead + tokens they accept. -/* CONSISTENT[S] is nonzero if no lookahead is needed to decide what - to do in state S. */ + Builds: + - #goto_map + - #from_state + - #to_state +*/ +void lalr (void); -extern char *consistent; +/** + * Update state numbers recorded in #goto_map, #from_state, and #to_state such + * that: + * - \c nstates_old is the old number of states. + * - Where \c i is the old state number, old_to_new[i] is either: + * - \c nstates_old if state \c i is removed because it is unreachable. + * Thus, remove all goto entries involving this state. + * - The new state number. + */ +void lalr_update_state_numbers (state_number old_to_new[], + state_number nstates_old); -/* LARULENO is a vector which records the rules that need lookahead in - various states. The elements of LARULENO that apply to state S are - those from LOOKAHEADS[S] through LOOKAHEADS[S+1]-1. Each element - of LARULENO is a rule number. +/** Release the information related to lookahead tokens. - If LR is the length of LAruleno, then a number from 0 to LR-1 can - specify both a rule and a state where the rule might be applied. - */ + Can be performed once the action tables are computed. */ +void lalr_free (void); -extern short *LAruleno; -/* LA is a lr by ntokens matrix of bits. LA[l, i] is 1 if the rule - LAruleno[l] is applicable in the appropriate state when the next - token is symbol i. If LA[l, i] and LA[l, j] are both 1 for i != j, - it is a conflict. */ +typedef size_t goto_number; +# define GOTO_NUMBER_MAXIMUM ((goto_number) -1) -extern unsigned *LA; +/** Index into #from_state and #to_state. + All the transitions that accept a particular variable are grouped + together and GOTO_MAP[I - NTOKENS] is the index in FROM_STATE and + TO_STATE of the first of them. */ +extern goto_number *goto_map; -extern int tokensetsize; -extern short *lookaheads; -extern short *accessing_symbol; -extern core **state_table; -extern shifts **shift_table; -extern reductions **reduction_table; +/** State number which a transition leads from. */ +extern state_number *from_state; +/** State number it leads to. */ +extern state_number *to_state; #endif /* !LALR_H_ */