SaaSHub helps you find the best software and product alternatives Learn more →
Myrex Alternatives
Similar projects and alternatives to myrex
-
oil
Oils is our upgrade path from bash to a better language and runtime. It's also for Python and JavaScript users who avoid shell!
-
rebar
A biased barometer for gauging the relative speed of some regex engines on a curated set of tasks.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
myrex reviews and mentions
-
Re2c
Concurrent parallel execution of NFA directly in Elixir:
https://github.com/mike-french/myrex
It is concurrent in both senses: a single match is split into many concurrent traversals of the network; multiple input strings can be matched concurrently within the same network; generators can also run concurrently in the network. It's possible because all state is in the traversal messages, not in the process nodes, and the whole thing runs asynch (non-blocking) in parallel, automatically using all cores in the machine.
> you see how regex syntax compiles down to various configurations of automata
That is Thompson's Construction [1]. The Myrex README contains a long description of how regex structures map to small process networks, and how they glue together. The final process network is a direct 1-1 representation of the NFA.
[1] Russ Cox has a nice explanation https://swtch.com/~rsc/regexp/regexp1.html
-
Calculate the difference and intersection of any two regexes
Another interesting question is: how many possible successful matches are there for a given input string. For example:
How many ways can (a?){m}(a){m} match the string* a{m}
i.e. input is m repetitions of the letter 'a'.
https://github.com/mike-french/myrex#ambiguous-example
-
Programming Techniques: Regular expression search algorithm (1968)
This is Thompson's Construction.
There is a nice description given by Russ Cox:
https://swtch.com/~rsc/regexp/regexp1.html
This project has an interesting implementation in Elixir, which converts the NFA directy into a process network:
https://github.com/mike-french/myrex
The network runs all possible traversals concurrently, and automatically scales to use all cores (Erlang BEAM runtime). Multiple input strings can also be processed concurrenty. It can also generate matching strings concurrently (Monte Carlo). It implements captures and Unicode character sets.
While it is designed for concurrency, it is not meant to be the fastest regex implementation. There is an example of a highly ambiguous match that launches 900k traversals and reports all capture results in about 10s.
-
A note from our sponsor - SaaSHub
www.saashub.com | 29 Apr 2024
Stats
mike-french/myrex is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.
The primary programming language of myrex is Elixir.
Popular Comparisons
Sponsored