Abstract syntax trees (AST) are hierarchical, recursive structures for representing source code. Parsing them typically requires a full traversal of the code, which costs O(n) operations. Instead of parsing code structures we load them into memory as an efficient binary structure before any further analysis, this would only cost O(1) operations. This tool adopts flatbuffers to represent the AST as a binary file, and demonstrates improved efficiency and applicability to software development.
