Skip to content
Combinators for constructing NFA's that recognize and compute functions on regular languages in linear time
Haskell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
benchmarks
demo/search
scratch
src/Data
tests
LICENSE
README.md
regl.cabal
stack.yaml

README.md

regl

Combinators for constructing NFA's that recognize and compute functions on regular languages in linear time.

The core type is P s a: a parser for a stream of s's that results in an a.

P s a is Alternative, and can be composed as you'd expect.

P s a's are like regular expressions, only more powerful. To give you an idea, the following primitive is defined:

parallel :: P s a -> P s b -> P s (a, b)

Credit

Some ideas for functionality are taken from regex-applicative.

Some combinators are taken from attoparsec and parsers.

You can’t perform that action at this time.