29 citations · 49 across the 9 of their papers we have counts for
4 papers · 1 filter
LL(1) Parsing with Derivatives and Zippers
Romain Edelmann, Jad Hamza, Viktor Kunčak
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 languag…
Minimal Synthesis of String To String Functions From Examples
Jad Hamza, Viktor Kunčak
We study the problem of synthesizing string to string transformations from a set of input/output examples. The transformations we consider are expressed using deterministic finite…
Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples
Mikaël Mayer, Jad Hamza, Viktor Kuncak
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…
Optimal Test Sets for Context-Free Languages
Mikaël Mayer, Jad Hamza
A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are iden…