Publication

Accelerating parser combinators with macros

Related publications (44)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

Assoc Computing Machinery2014

Scala AST Persistence

Adrien Ghosn, Eugene Burmako, Mathieu Baptiste Demarne

The Scala compiler uses ASTs (abstract syntax trees) as an intermediate representation before generating bytecode. With the development of Scala macros which expand trees at compile time, being able to access, modify and recompose ASTs within the compilati ...

2014

Surgical Precision JIT Compilers

Tiark Rompf, Hassan Chafi

Just-in-time (JIT) compilation of running programs provides more optimization opportunities than offline compilation. Modern JIT compilers, such as those in virtual machines like Oracle's HotSpot for Java or Google's V8 for JavaScript, rely on dynamic prof ...

Assoc Computing Machinery2014

Making sbt Macro-Aware

Eugene Burmako, Martin Nicolas Duhem

Macros made their first appearance as a fork of the Scala compiler and then as an experimental feature in the version 2.10.0 of Scala. Since macros are normal Scala functions that are executed by the compiler during the compilation of their clients, they c ...

2014

Yin-Yang: Concealing the Deep Embedding of DSLs

Martin Odersky, Christoph Koch, Amir Shaikhha, Sandro Stucki, Vojin Jovanovic, Vladimir Nikolaev

Deeply embedded domain-specific languages (EDSLs) intrinsically compromise programmer experience for improved program performance. Shallow EDSLs complement them by trading program performance for good programmer experience. We present Yin-Yang, a framework ...

2014

Yin-yang: concealing the deep embedding of DSLs

Martin Odersky, Christoph Koch, Amir Shaikhha, Sandro Stucki, Vojin Jovanovic, Vladimir Nikolaev

ACM Press2014

Hygiene for Scala

Denys Shabalin

The main contribution of this work is a formal model of hygienic name resolution and macro system that is flexible enough to provide missing safety to quasiquotes. This makes it possible to combine the best of two worlds: we get reasonable safety guarantee ...

2014

Scala Macros: Let Our Powers Combine!

Eugene Burmako

Compile-time metaprogramming has been proven immensely useful enabling programming techniques such as language virtualization, embedding of external DSLs, self-optimization, and boilerplate generation amongst many others. In the recent production release o ...

2013

Scala Macros, a Technical Report

Martin Odersky, Eugene Burmako

Metaprogramming is a powerful technique of software development, which allows to automate program generation. Applications of metaprogramming range from improving expressiveness of a programming language via deep embedding of domain-specific languages to b ...

2012

Lightweight Modular Staging and Embedded Compilers

Tiark Rompf

Programs expressed in a high-level programming language need to be translated to a low-level machine dialect for execution. This translation is usually accomplished by a compiler, which is able to translate any legal program to equivalent low-level code. B ...

EPFL2012