A small library for building push-down automata
- Using the DSL, in
.moonfiles - Writing the transition functions, initial and final states manually in a
.luafile - With a syntax language at some point
Only deterministic push-down automata work so far. This also means you can write deterministic finite state automata since they are strictly a subset.
Maybe, but only through determinisation and not backtracking.
The runtime should remain the same, since it's O(n) and compiling the automate should hopefully only happen once so it's allowed to be slower.
This will probably come with restrictions, such as no \enter or \exit handlers.
Hopefully soon. But I need a determinisation algorithm first before I can do this, since (most) regexes are translated to nondeterministic finite state automata.
Ideally anything that can be matched with a regex should be allowed as a transition.
This includes regexes, character classes (though that is already the case) and also literal strings.
This also depends on the determinisation algorithm, and may come with additional restrictions (like no \exit handler or only @char for transitions).