Abstract: We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context ...
How-To Geek on MSN
This tool lets you make magical code changes—without AI
If you thought grep was powerful, wait until you get a hold of ast-grep, which takes it to a whole new level.
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results