regex-tdfa-pipes VS regex-applicative

Compare regex-tdfa-pipes vs regex-applicative and see what are their differences.

regex-tdfa-pipes

Parse with regular expressions on Producers. (by erisco)

regex-applicative

Regex-based parsing with an applicative interface (by feuerbach)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Zigi - The context switching struggle is real
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • Scout APM - Truly a developer’s best friend
regex-tdfa-pipes regex-applicative
0 1
0 121
- -
0.0 0.0
over 7 years ago 11 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License 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.

regex-tdfa-pipes

Posts with mentions or reviews of regex-tdfa-pipes. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning regex-tdfa-pipes yet.
Tracking mentions began in Dec 2020.

regex-applicative

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-tdfa-pipes and regex-applicative you can also consider the following projects:

regex-applicative-text - regex-applicative on text

mustache-haskell - mustache implementation in Haskell

regex-posix-clib

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

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.

xmlgen - XML generator library for Haskell

regex-easy - sugar for regex-pcre