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
|
#include "Piraha.hpp"
#include <string.h>
using namespace piraha;
typedef vector<smart_ptr<Range> >::iterator range_iter;
bool Range::match(Matcher *m) {
if(m->pos - m->input_size >= 0)
return false;
char c = m->input[m->pos];
if(lo <= c && c <= hi) {
return true;
} else {
return false;
}
}
Bracket::Bracket(bool b) : neg(b), ranges() {}
Bracket *Bracket::addRange(char lo,char hi) {
bool done = false;
while(!done) {
done = true;
for(range_iter ri = ranges.begin();ri != ranges.end(); ++ri) {
smart_ptr<Range> r = *ri;
if(hi < r->lo || r->hi < lo) {
// no intersection
continue;
} else {
lo = std::min(lo,r->lo);
hi = std::max(hi,r->hi);
ranges.erase(ri);
done = false;
break;
}
}
}
ranges.push_back(new Range(lo,hi));
return this;
};
Bracket *Bracket::addRange(char lo,char hi,bool ign) {
if(ign) {
char lolc = lc_(lo);
char hilc = lc_(hi);
char louc = uc_(lo);
char hiuc = uc_(hi);
if(lolc == louc && hilc == hiuc) {
ranges.push_back(new Range(lo,hi));
} else {
ranges.push_back(new Range(lolc,hilc));
ranges.push_back(new Range(louc,hiuc));
}
} else {
ranges.push_back(new Range(lo,hi));
}
return this;
};
static void fail(Bracket *b,Matcher *m) {
typedef vector<smart_ptr<Range> >::iterator range_iter;
Bracket bex;
if(m->pos == m->max_pos+1) {
for(range_iter r = b->ranges.begin();r != b->ranges.end(); ++r) {
bex.addRange((*r)->lo,(*r)->hi);
}
m->fail(&bex);
}
}
bool Bracket::match(Matcher *m) {
if(m->pos >= (int)m->input_size) {
return false;
}
for(range_iter r = ranges.begin();r != ranges.end(); ++r) {
if((*r)->match(m)) {
if(neg) {
fail(this,m);
return false;
} else {
m->max_pos = std::max(m->pos,m->max_pos);
m->pos++;
return true;
}
}
}
if(!neg) {
fail(this,m);
return false;
} else {
m->pos++;
m->max_pos = std::max(m->pos,m->max_pos);
return true;
}
}
void piraha::insertc(std::ostream& o,char c) {
if(c == '-') {
o << "\\-";
} else if(c == '\n') {
o << "\\n";
} else if(c == '\r') {
o << "\\r";
} else if(c == '\t') {
o << "\\t";
} else if(c == '\b') {
o << "\\b";
} else if(strchr("\\\"[]-",c) != 0) {
o << "\\" << c;
} else {
o << c;
}
}
void Bracket::insert(std::ostream& o) {
o << "[";
if(neg)
o << "^";
for(range_iter r = ranges.begin();r != ranges.end(); ++r) {
char lo = (*r)->lo, hi = (*r)->hi;
if(lo == hi) {
insertc(o,lo);
} else {
insertc(o,lo);
o << '-';
insertc(o,hi);
}
}
o << "]";
}
|
