libfsm
libfsm copied to clipboard
katef
DFA regular expression library & friends
This adds an extra compilation step for PCRE regexes, generating programs for a group capture resolution abstract machine. The implementation builds on the approach described in ["Regular Expression Matching: the...
The PCRE dialect's lexer and parser hit an assertion with the input `(*:`: ``` $ build/bin/re -rpcre '(*:' re: src/libre/parser.act:1108: struct ast *parse_re_pcre(re_getchar_fun *, void *, const struct fsm_options *,...
A regexp which should work, but produces a parse error: `[Z-\]]` ``` $ re -r pcre -k pair -C -e abc -pl vmops_c '[Z-\]]' /[Z-\]]/:3: Syntax error: expected atom ```
Suggested: add a flag for "the newline is optional"
Using lots of `unsafe` code can sometimes be faster depending on the compiler, optimization level, and target platform. Not sure I want to actually have this merged. Just putting here...
From fcad35eec7a8184e5eaa8e71eee3d05c2ff752a6: > Disable the fragile IR tests. > > These are fragile due to testing the graph structure when rendered to json literally. The problem here is the state...
Change the `re_strings` API to optionally define an endid for each string. - This stores the set of endids in a state_set. The IDs are the same size and it...
It would be useful to have a function that populates a u64bitset with which characters must appear in the input to possibly match an FSM. This wouldn't track the relative...
I've just added the `lx` grammar to https://mingodad.github.io/parsertl-playground/playground/ an `Yacc/Lex` compatible editor/tester (select `Libfsm lx parser` from `Examples` then click `Parse` to see the parse tree for the content in...
