(print_closure, set_firsts, closure): Wrap strings in _() if they need

[bison.git] / src / LR0.c

diff --git a/src/LR0.c b/src/LR0.c
index 00ff736ce9e8d8b25dd029f664cab48fff18d147..76f8145274ee6a08832a457834142224101fccc2 100644 (file)
--- a/src/LR0.c
+++ b/src/LR0.c
@@ -1,5 +1,7 @@
 /* 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.
 
@@ -59,8 +61,8 @@ state_list_append (symbol_number_t symbol,
   state_list_t *node = XMALLOC (state_list_t, 1);
   state_t *state = state_new (symbol, core_size, core);
 
-  if (trace_flag)
-    fprintf (stderr, "state_list_append (state = %d, symbol = %d (%s))\n",
+  if (trace_flag & trace_automaton)
+    fprintf (stderr, _("state_list_append (state = %d, symbol = %d (%s))\n"),
             nstates, symbol, symbols[symbol]->tag);
 
   /* If this is the endtoken, and this is not the initial state, then
@@ -177,8 +179,8 @@ new_itemsets (state_t *state)
 {
   int i;
 
-  if (trace_flag)
-    fprintf (stderr, "Entering new_itemsets, state = %d\n",
+  if (trace_flag & trace_automaton)
+    fprintf (stderr, _("Entering new_itemsets, state = %d\n"),
             state->number);
 
   for (i = 0; i < nsyms; i++)
@@ -215,16 +217,16 @@ get_state (symbol_number_t symbol, size_t core_size, item_number_t *core)
 {
   state_t *sp;
 
-  if (trace_flag)
-    fprintf (stderr, "Entering get_state, symbol = %d (%s)\n",
+  if (trace_flag & trace_automaton)
+    fprintf (stderr, _("Entering get_state, symbol = %d (%s)\n"),
             symbol, symbols[symbol]->tag);
 
   sp = state_hash_lookup (core_size, core);
   if (!sp)
     sp = state_list_append (symbol, core_size, core);
 
-  if (trace_flag)
-    fprintf (stderr, "Exiting get_state => %d\n", sp->number);
+  if (trace_flag & trace_automaton)
+    fprintf (stderr, _("Exiting get_state => %d\n"), sp->number);
 
   return sp;
 }
@@ -243,8 +245,8 @@ append_states (state_t *state)
   int j;
   symbol_number_t symbol;
 
-  if (trace_flag)
-    fprintf (stderr, "Entering append_states, state = %d\n",
+  if (trace_flag & trace_automaton)
+    fprintf (stderr, _("Entering append_states, state = %d\n"),
             state->number);
 
   /* first sort shift_symbol into increasing order */
@@ -282,11 +284,6 @@ save_reductions (state_t *state)
   int count = 0;
   int i;
 
-  /* If this is the final state, we want it to have no reductions at
-     all, although it has one for `START_SYMBOL $end .'.  */
-  if (final_state && state->number == final_state->number)
-    return;
-
   /* Find and count the active items that represent ends of rules. */
   for (i = 0; i < nritemset; ++i)
     {
@@ -356,8 +353,8 @@ generate_states (void)
   while (list)
     {
       state_t *state = list->state;
-      if (trace_flag)
-       fprintf (stderr, "Processing state %d (reached by %s)\n",
+      if (trace_flag & trace_automaton)
+       fprintf (stderr, _("Processing state %d (reached by %s)\n"),
                 state->number,
                 symbols[state->accessing_symbol]->tag);
       /* Set up ruleset and itemset for the transitions out of this