regexinter

command module

v0.1.0 Latest Latest Go to latest Published: Jan 21, 2022 License: GPL-3.0 Imports: 5 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/oulinbao/regexinter

Links

Open Source Insights

README ¶

regexinter

regexinter is built for checking two regular expressions (regex) have intersection (conflict) or not. It's based on https://gitlab.com/opennota/re2dfa project.

Installation

go get -u github.com/oulinbao/regexinter

Usage

make
./regexinter "a*" "a+"

License

regexinter is released under the GNU General Public License version 3.0.

Contribute

If you find some bugs or have some good points to extend, please raise a PR.

Documentation ¶

Overview ¶

Transform regular expressions into finite state machines.

Source Files ¶

View all Source files

regexinter.go

Directories ¶

Path	Synopsis
dfa Package dfa provides a way to construct deterministic finite automata from non-deterministic finite automata.	Package dfa provides a way to construct deterministic finite automata from non-deterministic finite automata.
intersection This package checks that two DFA has intersection or not by DFS algorithm.	This package checks that two DFA has intersection or not by DFS algorithm.
nfa Package nfa provides a way to construct non-deterministic finite automata from regular expressions using the Thompson's construction algorithm.	Package nfa provides a way to construct non-deterministic finite automata from regular expressions using the Thompson's construction algorithm.
runerange Package runerange provides operations on rune ranges.	Package runerange provides operations on rune ranges.

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL