hoars 0.2.0

A library for dealing with the HOA (Hanoi Omega Automata) file format.
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

use chumsky::{prelude::*, select};

use crate::{
    AbstractLabelExpression, AcceptanceAtom, AcceptanceCondition, AcceptanceInfo,
    AcceptanceSignature, HoaBool, Id, StateConjunction, Token,
};

#[allow(unused)]
pub fn header() -> impl Parser<Token, String, Error = Simple<Token>> + Clone {
    select! {
        Token::Header(hdr) => hdr,
    }
}

pub fn boolean() -> impl Parser<Token, bool, Error = Simple<Token>> + Clone {
    select! {
        Token::Identifier(id) if id == *"t" => true,
        Token::Identifier(id) if id == *"f" => false,
    }
}

pub fn integer() -> impl Parser<Token, Id, Error = Simple<Token>> + Clone {
    select! {
        Token::Int(n) => n.parse().unwrap(),
    }
}

pub fn text() -> impl Parser<Token, String, Error = Simple<Token>> + Clone {
    select! {
        Token::Text(txt) => txt,
    }
}

pub fn identifier() -> impl Parser<Token, String, Error = Simple<Token>> + Clone {
    select! { Token::Identifier(ident) => ident }
}

pub fn alias_name() -> impl Parser<Token, String, Error = Simple<Token>> + Clone {
    select! { Token::Alias(aname) => aname }
}

pub fn state_conjunction() -> impl Parser<Token, StateConjunction, Error = Simple<Token>> {
    integer()
        .separated_by(just(Token::Op('&')))
        .at_least(1)
        .map(StateConjunction)
}

pub fn acceptance_signature() -> impl Parser<Token, AcceptanceSignature, Error = Simple<Token>> {
    integer()
        .repeated()
        .delimited_by(just(Token::Paren('{')), just(Token::Paren('}')))
        .map(AcceptanceSignature)
}

pub fn acceptance_info() -> impl Parser<Token, AcceptanceInfo, Error = Simple<Token>> {
    select! {
        Token::Identifier(ident) => AcceptanceInfo::Identifier(ident),
        Token::Int(n) => AcceptanceInfo::Int(n.parse().unwrap())
    }
}

pub fn label_expression() -> impl Parser<Token, AbstractLabelExpression, Error = Simple<Token>> {
    recursive(|label_expression| {
        let value = boolean()
            .map(|b| AbstractLabelExpression::Boolean(b))
            .or(integer().map(|i| AbstractLabelExpression::Integer(i as u16)));
        // .or(alias_name().map(|aname| LabelExpression::Alias(AliasName(aname))));

        let atom = value
            .or(label_expression.delimited_by(just(Token::Paren('(')), just(Token::Paren(')'))));

        let unary = just(Token::Op('!'))
            .or_not()
            .then(atom)
            .map(|(negated, expr)| {
                if negated.is_some() {
                    AbstractLabelExpression::Negated(Box::new(expr))
                } else {
                    expr
                }
            });

        let conjunction = unary
            .clone()
            .map(|x| vec![x])
            .then(just(Token::Op('&')).then(unary).repeated())
            .foldl(|mut acc, (_tok, expr)| {
                acc.push(expr);
                acc
            })
            .map(|acc| match acc.len() {
                0 => panic!("we do not expect this to happen..."),
                1 => acc.into_iter().next().unwrap(),
                _ => AbstractLabelExpression::Conjunction(acc),
            });

        conjunction
            .clone()
            .map(|conj| vec![conj])
            .then(just(Token::Op('|')).then(conjunction).repeated())
            .foldl(|mut acc, (_tok, rhs)| {
                acc.push(rhs);
                acc
            })
            .map(|acc| match acc.len() {
                0 => panic!("it seems we need to deal with the case where this is empty"),
                1 => acc.into_iter().next().unwrap(),
                _ => AbstractLabelExpression::Disjunction(acc),
            })
    })
}

pub fn acceptance_condition() -> impl Parser<Token, AcceptanceCondition, Error = Simple<Token>> {
    recursive(|acceptance_condition| {
        let atom_value = just(Token::Op('!'))
            .or_not()
            .then(integer())
            .map(|(negated, integer)| {
                if negated.is_none() {
                    AcceptanceAtom::Positive(integer)
                } else {
                    AcceptanceAtom::Negative(integer)
                }
            });

        let fin_inf_atom = just(Token::Fin)
            .to(AcceptanceCondition::Fin as fn(_) -> _)
            .or(just(Token::Inf).to(AcceptanceCondition::Inf as fn(_) -> _))
            .then(atom_value.delimited_by(just(Token::Paren('(')), just(Token::Paren(')'))))
            .map(|(f, atom)| f(atom));

        let atom =
            boolean()
                .map(HoaBool)
                .map(AcceptanceCondition::Boolean)
                .or(fin_inf_atom)
                .or(acceptance_condition
                    .delimited_by(just(Token::Paren('(')), just(Token::Paren(')'))));

        let conjunction = atom
            .clone()
            .then(
                just(Token::Op('&'))
                    .to(AcceptanceCondition::And)
                    .then(atom)
                    .repeated(),
            )
            .foldl(|lhs, (f, rhs)| f(Box::new(lhs), Box::new(rhs)));

        conjunction
            .clone()
            .then(
                just(Token::Op('|'))
                    .to(AcceptanceCondition::Or)
                    .then(conjunction)
                    .repeated(),
            )
            .foldl(|lhs, (f, rhs)| f(Box::new(lhs), Box::new(rhs)))
    })
}