The regex-applicative package

[Tags: library, mit]

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

[Skip to ReadMe]


Versions0.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,
Dependenciesbase (>=4.2 && <4.4), containers (>=0.3 && <0.5), monads-tf (==0.1.*), vector (==0.7.*) [details]
AuthorRoman Cheplyaka
MaintainerRoman Cheplyaka <>
Home page
Source repositoryhead: git clone git://
this: git clone git:// v0.1.4)
UploadedThu Oct 27 22:05:31 UTC 2011 by RomanCheplyaka
DistributionsDebian:, FreeBSD:, LTSHaskell:, NixOS:, Stackage:
Downloads3953 total (83 in last 30 days)
1 []
StatusDocs not available [build log]
All reported builds failed as of 2015-11-24 [all 4 reports]



Maintainers' corner

For package maintainers and hackage trustees

Readme for regex-applicative-0.1.4


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