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.
|
|
Strictly speaking, they are not DFA's at all. They contain ranges
which can determine whether or not a character belongs to the
specified predicate terminal.
|
|
Now we have a working implementation of predicates. It now only
remains to write the parser of grammars. Of course we shall generate
this parser by this parser generator itself, because why not. ;-P
|
|
Now we need to implement predicates, in order to have practical
applications.
|
|
Now we have the potential to recognize character classes. But the
most important task for us now is to experiment with ((B)RN)GLR
algorithms, so we leave the character classes at the present state for
a moment.
|