Katherine

``` ; echo '$' | ./build/bin/lx zsh: done echo '$' | zsh: segmentation fault ./build/bin/lx ; echo '$ ' | ./build/bin/lx zsh: done echo '$ ' | zsh: segmentation fault...

Currently we have `fsm_shortest()` to find the shortest paths (actually least cost by weighted edges). I'd like a more convenient interface to: - Return a set of finite strings, not...

Use Aho-Corasick for alts of literals during regexp AST compilation

1

I'll have more to say about this, but I'm too tired to write about it at the moment.

Missing handling for non-escaped { } literals in pcre dialect

3

https://twitter.com/JakeDChampion/status/1282973512593018880 This case shows `{` and `}` near the beginning, and these are literal characters and not escaped. ``` /\s*(?:{(.*)})?\s*(?:(\$?\S+))?\s*(?:\[([^\]]*)])?\s*-?\s*([\S\s]*)\s*$/ ``` I supposed the first would be distinguished from the...

The generated code for DFA does not distinguish beteween `""` and a match failure, which would lead to the default case or nothing. Possibly specific to one kind of `-k`...

perl dumping its implementation of a regex: ``` perl -E 'use re "debug";qr/a*(b|c)+d?|(fg*|x)[0-9a-z]?/;' ``` Likewise re2 can dump its AST. We could consider using these for equivalence tests for libre's...

The various `` predicates could be cached per state, as two bitfields: a set of their values, and a set of whether those values are valid (known), or invalidated (currently...

This ticket proposes a cache kept behind the scenes in libfsm, storing FSM as constructed by each `fsm_*()` unary or binary operation. I'm picturing this as a limited-size associative array...

Convert libfsm's internal representation to an adjacency list

1

Currently libfsm stores its FSMs as a graph of structs pointing to each other. This ticket proposes an adjacency list instead, where the whole FSM would be stores as an...

## Parameterised blocks Blocks enclose a set of mappings: ``` { /abc/ -> $t1; /xyz/ -> $t2; } ``` Defining a parameterised block of code: ``` f(x, y) = {...