Embedded Parser Generators
Paper i proceeding, 2011

We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation. Parsers are built from labelled BNF grammars that are defined directly in Haskell modules. Our solution combines features of parser generators (static grammar checks, a highly specialised grammar DSL) and adds several features that are otherwise exclusive to combinatory libraries such as the ability to reuse, parameterise and generate grammars inside Haskell. To allow writing grammars in concrete syntax, BNFC-meta provides a quasi-quoter that can parse grammars (embedded in Haskell files) at compile time and use metaprogramming to replace them with their abstract syntax. We also generate quasi-quoters so that the languages we define with BNFC-meta can be embedded in the same way. With a minimal change to the grammar, we support adding anti-quotation to the generated quasi-quoters, which allows users of the defined language to mix concrete and abstract syntax almost seamlessly. Unlike previous methods of achieving anti-quotation, the method used by BNFC-meta is simple, efficient and avoids polluting the abstract syntax types.

Domain Specific Languages

Metaprogramming

Functional programming

Författare

Jonas Almström Duregård

Chalmers, Data- och informationsteknik, Programvaruteknik

Patrik Jansson

Chalmers, Data- och informationsteknik, Programvaruteknik

Haskell'11 Proceedings of the 2011 ACM SIGPLAN Haskell Symposium, Tokyo Japan

107-117

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Programvaruteknik

DOI

10.1145/2034675.2034689

ISBN

978-1-4503-0860-1

Mer information

Skapat

2017-10-06