scryer-prolog 0.8.59

A modern Prolog implementation written mostly in Rust.
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

use l0::ast::{Term, TopLevel, Var};
use l0::l0_parser::{parse_TopLevel};

use std::collections::{HashMap};

extern crate lalrpop_util as __lalrpop_util;

pub type ParseResult<'a> =
    Result<TopLevel, __lalrpop_util::ParseError<usize,(usize, &'a str),()>>;

pub fn parse_top_level<'a>(input: &'a str) -> ParseResult {
    let result = parse_TopLevel(&*input);
    
    if let Ok(result) = result {
        return Ok(mark_cells(result));
    }

    result
}

#[inline]
fn mark_cells(tl: TopLevel) -> TopLevel {
    match tl {
        TopLevel::Fact(term) => TopLevel::Fact(mark_term_cells(term)),
        TopLevel::Query(term) => TopLevel::Query(mark_term_cells(term))            
    }
}
    
fn mark_term_cells(term: Term) -> Term {
    let mut cell_num = 1;    
    
    {
        let mut bindings: HashMap<&Var, usize> = HashMap::new();
        let mut iter = term.breadth_first_iter();
    
        while let Some(term) = iter.next() {
            if let &Term::Var(ref cell, ref var) = term {
                let cell_num_in_map = bindings.entry(var).or_insert(cell_num);
                
                if *cell_num_in_map != cell_num {                    
                    cell.set(*cell_num_in_map);
                    continue;
                }
            }

            term.set_cell(cell_num);
            cell_num += 1;
        }
    }

    term
}