Regular expressions are ubiquitous in computer science but are cumbersome to code. In this work, we present a new algorithm, named fAST (find Abstract Syntax Tree), that infers a regular expression from a small set of positive examples. Its main strength (with respect to the start of the art) resides in its ability to perform this inference without counter examples.
Authors: Maxime Raynal (LIG, NBLF), Marc-Olivier Buob (NBLF), Georges Quénot (LIG)