Have you worked with AST trees in Go? What disadvantages do you see in the current implementation?

Yes, I have worked with AST (Abstract Syntax Tree) in Go, using the go/ast package for analyzing and transforming code. The main drawbacks of the current AST implementation in Go that I noticed are:

• Complexity and verbosity: working with AST requires a deep understanding of its structure and often results in bulky code.
• Limited documentation and examples: it is not always easy to find examples for non-standard tasks.
• Lack of convenient utilities for certain operations: for example, simple tree traversal or node modification often requires writing a lot of boilerplate code.

Nevertheless, the standard Go library provides a sufficiently powerful and flexible tool for working with AST, which can be extended to meet specific needs.