Expand description
Lossless AST node types produced by the parser. Typed, lossless parse tree produced by the recursive-descent parser (src/parse.rs).
Every node carries a source position and byte span. Downstream crates consume this tree directly: daml-fmt re-prints layout from the spans, and daml-lint lowers it onto its own rule-facing IR.
Re-exports§
pub use crate::lexer::Identifier;pub use crate::lexer::ModuleName;pub use crate::lexer::Operator;pub use crate::lexer::Pos;
Structs§
- Alt
- Binding
- Choice
Decl - Equation
- Field
Assign - Field
Decl - Function
Decl - Import
Decl - Interface
Decl - Interface
Instance Decl - Module
- Parse
Diagnostic - Parse diagnostic — never fatal; the scan continues.
- Span
- Byte span of an AST node.
- Template
Decl
Enums§
- Consuming
- Decl
- Diagnostic
Category - Why a
ParseDiagnosticfired. - DoStmt
- Expr
- Import
Style - Import syntax style.
- LitKind
- Pat
- Section
Side - Side of an operator section.
- Template
Body Decl - Type
- Structured Daml type, parsed from the real token stream.