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.

Name		Name	Last commit message	Last commit date
Latest commit History 29 Commits
experiment		experiment
LICENSE		LICENSE
README.md		README.md
cache.go		cache.go
cache_test.go		cache_test.go
dump.go		dump.go
dump_test.go		dump_test.go
enum.go		enum.go
expr.go		expr.go
expr_test.go		expr_test.go
fast.go		fast.go
gen.go		gen.go
go.mod		go.mod
go.sum		go.sum
machine.go		machine.go
machine_test.go		machine_test.go
match.go		match.go
match_test.go		match_test.go
merge.go		merge.go
minimize.go		minimize.go
state.go		state.go
unicode.go		unicode.go
utf8.go		utf8.go

Navigation Menu

License

h12w/dfa

Folders and files

Latest commit

History

Repository files navigation

DFA: a fast and modular replacement for regular expressions

About

Resources

License

Stars

Watchers

Forks

Languages