than item number.
* closure.c (closure): Likewise.
* state.h (reductions): Comment sorting of rules.
(state): Comment sorting of items.
+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
2007-07-02 Joel E. Denny <jdenny@ces.clemson.edu>
Fix C++ test cases after recent Gnulib changes. Discussed starting at
| points to a vector of item numbers activated if that symbol is |
| shifted, and kernel_size[symbol] is their numbers. |
| |
| 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 |
-| on rule number. Compute each kernel_base[symbol] with the |
-| same sort. |
+| itemset is sorted on item index in ritem, which is sorted on |
+| rule number. Compute each kernel_base[symbol] with the same |
+| sort. |
`---------------------------------------------------------------*/
static void
`---------------------------------------------------------------*/
static void
if (ISVAR (ritem[core[c]]))
bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]]));
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;
Compute itemset with the same sort. */
nitemset = 0;
c = 0;
{
int num;
bitset *lookahead_tokens;
{
int num;
bitset *lookahead_tokens;
+ /* Sorted ascendingly on rule number. */
rule *rules[1];
} reductions;
rule *rules[1];
} reductions;
a human readable description of the resolution. */
const char *solved_conflicts;
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];
};
size_t nitems;
item_number items[1];
};