aufbau 0.1.0

Type-aware constrained decoding for LLMs using context-dependent grammars with typing rules
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120

use std::fmt::{self, Display};

// Functions for compact, consistent tree display.

fn indent(level: usize) -> String {
    const INDENT: &str = "  ";
    INDENT.repeat(level)
}

fn format_nonterminal(nt: &super::NonTerminal, level: usize) -> String {
    let mut out = String::new();

    out.push_str(&indent(level));
    out.push_str(&format!("{} [alt {}]", nt.name, nt.alternative_index));

    if nt.is_complete() {
        out.push_str(" ✓");
    } else {
        out.push_str(" (partial)");
    }

    for child in &nt.children {
        out.push('\n');
        out.push_str(&format_node(child, level + 1));
    }

    out
}

fn format_node(node: &super::Node, level: usize) -> String {
    match node {
        super::Node::Terminal(t) => {
            let mut out = indent(level);
            out.push_str(&t.to_string());
            out
        }
        super::Node::NonTerminal(nt) => format_nonterminal(nt, level),
    }
}

impl Display for super::PartialAST {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        let roots = self.roots();
        writeln!(f, "PartialAST ({} roots):", roots.len())?;
        for (i, root) in roots.iter().enumerate() {
            writeln!(f, "Root {}:", i)?;
            write!(f, "{}", format_nonterminal(root, 1))?;
            if i < roots.len() - 1 {
                writeln!(f)?;
            }
        }
        Ok(())
    }
}

impl Display for super::NonTerminal {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", format_nonterminal(self, 0))
    }
}

impl Display for super::Terminal {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            super::Terminal::Complete {
                value, extension, ..
            } => {
                write!(f, "\"{}\"", value)?;
                if let Some(ext) = extension {
                    write!(f, "<{}>", ext.to_pattern())?;
                }
                Ok(())
            }
            super::Terminal::Partial {
                value, remainder, ..
            } => {
                write!(f, "\"{}\"", value)?;
                if let Some(rem) = remainder {
                    write!(f, "~{}", rem.to_pattern())?;
                }
                Ok(())
            }
        }
    }
}

// Simple Display implementations for use in debug/trace output
impl Display for super::Node {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            super::Node::Terminal(t) => write!(f, "{}", t),
            super::Node::NonTerminal(nt) => write!(f, "{}", nt.name),
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::logic::grammar::Grammar;
    use crate::logic::partial::Parser;

    #[test]
    fn test_display_simple_complete() {
        let spec = r#"
        start ::= 'hello'
        "#;
        let g = Grammar::load(spec).unwrap();
        let mut p = Parser::new(g);

        let ast = p.partial("hello").unwrap();
        let display = format!("{}", ast);

        println!("\n=== Simple Complete ===");
        println!("{}", display);

        assert!(display.contains("start"));
        assert!(display.contains("\"hello\""));
        assert!(display.contains("✓")); // Should show complete
    }
}