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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
// Copyright 2016 The Fancy Regex Authors.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//! A simple test app for exercising and debugging the regex engine.
use fancy_regex::internal::{analyze, compile, run_trace, Insn, Prog};
use fancy_regex::*;
use std::env;
use std::str::FromStr;
fn main() {
let mut args = env::args().skip(1);
if let Some(cmd) = args.next() {
if cmd == "parse" {
if let Some(re) = args.next() {
let e = Expr::parse_tree(&re);
println!("{:#?}", e);
}
} else if cmd == "analyze" {
if let Some(re) = args.next() {
let tree = Expr::parse_tree(&re).unwrap();
let a = analyze(&tree);
println!("{:#?}", a);
}
} else if cmd == "compile" {
if let Some(re) = args.next() {
let r = Regex::new(&re).unwrap();
r.debug_print();
}
} else if cmd == "run" {
let re = args.next().expect("expected regexp argument");
let r = Regex::new(&re).unwrap();
let text = args.next().expect("expected text argument");
let mut pos = 0;
if let Some(pos_str) = args.next() {
pos = usize::from_str(&pos_str).unwrap();
}
if let Some(caps) = r.captures_from_pos(&text, pos).unwrap() {
print!("captures:");
for i in 0..caps.len() {
print!(" {}:", i);
if let Some(m) = caps.get(i) {
print!("[{}..{}] \"{}\"", m.start(), m.end(), m.as_str());
} else {
print!("_");
}
}
println!("");
for cap in caps.iter() {
println!("iterate {:?}", cap);
}
} else {
println!("no match");
}
} else if cmd == "trace" {
if let Some(re) = args.next() {
let prog = prog(&re);
if let Some(s) = args.next() {
run_trace(&prog, &s, 0).unwrap();
}
}
} else if cmd == "trace-inner" {
if let Some(re) = args.next() {
let tree = Expr::parse_tree(&re).unwrap();
let a = analyze(&tree).unwrap();
let p = compile(&a).unwrap();
if let Some(s) = args.next() {
run_trace(&p, &s, 0).unwrap();
}
}
} else if cmd == "graph" {
let re = args.next().expect("expected regexp argument");
graph(&re);
} else {
println!("commands: parse|analyze|compile|graph <expr>, run|trace|trace-inner <expr> <input>");
}
}
}
fn graph(re: &str) {
let prog = prog(re);
println!("digraph G {{");
for (i, insn) in prog.body.iter().enumerate() {
let label = format!("{:?}", insn)
.replace(r#"\"#, r#"\\"#)
.replace(r#"""#, r#"\""#);
println!(r#"{:3} [label="{}: {}"];"#, i, i, label);
match *insn {
Insn::Split(a, b) => {
println!("{:3} -> {};", i, a);
println!("{:3} -> {};", i, b);
}
Insn::Jmp(target) => {
println!("{:3} -> {};", i, target);
}
Insn::End => {}
_ => {
println!("{:3} -> {};", i, i + 1);
}
}
}
println!("}}");
}
fn prog(re: &str) -> Prog {
let tree = Expr::parse_tree(re).expect("Expected parsing regex to work");
let result = analyze(&tree).expect("Expected analyze to succeed");
compile(&result).expect("Expected compile to succeed")
}
|
