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


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:



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

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

find_abstract_syntax_tree-0.1.0.tar.gz (29.2 kB view hashes)

Uploaded Source

Built Distribution

find_abstract_syntax_tree-0.1.0-py3-none-any.whl (34.5 kB view hashes)

Uploaded Python 3

Supported by

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