cp-ast-core 0.1.3

Core AST types for competitive programming problem specification DSL
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

use super::node_id::NodeId;
use super::reference::Reference;
use super::types::{Ident, Literal, NodeKindHint};
use crate::constraint::Expression;

/// The kind of structure node in a competitive programming problem specification.
///
/// Rev.1: Rich variants with embedded data. Type and separator info
/// moved to `ConstraintAST` (`TypeDecl`, `RenderHint`).
#[derive(Debug, Clone, PartialEq)]
pub enum NodeKind {
    /// Single variable: N, M, S, etc.
    Scalar { name: Ident },
    /// 1D array: `A_1` ... `A_N`.
    Array { name: Ident, length: Expression },
    /// 2D grid, such as `C[i][j]` or `A_{i,j}`.
    Matrix {
        name: Ident,
        rows: Reference,
        cols: Reference,
    },
    /// Same-line variable group: (N, M, K), (`u_i`, `v_i`).
    Tuple { elements: Vec<NodeId> },
    /// Variable-dependent repetition: M lines, T test cases.
    Repeat {
        count: Expression,
        index_var: Option<Ident>,
        body: Vec<NodeId>,
    },
    /// Semantically delimited block: header + body.
    Section {
        header: Option<NodeId>,
        body: Vec<NodeId>,
    },
    /// Ordered root of the entire input.
    Sequence { children: Vec<NodeId> },
    /// Tag-dependent branching (query type variants).
    Choice {
        tag: Reference,
        variants: Vec<(Literal, Vec<NodeId>)>,
    },
    /// Unfilled position (first-class hole).
    Hole { expected_kind: Option<NodeKindHint> },
}