blob: 1dff0ba27c039b030cf64e8a88f61fd0778c0336 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/* Find and resolve or report lookahead conflicts for bison,
Copyright (C) 2000-2002, 2004, 2007, 2009-2015, 2018-2021 Free
Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
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.
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 this program. If not, see <https://www.gnu.org/licenses/>. */
#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, <tt>old_to_new[i]</tt> 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);
void conflicts_free (void);
bool has_conflicts (const state *s);
/* Were there conflicts? */
extern int expected_sr_conflicts;
extern int expected_rr_conflicts;
#endif /* !CONFLICTS_H_ */
|
