pub fn parse(text: &str) -> ParseOutputExpand description
Parse text into a lossless rowan CST. The drive loop works one logical
line at a time: leading trivia (including newlines) is emitted directly at
the root, then the line’s statements are parsed with the Pratt parser. A line
that carries a top-level ; groups its statements into a TOPLEVEL_SEMICOLON
node (mirroring JuliaSyntax’s toplevel-;); a plain line stays bare. An
unparseable token is consumed as one error token so the loop always makes
progress.