Compiled parser combinators and regular expressions in pure julia

A Julia prefix tree. Trie is an associative data structure with keys of type NTuple{N,K} where N and values of type V.

Lazy `AbstractString` transformations.

Provides a lazy reverse `AbstractString` interface implementation in `julia`.