* LR0.c (new_itemsets): Fix wording in comments: say item index rather

than item number.
* closure.c (closure): Likewise.
* state.h (reductions): Comment sorting of rules.
(state): Comment sorting of items.

ChangeLog

@@ -1,3 +1,11 @@
+2007-07-09  Joel E. Denny  <jdenny@ces.clemson.edu>
+
+	* LR0.c (new_itemsets): Fix wording in comments: say item index rather
+	than item number.
+	* closure.c (closure): Likewise.
+	* state.h (reductions): Comment sorting of rules.
+	(state): Comment sorting of items.
+
 2007-07-02  Joel E. Denny  <jdenny@ces.clemson.edu>
 
 	Fix C++ test cases after recent Gnulib changes.  Discussed starting at

src/LR0.c

@@ -170,9 +170,9 @@ free_storage (void)
 | points to a vector of item numbers activated if that symbol is |
 | shifted, and kernel_size[symbol] is their numbers.             |
 |                                                                |
-| itemset is sorted on item number from ritem, which is sorted   |
+| itemset is sorted on item index in ritem, which is sorted on   |
-| on rule number.  Compute each kernel_base[symbol] with the     |
+| rule number.  Compute each kernel_base[symbol] with the same   |
-| same sort.                                                     |
+| sort.                                                          |
 `---------------------------------------------------------------*/
 
 static void

src/closure.c

@@ -213,7 +213,7 @@ closure (item_number *core, size_t n)
     if (ISVAR (ritem[core[c]]))
       bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
 
-  /* core is sorted on item number from ritem, which is sorted on rule number.
+  /* core is sorted on item index in ritem, which is sorted on rule number.
      Compute itemset with the same sort.  */
   nitemset = 0;
   c = 0;

src/state.h

@@ -185,6 +185,7 @@ typedef struct
 {
   int num;
   bitset *lookahead_tokens;
+  /* Sorted ascendingly on rule number.  */
   rule *rules[1];
 } reductions;
 
@@ -210,8 +211,8 @@ struct state
      a human readable description of the resolution.  */
   const char *solved_conflicts;
 
-  /* 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];
 };