DFA is a Go package that implements combinatorial Deterministic Finite Automatas. It is a fast and modular replacement for regular expressions, and is designed with lexing purpose in mind.
To see how to use it as a lexer, please check Gombi.
DFA: a fast and modular replacement for regular expressions
DFA is a Go package that implements combinatorial Deterministic Finite Automatas. It is a fast and modular replacement for regular expressions, and is designed with lexing purpose in mind.
To see how to use it as a lexer, please check Gombi.
DFA: a fast and modular replacement for regular expressions
BSD 2-Clause "Simplified" License