-
Notifications
You must be signed in to change notification settings - Fork 2
/
L1GtLogicParser.cpp
1675 lines (1203 loc) · 47.7 KB
/
L1GtLogicParser.cpp
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
/**
* This is just a copy and paste from L1GtLogicParser!
*
*/
/**
* \class L1GtLogicParser
*
*
* Description: see header file.
*
* Implementation:
* <TODO: enter implementation details>
*
* \author: Vasile Mihai Ghete - HEPHY Vienna
*
* $Date: 2011/09/06 14:36:35 $
* $Revision: 1.4 $
*
*/
// this class header
#include "L1GtLogicParser.h"
// system include files
#include <stack>
#include <iostream>
#include <sstream>
#include <boost/algorithm/string.hpp>
// user include files
//#include "FWCore/Utilities/interface/EDMException.h"
//#include "FWCore/MessageLogger/interface/MessageLogger.h"
// forward declarations
// constructor(s)
// default constructor
L1GtLogicParser::L1GtLogicParser() {
// empty, default C++ initialization for string and vector are enough
}
// from the RPN vector and the operand token vector
// no checks for consistency, empty logical and numerical expressions
// requires special care when used
L1GtLogicParser::L1GtLogicParser(const RpnVector& rpnVec,
const std::vector<OperandToken>& opTokenVector)
{
m_rpnVector = rpnVec;
m_operandTokenVector = opTokenVector;
}
// from a constant logical expression
// numerical expression will be empty
L1GtLogicParser::L1GtLogicParser(const std::string& logicalExpressionVal)
{
// checks also for syntactic correctness of the logical expression
if ( !setLogicalExpression(logicalExpressionVal) ) {
// error(s) in logical expression - printed in the relevant place
std::cerr << "@ FailModule: "
<< "\nError in parsing the logical expression = " << logicalExpressionVal
<< std::endl;
}
}
// from a non-constant logical expression - add/remove spaces if needed
// numerical expression will be empty
L1GtLogicParser::L1GtLogicParser(std::string& logicalExpressionVal)
{
// checks also for syntactic correctness of the logical expression
// add spaces around brackets
std::string logicalExpressionBS;
addBracketSpaces(logicalExpressionVal, logicalExpressionBS);
// trim leading or trailing spaces
boost::trim(logicalExpressionBS);
if ( !buildRpnVector(logicalExpressionBS) ) {
// error(s) in logical expression
std::cerr << "@ FailModule: "
<< "\nError in parsing the logical expression = " << logicalExpressionVal
<< std::endl;
}
//LogDebug("L1GtLogicParser")
// << "\nInitial logical expression = '" << logicalExpressionVal << "'"
// << "\nFinal logical expression = '" << logicalExpressionBS << "'\n"
// << std::endl;
logicalExpressionVal = logicalExpressionBS;
m_logicalExpression = logicalExpressionVal;
// build operand token vector
// dummy tokenNumber; tokenResult false
buildOperandTokenVector();
}
// from a logical and a numerical expression
L1GtLogicParser::L1GtLogicParser(const std::string logicalExpressionVal,
const std::string numericalExpressionVal) {
// checks also for correctness
if ( !setLogicalExpression(logicalExpressionVal) ) {
// error(s) in logical expression - printed in the relevant place
std::cerr << "@ FailModule: "
<< "\nError in parsing the logical expression = " << logicalExpressionVal
<< std::endl;
}
if ( !setNumericalExpression(numericalExpressionVal) ) {
// error(s) in numerical expression - printed in the relevant place
std::cerr << "@ FailModule: "
<< "\nError in parsing the numerical expression = " << numericalExpressionVal
<< std::endl;
}
}
// from a logical and a numerical expression
// no checks for correctness - use it only after the correctness was tested
L1GtLogicParser::L1GtLogicParser(const std::string& logicalExpressionVal,
const std::string& numericalExpressionVal, bool dummy) {
clearRpnVector();
if ( !buildRpnVector(logicalExpressionVal) ) {
std::cerr << "@ FailModule: "
<< "\nError in building RPN vector for the logical expression = "
<< logicalExpressionVal
<< std::endl;
}
m_logicalExpression = logicalExpressionVal;
m_numericalExpression = numericalExpressionVal;
}
// destructor
L1GtLogicParser::~L1GtLogicParser()
{
// empty now
}
// public methods
// check a logical expression for correctness - add/remove spaces if needed
bool L1GtLogicParser::checkLogicalExpression(std::string& logicalExpressionVal) {
// add spaces around brackets
std::string logicalExpressionBS;
addBracketSpaces(logicalExpressionVal, logicalExpressionBS);
// trim leading or trailing spaces
boost::trim(logicalExpressionBS);
clearRpnVector();
if ( !buildRpnVector(logicalExpressionBS) ) {
return false;
}
std::cout << "L1GtLogicParser"
<< "\nL1GtLogicParser::checkLogicalExpression - "
<< "\nInitial logical expression = '" << logicalExpressionVal << "'"
<< "\nFinal logical expression = '" << logicalExpressionBS << "'\n"
<< std::endl;
logicalExpressionVal = logicalExpressionBS;
return true;
}
/**
* buildRpnVector Build the postfix notation.
*
* @param expression The expression to be parsed.
*
* @return "true" if everything was parsed. "false" if an error occured.
*
*/
bool L1GtLogicParser::buildRpnVector(const std::string& logicalExpressionVal)
{
//LogDebug("L1GtLogicParser")
//<< "\nL1GtLogicParser::buildRpnVector - "
//<< "\nLogical expression = '" << logicalExpressionVal << "'\n"
//<< std::endl;
OperationType actualOperation = OP_NULL;
OperationType lastOperation = OP_NULL;
// token as string and as TokenRPN, stack to form the postfix notation
std::string tokenString;
TokenRPN rpnToken;
std::stack<TokenRPN> operatorStack;
static const std::string whitespaces=" \r\v\n\t";
// clear possible old rpn vector
clearRpnVector();
// stringstream to separate all tokens
std::istringstream exprStringStream(logicalExpressionVal);
while ( !exprStringStream.eof() ) {
exprStringStream >> std::skipws >> std::ws >> tokenString;
// skip the end
if (tokenString.find_first_not_of(whitespaces) == std::string::npos ||
tokenString.length() == 0) {
//LogTrace("L1GtLogicParser")
//<< " Break for token string = " << tokenString
//<< std::endl;
break;
}
actualOperation = getOperation(tokenString, lastOperation, rpnToken);
//LogTrace("L1GtLogicParser")
//<< " Token string = '" << tokenString << "'"
//<< "\tActual Operation = " << actualOperation
//<< std::endl;
// http://en.wikipedia.org/wiki/Postfix_notation#Converting_from_infix_notation
switch (actualOperation) {
case OP_OPERAND: {
// operands get pushed to the postfix notation immediately
m_rpnVector.push_back(rpnToken);
}
break;
case OP_INVALID: {
int errorPosition = exprStringStream.tellg();
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing: "
<< "\n " << exprStringStream.str().substr(0,errorPosition)
<< "\n " << exprStringStream.str().substr(errorPosition)
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
break;
case OP_NOT: {
operatorStack.push(rpnToken);
// there are no operators with higher precedence
}
break;
case OP_AND: {
// first pop operators with higher precedence (NOT)
while (!operatorStack.empty() && operatorStack.top().operation == OP_NOT) {
m_rpnVector.push_back(operatorStack.top());
operatorStack.pop();
}
operatorStack.push(rpnToken);
}
break;
case OP_OR: {
// pop operators with higher precedence (AND, NOT)
while (!operatorStack.empty() &&
(operatorStack.top().operation == OP_NOT ||
operatorStack.top().operation == OP_AND) ) {
m_rpnVector.push_back(operatorStack.top());
operatorStack.pop();
}
// push operator on stack
operatorStack.push(rpnToken);
}
break;
case OP_OPENBRACKET: {
// just push it on stack
operatorStack.push(rpnToken);
}
break;
case OP_CLOSEBRACKET: {
// check if the operatorStack is empty
if (operatorStack.empty()) {
int errorPosition = exprStringStream.tellg();
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing - misplaced ')':"
<< "\n " << exprStringStream.str().substr(0,errorPosition)
<< "\n " << exprStringStream.str().substr(errorPosition)
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
// pop stack until a left parenthesis is found
do {
if (operatorStack.top().operation != OP_OPENBRACKET) {
m_rpnVector.push_back(operatorStack.top()); // pop
operatorStack.pop();
}
if (operatorStack.empty()) { // the operatorStack must not be empty
int errorPosition = exprStringStream.tellg();
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing - misplaced ')':"
<< "\n " << exprStringStream.str().substr(0,errorPosition)
<< "\n " << exprStringStream.str().substr(errorPosition)
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
} while (operatorStack.top().operation != OP_OPENBRACKET);
operatorStack.pop(); // pop the open bracket.
}
break;
default: {
// empty
}
break;
}
lastOperation = actualOperation; // for the next turn
}
// pop the rest of the operator stack
while (!operatorStack.empty()) {
if (operatorStack.top().operation == OP_OPENBRACKET) {
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing - missing ')':"
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
m_rpnVector.push_back(operatorStack.top());
operatorStack.pop();
}
// count all operations and check if the result is 1
int counter = 0;
for(RpnVector::iterator it = m_rpnVector.begin(); it != m_rpnVector.end(); it++) {
if (it->operation == OP_OPERAND)
counter++;
if (it->operation == OP_OR || it->operation == OP_AND)
counter--;
if (counter < 1) {
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing - too many operators"
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
}
if (counter > 1) {
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << logicalExpressionVal << "'"
<< "\n Syntax error during parsing - too many operands"
<< "\n Returned empty RPN vector and result false."
<< std::endl;
// clear the rpn vector before returning
clearRpnVector();
return false;
}
return true;
}
// clear rpn vector
void L1GtLogicParser::clearRpnVector()
{
m_rpnVector.clear();
}
// build from the RPN vector the operand token vector
// dummy tokenNumber and token result
void L1GtLogicParser::buildOperandTokenVector()
{
//LogTrace("L1GtLogicParser")
//<< "\nL1GtLogicParser::buildOperandTokenVector - "
//<< std::endl;
// reserve memory
size_t rpnVectorSize = m_rpnVector.size();
m_operandTokenVector.reserve(rpnVectorSize);
int opNumber = 0;
for(RpnVector::const_iterator it = m_rpnVector.begin(); it != m_rpnVector.end(); it++) {
//LogTrace("L1GtLogicParser")
//<< "\nit->operation = " << it->operation
//<< "\nit->operand = '" << it->operand << "'\n"
//<< std::endl;
switch (it->operation) {
case OP_OPERAND: {
OperandToken opToken;
opToken.tokenName = it->operand;
opToken.tokenNumber = opNumber;
opToken.tokenResult = false;
m_operandTokenVector.push_back(opToken);
}
break;
case OP_NOT: {
// do nothing
}
break;
case OP_OR: {
// do nothing
}
break;
case OP_AND: {
// do nothing
}
break;
default: {
// should not arrive here
}
break;
}
opNumber++;
}
}
// return the position index of the operand in the logical expression
int L1GtLogicParser::operandIndex(const std::string& operandNameVal) const
{
int result = -1;
OperationType actualOperation = OP_NULL;
OperationType lastOperation = OP_NULL;
std::string tokenString;
TokenRPN rpnToken; // token to be used by getOperation
// stringstream to separate all tokens
std::istringstream exprStringStream(m_logicalExpression);
// temporary index for usage in the loop
int tmpIndex = -1;
while (!exprStringStream.eof()) {
exprStringStream >> tokenString;
//LogTrace("L1GtLogicParser")
//<< "Token string = " << tokenString
//<< std::endl;
actualOperation = getOperation(tokenString, lastOperation, rpnToken);
if (actualOperation == OP_INVALID) {
// it should never be invalid
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << m_logicalExpression << "'"
<< "\n Invalid operation/operand " << operandNameVal
<< "\n Returned index is by default out of range (-1)."
<< std::endl;
return result;
}
if (actualOperation != OP_OPERAND) {
// do nothing
} else {
tmpIndex++;
if (rpnToken.operand == operandNameVal) {
result = tmpIndex;
//LogDebug("L1GtLogicParser")
//<< "\nL1GtLogicParser::operandIndex - "
//<< "\nLogical expression = '" << m_logicalExpression << "'"
//<< "\nIndex of operand " << operandNameVal << " = " << result
//<< std::endl;
return result;
}
}
lastOperation = actualOperation;
}
//
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << m_logicalExpression << "'"
<< "\n Operand " << operandNameVal << " not found in the logical expression"
<< "\n Returned index is by default out of range (-1)."
<< std::endl;
return result;
}
// return the name of the (iOperand)th operand in the logical expression
std::string L1GtLogicParser::operandName(const int iOperand) const
{
std::string result;
OperationType actualOperation = OP_NULL;
OperationType lastOperation = OP_NULL;
std::string tokenString;
TokenRPN rpnToken; // token to be used by getOperation
// stringstream to separate all tokens
std::istringstream exprStringStream(m_logicalExpression);
// temporary index for usage in the loop
int tmpIndex = -1;
while (!exprStringStream.eof()) {
exprStringStream >> tokenString;
//LogTrace("L1GtLogicParser")
//<< "Token string = " << tokenString
//<< std::endl;
actualOperation = getOperation(tokenString, lastOperation, rpnToken);
if (actualOperation == OP_INVALID) {
// it should never be invalid
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << m_logicalExpression << "'"
<< "\n Invalid operation/operand at position " << iOperand
<< "\n Returned empty name by default."
<< std::endl;
return result;
}
if (actualOperation != OP_OPERAND) {
// do nothing
} else {
tmpIndex++;
if (tmpIndex == iOperand) {
result = rpnToken.operand;
//LogDebug("L1GtLogicParser")
//<< "\nL1GtLogicParser::operandName - "
//<< "\nLogical expression = '" << m_logicalExpression << "'"
//<< "\nOperand with index " << iOperand << " = " << result
//<< std::endl;
return result;
}
}
lastOperation = actualOperation;
}
//
std::cout << "# L1GtLogicParser: "
<< "\nLogical expression = '" << m_logicalExpression << "'"
<< "\n No operand found at position " << iOperand
<< "\n Returned empty name by default."
<< std::endl;
return result;
}
// return the result for an operand with name operandNameVal
// in the logical expression using the operand token vector
bool L1GtLogicParser::operandResult(const std::string& operandNameVal) const {
for (size_t i = 0; i < m_operandTokenVector.size(); ++i) {
if ((m_operandTokenVector[i]).tokenName == operandNameVal) {
return (m_operandTokenVector[i]).tokenResult;
}
}
// return false - should not arrive here
std::cout << "# L1GtLogicParser: "
<< "\n Operand " << operandNameVal << " not found in the operand token vector"
<< "\n Returned false by default."
<< std::endl;
return false;
}
// return the result for an operand with tokenNumberVal
// using the operand token vector
bool L1GtLogicParser::operandResult(const int tokenNumberVal) const {
for (size_t i = 0; i < m_operandTokenVector.size(); ++i) {
if ((m_operandTokenVector[i]).tokenNumber == tokenNumberVal) {
return (m_operandTokenVector[i]).tokenResult;
}
}
// return false - should not arrive here
std::cout << "# L1GtLogicParser: "
<< "\n No operand with token number " << tokenNumberVal
<< " found in the operand token vector"
<< "\n Returned false by default."
<< std::endl;
return false;
}
// return the result for the logical expression
// require a proper operand token vector
bool L1GtLogicParser::expressionResult() const
{
//LogTrace("L1GtLogicParser")
//<< "\nL1GtLogicParser::expressionResult - "
//<< std::endl;
// return false if there is no RPN vector built
if ( m_rpnVector.empty() ) {
/*
std::cout << "# L1GtLogicParser: "
<< "\n No built RPN vector exists."
<< "\n Returned false by default."
<< std::endl;
*/
return false;
}
// stack containing temporary results
std::stack<bool> resultStack;
bool b1, b2;
for(RpnVector::const_iterator it = m_rpnVector.begin(); it != m_rpnVector.end(); it++) {
//LogTrace("L1GtLogicParser")
//<< "\nit->operation = " << it->operation
//<< "\nit->operand = '" << it->operand << "'\n"
//<< std::endl;
switch (it->operation) {
case OP_OPERAND: {
resultStack.push(operandResult(it->operand));
}
break;
case OP_NOT: {
b1 = resultStack.top();
resultStack.pop(); // pop the top
resultStack.push(!b1); // and push the result
}
break;
case OP_OR: {
b1 = resultStack.top();
resultStack.pop();
b2 = resultStack.top();
resultStack.pop();
resultStack.push(b1 || b2);
}
break;
case OP_AND: {
b1 = resultStack.top();
resultStack.pop();
b2 = resultStack.top();
resultStack.pop();
resultStack.push(b1 && b2);
}
break;
default: {
// should not arrive here
}
break;
}
}
// get the result in the top of the stack
//LogTrace("L1GtLogicParser")
//<< "\nL1GtLogicParser::expressionResult - "
//<< "\nResult = " << resultStack.top()
//<< std::endl;
return resultStack.top();
}
// return the result for an operand with name operandNameVal
// in the logical expression using a numerical expression
bool L1GtLogicParser::operandResultNumExp(const std::string& operandNameVal) const
{
bool result = false;
// get the position index of the operand in the logical string
const int iOperand = operandIndex(operandNameVal);
result = operandResult(iOperand);
return result;
}
// return the result for an operand with index iOperand
// in the logical expression using a numerical expression
bool L1GtLogicParser::operandResultNumExp(const int iOperand) const
{
bool result = false;
// parse the numerical expression
OperationType actualOperation = OP_NULL;
OperationType lastOperation = OP_NULL;
std::string tokenString;
TokenRPN rpnToken; // token to be used by getOperation
// stringstream to separate all tokens
std::istringstream exprStringStream(m_numericalExpression);
// temporary index for usage in the loop
int tmpIndex = -1;
while (!exprStringStream.eof()) {
exprStringStream >> tokenString;
//LogTrace("L1GtLogicParser")
//<< "Token string = " << tokenString
//<< std::endl;
actualOperation = getOperation(tokenString, lastOperation, rpnToken);
if (actualOperation == OP_INVALID) {
// it should never be invalid
std::cout << "# L1GtLogicParser: "
<< "\nNumerical expression = '" << m_numericalExpression << "'"
<< "\n Invalid operation/operand at position " << iOperand
<< "\n Returned false by default."
<< std::endl;
result = false;
return result;
}
if (actualOperation != OP_OPERAND) {
// do nothing
} else {
tmpIndex++;
if (tmpIndex == iOperand) {
if (rpnToken.operand == "1") {
result = true;
} else {
if (rpnToken.operand == "0") {
result = false;
} else {
// something went wrong - break
//
std::cout << "# L1GtLogicParser: "
<< "\nNumerical expression = '" << m_numericalExpression << "'"
<< "\n Invalid result for operand at position " << iOperand
<< ": " << rpnToken.operand
<< "\n It must be 0 or 1"
<< "\n Returned false by default."
<< std::endl;
result = false;
return result;
}
}
//LogDebug("L1GtLogicParser")
//<< "\nL1GtLogicParser::operandResult - "
//<< "\nNumerical expression = '" << m_numericalExpression << "'"
//<< "\nResult for operand with index " << iOperand
//<< " = " << result << "'\n"
//<< std::endl;
return result;
}
}
lastOperation = actualOperation;
}
//
std::cout << "# L1GtLogicParser: "
<< "\nNumerical expression = '" << m_numericalExpression << "'"
<< "\n No operand found at position " << iOperand
<< "\n Returned false by default."
<< std::endl;
return result;
}
// build from the RPN vector the operand token vector
// using a numerical expression
void L1GtLogicParser::buildOperandTokenVectorNumExp()
{
//LogTrace("L1GtLogicParser")
//<< "\nL1GtLogicParser::buildOperandTokenVector - "
//<< std::endl;
// reserve memory
size_t rpnVectorSize = m_rpnVector.size();
m_operandTokenVector.reserve(rpnVectorSize);
int opNumber = 0;
for(RpnVector::const_iterator it = m_rpnVector.begin(); it != m_rpnVector.end(); it++) {
//LogTrace("L1GtLogicParser")
//<< "\nit->operation = " << it->operation
//<< "\nit->operand = '" << it->operand << "'\n"
//<< std::endl;
switch (it->operation) {
case OP_OPERAND: {
OperandToken opToken;
opToken.tokenName = it->operand;
opToken.tokenNumber = opNumber;
opToken.tokenResult = operandResultNumExp(it->operand);
m_operandTokenVector.push_back(opToken);
}
break;
case OP_NOT: {
// do nothing
}
break;
case OP_OR: {
// do nothing
}
break;
case OP_AND: {
// do nothing
}
break;
default: {
// should not arrive here
}
break;
}
opNumber++;
}
}
// return the result for the logical expression
bool L1GtLogicParser::expressionResultNumExp() const
{
//LogTrace("L1GtLogicParser")
//<< "\nL1GtLogicParser::expressionResult - "
//<< std::endl;
// return false if there is no expression
if ( m_rpnVector.empty() ) {
/*
std::cout << "# L1GtLogicParser: "
<< "\n No built RPN vector exists."
<< "\n Returned false by default."
<< std::endl;
*/
return false;
}
// stack containing temporary results
std::stack<bool> resultStack;
bool b1, b2;
for(RpnVector::const_iterator it = m_rpnVector.begin(); it != m_rpnVector.end(); it++) {
//LogTrace("L1GtLogicParser")
//<< "\nit->operation = " << it->operation
//<< "\nit->operand = '" << it->operand << "'\n"
//<< std::endl;
switch (it->operation) {
case OP_OPERAND: {
resultStack.push(operandResultNumExp(it->operand));
}
break;
case OP_NOT: {
b1 = resultStack.top();
resultStack.pop(); // pop the top
resultStack.push(!b1); // and push the result
}
break;
case OP_OR: {