* src/assoc.c, src/closure.c, src/gram.c, src/injections.c,

* src/lalr.c, src/LR0.c, src/relation.c, src/tables.c: Don't
translate maintainer only messages.

ChangeLog

@@ -1,3 +1,9 @@
+2002-09-04  Akim Demaille  <akim@epita.fr>
+
+	* src/assoc.c, src/closure.c, src/gram.c, src/injections.c,
+	* src/lalr.c, src/LR0.c, src/relation.c, src/tables.c: Don't
+	translate maintainer only messages.
+
 2002-08-12  Paul Eggert  <eggert@twinsun.com>
 
 	Version 1.49b.

HACKING

@@ -21,9 +21,17 @@ The correct response to most actual bugs is to write a new test case
 which demonstrates the bug.  Then fix the bug, re-run the test suite,
 and check everything in.
 
+* Hacking
+
 ** Visible changes
 Which include serious bug fixes, must be mentioned in NEWS.
 
+** Translations
+Only user visible strings are to be translated: error messages, bits
+of the .output file etc.  This excludes impossible error messages
+(comparable to assert/abort), and all the --trace output which is
+meant for the maintainers only.
+
 
 * Test suite
 

src/LR0.c

@@ -62,7 +62,7 @@ state_list_append (symbol_number_t symbol,
   state_t *state = state_new (symbol, core_size, core);
 
   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);
 
   /* If this is the endtoken, and this is not the initial state, then
@@ -180,7 +180,7 @@ new_itemsets (state_t *state)
   int i;
 
   if (trace_flag & trace_automaton)
-    fprintf (stderr, _("Entering new_itemsets, state = %d\n"),
+    fprintf (stderr, "Entering new_itemsets, state = %d\n",
 	     state->number);
 
   for (i = 0; i < nsyms; i++)
@@ -218,7 +218,7 @@ get_state (symbol_number_t symbol, size_t core_size, item_number_t *core)
   state_t *sp;
 
   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);
 
   sp = state_hash_lookup (core_size, core);
@@ -226,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);
 
   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;
 }
@@ -246,7 +246,7 @@ append_states (state_t *state)
   symbol_number_t symbol;
 
   if (trace_flag & trace_automaton)
-    fprintf (stderr, _("Entering append_states, state = %d\n"),
+    fprintf (stderr, "Entering append_states, state = %d\n",
 	     state->number);
 
   /* first sort shift_symbol into increasing order */
