Skip to main content

Python3 module inferring Abstract Syntax Trees (AST) representing regular expressions (RE) given a set of positive examples.

Project description

fAST (find Abstract Syntax Tree)

PyPI Build Documentation ReadTheDocs codecov

Overview

find-abstract-syntax-tree is a Python 3 implemention of the fAST algorithm. This algorithm aims at inferring a regular expression from a finite set of positive examples.

The fAST algorithm is described in:

[ICGI'2023] fAST: regular expression inference from positive examples using Abstract Syntax Trees, Maxime Raynal, Marc-Olivier Buob, Georges Quénot.

This module is built on top of:

Links

License

This project is licensed under the BSD-3-Clause license.

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page