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.
A tool to parse expression and form an expression tree. Can be used to understand complex If-Else conditions/ Algorithm studies / compiler design studies.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results