-
- [ ] [Router](https://aantron.github.io/dream/#routing): use a trie or a DFA instead of walking through all routes using CPS.
- [ ] [Logger](https://aantron.github.io/dream/#logging): logging is slo…
-
E.g. when we parsing javascript:
```js
f(({a, b}) => a + b);
```
with the following grammar rules:
```
exp := '(' '{' identifier (',' identifier)* '}' ')' '=>' exp
exp := '(' exp ')'
exp…
-
DFA created with dfa_to_efficient_dfa have a field initial_state that has a complex structure and that is not just an ID.
- Either there is a bug in dfa_to_efficient_dfa
- Or the documentation is i…
-
```
Hello,
I'm using this runtime to parse Wiki to LaTeX in a little online application.
Integrating this with Zend Framework, when I include the 'antlr.php' file, the
global used in DFA constructi…
-
https://github.com/certtools/malware_name_mapping can be used to map malware names with the IntelMQ modify bot. However the 500 regexp rules are tried sequentially and this is quite resource intensive…
-
I have a growing base of 50 complex irregex strings. I precompile all of them, store them in a file, and use the result. This works very nicely, but 1 of the irregex results contains a procedure, so t…
-
This one is high-priority. It is very valuable to be able to see all of the states that an NFA is in after each step, since NFAs tend to be more confusing than DFAs.
-
This project works really well so far, it has a bit of performance issue for big grammars like postgresql (see attached and the timings bellow).
See attached naive conversion of postgresql-16 gramm…
-
This may be bugged, the current solution seems shaky. Try union on some more complex state machines in tests.
-
## Classification:
Enhancement
## Version
AutoKey version: All < 0.96
## Summary
(Extracted from notes in #356)
Currently, AutoKey tests if two window filters are distinct, by equa…