Safe Haskell | Safe-Inferred |
---|
Types for the rewriting combinator
- data SubwordTree = SubwordTree Subword [SubwordTree]
- type SubwordConstructionAlgorithm a = a -> [ParserInfo] -> Subword -> [SubwordTree]
Documentation
data SubwordTree Source
Tree of subwords. Every path in a tree represents a sequence of subwords for a corresponding sequence of parsers in a production.
type SubwordConstructionAlgorithm aSource
= a | rewriting function |
-> [ParserInfo] | yield size info for each parser of a production |
-> Subword | subword for which subwords should be constructed |
-> [SubwordTree] | constructed subwords, represented as tree |