AST and pretty printing

[suhr]

The documentation is inaccurate: rnix::parser::AST is a concrete syntax tree.

It would be great to be able to create an AST and pretty-print it into a human readable CST.

[jD91mZM2]

TIL what a CST is. I think I'll need @matklad's advice on what to do here! I think rather than making an AST we'd want functions to skip over trivia in the CST, which I suppose would have the same effect?

[lf-]

I think if you just treat it as a tree of nodes you can print it ignoring all the trivia, probably?

[jD91mZM2]

I think that's basically what we're doing?

[lf-]

I was under the impression that the Display implementation for the Node would essentially print out the source code directly (including trivia) rather than pretty-printing it.

[jD91mZM2]

Ah, right, yes, it's going to include trivia. With the {:?} syntax you can print rowan's syntax tree (including trivia). With TypedNode::dump you have my favorite representation (including trivia). Anything else, you're going to have to roll your own version of it, using SyntaxKind::is_trivia

[oberblastmeister]

{} prints the exact source code, {:#?} pretty prints as a tree