Age | Commit message (Collapse) | Author |
|
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 need to implement predicates, in order to have practical
applications.
|
|
I now have a working algorithm in test/check_cnp. It can correctly
parse the grammar for an esoteric language called "Brainfuck". This
language does not matter. What matters is that it contains
parentheses. So this shows that at least for grammars as complex as
parentheses, this parser works well. Haha.
|
|
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.
|