ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
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-conq