Module hime_redist::lexers::fuzzy

source ·
Expand description

Module for the lexers’ fuzzy DFA matcher

Structs

A fuzzy DFA matcher This matcher uses the Levenshtein distance to match the input ahead against the current DFA automaton. The matcher favors solutions that are the closest to the original input. When multiple solutions are at the same Levenshtein distance to the input, the longest one is preferred.