/usr/include/lexertl/parser/tokeniser/re_tokeniser.hpp is in libpuma-dev 1:1.1+svn20120529-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 | // tokeniser.hpp
// Copyright (c) 2005-2011 Ben Hanson (http://www.benhanson.net/)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file licence_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef LEXERTL_RE_TOKENISER_HPP
#define LEXERTL_RE_TOKENISER_HPP
// memcpy()
#include <cstring>
#include "re_token.hpp"
#include "../../runtime_error.hpp"
#include "../../size_t.hpp"
#include <sstream>
#include "../../string_token.hpp"
#include "re_tokeniser_helper.hpp"
namespace lexertl
{
namespace detail
{
template<typename rules_char_type, typename char_type, typename id_type>
class basic_re_tokeniser
{
public:
typedef basic_re_token<rules_char_type, char_type> re_token;
typedef basic_re_tokeniser_helper<rules_char_type, char_type, id_type>
tokeniser_helper;
typedef typename tokeniser_helper::char_state char_state;
typedef typename tokeniser_helper::state state;
typedef basic_string_token<char_type> string_token;
static void next (state &state_, re_token *token_)
{
rules_char_type ch_ = 0;
bool eos_ = state_.next (ch_);
token_->clear ();
while (!eos_ && ch_ == '"')
{
state_._in_string ^= 1;
eos_ = state_.next (ch_);
}
if (eos_)
{
if (state_._in_string)
{
throw runtime_error ("Unexpected end of regex "
"(missing '\"').");
}
if (state_._paren_count)
{
throw runtime_error ("Unexpected end of regex "
"(missing ')').");
}
token_->_type = END;
}
else
{
if (ch_ == '\\')
{
// Even if we are in a string, respect escape sequences...
token_->_type = CHARSET;
escape (state_, token_->_str);
}
else if (state_._in_string)
{
// All other meta characters lose their special meaning
// inside a string.
token_->_type = CHARSET;
token_->_str.insert (typename string_token::range (ch_, ch_));
}
else
{
// Not an escape sequence and not inside a string, so
// check for meta characters.
switch (ch_)
{
case '(':
token_->_type = OPENPAREN;
++state_._paren_count;
read_options (state_);
break;
case ')':
--state_._paren_count;
if (state_._paren_count < 0)
{
std::ostringstream ss_;
ss_ << "Number of open parenthesis < 0 at index " <<
state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
token_->_type = CLOSEPAREN;
if (!state_._flags_stack.empty ())
{
state_._flags = state_._flags_stack.top ();
state_._flags_stack.pop ();
}
break;
case '?':
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AOPT;
state_.increment ();
}
else
{
token_->_type = OPT;
}
break;
case '*':
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AZEROORMORE;
state_.increment ();
}
else
{
token_->_type = ZEROORMORE;
}
break;
case '+':
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AONEORMORE;
state_.increment ();
}
else
{
token_->_type = ONEORMORE;
}
break;
case '{':
open_curly (state_, token_);
break;
case '|':
token_->_type = OR;
break;
case '^':
if (!state_._macro && state_._curr - 1 == state_._start)
{
token_->_type = BOL;
}
else
{
token_->_type = CHARSET;
token_->_str.insert (typename string_token::range
(ch_, ch_));
}
break;
case '$':
if (!state_._macro && state_._curr == state_._end)
{
token_->_type = EOL;
}
else
{
token_->_type = CHARSET;
token_->_str.insert (typename string_token::range
(ch_, ch_));
}
break;
case '.':
{
token_->_type = CHARSET;
if (state_._flags & dot_not_newline)
{
token_->_str.insert (typename string_token::range
('\n', '\n'));
}
token_->_str.negate ();
break;
}
case '[':
{
token_->_type = CHARSET;
tokeniser_helper::charset (state_, token_->_str);
break;
}
case '/':
throw runtime_error ("Lookahead ('/') is "
"not supported yet.");
break;
default:
token_->_type = CHARSET;
if ((state_._flags & icase) &&
(std::isupper (ch_, state_._locale) ||
std::islower (ch_, state_._locale)))
{
char_type upper_ = std::toupper (ch_, state_._locale);
char_type lower_ = std::tolower (ch_, state_._locale);
token_->_str.insert (typename string_token::range
(upper_, upper_));
token_->_str.insert (typename string_token::range
(lower_, lower_));
}
else
{
token_->_str.insert (typename string_token::range
(ch_, ch_));
}
break;
}
}
}
}
private:
static void read_options (state &state_)
{
if (!state_.eos () && *state_._curr == '?')
{
rules_char_type ch_ = 0;
bool eos_ = false;
bool negate_ = false;
state_.increment ();
eos_ = state_.next (ch_);
state_._flags_stack.push (state_._flags);
while (!eos_ && ch_ != ':')
{
switch (ch_)
{
case '-':
negate_ ^= 1;
break;
case 'i':
if (negate_)
{
state_._flags = state_._flags & ~icase;
}
else
{
state_._flags = state_._flags | icase;
}
negate_ = false;
break;
case 's':
if (negate_)
{
state_._flags = state_._flags | dot_not_newline;
}
else
{
state_._flags = state_._flags & ~dot_not_newline;
}
negate_ = false;
break;
default:
{
std::ostringstream ss_;
ss_ << "Unknown option at index " <<
state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
}
eos_ = state_.next (ch_);
}
// End of string handler will handle early termination
}
else if (!state_._flags_stack.empty ())
{
state_._flags_stack.push (state_._flags);
}
}
static void escape (state &state_, string_token &token_)
{
char_type ch_ = 0;
std::size_t str_len_ = 0;
const char *str_ = tokeniser_helper::escape_sequence (state_,
ch_, str_len_);
if (str_)
{
char_state state2_ (str_ + 1, str_ + str_len_, state_._flags,
state_._locale, false);
tokeniser_helper::charset (state2_, token_);
}
else
{
token_.insert (typename string_token::range (ch_, ch_));
}
}
static void open_curly (state &state_, re_token *token_)
{
if (state_.eos ())
{
throw runtime_error ("Unexpected end of regex "
"(missing '}').");
}
else if (*state_._curr >= '0' && *state_._curr <= '9')
{
repeat_n (state_, token_);
}
else
{
macro (state_, token_);
}
}
// SYNTAX:
// {n[,[n]]}
// SEMANTIC RULES:
// {0} - INVALID (throw exception)
// {0,} = *
// {0,0} - INVALID (throw exception)
// {0,1} = ?
// {1,} = +
// {min,max} where min == max - {min}
// {min,max} where max < min - INVALID (throw exception)
static void repeat_n (state &state_, re_token *token_)
{
rules_char_type ch_ = 0;
bool eos_ = state_.next (ch_);
std::size_t min_ = 0;
std::size_t max_ = 0;
while (!eos_ && ch_ >= '0' && ch_ <= '9')
{
min_ *= 10;
min_ += ch_ - '0';
token_->_extra += ch_;
eos_ = state_.next (ch_);
}
if (eos_)
{
throw runtime_error ("Unexpected end of regex "
"(missing '}').");
}
bool min_max_ = false;
bool repeatn_ = true;
if (ch_ == ',')
{
token_->_extra += ch_;
eos_ = state_.next (ch_);
if (eos_)
{
throw runtime_error ("Unexpected end of regex "
"(missing '}').");
}
if (ch_ == '}')
{
// Small optimisation: Check for '*' equivalency.
if (min_ == 0)
{
token_->_type = ZEROORMORE;
repeatn_ = false;
}
// Small optimisation: Check for '+' equivalency.
else if (min_ == 1)
{
token_->_type = ONEORMORE;
repeatn_ = false;
}
}
else
{
if (ch_ < '0' || ch_ > '9')
{
std::ostringstream ss_;
ss_ << "Missing '}' at index " <<
state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
min_max_ = true;
do
{
max_ *= 10;
max_ += ch_ - '0';
token_->_extra += ch_;
eos_ = state_.next (ch_);
} while (!eos_ && ch_ >= '0' && ch_ <= '9');
if (eos_)
{
throw runtime_error ("Unexpected end of regex "
"(missing '}').");
}
// Small optimisation: Check for '?' equivalency.
if (min_ == 0 && max_ == 1)
{
token_->_type = OPT;
repeatn_ = false;
}
// Small optimisation: if min == max, then min.
else if (min_ == max_)
{
token_->_extra.erase (token_->_extra.find (','));
min_max_ = false;
max_ = 0;
}
}
}
if (ch_ != '}')
{
std::ostringstream ss_;
ss_ << "Missing '}' at index " << state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
if (repeatn_)
{
// SEMANTIC VALIDATION follows:
// NOTE: {0,} has already become *
// therefore we don't check for a comma.
if (min_ == 0 && max_ == 0)
{
std::ostringstream ss_;
ss_ << "Cannot have exactly zero repeats preceding index " <<
state_.index () << '.';
throw runtime_error (ss_.str ().c_str ());
}
if (min_max_ && max_ < min_)
{
std::ostringstream ss_;
ss_ << "Max less than min preceding index " <<
state_.index () << '.';
throw runtime_error (ss_.str ().c_str ());
}
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AREPEATN;
state_.increment ();
}
else
{
token_->_type = REPEATN;
}
}
else if (token_->_type == ZEROORMORE)
{
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AZEROORMORE;
state_.increment ();
}
}
else if (token_->_type == ONEORMORE)
{
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AONEORMORE;
state_.increment ();
}
}
else if (token_->_type == OPT)
{
if (!state_.eos () && *state_._curr == '?')
{
token_->_type = AOPT;
state_.increment ();
}
}
}
static void macro (state &state_, re_token *token_)
{
rules_char_type ch_ = 0;
bool eos_ = false;
state_.next (ch_);
if (ch_ != '_' && !(ch_ >= 'A' && ch_ <= 'Z') &&
!(ch_ >= 'a' && ch_ <= 'z'))
{
std::ostringstream ss_;
ss_ << "Invalid MACRO name at index " <<
state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
do
{
token_->_extra += ch_;
eos_ = state_.next (ch_);
if (eos_)
{
throw runtime_error ("Unexpected end of regex "
"(missing '}').");
}
} while (ch_ == '_' || ch_ == '-' || (ch_ >= 'A' && ch_ <= 'Z') ||
(ch_ >= 'a' && ch_ <= 'z') || (ch_ >= '0' && ch_ <= '9'));
if (ch_ != '}')
{
std::ostringstream ss_;
ss_ << "Missing '}' at index " << state_.index () - 1 << '.';
throw runtime_error (ss_.str ().c_str ());
}
token_->_type = MACRO;
}
};
}
}
#endif
|