Parsing Permutation Phrases (2001) [15 citations — 1 self]
by
Arthur Baars
,
Andres Loh
,
Andres Löh
,
S. Doaitse Swierstra
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Baars01parsingpermutation,
author = {Arthur Baars and Andres Loh and Andres Löh and S. Doaitse Swierstra},
title = {Parsing Permutation Phrases},
year = {2001}
}
author = {Arthur Baars and Andres Loh and Andres Löh and S. Doaitse Swierstra},
title = {Parsing Permutation Phrases},
year = {2001}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
A permutation phrase is a sequence of elements (possibly of di#erent types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show a way 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 recognised elements. Possible applications include the generation of parsers for attributes of XML tags and Haskell's record syntax. 1
Citations
| 50 | Monadic Parser Combinators – Hutton, Meijer - 1996 |
| 41 | Deterministic, error-correcting combinator parsers – Swierstra, Duponcheel - 1996 |
| 39 | Functional Parsers – FOKKER - 1995 |
| 14 | Generalising monads to arrows, Science of Computer Programming 37 – Hughes - 2000 |
| 10 | Extending Context-Free Grammars with Permutation Phrases – Cameron - 1993 |
| 10 | Parser Combinators, from Toys to Tools – Swierstra - 2000 |
| 8 | a fast combinator parser – Leijen, Parsec - 2001 |
| 6 | How to replace failure with a list of successes – Wadler - 1985 |
| 2 | error repairing parser combinators – Swierstra, Fast - 2001 |
