X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/d63282419d27320c40be57d46418a0b44691626c..9ca7f077a0a5ecdd00c5945c7a7bd3cf46e23c13:/src/conflicts.h?ds=sidebyside diff --git a/src/conflicts.h b/src/conflicts.h index 50b785e6..d8264cca 100644 --- a/src/conflicts.h +++ b/src/conflicts.h @@ -1,28 +1,39 @@ -/* Find and resolve or report look-ahead conflicts for bison, - Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. +/* Find and resolve or report lookahead conflicts for bison, + Copyright (C) 2000, 2001, 2002, 2004, 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 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. + 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 3 of the License, or + (at your option) any later version. - Bison 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. + 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 CONFLICTS_H_ # define CONFLICTS_H_ # include "state.h" void conflicts_solve (void); + +/** + * Update state numbers recorded in internal arrays 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. + * - The new state number. + * - The highest new state number is the number of remaining states - 1. + * - The numerical order of the remaining states has not changed. + */ +void conflicts_update_state_numbers (state_number old_to_new[], + state_number nstates_old); + void conflicts_print (void); int conflicts_total_count (void); void conflicts_output (FILE *out);