finite-automata | regex-posix-clib | |
---|---|---|
1 | - | |
1 | 8 | |
- | - | |
0.0 | 4.5 | |
over 1 year ago | 8 months ago | |
Haskell | Haskell | |
MIT License | GNU Lesser General Public License v2.1 only |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
finite-automata
Posts with mentions or reviews of finite-automata.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Code review request - New to Haskell
Here is my repo: https://github.com/akumm2k/finite-automata
regex-posix-clib
Posts with mentions or reviews of regex-posix-clib.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning regex-posix-clib yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing finite-automata and regex-posix-clib you can also consider the following projects:
regex-tdfa-pipes - Parse with regular expressions on Producers.
regex - regex: A Regular Expression Toolkit for regex-base
regex-genex - Given a list of regexes, generate all possible strings that matches all of them.
regex-applicative - Regex-based parsing with an applicative interface
regex-pcre-text - he PCRE/Text backend to accompany regex-base; needs regex-pcre and regex-tdfa-text
regex-applicative-text - regex-applicative on text
regex-tdfa - A new all Haskell "tagged" DFA regex engine, inspired by libtre
regex-easy - sugar for regex-pcre
regex-tdfa-quasiquoter - Quasi-quoter for TDFA (extended POSIX) regular expressions.
regex-posix-clib vs regex-tdfa-pipes
regex-posix-clib vs regex
regex-posix-clib vs regex-genex
regex-posix-clib vs regex-applicative
regex-posix-clib vs regex-pcre-text
regex-posix-clib vs regex-applicative-text
regex-posix-clib vs regex-tdfa
regex-posix-clib vs regex-easy
regex-posix-clib vs regex-tdfa-quasiquoter