3 ms·
Could you point towards a paper that does precise and minimal regular expression (or finite state automaton) inference?
by GregarianChild 3y ago
Could you point towards a paper that does precise and minimal regular expression (or finite state automaton) inference?
- lmeyerov 3y agoThat's a great yet narrow request, which is great for POPL and less for PLDI. As a reference, I believe starcoder does worse than GPT4 and has taken time to publish results on program synthesis that subsumes regex. The flashfill team has academic PL roots and would also be good to compare to, as I mentioned. With prompt engineering being so easy, and naive search/refinement over them so easy too, not comparing via benchmarks, vs brush-off related work section, to these general solvers seems strange.