Two cool blog posts about implementing memory-efficient ASTs (abstract syntax trees, the in-memory representation of programming languages) in #Rust

https://jhwlr.io/super-flat-ast/

https://www.cs.cornell.edu/~asampson/blog/flattening.html

The first is very similar to my implementation of the cuicui DSL (https://github.com/nicopap/cuicui_layout/blob/main/design_docs/ast.md) The second mentions #bevy, which reminds me of how many people in the bevy chat said the ECS would be a good storage for AST nodes (it would indeed, but the "super flat AST" is better)