Explicitly recursive grammar combinators: A better model for shallow parser DSLs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6539 LNCS, Issue , 2011, Pages 84-98

  Devriese, Dominique ^a   Piessens, Frank ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATOR LIBRARY; COMBINATORS; FUNDAMENTAL LIMITATIONS; GENERIC PROGRAMMING; GRAMMAR TRANSFORMATION; PROGRAMMING LANGUAGE; RECURSIONS; SEMANTIC ACTION; PAPER FORMS;

LIBRARIES; SEMANTICS; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; DIGITAL SUBSCRIBER LINES; SYNTACTICS;

CONTEXT FREE LANGUAGES; FORMAL LANGUAGES;

EID: 79551600593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18378-2_9     Document Type: Conference Paper

References (23)

1. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools, 2nd edn. Addison-Wesley, Reading (2006)
2. Johnson, S.C.: YACC. Unix Programmer's Manual 2b (1979)
3. Parr, T., Quong, R.: ANTLR: A predicated-LL(k) parser generator. Software: Practice and Experience 25(7), 789-810 (1995)
4. Swierstra, S., Duponcheel, L.: Deterministic, error-correcting combinator parsers. In: Advanced Functional Programming, pp. 184-207 (1996)
5. Sabry, A.: What is a purely functional language? JFP 8(1), 1-22 (1998)
6. Sheard, T., Peyton Jones, S.: Template meta-programming for Haskell. SIGPLAN Notices 37(12), 75 (2002)
7. Yakushev, A., Holdermans, S., Löh, A., Jeuring, J.: Generic programming with fixed points for mutually recursive datatypes. In: ICFP, pp. 233-244 (2009)
8. Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unificationbased type inference for GADTs. In: ICFP, pp. 61 (2006)
9. Schrijvers, T., Peyton Jones, S., Chakravarty, M., Sulzmann, M.: Type checking with open type functions. In: ICFP, pp. 51-62 (2008)
10. Pierce, B.: Types and programming languages. MIT Press, Cambridge (2002)
11. Devriese, D., Piessens, F.: Explicitly recursive grammar combinators - Implemention of some grammar algorithms. Technical Report CW594, KULeuven CS (2010)
12. Moore, R.: Removing left recursion from context-free grammars. In: NAACL, pp. 249-255 (2000)
13. Ford, B.: Packrat parsing: simple, powerful, lazy, linear time - functional pearl. In: ICFP, pp. 36-47 (2002)
14. Leijen, D., Meijer, E.: Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-27, Universiteit Utrecht CS (2001)
15. Magalhaes, J., Holdermans, S., Jeuring, J., Löh, A.: Optimizing generics is easy! In: Workshop on Partial Evaluation and Program Manipulation, pp. 33-42 (2010)
16. Baars, A., Swierstra, S., Viera, M.: Typed transformations of typed abstract syntax. In: TLDI, pp. 15-26 (2009)
17. Baars, A., Swierstra, S.: Type-safe, self inspecting code. In: HASKELL (2004)
18. Viera, M., Swierstra, S., Lempsink, E.: Haskell, do you read me? constructing and composing efficient top-down parsers at runtime. In: HASKELL, pp. 63-74 (2008)
19. Brink, K., Holdermans, S., Löh, A.: Dependently typed grammars. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 58-79. Springer, Heidelberg (2010)
20. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)
21. Fokkinga, M., Jeuring, J., Meertens, L., Meijer, E.: A translation from attribute grammars to catamorphisms. The Squiggolist 2(1), 20-26 (1991)
22. Gill, A.: Type-safe observable sharing in Haskell. In: Haskell, pp. 117-128 (2009)
23. Claessen, K., Sands, D.: Observable sharing for functional circuit description. In: Thiagarajan, P.S., Yap, R.H.C. (eds.) ASIAN 1999. LNCS, vol. 1742, p. 62. Springer, Heidelberg (1999)