| Age | Commit message (Collapse) | Author |
|---|
|
There are multiple subtle errors in the previous version, both in the
codes and in the description of the BNF format. This version should
fix some problems now.
This version can successfully parse the grammar of its own grammar
format, which is quite nice. See test/check_reader.c for parsing this
format.
|
|
Previously I used hash tables, which consume too much memory. Now the
critical parts are replaced by a new hand-written library called
"tuple.h". Now we can easily parse larger inputs. I haven't tested
its limits, though.
|
|
Hash tables take too much space!
If I use hash tables, the length of the input will be severely
limited, to an unacceptable extent. So we have to use arrays
instead.
|
|
CRF and process descriptors seem to work now. It only remains to
implement the set of pending actions before I can work on the driver
program.
|
|
A prototype of BSR is roughly finished.
|
|
|
|
Just to save some work.
|
