Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-18 16:53:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

(state_list_append, new_itemsets, get_state, append_states, generate_states):

Browse Source 
Wrap strings in _() if they need translation.
This commit is contained in:
Paul Eggert
2002-08-12 14:33:12 +00:00
parent 0755be2ff9
commit 6fc82eafd5
1 changed files with 9 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/LR0.c
View File

@@ -1,5 +1,7 @@
/* Generate the nondeterministic finite state machine for bison, /* Generate the nondeterministic finite state machine for bison,
Copyright 1984, 1986, 1989, 2000, 2001, 2002 Free Software Foundation, Inc.
Copyright (C) 1984, 1986, 1989, 2000, 2001, 2002 Free Software
Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler. This file is part of Bison, the GNU Compiler Compiler.
@@ -60,7 +62,7 @@ state_list_append (symbol_number_t symbol,
state_t *state = state_new (symbol, core_size, core); state_t *state = state_new (symbol, core_size, core);
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "state_list_append (state = %d, symbol = %d (%s))\n", fprintf (stderr, _("state_list_append (state = %d, symbol = %d (%s))\n"),
nstates, symbol, symbols[symbol]->tag); nstates, symbol, symbols[symbol]->tag);
/* If this is the endtoken, and this is not the initial state, then /* If this is the endtoken, and this is not the initial state, then
@@ -178,7 +180,7 @@ new_itemsets (state_t *state)
int i; int i;
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "Entering new_itemsets, state = %d\n", fprintf (stderr, _("Entering new_itemsets, state = %d\n"),
state->number); state->number);
for (i = 0; i < nsyms; i++) for (i = 0; i < nsyms; i++)
@@ -216,7 +218,7 @@ get_state (symbol_number_t symbol, size_t core_size, item_number_t *core)
state_t *sp; state_t *sp;
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "Entering get_state, symbol = %d (%s)\n", fprintf (stderr, _("Entering get_state, symbol = %d (%s)\n"),
symbol, symbols[symbol]->tag); symbol, symbols[symbol]->tag);
sp = state_hash_lookup (core_size, core); sp = state_hash_lookup (core_size, core);
@@ -224,7 +226,7 @@ get_state (symbol_number_t symbol, size_t core_size, item_number_t *core)
sp = state_list_append (symbol, core_size, core); sp = state_list_append (symbol, core_size, core);
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "Exiting get_state => %d\n", sp->number); fprintf (stderr, _("Exiting get_state => %d\n"), sp->number);
return sp; return sp;
} }
@@ -244,7 +246,7 @@ append_states (state_t *state)
symbol_number_t symbol; symbol_number_t symbol;
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "Entering append_states, state = %d\n", fprintf (stderr, _("Entering append_states, state = %d\n"),
state->number); state->number);
/* first sort shift_symbol into increasing order */ /* first sort shift_symbol into increasing order */
@@ -352,7 +354,7 @@ generate_states (void)
{ {
state_t *state = list->state; state_t *state = list->state;
if (trace_flag & trace_automaton) if (trace_flag & trace_automaton)
fprintf (stderr, "Processing state %d (reached by %s)\n", fprintf (stderr, _("Processing state %d (reached by %s)\n"),
state->number, state->number,
symbols[state->accessing_symbol]->tag); symbols[state->accessing_symbol]->tag);
/* Set up ruleset and itemset for the transitions out of this /* Set up ruleset and itemset for the transitions out of this