Crate daml_parser 

daml-parser: a lossless lexer, layout resolver, and parser for the Daml smart-contract language.

This is the shared foundation under both daml-lint and daml-fmt. The pipeline is lexer → layout → parse over the ast types. The tree is lossless: the lexer records every comment and whitespace run as trivia (see lexer::lex_with_trivia), so a consumer can reconstruct the original bytes exactly. The linter ignores trivia and reads meaning; the formatter keeps trivia and re-prints layout. One tree, two readers.

Start at parse::parse_module. For byte-faithful reconstruction from the parse tree, see ast_span::render_from_ast and lexer::render_lossless. The AST modules are public for inspection by tools; parser-created trees are the supported construction path. This crate is pre-1.0, so breaking public API changes use 0.x minor bumps and patch releases should stay compatible.

Example

let (module, diagnostics) =
    daml_parser::parse::parse_module("module M where\nfoo : Int\nfoo = 1\n");

assert!(diagnostics.is_empty());
assert_eq!(module.name, "M");

Modules

ast

Typed, lossless parse tree produced by the recursive-descent parser (src/parse.rs).

ast_span

AST byte-span losslessness oracle (render_from_ast): reconstruct source from the parse tree to prove the tree lost nothing. AST losslessness oracle for daml-fmt.

layout

Layout resolution: insert virtual braces/semicolons per the Haskell offside rule (adapted for DAML, where with also opens a layout block).

lexer

DAML lexer: source text → tokens with spans.

parse

Recursive-descent parser: laid-out token stream → typed AST (src/ast.rs).