Searched refs:nritems (Results 1 – 12 of 12) sorted by relevance
| /external/bison/src/ |
| D | reader.c | 192 ++nritems; in grammar_symbol_append()
385 ++nritems; in grammar_midrule_action()
505 ritem = xnmalloc (nritems + 1, sizeof *ritem); in packgram()
583 aver (itemno == nritems); in packgram()
717 nritems += 3; in check_and_convert_grammar()
|
| D | gram.c | 35 unsigned int nritems = 0; variable
148 for (i = 0; i < nritems; ++i) in ritem_print()
247 ntokens, nvars, nsyms, nrules, nritems); in grammar_dump()
|
| D | output.c | 222 item_number *rhs = xnmalloc (nritems, sizeof *rhs); in prepare_rules()
251 aver (i == nritems); in prepare_rules()
253 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems); in prepare_rules()
|
| D | gram.h | 118 extern unsigned int nritems;
|
| D | nullable.c | 70 rule_list *relts = xnmalloc (nritems + nvars + 1, sizeof *relts); in nullable_compute()
|
| D | print_graph.c | 202 new_closure (nritems); in print_graph()
|
| D | LR0.c | 341 new_closure (nritems); in generate_states()
|
| D | reduce.c | 275 nritems -= length + 1; in reduce_grammar_tables()
|
| D | ielr.c | 51 bitset result = bitset_create (nritems, BITSET_FIXED); in ielr_compute_ritem_sees_lookahead_set()
52 unsigned int i = nritems-1; in ielr_compute_ritem_sees_lookahead_set()
|
| D | print-xml.c | 519 new_closure (nritems); in print_xml()
|
| D | print.c | 519 new_closure (nritems); in print_results()
|
| /external/bison/ |
| D | ChangeLog-2012 | 17792 * src/gram.h, src/gram.c (nritems): Is `unsigned int', not int.
18234 nritems.
18285 * src/gram.c (nitems, nrules, nsyms, ntokens, nvars, nritems)
19332 (reduce_grammar_tables): Likewise, plus update nritems.
19340 * src/LR0.c (generate_states): Use nritems, not nitems, nor using
19363 * src/output.c (output_gram): Rely on nritems, not the
19402 is used instead of > 0 where appropriate, (ii), depend upon nritems
19405 * src/gram.h, src/gram.c (nritems): New.
19407 * src/reader.c (packgram): Assert nritems and nitems are equal.
|