regex-posix-clib VS regex-applicative

Compare regex-posix-clib vs regex-applicative and see what are their differences.


Regex-based parsing with an applicative interface (by feuerbach)
Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • Zigi - Close all those tabs. Zigi will handle your updates.
  • Scout APM - Truly a developer’s best friend
  • SonarLint - Clean code begins in your IDE with SonarLint
regex-posix-clib regex-applicative
0 1
8 121
- -
1.0 0.0
6 months ago 12 months ago
Haskell Haskell
GNU General Public License v3.0 or later MIT License
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.


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.


Posts with mentions or reviews of regex-applicative. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-04-04.

What are some alternatives?

When comparing regex-posix-clib and regex-applicative you can also consider the following projects:

regex-applicative-text - regex-applicative on text

mustache-haskell - mustache implementation in Haskell

regex-tdfa-pipes - Parse with regular expressions on Producers.

regex - regex: A Regular Expression Toolkit for regex-base

xmlgen - XML generator library for Haskell

regex-pcre-text - he PCRE/Text backend to accompany regex-base; needs regex-pcre and regex-tdfa-text

regex-tdfa - A new all Haskell "tagged" DFA regex engine, inspired by libtre

regex-genex - Given a list of regexes, generate all possible strings that matches all of them.