Author:
BAARS ARTHUR I.,LÖH ANDRES,SWIERSTRA S. DOAITSE
Abstract
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.
Publisher
Cambridge University Press (CUP)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Purely functional GLL parsing;Journal of Computer Languages;2020-06
2. A unified view of monadic and applicative non-determinism;Science of Computer Programming;2018-01
3. From monoids to near-semirings;Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming;2015-07-14
4. How functional programming mattered;National Science Review;2015-07-13
5. Implementing an embedded compiler using program transformation rules;Software: Practice and Experience;2013-09-06