Concept

Parser combinator

Related publications (26)

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.

Specialising Parsers for Queries

Manohar Jonnalagedda

Many software systems consist of data processing components that analyse large datasets to gather information and learn from these. Often, only part of the data is relevant for analysis. Data processing systems contain an initial preprocessing step that fi ...

EPFL2016

Word Sequence Modeling using Deep Learning

Joël Yvon Roland Legrand

For a long time, natural language processing (NLP) has relied on generative models with task specific and manually engineered features. Recently, there has been a resurgence of interest for neural networks in the machine learning community, obtaining state ...

EPFL2016

Traversal Query Language For Scala.Meta

Eugene Burmako, Eric Beguet

With the rise of metaprogramming in Scala, manipulating ASTs has become a daily job. Yet the standard API provides only low-level mechanisms to transform or to collect information on those data structures. Moreover, those mechanisms often force the program ...

2015

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from a practical perspective the problem of checking equivalence of context-free grammars. We present techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building ...

2015

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

Assoc Computing Machinery2015

Towards Automating Grammar Equivalence Checking

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from practical perspective the (generally undecidable) problem of checking equivalence of context-free grammars. We present both techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalen ...

2015

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 ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

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

Assoc Computing Machinery2014

Accelerating parser combinators with macros

Manohar Jonnalagedda, Eric Beguet

Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used fo ...

ACM Press2014

Comparing machines and humans on a visual categorization test

François Fleuret, Charles Dubout, Ting Li

Automated scene interpretation has benefited from advances in machine learning, and restricted tasks, such as face detection, have been solved with sufficient accuracy for restricted settings. However, the performance of machines in providing rich semantic ...

2011