save point: representation of grammar might be too rough.

The current representation of the grammar is the most primitive BNF.
This is the simplest to implement, but is difficult to cope with user
requirements.  Moreover, I find another paper describing the GLR
algorithm, so I need to think about the representation of the grammar
more.  In particular, I would like the generation of the grammar to be
incremental, so per chance its data type should be adapted
accordingly.

1 files changed, 4 insertions, 0 deletions

diff --git a/src/list.h b/src/list.h
index d774f96..b710aa2 100644
--- a/src/list.h
+++ b/src/list.h
@@ -28,8 +28,12 @@ typedef void (*printer)(void *);
 typedef printer acter;          /* a type that can act on list
                                    elements */
 
+typedef void (*doer)(void);
+
 void map_list(List *ls, acter f);
 
+void map_list_between(List *ls, acter f, doer d);
+
 void print_list(List *ls, printer prt);
 
 /* COPYER is expected to return NULL when it fails to copy. */