|File Search||Catalog||Content Search|
This module parses regular expression Strings using a Parsec parser and creates an internal data structure (Text.Regex.Lazy.Pattern). This is then transformed a DFA table for matching against the input String or FastPackedString. The input string is consumed lazily, so it may be an arbitrarily long or infinite source.
This package contains the libraries compiled for GHC.
haskell-regex-tdfa (1.1.8-3) experimental; urgency=low * Depend on haskell-devscripts 0.8.13 to ensure this packages is built against experimental * Bump standards version, no change -- Joachim Breitner <firstname.lastname@example.org> Sun, 14 Oct 2012 12:01:55 +0200 haskell-regex-tdfa (1.1.8-2) unstable; urgency=low * Remove doc-base file, avoids squeeze → wheezy upgrade problems -- Joach more»
This package was originally debianised by Erik de Castro Lopo <email@example.com> Mon, 11 May 2009. It was downloaded from the Haskell hackage repository at http://hackage.haskell.org/cgi-bin/hackage-scripts/package/regex-tdfa Copyright: Copyright (c) 2007-2009, Christopher Kuklewicz All rights reserved. Redistribution and use in source and binary forms, with or without modification, more»