abnf-0.4.1.0: Parse ABNF and generate parsers for the specified document

Copyright(c) Martin Zeller, 2016
LicenseBSD2
MaintainerMartin Zeller <mz.bremerhaven@gmail.com>
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010

Text.ABNF.Document.Types

Description

 

Synopsis

Documentation

data Document a Source #

A Document represents a tree of the parsed input. Directly after parsing, every Rule that was applied, gets a node in the tree.

You can use filterDocument and squashDocumentOn to reduce the tree into a more managable shape.

Constructors

Document Text [Document a] 
Terminal a 

Instances

Functor Document Source # 

Methods

fmap :: (a -> b) -> Document a -> Document b #

(<$) :: a -> Document b -> Document a #

Eq a => Eq (Document a) Source # 

Methods

(==) :: Document a -> Document a -> Bool #

(/=) :: Document a -> Document a -> Bool #

Show a => Show (Document a) Source # 

Methods

showsPrec :: Int -> Document a -> ShowS #

show :: Document a -> String #

showList :: [Document a] -> ShowS #