|
|
|
|
|
|
by loup-vaillant
3019 days ago
|
|
|
That's a shame, because regular grammars have a very important property: they're processed with a Finite State Automaton. This makes them blazing fast and quite memory efficient. (Heck, even with a non-deterministic one they're fast.) |
|
|