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
|
// Generated by Flexc++ V2.17.01 on Wed, 16 Apr 2025 11:56:10 +0200
#include <iostream>
#include <fstream>
#include <sstream>
#include <stdexcept>
#include <filesystem>
// $insert class_ih
#include "scanner.ih"
// s_ranges_: use (unsigned) characters as index to obtain
// that character's range-number.
// The range for EOF is defined in a constant in the
// class header file
size_t const ScannerBase::s_ranges_[] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 8, 9,10,11,12,13,14,14,
14,14,14,14,14,14,14,14,15,15,15,16,17,17,17,18,18,18,18,18,18,18,18,18,18,
18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,19,19,19,19,20,21,22,22,22,
22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,23,23,
23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,
23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,
23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,
23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,
23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,
23,23,23,23,23,23,
};
// $insert startcondinfo
// s_dfa_ contains the rows of *all* DFAs ordered by start state. The
// enum class StartCondition_is defined in the baseclass header.
// StartCondition_::INITIAL is always 0. Each entry defines the row to
// transit to if the column's character range was sensed. Row numbers are
// relative to the used DFA, and d_dfaBase_ is set to the first row of
// the subset to use. The row's final two values are respectively the
// rule that may be matched at this state, and the rule's FINAL flag. If
// the final value equals FINAL (= 1) then, if there's no continuation,
// the rule is matched. If the BOL flag (8) is also set (so FINAL + BOL (=
// 9) is set) then the rule only matches when d_atBOL is also true.
int const ScannerBase::s_dfa_[][27] =
{
// INITIAL
{ 1, 2, 3, 1, 2, 1, 4, 1, 3, 1, 3, 3, 1, 3, 5, 1, 3, 1, 6, 1,
6, 1, 6, 1,-1, -1, 0}, // 0
{-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
-1,-1,-1,-1,-1, 5, -1}, // 1
{-1, 2,-1,-1, 2,-1, 7,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
-1,-1,-1,-1,-1, 1, 0}, // 2
{-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
-1,-1,-1,-1,-1, 4, -1}, // 3
{ 7, 7,-1, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7,-1, 5, 0}, // 4
{-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, 5,-1,-1,-1,-1,-1,
-1,-1,-1,-1,-1, 2, -1}, // 5
{-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, 6,-1,-1, 6,-1,-1,-1, 6,-1,
6,-1, 6,-1,-1, 3, -1}, // 6
{ 7, 7,-1, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7,-1, -1, 0}, // 7
};
int const (*ScannerBase::s_dfaBase_[])[27] =
{
s_dfa_ + 0,
};
size_t ScannerBase::s_istreamNr = 0;
// $insert inputImplementation
ScannerBase::Input::Input()
:
d_in(0),
d_lineNr(1)
{}
ScannerBase::Input::Input(std::istream *iStream, size_t lineNr)
:
d_in(iStream),
d_lineNr(lineNr)
{}
size_t ScannerBase::Input::get()
{
switch (size_t ch = next()) // get the next input char
{
case '\n':
++d_lineNr;
[[fallthrough]];
default:
return ch;
}
}
size_t ScannerBase::Input::next()
{
size_t ch;
if (d_deque.empty()) // deque empty: next char fm d_in
{
if (d_in == 0)
return AT_EOF;
ch = d_in->get();
return *d_in ? ch : static_cast<size_t>(AT_EOF);
}
ch = d_deque.front();
d_deque.pop_front();
return ch;
}
void ScannerBase::Input::reRead(size_t ch)
{
if (ch < 0x100)
{
if (ch == '\n')
--d_lineNr;
d_deque.push_front(ch);
}
}
void ScannerBase::Input::reRead(std::string const &str, size_t fm)
{
for (size_t idx = str.size(); idx-- > fm; )
reRead(str[idx]);
}
ScannerBase::ScannerBase(std::istream &in, std::ostream &out, bool keepCwd)
:
d_out(new std::ostream(out.rdbuf())),
// $insert interactiveInit
d_in(0),
d_dfaBase_(s_dfa_)
{
if (keepCwd)
d_cwd = std::filesystem::current_path().string();
p_pushStream(s_istream, new std::istream(in.rdbuf()));
}
void ScannerBase::switchStream_(std::istream &in, size_t lineNr)
{
d_input->close();
d_streamStack.back().input = { new std::istream(in.rdbuf()), lineNr };
}
ScannerBase::ScannerBase(std::string const &infilename, std::string const &outfilename, bool keepCwd)
:
d_out(outfilename == "-" ? new std::ostream(std::cout.rdbuf()) :
outfilename == "" ? new std::ostream(std::cerr.rdbuf()) :
new std::ofstream(outfilename)),
d_dfaBase_(s_dfa_)
{
if (keepCwd)
d_cwd = std::filesystem::current_path().string();
p_pushStream(infilename, { new std::ifstream(infilename) });
toCwd();
}
void ScannerBase::switchStreams(std::istream &in, std::ostream &out)
{
switchStream_(in, 1);
switchOstream(out);
}
void ScannerBase::switchIstream(std::string const &infilename)
{
d_input->close();
d_filename = infilename;
std::ifstream *ptr = new std::ifstream(infilename);
d_streamStack.back() =
StreamStruct{ chgWorkingDir(d_filename), { ptr } };
d_atBOL = true;
}
void ScannerBase::switchStreams(std::string const &infilename,
std::string const &outfilename)
{
switchOstream(outfilename);
switchIstream(infilename);
}
void ScannerBase::pushStream(std::istream &istr)
{
p_pushStream("(istream)", new std::istream(istr.rdbuf())); //streamPtr);
}
void ScannerBase::pushStream(std::string const &name)
{
std::istream *streamPtr = new std::ifstream(name);
if (!*streamPtr)
{
delete streamPtr;
throw std::runtime_error("Cannot read " + name);
}
p_pushStream(name, streamPtr);
}
void ScannerBase::toCwd() const
{
using namespace std;
using namespace filesystem;
if (d_cwd.empty())
return;
error_code ec;
current_path(d_cwd, ec);
}
// static
std::string ScannerBase::chgWorkingDir(std::string const &name) // any name
{
using namespace std;
using namespace filesystem;
if (name == s_istream) // used with istreams
return name;
// a filename: get its
auto path = absolute(name); // full pathname
error_code ec;
current_path(path.parent_path(), ec);
return path.string(); // return the pathname
}
void ScannerBase::p_pushStream(std::string const &name, std::istream *streamPtr)
{
if (d_streamStack.size() == s_maxSizeofStreamStack_)
{
delete streamPtr;
throw std::length_error("Max stream stack size exceeded");
}
d_filename = name;
d_streamStack.push_back(
StreamStruct{chgWorkingDir(d_filename), { streamPtr } }
);
d_input = &d_streamStack.back().input;
d_atBOL = true;
}
void ScannerBase::switchOstream(std::ostream &out)
{
*d_out << std::flush;
d_out.reset(new std::ostream(out.rdbuf()));
}
// $insert debugFunctions
void ScannerBase::setDebug(bool onOff)
{}
bool ScannerBase::debug() const
{
return false;
}
void ScannerBase::redo(size_t nChars)
{
size_t from = nChars >= length() ? 0 : length() - nChars;
d_input->reRead(d_matched, from);
d_matched.resize(from);
}
void ScannerBase::switchOstream(std::string const &outfilename)
{
*d_out << std::flush;
d_out.reset(
outfilename == "-" ? new std::ostream(std::cout.rdbuf()) :
outfilename == "" ? new std::ostream(std::cerr.rdbuf()) :
new std::ofstream(outfilename));
}
bool ScannerBase::popStream()
{
using namespace std::filesystem;
d_input->close();
if (d_streamStack.size() <= 1)
return false;
d_streamStack.pop_back();
d_filename = path{ chgWorkingDir(d_streamStack.back().pushedName)
}.filename().string();
d_input = &d_streamStack.back().input;
return true;
}
// See the manual's section `Run-time operations' section for an explanation
// of this member.
ScannerBase::ActionType_ ScannerBase::actionType_(size_t range)
{
d_nextState = d_dfaBase_[d_state][range];
if (d_nextState != -1) // transition is possible
return ActionType_::CONTINUE;
if (knownFinalState()) // FINAL state reached
return ActionType_::MATCH;
if (d_matched.size())
return ActionType_::ECHO_FIRST; // no match, echo the 1st char
return range != s_rangeOfEOF_ ?
ActionType_::ECHO_CH
:
ActionType_::RETURN;
}
void ScannerBase::accept(size_t nChars) // old name: less
{
if (nChars < d_matched.size())
{
d_input->reRead(d_matched, nChars);
d_matched.resize(nChars);
}
}
void ScannerBase::setMatchedSize(size_t length)
{
d_input->reRead(d_matched, length); // reread the tail section
d_matched.resize(length); // return what's left
}
// At this point a rule has been matched. The next character is not part of
// the matched rule and is sent back to the input. The final match length
// is determined, the index of the matched rule is determined, and then
// d_atBOL is updated. Finally the rule's index is returned.
// The numbers behind the finalPtr assignments are explained in the
// manual's `Run-time operations' section.
size_t ScannerBase::matched_(size_t ch)
{
d_input->reRead(ch);
FinalData *finalPtr;
if (not d_atBOL) // not at BOL
finalPtr = &d_final.std; // then use the std rule (3, 4)
// at BOL
else if (not available(d_final.std.rule)) // only a BOL rule avail.
finalPtr = &d_final.bol; // use the BOL rule (6)
else if (not available(d_final.bol.rule)) // only a std rule is avail.
finalPtr = &d_final.std; // use the std rule (7)
else if ( // Both are available (8)
d_final.bol.length != // check lengths of matched texts
d_final.std.length // unequal lengths, use the rule
) // having the longer match length
finalPtr =
d_final.bol.length > d_final.std.length ?
&d_final.bol
:
&d_final.std;
else // lengths are equal: use 1st rule
finalPtr =
d_final.bol.rule < d_final.std.rule ?
&d_final.bol
:
&d_final.std;
setMatchedSize(finalPtr->length);
// size check needed since g++-15
d_atBOL = d_matched.size() > 0 and d_matched.back() == '\n';
return finalPtr->rule;
}
size_t ScannerBase::getRange_(int ch) // using int to prevent casts
{
return ch == AT_EOF ? as<size_t>(s_rangeOfEOF_) : s_ranges_[ch];
}
// At this point d_nextState contains the next state and continuation is
// possible. The just read char. is appended to d_match
void ScannerBase::continue_(int ch)
{
d_state = d_nextState;
if (ch != AT_EOF)
d_matched += ch;
}
void ScannerBase::echoCh_(size_t ch)
{
*d_out << as<char>(ch);
d_atBOL = ch == '\n';
}
// At this point there is no continuation. The last character is
// pushed back into the input stream as well as all but the first char. in
// the buffer. The first char. in the buffer is echoed to stderr.
// If there isn't any 1st char yet then the current char doesn't fit any
// rules and that char is then echoed
void ScannerBase::echoFirst_(size_t ch)
{
d_input->reRead(ch);
d_input->reRead(d_matched, 1);
echoCh_(d_matched[0]);
}
// Update the rules associated with the current state, do this separately
// for BOL and std rules.
// If a rule was set, update the rule index and the current d_matched
// length.
void ScannerBase::updateFinals_()
{
size_t len = d_matched.size();
int const *rf = d_dfaBase_[d_state] + s_finIdx_;
if (rf[0] != -1) // update to the latest std rule
{
d_final.std = FinalData { as<size_t>(rf[0]), len };
}
if (rf[1] != -1) // update to the latest bol rule
{
d_final.bol = FinalData { as<size_t>(rf[1]), len };
}
}
void ScannerBase::reset_()
{
d_final = Final{
FinalData{s_unavailable, 0},
FinalData {s_unavailable, 0}
};
d_state = 0;
d_return = true;
if (!d_more)
d_matched.clear();
d_more = false;
}
int Scanner::executeAction_(size_t ruleIdx)
try
{
switch (ruleIdx)
{
// $insert actions
case 1:
{
#line 13 "lexer"
return Tokens::WS;
}
break;
case 2:
{
#line 15 "lexer"
return Tokens::NR;
}
break;
case 3:
{
#line 17 "lexer"
return Tokens::ID;
}
break;
case 4:
{
#line 19 "lexer"
return matched()[0];
}
break;
case 5:
{
#line 21 "lexer"
return Tokens::CHAR;
}
break;
}
noReturn_();
return 0;
}
catch (Leave_ value)
{
return static_cast<int>(value);
}
int Scanner::lex_()
{
reset_();
preCode();
while (true)
{
size_t ch = get_(); // fetch next char
size_t range = getRange_(ch); // determine the range
updateFinals_(); // update the state's Final info
switch (actionType_(range)) // determine the action
{
case ActionType_::CONTINUE:
continue_(ch);
continue;
case ActionType_::MATCH:
{
d_token_ = executeAction_(matched_(ch));
if (return_())
{
print();
toCwd();
return d_token_;
}
break;
}
case ActionType_::ECHO_FIRST:
echoFirst_(ch);
break;
case ActionType_::ECHO_CH:
echoCh_(ch);
break;
case ActionType_::RETURN:
if (!popStream())
{
postCode(PostEnum_::END);
toCwd();
return 0;
}
postCode(PostEnum_::POP);
continue;
} // switch
postCode(PostEnum_::WIP);
reset_();
preCode();
} // while
}
void ScannerBase::print_() const
{
}
|