/usr/include/lexertl/rules.hpp is in libpuma-dev 1:2.1-2+b1.
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 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 | // rules.hpp
// Copyright (c) 2005-2015 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_RULES_HPP
#define LEXERTL_RULES_HPP
#include "compile_assert.hpp"
#include <deque>
#include "enums.hpp"
#include <locale>
#include <map>
#include "narrow.hpp"
#include "parser/tokeniser/re_tokeniser.hpp"
#include "runtime_error.hpp"
#include <set>
#include "size_t.hpp"
#include <sstream>
#include <string>
#include <vector>
namespace lexertl
{
template<typename r_ch_type, typename ch_type,
typename id_ty = std::size_t>
class basic_rules
{
public:
typedef std::vector<bool> bool_vector;
typedef std::deque<bool_vector> bool_vector_deque;
typedef ch_type char_type;
typedef r_ch_type rules_char_type;
typedef id_ty id_type;
typedef std::vector<id_type> id_vector;
typedef std::deque<id_vector> id_vector_deque;
typedef detail::basic_re_tokeniser_state<rules_char_type, id_type> re_state;
typedef std::basic_string<rules_char_type> string;
typedef basic_string_token<char_type> string_token;
typedef std::deque<string> string_deque;
typedef std::set<string> string_set;
typedef std::pair<string, string> string_pair;
typedef std::map<string, id_type> string_id_type_map;
typedef std::pair<string, id_type> string_id_type_pair;
typedef detail::basic_re_token<rules_char_type, char_type> token;
typedef std::deque<token> token_deque;
typedef std::deque<token_deque> token_deque_deque;
typedef std::deque<token_deque_deque> token_deque_deque_deque;
typedef std::map<string, token_deque> macro_map;
typedef std::pair<string, token_deque> macro_pair;
typedef detail::basic_re_tokeniser
<rules_char_type, char_type, id_type> tokeniser;
// If you get a compile error here you have
// failed to define an unsigned id type.
compile_assert <(~static_cast<id_type>(0) > 0)> _valid_id_type;
basic_rules(const std::size_t flags_ = dot_not_newline) :
_valid_id_type(),
_statemap(),
_macro_map(),
_regexes(),
_features(),
_ids(),
_user_ids(),
_next_dfas(),
_pushes(),
_pops(),
_flags(flags_),
_locale(),
_lexer_state_names()
{
push_state(initial());
}
void clear()
{
_statemap.clear();
_macro_map.clear();
_regexes.clear();
_features.clear();
_ids.clear();
_user_ids.clear();
_next_dfas.clear();
_pushes.clear();
_pops.clear();
_flags = dot_not_newline;
_locale = std::locale();
_lexer_state_names.clear();
push_state(initial());
}
void clear(const id_type dfa_)
{
if (_regexes.size() > dfa_)
{
_regexes[dfa_].clear();
_features[dfa_] = 0;
_ids[dfa_].clear();
_user_ids[dfa_].clear();
_next_dfas[dfa_].clear();
_pushes[dfa_].clear();
_pops[dfa_].clear();
}
}
void flags(const std::size_t flags_)
{
_flags = flags_;
}
std::size_t flags() const
{
return _flags;
}
static id_type skip()
{
return ~static_cast<id_type>(1);
}
id_type eoi() const
{
return 0;
}
static id_type npos()
{
return ~static_cast<id_type>(0);
}
std::locale imbue(const std::locale &locale_)
{
std::locale loc_ = _locale;
_locale = locale_;
return loc_;
}
const std::locale &locale() const
{
return _locale;
}
const rules_char_type *state(const id_type index_) const
{
if (index_ == 0)
{
return initial();
}
else
{
const id_type i_ = index_ - 1;
if (_lexer_state_names.size() > i_)
{
return _lexer_state_names[i_].c_str();
}
else
{
return 0;
}
}
}
id_type state(const rules_char_type *name_) const
{
typename string_id_type_map::const_iterator iter_ =
_statemap.find(name_);
if (iter_ == _statemap.end())
{
return npos();
}
else
{
return iter_->second;
}
}
id_type push_state(const rules_char_type *name_)
{
validate(name_);
if (_statemap.insert(string_id_type_pair(name_,
_statemap.size())).second)
{
_regexes.push_back(token_deque_deque());
_features.push_back(0);
_ids.push_back(id_vector());
_user_ids.push_back(id_vector());
_next_dfas.push_back(id_vector());
_pushes.push_back(id_vector());
_pops.push_back(bool_vector());
if (string(name_) != initial())
{
_lexer_state_names.push_back(name_);
}
}
else
{
return _statemap.find(name_)->second;
}
if (_next_dfas.size() > npos())
{
// Overflow
throw runtime_error("The data type you have chosen cannot hold "
"this many lexer start states.");
}
// Initial is not stored, so no need to - 1.
return static_cast<id_type>(_lexer_state_names.size());
}
void insert_macro(const rules_char_type *name_,
const rules_char_type *regex_)
{
insert_macro(name_, string(regex_));
}
void insert_macro(const rules_char_type *name_,
const rules_char_type *regex_start_,
const rules_char_type *regex_end_)
{
insert_macro(name_, string(regex_start_, regex_end_));
}
void insert_macro(const rules_char_type *name_, const string ®ex_)
{
validate(name_);
typename macro_map::const_iterator iter_ = _macro_map.find(name_);
if (iter_ == _macro_map.end())
{
std::pair<typename macro_map::iterator, bool> pair_ =
_macro_map.insert(macro_pair(name_, token_deque()));
tokenise(regex_, pair_.first->second, npos(), name_);
}
else
{
std::ostringstream ss_;
ss_ << "Attempt to redefine MACRO '";
narrow(name_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
}
// Add rule to INITIAL
void push(const rules_char_type *regex_, const id_type id_,
const id_type user_id_ = npos())
{
push(string(regex_), id_, user_id_);
}
void push(const rules_char_type *regex_start_,
const rules_char_type *regex_end_,
const id_type id_, const id_type user_id_ = npos())
{
push(string(regex_start_, regex_end_), id_, user_id_);
}
void push(const string ®ex_, const id_type id_,
const id_type user_id_ = npos())
{
check_for_invalid_id(id_);
_regexes.front().push_back(token_deque());
tokenise(regex_, _regexes.front().back(), id_, 0);
if (regex_[0] == '^')
{
_features.front() |= bol_bit;
}
if (regex_.size() > 0 && regex_[regex_.size() - 1] == '$')
{
_features.front() |= eol_bit;
}
if (id_ == skip())
{
_features.front() |= skip_bit;
}
else if (id_ == eoi())
{
_features.front() |= again_bit;
}
_ids.front().push_back(id_);
_user_ids.front().push_back(user_id_);
_next_dfas.front().push_back(0);
_pushes.front().push_back(npos());
_pops.front().push_back(false);
}
// Add rule with no id
void push(const rules_char_type *curr_dfa_,
const rules_char_type *regex_, const rules_char_type *new_dfa_)
{
push(curr_dfa_, string(regex_), new_dfa_);
}
void push(const rules_char_type *curr_dfa_,
const rules_char_type *regex_start_, const rules_char_type *regex_end_,
const rules_char_type *new_dfa_)
{
push(curr_dfa_, string(regex_start_, regex_end_), new_dfa_);
}
void push(const rules_char_type *curr_dfa_, const string ®ex_,
const rules_char_type *new_dfa_)
{
push(curr_dfa_, regex_, eoi(), new_dfa_, false);
}
// Add rule with id
void push(const rules_char_type *curr_dfa_,
const rules_char_type *regex_, const id_type id_,
const rules_char_type *new_dfa_, const id_type user_id_ = npos())
{
push(curr_dfa_, string(regex_), id_, new_dfa_, user_id_);
}
void push(const rules_char_type *curr_dfa_,
const rules_char_type *regex_start_,
const rules_char_type *regex_end_, const id_type id_,
const rules_char_type *new_dfa_, const id_type user_id_ = npos())
{
push(curr_dfa_, string(regex_start_, regex_end_),
id_, new_dfa_, user_id_);
}
void push(const rules_char_type *curr_dfa_, const string ®ex_,
const id_type id_, const rules_char_type *new_dfa_,
const id_type user_id_ = npos())
{
push(curr_dfa_, regex_, id_, new_dfa_, true, user_id_);
}
void reverse()
{
typename token_deque_deque_deque::iterator state_iter_ =
_regexes.begin();
typename token_deque_deque_deque::iterator state_end_ =
_regexes.end();
typename macro_map::iterator macro_iter_ = _macro_map.begin();
typename macro_map::iterator macro_end_ = _macro_map.end();
for (; state_iter_ != state_end_; ++state_iter_)
{
typename token_deque_deque::iterator regex_iter_ =
state_iter_->begin();
typename token_deque_deque::iterator regex_end_ =
state_iter_->end();
for (; regex_iter_ != regex_end_; ++regex_iter_)
{
reverse(*regex_iter_);
}
}
for (; macro_iter_ != macro_end_; ++macro_iter_)
{
reverse(macro_iter_->second);
}
}
const string_id_type_map &statemap() const
{
return _statemap;
}
const token_deque_deque_deque ®exes() const
{
return _regexes;
}
const id_vector &features() const
{
return _features;
}
const id_vector_deque &ids() const
{
return _ids;
}
const id_vector_deque &user_ids() const
{
return _user_ids;
}
const id_vector_deque &next_dfas() const
{
return _next_dfas;
}
const id_vector_deque &pushes() const
{
return _pushes;
}
const bool_vector_deque &pops() const
{
return _pops;
}
bool empty() const
{
typename token_deque_deque_deque::const_iterator iter_ =
_regexes.begin();
typename token_deque_deque_deque::const_iterator end_ =
_regexes.end();
bool empty_ = true;
for (; iter_ != end_; ++iter_)
{
if (!iter_->empty())
{
empty_ = false;
break;
}
}
return empty_;
}
static const rules_char_type *initial()
{
static const rules_char_type initial_ [] =
{ 'I', 'N', 'I', 'T', 'I', 'A', 'L', 0 };
return initial_;
}
static const rules_char_type *dot()
{
static const rules_char_type dot_ [] = { '.', 0 };
return dot_;
}
static const rules_char_type *all_states()
{
static const rules_char_type star_ [] = { '*', 0 };
return star_;
}
private:
string_id_type_map _statemap;
macro_map _macro_map;
token_deque_deque_deque _regexes;
id_vector _features;
id_vector_deque _ids;
id_vector_deque _user_ids;
id_vector_deque _next_dfas;
id_vector_deque _pushes;
bool_vector_deque _pops;
std::size_t _flags;
std::locale _locale;
string_deque _lexer_state_names;
void tokenise(const string ®ex_, token_deque &tokens_,
const id_type id_, const rules_char_type *name_)
{
re_state state_(regex_.c_str(), regex_.c_str() + regex_.size(), id_,
_flags, _locale, name_);
string macro_;
rules_char_type diff_ = 0;
tokens_.push_back(token());
do
{
token *lhs_ = &tokens_.back();
token rhs_;
tokeniser::next(*lhs_, state_, rhs_);
if (rhs_._type != detail::DIFF &&
lhs_->precedence(rhs_._type) == ' ')
{
std::ostringstream ss_;
ss_ << "A syntax error occurred: '" <<
lhs_->precedence_string() <<
"' against '" << rhs_.precedence_string() <<
"' preceding index " << state_.index() <<
" in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << '.';
throw runtime_error(ss_.str());
}
if (rhs_._type == detail::MACRO)
{
typename macro_map::const_iterator iter_ =
_macro_map.find(rhs_._extra);
macro_ = rhs_._extra;
if (iter_ == _macro_map.end())
{
const rules_char_type *name_ = rhs_._extra.c_str();
std::ostringstream ss_;
ss_ << "Unknown MACRO name '";
narrow(name_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
else
{
const bool multiple_ = iter_->second.size() > 3;
if (diff_)
{
if (multiple_)
{
std::ostringstream ss_;
ss_ << "Single CHARSET must follow {-} or {+} at "
"index " << state_.index() - 1 << " in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << '.';
throw runtime_error(ss_.str());
}
else
{
rhs_ = iter_->second[1];
}
}
// Any macro with more than one charset (or quantifiers)
// requires bracketing.
if (multiple_)
{
token open_;
open_._type = detail::OPENPAREN;
open_._str.insert('(');
tokens_.push_back(open_);
}
// Don't need to store token if it is diff.
if (!diff_)
{
// Don't insert BEGIN or END tokens
tokens_.insert(tokens_.end(), iter_->second.begin() + 1,
iter_->second.end() - 1);
lhs_ = &tokens_.back();
}
if (multiple_)
{
token close_;
close_._type = detail::CLOSEPAREN;
close_._str.insert(')');
tokens_.push_back(close_);
}
}
}
else if (rhs_._type == detail::DIFF)
{
if (!macro_.empty())
{
typename macro_map::const_iterator iter_ =
_macro_map.find(macro_);
if (iter_->second.size() > 3)
{
std::ostringstream ss_;
ss_ << "Single CHARSET must precede {-} or {+} at "
"index " << state_.index() - 1 << " in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << '.';
throw runtime_error(ss_.str());
}
}
diff_ = rhs_._extra[0];
macro_.clear();
continue;
}
else if (!diff_)
{
tokens_.push_back(rhs_);
lhs_ = &tokens_.back();
macro_.clear();
}
// diff_ may have been set by previous conditional.
if (diff_)
{
if (rhs_._type != detail::CHARSET)
{
std::ostringstream ss_;
ss_ << "CHARSET must follow {-} or {+} at index " <<
state_.index() - 1 << " in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << '.';
throw runtime_error(ss_.str());
}
switch (diff_)
{
case '-':
lhs_->_str.remove(rhs_._str);
if (lhs_->_str.empty())
{
std::ostringstream ss_;
ss_ << "Empty charset created by {-} at index " <<
state_.index() - 1 << " in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << '.';
throw runtime_error(ss_.str());
}
break;
case '+':
lhs_->_str.insert(rhs_._str);
break;
}
diff_ = 0;
}
} while (tokens_.back()._type != detail::END);
if (tokens_.size() == 2)
{
std::ostringstream ss_;
ss_ << "Empty regex in ";
if (name_ != 0)
{
ss_ << "macro ";
narrow(name_, ss_);
}
else
{
ss_ << "rule id " << state_._id;
}
ss_ << " is not allowed.";
throw runtime_error(ss_.str());
}
}
void reverse(token_deque &deque_)
{
token_deque new_deque_(deque_.size(), token());
typename token_deque::reverse_iterator iter_ =
deque_.rbegin();
typename token_deque::reverse_iterator end_ =
deque_.rend();
typename token_deque::iterator dest_ = new_deque_.begin();
std::stack<typename token_deque::reverse_iterator> stack_;
for (; iter_ != end_; ++iter_, ++dest_)
{
switch (iter_->_type)
{
case detail::BEGIN:
iter_->swap(*dest_);
dest_->_type = detail::END;
break;
case detail::BOL:
iter_->swap(*dest_);
dest_->_type = detail::EOL;
break;
case detail::EOL:
iter_->swap(*dest_);
dest_->_type = detail::BOL;
break;
case detail::OPENPAREN:
iter_->swap(*dest_);
dest_->_type = detail::CLOSEPAREN;
if (stack_.top() != end_)
{
++dest_;
dest_->swap(*stack_.top());
}
stack_.pop();
break;
case detail::CLOSEPAREN:
iter_->swap(*dest_);
dest_->_type = detail::OPENPAREN;
stack_.push(end_);
break;
case detail::OPT:
case detail::AOPT:
case detail::ZEROORMORE:
case detail::AZEROORMORE:
case detail::ONEORMORE:
case detail::AONEORMORE:
case detail::REPEATN:
case detail::AREPEATN:
{
typename token_deque::reverse_iterator temp_ = iter_ + 1;
if (temp_->_type == detail::CLOSEPAREN)
{
stack_.push(iter_);
++iter_;
iter_->swap(*dest_);
dest_->_type = detail::OPENPAREN;
}
else
{
dest_->swap(*temp_);
++dest_;
dest_->swap(*iter_);
++iter_;
}
break;
}
case detail::END:
iter_->swap(*dest_);
dest_->_type = detail::BEGIN;
break;
default:
// detail::OR
// detail::CHARSET
iter_->swap(*dest_);
break;
}
}
new_deque_.swap(deque_);
}
void push(const rules_char_type *curr_dfa_, const string ®ex_,
const id_type id_, const rules_char_type *new_dfa_,
const bool check_, const id_type user_id_ = npos())
{
const bool star_ = *curr_dfa_ == '*' && *(curr_dfa_ + 1) == 0;
const bool dot_ = *new_dfa_ == '.' && *(new_dfa_ + 1) == 0;
const bool push_ = *new_dfa_ == '>';
const rules_char_type *push_dfa_ = 0;
const bool pop_ = *new_dfa_ == '<';
if (push_ || pop_)
{
++new_dfa_;
}
if (check_)
{
check_for_invalid_id(id_);
}
if (!dot_ && !pop_)
{
const rules_char_type *temp_ = new_dfa_;
while (*temp_ && *temp_ != ':')
{
++temp_;
}
if (*temp_) push_dfa_ = temp_ + 1;
validate(new_dfa_, *temp_ ? temp_ : 0);
if (push_dfa_)
{
validate(push_dfa_);
}
}
// npos means pop here
id_type new_dfa_id_ = npos();
id_type push_dfa_id_ = npos();
typename string_id_type_map::const_iterator iter_;
typename string_id_type_map::const_iterator end_ = _statemap.end();
id_vector next_dfas_;
if (!dot_ && !pop_)
{
if (push_dfa_)
{
iter_ = _statemap.find(string(new_dfa_, push_dfa_ - 1));
}
else
{
iter_ = _statemap.find(new_dfa_);
}
if (iter_ == end_)
{
std::ostringstream ss_;
ss_ << "Unknown state name '";
narrow(new_dfa_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
new_dfa_id_ = iter_->second;
if (push_dfa_)
{
iter_ = _statemap.find(push_dfa_);
if (iter_ == end_)
{
std::ostringstream ss_;
ss_ << "Unknown state name '";
narrow(push_dfa_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
push_dfa_id_ = iter_->second;
}
}
if (star_)
{
const std::size_t size_ = _statemap.size();
for (id_type i_ = 0; i_ < size_; ++i_)
{
next_dfas_.push_back(i_);
}
}
else
{
const rules_char_type *start_ = curr_dfa_;
string next_dfa_;
while (*curr_dfa_)
{
while (*curr_dfa_ && *curr_dfa_ != ',')
{
++curr_dfa_;
}
next_dfa_.assign(start_, curr_dfa_);
if (*curr_dfa_)
{
++curr_dfa_;
start_ = curr_dfa_;
}
validate(next_dfa_.c_str());
iter_ = _statemap.find(next_dfa_.c_str());
if (iter_ == end_)
{
std::ostringstream ss_;
ss_ << "Unknown state name '";
curr_dfa_ = next_dfa_.c_str();
narrow(curr_dfa_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
next_dfas_.push_back(iter_->second);
}
}
for (std::size_t i_ = 0, size_ = next_dfas_.size();
i_ < size_; ++i_)
{
const id_type curr_ = next_dfas_[i_];
_regexes[curr_].push_back(token_deque());
tokenise(regex_, _regexes[curr_].back(), id_, 0);
if (regex_[0] == '^')
{
_features[curr_] |= bol_bit;
}
if (regex_[regex_.size() - 1] == '$')
{
_features[curr_] |= eol_bit;
}
if (id_ == skip())
{
_features[curr_] |= skip_bit;
}
else if (id_ == eoi())
{
_features[curr_] |= again_bit;
}
if (push_ || pop_)
{
_features[curr_] |= recursive_bit;
}
_ids[curr_].push_back(id_);
_user_ids[curr_].push_back(user_id_);
_next_dfas[curr_].push_back(dot_ ? curr_ : new_dfa_id_);
_pushes[curr_].push_back(push_ ? (push_dfa_ ?
push_dfa_id_ : curr_) : npos());
_pops[curr_].push_back(pop_);
}
}
void validate(const rules_char_type *name_,
const rules_char_type *end_ = 0) const
{
const rules_char_type *start_ = name_;
if (*name_ != '_' && !(*name_ >= 'A' && *name_ <= 'Z') &&
!(*name_ >= 'a' && *name_ <= 'z'))
{
std::ostringstream ss_;
ss_ << "Invalid name '";
narrow(name_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
else if (*name_)
{
++name_;
}
while (*name_ && name_ != end_)
{
if (*name_ != '_' && *name_ != '-' &&
!(*name_ >= 'A' && *name_ <= 'Z') &&
!(*name_ >= 'a' && *name_ <= 'z') &&
!(*name_ >= '0' && *name_ <= '9'))
{
std::ostringstream ss_;
ss_ << "Invalid name '";
name_ = start_;
narrow(name_, ss_);
ss_ << "'.";
throw runtime_error(ss_.str());
}
++name_;
}
}
void check_for_invalid_id(const id_type id_) const
{
if (id_ == eoi())
{
throw runtime_error("Cannot resuse the id for eoi.");
}
if (id_ == npos())
{
throw runtime_error("The id npos is reserved for the "
"UNKNOWN token.");
}
}
};
typedef basic_rules<char, char> rules;
typedef basic_rules<wchar_t, wchar_t> wrules;
}
#endif
|