ebnf-bff-0.1.0.0: Parser combinators & EBNF, BFFs!

Safe HaskellNone
LanguageHaskell2010

Text.EBNF.Build.Parser.Except

Synopsis

Documentation

data FailData Source

Constructors

FailData 

Instances

data Report Source

Constructors

Clean 
Warning 

Fields

warnings :: [FailData]
 
Failed 

Fields

failures :: [FailData]
 

Instances

generateReport :: SyntaxTree -> Report Source

Will analyse a syntax tree, returning reports to be combined together

reportNeverTerminating :: SyntaxTree -> Report Source

A never terminating parser is one that can parse an infinite amount of empty strings, such parsers can be achieved with {[identifer]} pattern rules, which can parse indefinitely but never terminate.