Python3 module inferring Abstract Syntax Trees (AST) representing regular expressions (RE) given a set of positive examples.
Project description
fAST (find Abstract Syntax Tree)
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.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for find_abstract_syntax_tree-0.1.0.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 3574cd856edef93b4cb71661f57afab226c9768b4d3b47d38703c9021e1f7ce8 |
|
| MD5 | 0c133e59d38f77d074bf2b2e915a3af3 |
|
| BLAKE2b-256 | 211fa8c7f23d907fcb9b7741ef7c795bf85bb4f8f91616de4d508c0f71439807 |
Close
Hashes for find_abstract_syntax_tree-0.1.0-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | fa7d2e43b95a219bc383ae047c78dc2cc2ab3700f73dfafa5b6ddc7d26815642 |
|
| MD5 | f01c1463ac064ada22dff78b552f4102 |
|
| BLAKE2b-256 | 67dd16e9da1831002cc574fe376acf04e140e34ad562c75548b5361f7ccf890a |
