Ruby library for working with abstract syntax trees
Descriptionast embraces immutability; each AST node is inherently frozen at creation, and updating a child node requires recreating that node and its every parent, recursively. This is a design choice. It does create some pressure on garbage collector, but completely eliminates all concurrency and aliasing problems. See also AST::Node, AST::Processor::Mixin and AST::Sexp classes for additional recommendations and design patterns.
Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.Upload a screenshot
Hint: upload an image here from your clipboard with Ctrl-V
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…Install ruby-ast