Text.ParserCombinators.UU.Interleaved

This module contains the additional data types, instance definitions and functions to run parsers in an interleaved way. If all the interleaved parsers recognise a single connected piece of the input text this incorporates the permutation parsers. For some examples see the module Text.ParserCombinators.UU.Demo.MergeAndPermute.

Documentation

mkP :: Gram (P st) a -> P st a

doNotInterpret :: P st a -> P st a

doNotInterpret forgets the computed minimal number of tokens recognised by this parser which makes a parser opaque for abstract interpretation; used when interleaving parsers where we do not want to compare lengths.