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

style: spell fixes

Browse Source 
* Makefile.am (codespell): New.
* doc/bison.texi: Fixes.
Use @option for options.
* src/lssi.c, src/lssi.h, src/parse-simulation.h, src/state-item.c:
Fix spellos.
This commit is contained in:
Akim Demaille
2020-05-23 11:11:45 +02:00
parent e7aff57122
commit 3fea8fade8
8 changed files with 42 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/lssi.c
View File

@@ -1,4 +1,4 @@
/* Lookahead sensative state item searches for counterexample generation
/* Lookahead sensitive state item searches for counterexample generation
Copyright (C) 2020 Free Software Foundation, Inc.
@@ -19,16 +19,16 @@
#include <config.h>
#include <stdlib.h>
#include "lssi.h"
#include <gl_linked_list.h>
#include <gl_xlist.h>
#include <stdlib.h>
#include "getargs.h"
#include "lssi.h"
#include "nullable.h"
// lookahead sensative state item
// Lookahead sensitive state item.
typedef struct lssi
{
state_item_number si;

2
src/lssi.h
View File

@@ -1,4 +1,4 @@
/* Lookahead sensative state item searches for counterexample generation
/* Lookahead sensitive state item searches for counterexample generation
Copyright (C) 2020 Free Software Foundation, Inc.

2
src/parse-simulation.h
View File

@@ -51,7 +51,7 @@
derivations. The derivations become the derivation of the lhs which is then
shifted over.
Effectively, everytime a derivation is appended, it represents a shift in
Effectively, every time a derivation is appended, it represents a shift in
the parser. So a parse state that contains
start: A . B C D
start: A B C D .

9
src/state-item.c
View File

@@ -35,7 +35,7 @@ size_t nstate_items;
state_item_number *state_item_map;
state_item *state_items;
// hash functions for index -> bitset hash maps
// Hash functions for index -> bitset hash maps.
typedef struct
{
int key;
@@ -293,10 +293,9 @@ init_prods (void)
}
}
/* Since lookaheads are only generated for reductions,
we need to propogate lookahead sets backwards as
the searches require each state_item to have a lookahead.
*/
/* Since lookaheads are only generated for reductions, we need to
propagate lookahead sets backwards as the searches require each
state_item to have a lookahead. */
static inline void
gen_lookaheads (void)
{