Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-09 12:23:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

style: comment changes

Browse Source 
* src/lr0.c, src/state.c, src/state.h: here.
This commit is contained in:
Akim Demaille
2019-01-25 19:27:48 +01:00
parent 7fec997ecf
commit 3075d96d44
3 changed files with 16 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
src/lr0.c
View File

@@ -80,7 +80,10 @@ state_list_append (symbol_number sym, size_t core_size, item_number *core)
bitset shift_symbol;
static rule **redset;
/* For the current state, the states that can be reached via a "shift". */
/* For the current state, the list of pointers to states that can be
reached via a shift/goto. Could be indexed by the reaching symbol,
but labels of incoming transitions can be recovered by the state
itself. */
static state **shiftset;
static item_number **kernel_base;

10
src/state.c
View File

@@ -41,12 +41,12 @@
`-----------------------------------------*/
static transitions *
transitions_new (int num, state **the_states)
transitions_new (int num, state **dst)
{
size_t states_size = num * sizeof *the_states;
size_t states_size = num * sizeof *dst;
transitions *res = xmalloc (offsetof (transitions, states) + states_size);
res->num = num;
memcpy (res->states, the_states, states_size);
memcpy (res->states, dst, states_size);
return res;
}
@@ -198,10 +198,10 @@ state_free (state *s)
`---------------------------*/
void
state_transitions_set (state *s, int num, state **trans)
state_transitions_set (state *s, int num, state **dst)
{
aver (!s->transitions);
s->transitions = transitions_new (num, trans);
s->transitions = transitions_new (num, dst);
}

14
src/state.h
View File

@@ -51,11 +51,11 @@
lookahead token alone). When the states are generated, these
actions are represented in two other lists.
Each transition structure describes the possible transitions out
of one state, the state whose number is in the number field. Each
contains a vector of numbers of the states that transitions can go
to. The accessing_symbol fields of those states' cores say what
kind of input leads to them.
Each transition structure describes the possible transitions out of
one state (there are NUM of them). Each contains a vector of
numbers of the states that transitions can go to. The
accessing_symbol fields of those states' cores say what kind of
input leads to them.
A transition to state zero should be ignored: conflict resolution
deletes transitions by having them point to zero.
@@ -233,8 +233,8 @@ state *state_new (symbol_number accessing_symbol,
size_t core_size, item_number *core);
state *state_new_isocore (state const *s);
/* Set the transitions of STATE. */
void state_transitions_set (state *s, int num, state **trans);
/* Record that from S we can reach all the DST states (NUM of them). */
void state_transitions_set (state *s, int num, state **dst);
/* Set the reductions of STATE. */
void state_reductions_set (state *s, int num, rule **reds);