ReSyn: A Generalized Recursive Regular Expression Synthesis Framework

TL;DR

ReSyn is a versatile framework that decomposes complex regex synthesis tasks into simpler parts, significantly improving accuracy and setting new benchmarks when combined with Set2Regex, a novel synthesizer.

Contribution

The paper introduces ReSyn, a generalized divide-and-conquer framework for regex synthesis, and Set2Regex, a parameter-efficient synthesizer capturing permutation invariance.

Findings

ReSyn boosts accuracy across various synthesizers.

Combination with Set2Regex achieves new state-of-the-art results.

ReSyn effectively handles complex real-world regex benchmarks.

Abstract

Existing Programming-By-Example (PBE) systems often rely on simplified benchmarks that fail to capture the high structural complexity-such as deeper nesting and frequent Unions-of real-world regexes. To overcome the resulting performance drop, we propose ReSyn, a synthesizer-agnostic divide-and-conquer framework that decomposes complex synthesis problems into manageable sub-problems. We also introduce Set2Regex, a parameter-efficient synthesizer capturing the permutation invariance of examples. Experimental results demonstrate that ReSyn significantly boosts accuracy across various synthesizers, and its combination with Set2Regex establishes a new state-of-the-art on challenging real-world benchmark.