Language for ASTs

Might be a fun experiment to compare complexity of different implementations via a standardized AST form....Something like, convert source code in language to some IR (TreeSitter, LLVM, etc) with a representation in a Tree Language. Then you can do simple complexity comparisons.

Start by clarifying the proposed standardized AST or IR representation, including how TreeSitter or LLVM would fit into the experiment. Define which languages and complexity comparisons are in scope, and consider the work complete when the representation and comparison method produce documented results.

Written by the indexing model from the issue text.