projects
/
bison.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
maint: more syntax-checks
[bison.git]
/
src
/
state.h
diff --git
a/src/state.h
b/src/state.h
index 2d67bb7c31b6b0e6fa19d9fc7927d48a9c5107bd..32f626c1a8fbd6589e80ff0ee7ad2d91a00dc356 100644
(file)
--- a/
src/state.h
+++ b/
src/state.h
@@
-1,24
+1,22
@@
-/* Type definitions for
nondeterministic
finite state machine for Bison.
+/* Type definitions for
the
finite state machine for Bison.
- Copyright (C) 1984, 1989, 2000
, 2001, 2002, 2003, 2004, 2007 Fre
e
-
Software
Foundation, Inc.
+ Copyright (C) 1984, 1989, 2000
-2004, 2007, 2009-2012 Free Softwar
e
+ Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
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
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
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., 51 Franklin Street, Fifth Floor,
- Boston, MA 02110-1301, USA. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* These type definitions are used to represent a nondeterministic
/* These type definitions are used to represent a nondeterministic
@@
-121,41
+119,41
@@
typedef struct
TRANSITIONS->states[Num]? Can be a token (amongst which the error
token), or non terminals in case of gotos. */
TRANSITIONS->states[Num]? Can be a token (amongst which the error
token), or non terminals in case of gotos. */
-#define TRANSITION_SYMBOL(Transitions, Num) \
+#
define TRANSITION_SYMBOL(Transitions, Num) \
(Transitions->states[Num]->accessing_symbol)
/* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
(Transitions->states[Num]->accessing_symbol)
/* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
-#define TRANSITION_IS_SHIFT(Transitions, Num) \
+#
define TRANSITION_IS_SHIFT(Transitions, Num) \
(ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
/* Is the TRANSITIONS->states[Num] a goto?. */
(ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
/* Is the TRANSITIONS->states[Num] a goto?. */
-#define TRANSITION_IS_GOTO(Transitions, Num) \
+#
define TRANSITION_IS_GOTO(Transitions, Num) \
(!TRANSITION_IS_SHIFT (Transitions, Num))
/* Is the TRANSITIONS->states[Num] labelled by the error token? */
(!TRANSITION_IS_SHIFT (Transitions, Num))
/* Is the TRANSITIONS->states[Num] labelled by the error token? */
-#define TRANSITION_IS_ERROR(Transitions, Num) \
+#
define TRANSITION_IS_ERROR(Transitions, Num) \
(TRANSITION_SYMBOL (Transitions, Num) == errtoken->number)
/* When resolving a SR conflicts, if the reduction wins, the shift is
disabled. */
(TRANSITION_SYMBOL (Transitions, Num) == errtoken->number)
/* When resolving a SR conflicts, if the reduction wins, the shift is
disabled. */
-#define TRANSITION_DISABLE(Transitions, Num) \
+#
define TRANSITION_DISABLE(Transitions, Num) \
(Transitions->states[Num] = NULL)
(Transitions->states[Num] = NULL)
-#define TRANSITION_IS_DISABLED(Transitions, Num) \
+#
define TRANSITION_IS_DISABLED(Transitions, Num) \
(Transitions->states[Num] == NULL)
/* Iterate over each transition over a token (shifts). */
(Transitions->states[Num] == NULL)
/* Iterate over each transition over a token (shifts). */
-#
define FOR_EACH_SHIFT(Transitions, Iter)
\
- for (Iter = 0; \
- Iter < Transitions->num \
- && (TRANSITION_IS_DISABLED (Transitions, Iter) \
- || TRANSITION_IS_SHIFT (Transitions, Iter)); \
- ++Iter) \
+#
define FOR_EACH_SHIFT(Transitions, Iter)
\
+ for (Iter = 0;
\
+ Iter < Transitions->num
\
+
&& (TRANSITION_IS_DISABLED (Transitions, Iter) \
+
|| TRANSITION_IS_SHIFT (Transitions, Iter)); \
+ ++Iter)
\
if (!TRANSITION_IS_DISABLED (Transitions, Iter))
if (!TRANSITION_IS_DISABLED (Transitions, Iter))
@@
-185,6
+183,7
@@
typedef struct
{
int num;
bitset *lookahead_tokens;
{
int num;
bitset *lookahead_tokens;
+ /* Sorted ascendingly on rule number. */
rule *rules[1];
} reductions;
rule *rules[1];
} reductions;
@@
-194,6
+193,8
@@
typedef struct
| states. |
`---------*/
| states. |
`---------*/
+struct state_list;
+
struct state
{
state_number number;
struct state
{
state_number number;
@@
-202,6
+203,11
@@
struct state
reductions *reductions;
errs *errs;
reductions *reductions;
errs *errs;
+ /* When an includer (such as ielr.c) needs to store states in a list, the
+ includer can define struct state_list as the list node structure and can
+ store in this member a reference to the node containing each state. */
+ struct state_list *state_list;
+
/* If non-zero, then no lookahead sets on reduce actions are needed to
decide what to do in state S. */
char consistent;
/* If non-zero, then no lookahead sets on reduce actions are needed to
decide what to do in state S. */
char consistent;
@@
-209,9
+215,10
@@
struct state
/* If some conflicts were solved thanks to precedence/associativity,
a human readable description of the resolution. */
const char *solved_conflicts;
/* If some conflicts were solved thanks to precedence/associativity,
a human readable description of the resolution. */
const char *solved_conflicts;
+ const char *solved_conflicts_xml;
- /* Its items. Must be last, since ITEMS can be arbitrarily large.
- */
+ /* Its items. Must be last, since ITEMS can be arbitrarily large.
Sorted
+
ascendingly on item index in RITEM, which is sorted on rule number.
*/
size_t nitems;
item_number items[1];
};
size_t nitems;
item_number items[1];
};
@@
-221,7
+228,8
@@
extern state *final_state;
/* Create a new state with ACCESSING_SYMBOL for those items. */
state *state_new (symbol_number accessing_symbol,
/* Create a new state with ACCESSING_SYMBOL for those items. */
state *state_new (symbol_number accessing_symbol,
- size_t core_size, item_number *core);
+ size_t core_size, item_number *core);
+state *state_new_isocore (state const *s);
/* Set the transitions of STATE. */
void state_transitions_set (state *s, int num, state **trans);
/* Set the transitions of STATE. */
void state_transitions_set (state *s, int num, state **trans);
@@
-237,6
+245,8
@@
void state_errs_set (state *s, int num, symbol **errors);
/* Print on OUT all the lookahead tokens such that this STATE wants to
reduce R. */
void state_rule_lookahead_tokens_print (state *s, rule *r, FILE *out);
/* Print on OUT all the lookahead tokens such that this STATE wants to
reduce R. */
void state_rule_lookahead_tokens_print (state *s, rule *r, FILE *out);
+void state_rule_lookahead_tokens_print_xml (state *s, rule *r,
+ FILE *out, int level);
/* Create/destroy the states hash table. */
void state_hash_new (void);
/* Create/destroy the states hash table. */
void state_hash_new (void);