Parsing permutation phrases

Journal of Functional Programming

Volumn 14, Issue 6, 2004, Pages 635-646

  Baars, Arthur I ^a   Löh, Andres ^a   Swierstra, S Doaitse ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; QUERY LANGUAGES; TREES (MATHEMATICS); XML;

CONTEXT-FREE GRAMMER; FUNCTIONAL PROGRAMMING; PERMUTATION; PSEUDO-CODE ALGORITHM;

MATHEMATICAL PROGRAMMING;

EID: 9744279771     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005143     Document Type: Article

References (9)

1. Cameron, R. D. (1993) Extending context-free grammars with permutation phrases. ACM Lett. Program. Lang. Syst. 2(4), 85-94.
2. Fokker, J. (1995) Functional parsers. Advanced Functional Programming, First International Spring School: LNCS 925, pp. 1-23. Springer-Verlag.
3. Hutton, G. and Meijer, H. (1988) Monadic parser combinators. J. Funct. Program. 8(4), 437-444.
4. Leijen, D. (2001) Parsec, a fast combinator parser. http://www.cs.uu.nl/ ̃daan/parsec.html.
5. Peyton Jones, S. (2003) Haskell 98 Language and Libraries. Cambridge University Press. http://www.haskell.org/report.
6. Röjemo, N. (1995) Garbage collection and memory efficiency in lazy functional languages. PhD thesis, Chalmers University of Technology.
7. Swierstra, D. (2001) Combinator parsers: From toys to tools. In: Hutton, G. (editor), Electronic Notes in Theoretical Computer Science, vol. 41. Elsevier.
8. Swierstra, D. and Duponcheel, L. (1996) Deterministic, error correcting combinator parsers. Advanced Functional Programming, Second International Spring School: LNCS 1129, pp. 184-207. Springer-Verlag.
9. Wadler, P. (1985) How to replace failure with a list of successes. Functional Programming Languages and Computer Architecture: LNCS 201, pp. 113-128. Springer-Verlag.