The regex-applicative package

[Tags:library, mit, test]

regex-applicative is a Haskell library for parsing using regular expressions. Parsers can be built using Applicative interface.

[Skip to Readme]


Versions 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.2, 0.2.1, 0.3,,,, 0.3.1, 0.3.2,, 0.3.3
Change log
Dependencies base (<5), containers, transformers [details]
License MIT
Author Roman Cheplyaka
Maintainer Roman Cheplyaka <>
Stability Unknown
Category Text
Home page
Source repository head: git clone git://
this: git clone git:// v0.3)
Uploaded Wed Apr 17 15:43:27 UTC 2013 by RomanCheplyaka
Distributions Arch:0.3.3, Debian:0.3.3, FreeBSD:, LTSHaskell:0.3.3, NixOS:0.3.3, Stackage:0.3.3, Tumbleweed:0.3.3
Downloads 4576 total (33 in the last 30 days)
2 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for regex-applicative

Readme for regex-applicative-0.3


regex-applicative is aimed to be an efficient and easy to use parsing combinator library for Haskell based on regular expressions.

Perl programmers often use regular expressions for parsing, even if it is not an appropriate tool for the job, because Perl has so good support for regexps.

The opposite seems to be valid about Haskell programmers -- they use parsing combinators (which recognize context-free or even context-sensitive grammars), even when the language is actually regular!

Hopefully, this library will improve the situation.


Install this library using cabal-install tool:

cabal update
cabal install regex-applicative


The API reference is available from Hackage.

To get started, see some examples on the wiki.

Other resources