Regex-based parsing with applicative interface
|Version on this page:||0.3.3|
|LTS Haskell 20.25:||0.3.4|
|Stackage Nightly 2023-06-10:||0.3.4|
|Latest on Hackage:||0.3.4|
Module documentation for 0.3.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 update cabal install regex-applicative
The API reference is available from Hackage.
To get started, see some examples on the wiki.
- Use strict left fold in decimal/hexadecimal
- Include a missing test module in the sdist tarball
- Fix the test suite
- Fix build with GHC 7.9
Fix the test suite
Port the test suite to tasty
- Add a new module,
Text.Regex.Applicative.Common, which contains some commonly used regexps (by Aleksey Khudyakov)
- Improve the test suite
- Add the
- Make matching functions a bit more lax
- Fix a bug in the
- Infix matching functions
- Improved documentation
- Improved performance
- Improved portability
- Expose Object interface
- Allow matching prefixes rather than the whole string
- Add non-greedy repetitions
- Completely rewrite the engine. Now it’s faster and runs in constant space.
- Add ‘string’ function and ‘IsString’ instance.
- Fix a .cabal-file issue introduced in 0.1.2
- Change the fixity of =~
- Relax the constraint on the containers version
- Fix a bug in ‘reFoldl’ and ‘many’
- “Lazy” infinite regexes are no longer supported
- Initial release