Hostname: page-component-6bf8c574d5-b4m5d Total loading time: 0 Render date: 2025-02-16T16:21:05.941Z Has data issue: false hasContentIssue false
  • English
  • Français

FUNCTIONAL PEARL Parsing permutation phrases

Published online by Cambridge University Press:  27 October 2004

ARTHUR I. BAARS ,
ANDRES LÖH  and
S. DOAITSE SWIERSTRA
ARTHUR I. BAARS
Affiliation:
Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (email: [email protected]@[email protected])
ANDRES LÖH
Affiliation:
Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (email: [email protected]@[email protected])
S. DOAITSE SWIERSTRA
Affiliation:
Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (email: [email protected]@[email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Functional pearls
Information
Journal of Functional Programming , Volume 14 , Issue 6 , November 2004 , pp. 635 - 646
Copyright
© 2004 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.