automata_core 0.2.1

Deterministic and nondeterministic automata algorithms in Rust
Documentation 
1
2
3
4
5
6
7
8
9

//! Longest-match DFA parsing (unlabeled entry point).
//!
//! Re-exports [`parse_by_longest_match`] and [`ParseResult`] from
//! [`crate::labeled::finite::parsing`]. Parsing works for any
//! [`crate::labeled::finite::DeterministicFiniteLabeledAutomaton`]; unlabeled
//! DFAs use `Label = ()`.

pub use crate::labeled::finite::parsing::ParseResult;
pub use crate::labeled::finite::parsing::parse_by_longest_match;