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
use crate::parser::*;
use bogobble::partial::*;
use bogobble::traits::*;
impl<CF: BackTo, P: SSParser<CF>> SSParser<CF> for PPlus<P> {
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, cf: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
let mut n = 0;
loop {
let rpos = res.len();
if i2.eoi() {
return Ok((i2, None));
}
match self.0.ss_parse(&i2, res, cf) {
Ok((i3, _)) => {
if i3.index() == i2.index() {
return i2.err_rs("No Progression in PPlus");
}
i2 = i3;
n += 1;
}
Err(e) => {
if n > 0 {
res.truncate(rpos);
return Ok((i2, Some(e)));
}
return Err(e);
}
}
}
}
}
impl<CF: BackTo, P: SSParser<CF>> SSParser<CF> for PStar<P> {
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, cf: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
loop {
let rpos = res.len();
if i2.eoi() {
return Ok((i2, None));
}
match self.0.ss_parse(&i2, res, cf) {
Ok((i3, _)) => {
i2 = i3;
}
Err(e) => {
res.truncate(rpos);
return Ok((i2, Some(e)));
}
}
}
}
}
pub struct PKeyWord(pub &'static str);
impl<CF: BackTo> SSParser<CF> for PKeyWord {
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, _: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
for c in self.0.chars() {
match i2.next() {
Some(n) if c == n => {}
Some(_) => return it.err_rs(self.0),
None => {
res.push_str(it.str_to(None));
return Ok((i2, None));
}
}
}
let mut i3 = i2.clone();
use bogobble::*;
match i3.next() {
Some(c) if (Alpha, NumDigit, '_').char_bool(c) => {
return i2.err_rs(self.0);
}
_ => {
res.push_str(it.str_to(i2.index()));
Ok((i2, None))
}
}
}
}
pub struct PStarUntil<A, B>(pub A, pub B);
impl<CF: BackTo, A: SSParser<CF>, B: SSParser<CF>> SSParser<CF> for PStarUntil<A, B> {
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, cf: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
loop {
if i2.eoi() {
return Ok((i2, None));
}
let rpos = res.len();
let e = match self.1.ss_parse(&i2, res, cf) {
Ok(v) => return Ok(v),
Err(e) => e,
};
res.truncate(rpos);
match self.0.ss_parse(&i2, res, cf) {
Ok((v, _)) => i2 = v,
Err(ea) => return Err(ea.join(e)),
}
}
}
}
pub struct PSepPlus<A, B>(pub A, pub B);
impl<CF: BackTo, A: SSParser<CF>, B: SSParser<CF>> SSParser<CF> for PSepPlus<A, B> {
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, cf: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
loop {
if i2.eoi() {
return Ok((i2, None));
}
match self.0.ss_parse(&i2, res, cf) {
Ok((nx, _)) => i2 = nx,
Err(e) => return Err(e),
}
if i2.eoi() {
return Ok((i2, None));
}
match self.1.ss_parse(&i2, res, cf) {
Ok((nx, _)) => i2 = nx,
Err(e) => return Ok((i2, Some(e))),
}
}
}
}
pub struct PSepUntil<A, B, C>(pub A, pub B, pub C);
impl<CF: BackTo, A: SSParser<CF>, B: SSParser<CF>, C: SSParser<CF>> SSParser<CF>
for PSepUntil<A, B, C>
{
fn ss_parse<'a>(&self, it: &PIter<'a>, res: &mut String, cf: &CF) -> SSRes<'a> {
let mut i2 = it.clone();
let mut e_end = Some(match self.2.ss_parse(&i2, res, cf) {
Ok(v) => return Ok(v),
Err(e) => e,
});
loop {
if i2.eoi() {
return Ok((i2, None));
}
match self.0.ss_parse(&i2, res, cf) {
Ok((v, _)) => i2 = v,
Err(e) => {
return match e_end {
Some(ee) => Err(e.join(ee)),
None => Err(e),
}
}
}
if i2.eoi() {
return Ok((i2, None));
}
e_end = match self.2.ss_parse(&i2, res, cf) {
Ok(v) => return Ok(v),
Err(e) => Some(e),
};
if i2.eoi() {
return Ok((i2, None));
}
e_end = match self.1.ss_parse(&i2, res, cf) {
Ok((v, e)) => {
i2 = v;
e
}
Err(e) => {
return match e_end {
Some(ee) => Err(e.join(ee)),
None => Err(e),
}
}
}
}
}
}