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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
///////////////////////////////////////////////////////////////////////////////
// misc1.hpp
//
// Copyright 2004 Eric Niebler. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <iostream>
#include <boost/xpressive/xpressive.hpp>
#include <boost/xpressive/traits/cpp_regex_traits.hpp>
#include "./test_minimal.hpp"
using namespace boost::xpressive;
void test1()
{
// make sure the following compiles:
sregex a = _;
sregex b = _;
sregex c = a >> b;
c = a | b;
c = !a;
c = *a;
c = +a;
}
///////////////////////////////////////////////////////////////////////////////
// test for basic_regex in a keep
//
void test2()
{
std::locale loc;
std::string str("Its a mad Mad mAd maD world");
sregex word = +_w;
sregex sentence = imbue(loc)(*(keep(word) >> +_s) >> word);
smatch what;
BOOST_REQUIRE(regex_match(str, what, sentence));
BOOST_REQUIRE(7 == what.nested_results().size());
smatch::nested_results_type::const_iterator pword = what.nested_results().begin();
BOOST_CHECK((*pword++)[0] == "Its");
BOOST_CHECK((*pword++)[0] == "a");
BOOST_CHECK((*pword++)[0] == "mad");
BOOST_CHECK((*pword++)[0] == "Mad");
BOOST_CHECK((*pword++)[0] == "mAd");
BOOST_CHECK((*pword++)[0] == "maD");
BOOST_CHECK((*pword++)[0] == "world");
BOOST_CHECK(pword == what.nested_results().end());
}
///////////////////////////////////////////////////////////////////////////////
// test for a simple non-recursive grammar
//
void test3()
{
// test for a simple regex grammar
std::string buffer =
"FROGGIE\r\n"
"Volume = 1\r\n"
"Other1= 2\r\n"
"Channel=3\r\n"
"Other =4\r\n"
"\r\n"
"FROGGIE\r\n"
"Volume = 5\r\n"
"Other1= 6\r\n"
"Channel=7\r\n"
"Other =8\r\n"
"\r\n"
"FROGGIE\r\n"
"Volume = 9\r\n"
"Other1= 0\r\n"
"Channel=10\r\n"
"\r\n";
mark_tag name(1), value(2);
sregex name_value_pair_ =
(name= +alnum) >> *_s >> "=" >> *_s >>
(value= +_d) >> *_s >> _ln;
sregex message_ =
*_s >> "FROGGIE" >> _ln >> +name_value_pair_ >> _ln;
sregex re_ = +message_;
smatch::nested_results_type::const_iterator msg, nvp;
smatch tmpwhat;
BOOST_REQUIRE(regex_search(buffer, tmpwhat, re_));
// for giggles, make a deep-copy of the tree of results
smatch what = tmpwhat;
BOOST_REQUIRE(3 == what.nested_results().size());
msg = what.nested_results().begin();
BOOST_REQUIRE(4 == msg->nested_results().size());
nvp = msg->nested_results().begin();
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Volume" == (*nvp)[name]);
BOOST_CHECK("1" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Other1" == (*nvp)[name]);
BOOST_CHECK("2" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Channel" == (*nvp)[name]);
BOOST_CHECK("3" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Other" == (*nvp)[name]);
BOOST_CHECK("4" == (*nvp)[value]);
++msg;
BOOST_REQUIRE(4 == msg->nested_results().size());
nvp = msg->nested_results().begin();
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Volume" == (*nvp)[name]);
BOOST_CHECK("5" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Other1" == (*nvp)[name]);
BOOST_CHECK("6" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Channel" == (*nvp)[name]);
BOOST_CHECK("7" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Other" == (*nvp)[name]);
BOOST_CHECK("8" == (*nvp)[value]);
++msg;
BOOST_REQUIRE(3 == msg->nested_results().size());
nvp = msg->nested_results().begin();
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Volume" == (*nvp)[name]);
BOOST_CHECK("9" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Other1" == (*nvp)[name]);
BOOST_CHECK("0" == (*nvp)[value]);
++nvp;
BOOST_REQUIRE(3 == nvp->size());
BOOST_CHECK("Channel" == (*nvp)[name]);
BOOST_CHECK("10" == (*nvp)[value]);
}
///////////////////////////////////////////////////////////////////////////////
// test for a self-recursive regex
//
void test4()
{
sregex parentheses;
parentheses // A balanced set of parentheses ...
= '(' // is an opening parenthesis ...
>> // followed by ...
*( // zero or more ...
keep( +~(set='(',')') ) // of a bunch of things that are not parentheses ...
| // or ...
by_ref(parentheses) // a balanced set of parentheses
) // (ooh, recursion!) ...
>> // followed by ...
')' // a closing parenthesis
;
smatch what;
smatch::nested_results_type::const_iterator pwhat, pwhat2;
std::string str( "blah blah( a(b)c (c(e)f (g)h )i (j)6 )blah" );
BOOST_REQUIRE(regex_search(str, what, parentheses));
BOOST_REQUIRE(1 == what.size());
BOOST_CHECK("( a(b)c (c(e)f (g)h )i (j)6 )" == what[0]);
BOOST_REQUIRE(3 == what.nested_results().size());
pwhat = what.nested_results().begin();
BOOST_REQUIRE(1 == pwhat->size());
BOOST_CHECK("(b)" == (*pwhat)[0]);
++pwhat;
BOOST_REQUIRE(1 == pwhat->size());
BOOST_CHECK("(c(e)f (g)h )" == (*pwhat)[0]);
BOOST_REQUIRE(2 == pwhat->nested_results().size());
pwhat2 = pwhat->nested_results().begin();
BOOST_REQUIRE(1 == pwhat2->size());
BOOST_CHECK("(e)" == (*pwhat2)[0]);
++pwhat2;
BOOST_REQUIRE(1 == pwhat2->size());
BOOST_CHECK("(g)" == (*pwhat2)[0]);
++pwhat;
BOOST_REQUIRE(1 == pwhat->size());
BOOST_CHECK("(j)" == (*pwhat)[0]);
}
///////////////////////////////////////////////////////////////////////////////
// test_main
//
int test_main( int, char*[] )
{
test1();
test2();
test3();
test4();
return 0;
}
|
