-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathregexinter.go
42 lines (35 loc) · 1.09 KB
/
regexinter.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// This program is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the Free
// Software Foundation, either version 3 of the License, or (at your option)
// any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
// Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program. If not, see <http://www.gnu.org/licenses/>.
// Transform regular expressions into finite state machines.
package main
import (
"flag"
"fmt"
"github.com/oulinbao/regexinter/intersection"
"log"
"os"
)
func main() {
log.SetFlags(0)
flag.Usage = func() {
fmt.Println(`Usage: regexinter regexp1 regexp2
EXAMPLE: regexinter "a+b" "a*b"`)
}
flag.Parse()
if len(flag.Args()) != 2 {
flag.Usage()
os.Exit(1)
}
result := intersection.HasIntersection(flag.Arg(0), flag.Arg(1))
fmt.Println(result)
}