|Copyright||Bryan O'Sullivan 2007-2015|
Simple, efficient combinator parsing that can consume lazy
strings, loosely based on the Parsec library.
This is essentially the same code as in the
module, only with a
parse function that can consume a lazy
Text incrementally, and a
Result type that does not allow
more input to be fed in. Think of this as suitable for use with a
lazily read file, e.g. via
Note: The various parser functions and combinators such as
string still expect strict
Text parameters, and return
Text results. Behind the scenes, strict
are still used internally to store parser input and manipulate it
The result of a parse.
|Fail Text [String] String|
The parse failed. The
|Done Text r|
The parse succeeded. The
|Functor Result Source #|
|Show r => Show (Result r) Source #|
|NFData r => NFData (Result r) Source #|
Run a parser and print its result to standard output.