diff options
author | JSDurand <mmemmew@gmail.com> | 2021-11-09 20:03:23 +0800 |
---|---|---|
committer | JSDurand <mmemmew@gmail.com> | 2021-11-09 20:03:23 +0800 |
commit | 53b8b6ffab5a968db75e9babddf4e2dbb2c688a3 (patch) | |
tree | 4ff55ae0027544b06702d24ec4840a2011f724e9 /src/Makefile.am | |
parent | 87b6bad500702b0fcd708ee5b1d99f61a29ec7e6 (diff) |
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.
Diffstat (limited to 'src/Makefile.am')
-rw-r--r-- | src/Makefile.am | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/src/Makefile.am b/src/Makefile.am index d38ef1b..ffb9a5c 100644 --- a/src/Makefile.am +++ b/src/Makefile.am @@ -1,8 +1,8 @@ AM_CFLAGS = -Wall -Wextra noinst_LIBRARIES = libeps.a -libeps_a_SOURCES = grammar.c list.c input.c \ -grammar.h list.h util.h input.h +libeps_a_SOURCES = grammar.c list.c reader.c \ +grammar.h list.h util.h reader.h libeps_a_CFLAGS = $(AM_CFLAGS) --pedantic @@ -19,12 +19,14 @@ CLEANFILES = TAGS # tests -check_PROGRAMS = check_list check_grammar +check_PROGRAMS = check_list check_grammar check_reader check_list_SOURCES = test/check_list.c list.c check_grammar_SOURCES = test/check_grammar.c list.c grammar.c +check_reader_SOURCES = test/check_reader.c list.c grammar.c reader.c + TESTS = $(check_PROGRAMS) AM_COLOR_TESTS = always |