@@ -354,7 +354,7 @@ generate_states (void)
     {
       state_t *state = list->state;
       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,
 		 symbols[state->accessing_symbol]->tag);
       /* Set up ruleset and itemset for the transitions out of this

src/assoc.c

@@ -28,7 +28,7 @@ assoc_to_string (assoc_t assoc)
   switch (assoc)
     {
     case undef_assoc:
-      return _("undefined associativity");
+      return "undefined associativity";
 
     case right_assoc:
       return "%right";

src/closure.c

@@ -53,14 +53,14 @@ static void
 print_closure (const char *title, item_number_t *array, size_t size)
 {
   size_t i;
-  fprintf (stderr, _("Closure: %s\n"), title);
+  fprintf (stderr, "Closure: %s\n", title);
   for (i = 0; i < size; ++i)
     {
       item_number_t *rp;
       fprintf (stderr, "  %2d: .", array[i]);
       for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
 	fprintf (stderr, " %s", symbols[*rp]->tag);
-      fprintf (stderr, _("  (rule %d)\n"), -*rp - 1);
+      fprintf (stderr, "  (rule %d)\n", -*rp - 1);
     }
   fputs ("\n\n", stderr);
 }
@@ -133,10 +133,10 @@ set_firsts (void)
       }
 
   if (trace_flag & trace_sets)
-    bitsetv_matrix_dump (stderr, _("RTC: Firsts Input"), firsts);
+    bitsetv_matrix_dump (stderr, "RTC: Firsts Input", firsts);
   bitsetv_reflexive_transitive_closure (firsts);
   if (trace_flag & trace_sets)
-    bitsetv_matrix_dump (stderr, _("RTC: Firsts Output"), firsts);
+    bitsetv_matrix_dump (stderr, "RTC: Firsts Output", firsts);
 
   if (trace_flag & trace_sets)
     print_firsts ();
@@ -200,7 +200,7 @@ closure (item_number_t *core, int n)
   bitset_iterator iter;
 
   if (trace_flag & trace_sets)
-    print_closure (_("input"), core, n);
+    print_closure ("input", core, n);
 
   bitset_zero (ruleset);
 
@@ -231,7 +231,7 @@ closure (item_number_t *core, int n)
     }
 
   if (trace_flag & trace_sets)
-    print_closure (_("output"), itemset, nritemset);
+    print_closure ("output", itemset, nritemset);
 }
 
 

src/injections.c

@@ -101,10 +101,10 @@ injections_compute (void)
       }
 
   if (trace_flag & trace_sets)
-    injections_print (_("syntactic direct injections"));
+    injections_print ("syntactic direct injections");
   bitsetv_transitive_closure (injects);
   if (trace_flag & trace_sets)
-    injections_print (_("syntactic injections"));
+    injections_print ("syntactic injections");
 }
 
 

src/lalr.c

@@ -403,7 +403,7 @@ lookaheads_print (FILE *out)
 {
   state_number_t i;
   int j, k;
-  fprintf (out, _("Lookaheads: BEGIN\n"));
+  fprintf (out, "Lookaheads: BEGIN\n");
   for (i = 0; i < nstates; ++i)
     {
       reductions_t *reds = states[i]->reductions;
@@ -415,19 +415,19 @@ lookaheads_print (FILE *out)
 	  if (reds->lookaheads[k])
 	    ++nlookaheads;
 
-      fprintf (out, _("State %d: %d lookaheads\n"),
+      fprintf (out, "State %d: %d lookaheads\n",
 	       i, nlookaheads);
 
       if (reds->lookaheads)
 	for (j = 0; j < reds->num; ++j)
 	  BITSET_FOR_EACH (iter, reds->lookaheads[j], k, 0)
 	  {
-	    fprintf (out, _("   on %d (%s) -> rule %d\n"),
+	    fprintf (out, "   on %d (%s) -> rule %d\n",
 		     k, symbols[k]->tag,
 		     reds->rules[j]->number);
 	  };
     }
-  fprintf (out, _("Lookaheads: END\n"));
+  fprintf (out, "Lookaheads: END\n");
 }
 
 void

src/relation.c

@@ -134,7 +134,7 @@ relation_transpose (relation_t *R_arg, int n)
 
   if (trace_flag & trace_sets)
     {
-      fputs (_("relation_transpose: input\n"), stderr);
+      fputs ("relation_transpose: input\n", stderr);
       relation_print (*R_arg, n, stderr);
     }
 
@@ -173,7 +173,7 @@ relation_transpose (relation_t *R_arg, int n)
 
   if (trace_flag & trace_sets)
     {
-      fputs (_("relation_transpose: output\n"), stderr);
+      fputs ("relation_transpose: output\n", stderr);
       relation_print (new_R, n, stderr);
     }
 

src/tables.c

@@ -207,8 +207,8 @@ table_grow (size_t desired)
     table_size *= 2;
 
   if (trace_flag & trace_resource)
-    fprintf (stderr, _("growing table and check from: %lu to %lu\n"),
-	     (unsigned long) old_size, (unsigned long) table_size);
+    fprintf (stderr, "growing table and check from: %d to %d\n",
+	     old_size, table_size);
 
   table = XREALLOC (table, base_t, table_size);
   check = XREALLOC (check, base_t, table_size);
@@ -754,7 +754,7 @@ pack_vector (vector_number_t vector)
 	    high = loc;
 
 	  if (j < BASE_MIN || BASE_MAX < j)
-	    fatal (_("base_t too small to hold %d\n"), j);
+	    fatal ("base_t too small to hold %d\n", j);
 	  return j;
 	}
     }