Baars, Arthur I.; Löh, Andres; Swierstra, S. Doaitse Parsing permutation phrases. (English) Zbl 1063.68028 J. Funct. Program. 14, No. 6, 635-646 (2004). Summary: A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show how to extend a parser combinator library with support for parsing such free-order constructs. A user of the library can easily write parsers for permutation phrases and does not need to care about checking and reordering the recognized elements. Applications include the generation of parsers for attributes of XML tags and Haskell’s record syntax. Cited in 3 Documents MSC: 68N18 Functional programming and lambda calculus Keywords:parser combinator libraries PDFBibTeX XMLCite \textit{A. I. Baars} et al., J. Funct. Program. 14, No. 6, 635--646 (2004; Zbl 1063.68028) Full Text: DOI