Publications associées à Grammaire non contextuelle déterministe

Viktor Kuncak, Jad Hamza, Romain Edelmann

In this paper, we present an efficient, functional, and formally verified parsing algorithm for LL(1) context-free expressions based on the concept of derivatives of formal languages. Parsing with derivatives is an elegant parsing technique, which, in the ...

ASSOC COMPUTING MACHINERY2020

Contextual semantic interpretability

Devis Tuia, Sylvain Lobry, Nicolas Courty

Convolutional neural networks (CNN) are known to learn an image representation that captures concepts relevant to the task, but do so in an implicit way that hampers model interpretability. However, one could argue that such a representation is hidden in t ...

LNCS2020

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Call Graphs for Languages with Parametric Polymorphism

Martin Odersky, Vlad Ureche, Dmytro Petrashko

The performance of contemporary object oriented languages depends on optimizations such as devirtualization, inlining, and specialization, and these in turn depend on precise call graph analysis. Existing call graph analyses do not take advantage of the in ...

2016

Stellar classification from single-band imaging using machine learning

Frédéric Courbin, Thibault Adrien Kuntzer, Malte Tewes

Information on the spectral types of stars is of great interest in view of the exploitation of space-based imaging surveys. In this article, we investigate the classification of stars into spectral types using only the shape of their diffraction pattern in ...

Edp Sciences S A2016

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

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Grammaire non contextuelle déterministe

Zippy LL(1) Parsing with Derivatives

Contextual semantic interpretability

Scaling Functional Synthesis and Repair

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Specialising Parsers for Queries

Call Graphs for Languages with Parametric Polymorphism

Stellar classification from single-band imaging using machine learning

Automating Grammar Comparison

Automating Grammar Comparison

Towards Automating Grammar Equivalence Checking

Graph Chatbot

Chattez avec Graph Search

Specialising Parsers for Queries

Towards Automating Grammar Equivalence Checking

Zippy LL(1) Parsing with Derivatives

Contextual semantic interpretability

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Call Graphs for Languages with Parametric Polymorphism

Automating Grammar Comparison

Automating Grammar Comparison

Scaling Functional Synthesis and Repair

Stellar classification from single-band imaging using machine learning