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.
|
|
I think this is a better practice than the previously used hard-coded
configure option.
|
|
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
|
|
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.
|