Embedded parser generators

Haskell'11 - Proceedings of the 2011 ACM SIGPLAN Haskell Symposium

Volumn , Issue , 2011, Pages 107-117

  Duregård, Jonas ^a,b   Jansson, Patrik ^a,b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF GOTHENBURG   (Sweden)

Author keywords

domain specific languages; metaprogramming

Indexed keywords

ABSTRACT SYNTAX; BNF GRAMMARS; CODE GENERATION; COMPILE TIME; CONCRETE SYNTAX; DOMAIN SPECIFIC LANGUAGES; FRONT END; HASKELL; META PROGRAMMING; PARSE GRAMMAR; PARSER GENERATORS;

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS; SYNTACTICS;

CODE CONVERTERS;

EID: 82655162732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2034675.2034689     Document Type: Conference Paper

References (18)

1. E. Axelsson, K. Claessen, G. Dévai, Z. Horváth, K. Keijzer, B. Lyckegård, A. Persson, M. Sheeran, J. Svenningsson, and A. Vajdax. Feldspar: A domain specific language for digital signal processing algorithms. In MEMOCODE, pages 169-178, 2010.
2. H. G. Baker. Pragmatic parsing in Common Lisp; or, putting defmacro on steroids. SIGPLAN Lisp Pointers, IV:3-15, April 1991. ISSN 1045-3563.
3. A. Bawden. Quasiquotation in LISP. In O. Danvy, editor, Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-99, San Antonio, 1999. University of Aarhus, Dept. of Computer Science.
4. Boost. The Boost initiative for free peer-reviewed portable C++ source libraries. http://www.boost.org, 2009.
5. K. Czarnecki, T. O'Donnell, John, J. Striegnitz, and W. Taha. DSL Implementation in MetaOCaml, Template Haskell, and C++, volume 3016 of LNCS, pages 51-72. Springer-Verlag, Berlin, Heidelberg, 2003. doi:10.1007/b98156.
6. J. de Guzman and H. Kaiser. Boost spirit. http://www.boost.org/doc/libs/ 1-46-1/libs/spirit/.
7. D. Devriese and F. Piessens. Explicitly recursive grammar combinators - a better model for shallow parser DSLs. In Practical Aspects of Declarative Languages (PADL) 2011, volume 6539 of LNCS. Springer, Jan. 2011.
8. M. Forsberg and A. Ranta. The BNF converter: A high-level tool for implementing well-behaved programming languages. In NWPT'02 proc., Proc. Estonian Academy of Sciences, December 2003.
9. D. Leijen and E. Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-35, Departement of Computer Science, Utrecht University, 2001. http://www.cs.uu.nl/~daan/parsec.html.
10. G. Mainland. Why it's nice to be quoted: quasiquoting for Haskell. In Proc. ACM SIGPLAN workshop on Haskell, Haskell '07, pages 73-82, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-674-5.
11. G. Mainland. The haskell package language-c-quote. http://hackage. haskell.org/package/language-c-quote, 2009.
12. R. C. Moore. Removing left recursion from context-free grammars. In Proc. 1st North American chapter of the Association for Computational Linguistics conference, pages 249-255, San Francisco, CA, USA, 2000. Morgan Kaufmann Publishers Inc.
13. S. Owens, M. Flatt, O. Shivers, and B. Mcmullan. Lexer and parser generators in scheme. In 2004 Scheme Workshop, 2004. URL http://repository. readscheme.org/ftp/papers/sw2004/owens.ps.gz.
14. A. Ranta. Grammatical framework. J. Funct. Program., 14:145-189, March 2004. ISSN 0956-7968.
15. T. Rendel and K. Ostermann. Invertible syntax descriptions: unifying parsing and pretty printing. In Proc. third ACM Haskell symposium, Haskell '10, New York, NY, USA, 2010. ACM.
16. T. Sheard and S. P. Jones. Template meta-programming for Haskell. In Proceedings of the Haskell workshop, pages 1-16. ACM Press, 2002. ISBN 1-58113-605-6.
17. J. Svensson, K. Claessen, and M. Sheeran. GPGPU kernel implementation and refinement using Obsidian. Procedia Computer Science, 1(1):2065-2074, 2010. ISSN 1877-0509. doi: 10.1016/j.procs.2010.04.231. ICCS 2010.
18. S. D. Swierstra. Combinator Parsing: A Short Tutorial, pages 252-300. Springer-Verlag, Berlin, Heidelberg, 2009. ISBN 978-3-642-03152-6. doi: 10.1007/978-3-642-03153-3-6.