ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915891552190464 |
|---|---|
| author | Kim, Seongmin Cheon, Hyunjoon Kim, Su-Hyeon Han, Yo-Sub Ko, Sang-Ki |
| author_facet | Kim, Seongmin Cheon, Hyunjoon Kim, Su-Hyeon Han, Yo-Sub Ko, Sang-Ki |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_24624 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | ReSyn: A Generalized Recursive Regular Expression Synthesis Framework Kim, Seongmin Cheon, Hyunjoon Kim, Su-Hyeon Han, Yo-Sub Ko, Sang-Ki Programming Languages Software Engineering 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. |
| title | ReSyn: A Generalized Recursive Regular Expression Synthesis Framework |
| topic | Programming Languages Software Engineering |
| url | https://arxiv.org/abs/2603.24624 |