rustfst 0.3.0

Library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs).
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

use std::fs::read_to_string;
use std::path::Path;

use failure::Fallible;

use nom::types::CompleteStr;

use crate::parsers::text_symt::nom_parser::parse_text_symt;
use crate::{Label, Symbol};

#[derive(Debug, PartialEq, Default)]
pub(crate) struct ParsedTextSymt {
    pub pairs: Vec<(Symbol, Label)>,
}

impl ParsedTextSymt {
    pub(crate) fn from_string(symt_string: &str) -> Fallible<Self> {
        let complete_symt_str = CompleteStr(symt_string);
        let (_, parsed_symt) = parse_text_symt(complete_symt_str)
            .map_err(|_| format_err!("Error while parsing text symt"))?;
        Ok(parsed_symt)
    }

    pub(crate) fn from_path<P: AsRef<Path>>(path_symt_text: P) -> Fallible<Self> {
        let symt_string = read_to_string(path_symt_text)?;
        Self::from_string(&symt_string)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::symbol_table::SymbolTable;

    #[test]
    fn test_parse_text_symt() -> Fallible<()> {
        let mut symt = SymbolTable::new();
        symt.add_symbol("a");
        symt.add_symbol("b");
        let s = symt.text()?;
        println!("{:?}", ParsedTextSymt::from_string(&s));
        Ok(())
    }

}