Files
@ bac2e7f972b5
Branch filter:
Location: Regular-Expresso/src/regexp/token.rs
bac2e7f972b5
6.8 KiB
application/rls-services+xml
added a license
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 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 | use std::{borrow::Borrow, fmt};
#[derive(Debug, Clone)]
pub enum ParsingError {
Asterisk {s: String, pos: usize},
OpeningParenthesis {s: String, pos: usize},
ClosingParenthesis {s: String, pos: usize},
EmptyAlternativeVariant
}
impl fmt::Display for ParsingError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
ParsingError::Asterisk {s, pos} => {
write!(f, "The asterisk operator is missing an argument. Pattern \"{s}\", position {pos}")
},
ParsingError::OpeningParenthesis {s, pos} => {
write!(f, "An opening parenthesis not found. Pattern \"{s}\", position {pos}")
},
ParsingError::ClosingParenthesis {s, pos} => {
write!(f, "An closing parenthesis not found. Pattern \"{s}\", position {pos}")
},
ParsingError::EmptyAlternativeVariant => {
write!(f, "Found an empty Alternative variant.")
}
}
}
}
pub struct Symbol {
position: usize
}
pub struct Asterisk {
content: Box<Token>
}
pub struct Alternative {
content: Vec<Box<Token>>
}
pub struct Chain {
content: Vec<Box<Token>>
}
pub enum Token {
Lambda,
Symbol(Symbol),
Asterisk(Asterisk),
Alternative(Alternative),
AlternativeSeparator,
Chain(Chain)
}
impl Symbol {
fn list_first(&self) -> Vec<usize> {
return vec![self.position];
}
fn list_last(&self) -> Vec<usize> {
return vec![self.position];
}
fn list_neighbours(&self) -> Vec<(usize, usize)> {
return vec![];
}
}
impl Asterisk {
fn list_first(&self) -> Vec<usize> {
return self.content.list_first();
}
fn list_last(&self) -> Vec<usize> {
return self.content.list_last();
}
fn list_neighbours(&self) -> Vec<(usize, usize)> {
let mut res = self.content.list_neighbours();
for x in self.list_last() {
for y in self.list_first() {
res.push((x, y));
}
}
return res;
}
}
impl Alternative {
fn new(content: Vec<Box<Token>>) -> Result<Alternative, ParsingError> {
let mut variants: Vec<Vec<Box<Token>>> = vec![Vec::new()];
content.into_iter().for_each(|x| {
if matches!(x.borrow(), Token::AlternativeSeparator) {
variants.push(Vec::new());
} else {
variants.last_mut().unwrap().push(x);
}
});
if variants.iter().any(|x| x.is_empty()) {
return Err(ParsingError::EmptyAlternativeVariant);
}
return Ok(Alternative{
content: variants.into_iter().map(
|x| Box::new(Token::Chain(Chain{content: x}))
).collect()
});
}
fn is_skippable(&self) -> bool {
return self.content.iter().any(|x| x.is_skippable());
}
fn list_first(&self) -> Vec<usize> {
let mut res = Vec::new();
for token in self.content.iter() {
res.append(&mut token.list_first());
}
return res;
}
fn list_last(&self) -> Vec<usize> {
let mut res = Vec::new();
for token in self.content.iter() {
res.append(&mut token.list_last());
}
return res;
}
fn list_neighbours(&self) -> Vec<(usize, usize)> {
let mut res = Vec::new();
for token in self.content.iter() {
res.append(&mut token.list_neighbours());
}
return res;
}
}
impl Chain {
fn is_skippable(&self) -> bool {
return self.content.iter().all(|x| x.is_skippable());
}
fn list_first(&self) -> Vec<usize> {
let mut res = Vec::new();
for token in self.content.iter() {
res.append(&mut token.list_first());
if !token.is_skippable() {break;}
}
return res;
}
fn list_last(&self) -> Vec<usize> {
let mut res = Vec::new();
for token in self.content.iter().rev() {
res.append(&mut token.list_last());
if !token.is_skippable() {break;}
}
return res;
}
fn list_neighbours(&self) -> Vec<(usize, usize)> {
let mut res = Vec::new();
let mut previous: Vec<&Box<Token>> = Vec::new();
for token in self.content.iter() {
for t in previous.iter() {
for x in t.list_last() {
for y in token.list_first() {
res.push((x, y));
}
}
}
res.append(&mut token.list_neighbours());
if token.is_skippable() {
previous.push(token);
} else {
previous = vec![token];
}
}
return res;
}
}
impl Token {
pub fn is_skippable(&self) -> bool {
match self {
Token::Lambda => true,
Token::Symbol(_) => false,
Token::Asterisk(_) => true,
Token::Alternative(t) => t.is_skippable(),
Token::AlternativeSeparator => panic!(),
Token::Chain(t) => t.is_skippable()
}
}
pub fn list_first(&self) -> Vec<usize> {
match self {
Token::Lambda => vec![],
Token::Symbol(t) => t.list_first(),
Token::Asterisk(t) => t.list_first(),
Token::Alternative(t) => t.list_first(),
Token::AlternativeSeparator => panic!(),
Token::Chain(t) => t.list_first()
}
}
pub fn list_last(&self) -> Vec<usize> {
match self {
Token::Lambda => vec![],
Token::Symbol(t) => t.list_last(),
Token::Asterisk(t) => t.list_last(),
Token::Alternative(t) => t.list_last(),
Token::AlternativeSeparator => panic!(),
Token::Chain(t) => t.list_last()
}
}
pub fn list_neighbours(&self) -> Vec<(usize, usize)> {
match self {
Token::Lambda => vec![],
Token::Symbol(t) => t.list_neighbours(),
Token::Asterisk(t) => t.list_neighbours(),
Token::Alternative(t) => t.list_neighbours(),
Token::AlternativeSeparator => panic!(),
Token::Chain(t) => t.list_neighbours()
}
}
}
fn find_closing_parenthesis(s: &String) -> Option<usize> {
let chars: Vec<char> = s.chars().collect();
let mut counter = 0;
for (i, c) in chars.iter().enumerate() {
if *c == '(' {counter += 1;}
else if *c == ')' {counter -= 1;}
if counter == 0 {return Some(i);}
}
return None;
}
pub fn parse(pattern: &String, offset: usize) -> Result<Token, ParsingError> {
let chars: Vec<char> = pattern.chars().collect();
let mut res: Vec<Box<Token>> = Vec::new();
let mut is_alternative = false;
let mut i = 0;
while i < pattern.len() {
let c = chars[i];
match c {
'(' => {
let j = find_closing_parenthesis(&pattern[i..].to_string()).ok_or(ParsingError::ClosingParenthesis {s: pattern.clone(), pos: i})? + i;
let inner_content = parse(&pattern[i+1..j].to_string(), offset+i+1)?;
res.push(Box::new(inner_content));
i = j+1;
}
'*' => {
let token = res.pop().ok_or(ParsingError::Asterisk{s: pattern.clone(), pos: i})?;
res.push(Box::new(Token::Asterisk(Asterisk{content: token})));
i += 1;
}
')' => {
return Err(ParsingError::OpeningParenthesis {s: pattern.clone(), pos: i});
}
'|' | '+' => {
is_alternative = true;
res.push(Box::new(Token::AlternativeSeparator));
i += 1;
}
'_' => {
res.push(Box::new(Token::Lambda));
i += 1;
}
_c => {
res.push(Box::new(Token::Symbol(Symbol{position: i+offset})));
i += 1;
}
}
}
if is_alternative {
return Ok(Token::Alternative(Alternative::new(res)?));
} else {
return Ok(Token::Chain(Chain{content: res}));
}
}
mod test {
use super::*;
#[test]
fn test_closing_parenthesis() {
let s = "()";
assert_eq!(find_closing_parenthesis(&s.to_string()), Some(1));
}
}
|