| 40 |
|
*/ |
| 41 |
|
|
| 42 |
|
#include "selection/SelectionCompiler.hpp" |
| 43 |
+ |
#include "utils/StringUtils.hpp" |
| 44 |
|
namespace oopse { |
| 45 |
|
|
| 46 |
|
bool SelectionCompiler::compile(const std::string& filename, const std::string& script) { |
| 51 |
|
lineIndices.clear(); |
| 52 |
|
aatokenCompiled.clear(); |
| 53 |
|
|
| 54 |
< |
if (internalcompile()) { |
| 54 |
> |
if (internalCompile()) { |
| 55 |
|
return true; |
| 56 |
|
} |
| 57 |
|
|
| 58 |
|
int icharEnd; |
| 59 |
< |
if ((icharEnd = script.find('\r', ichCurrentCommand)) == std::string:npos && |
| 60 |
< |
(icharEnd = script.find('\n', ichCurrentCommand)) == std::string:npos) { |
| 59 |
> |
if ((icharEnd = script.find('\r', ichCurrentCommand)) == std::string::npos && |
| 60 |
> |
(icharEnd = script.find('\n', ichCurrentCommand)) == std::string::npos) { |
| 61 |
|
icharEnd = script.size(); |
| 62 |
|
} |
| 63 |
|
errorLine = script.substr(ichCurrentCommand, icharEnd); |
| 72 |
|
|
| 73 |
|
error = false; |
| 74 |
|
|
| 75 |
< |
std::vector<Token> lltoken; |
| 75 |
> |
//std::vector<Token> lltoken; |
| 76 |
> |
aatokenCompiled.clear(); |
| 77 |
|
std::vector<Token> ltoken; |
| 78 |
|
|
| 79 |
< |
//Token tokenCommand = null; |
| 80 |
< |
int tokCommand = Token.nada; |
| 79 |
> |
Token tokenCommand; |
| 80 |
> |
int tokCommand = Token::nada; |
| 81 |
|
|
| 82 |
|
for ( ; true; ichToken += cchToken) { |
| 83 |
|
if (lookingAtLeadingWhitespace()) |
| 84 |
|
continue; |
| 85 |
< |
if (lookingAtComment()) |
| 86 |
< |
continue; |
| 87 |
< |
boolean endOfLine = lookingAtEndOfLine(); |
| 85 |
> |
//if (lookingAtComment()) |
| 86 |
> |
// continue; |
| 87 |
> |
bool endOfLine = lookingAtEndOfLine(); |
| 88 |
|
if (endOfLine || lookingAtEndOfStatement()) { |
| 89 |
< |
if (tokCommand != Token.nada) { |
| 89 |
> |
if (tokCommand != Token::nada) { |
| 90 |
|
if (! compileCommand(ltoken)) { |
| 91 |
|
return false; |
| 92 |
|
} |
| 93 |
< |
lltoken.push_back(atokenCommand); |
| 94 |
< |
/** @todo*/ |
| 95 |
< |
int iCommand = lltoken.size(); |
| 96 |
< |
lineNumbers[iCommand] = lineCurrent; |
| 97 |
< |
lineIndices[iCommand] = (short) ichCurrentCommand; |
| 96 |
< |
ltoken.clear(); |
| 97 |
< |
tokCommand = Token.nada; |
| 93 |
> |
aatokenCompiled.push_back(atokenCommand); |
| 94 |
> |
lineNumbers.push_back(lineCurrent); |
| 95 |
> |
lineIndices.push_back(ichCurrentCommand); |
| 96 |
> |
ltoken.clear(); |
| 97 |
> |
tokCommand = Token::nada; |
| 98 |
|
} |
| 99 |
|
|
| 100 |
|
if (ichToken < cchScript) { |
| 105 |
|
break; |
| 106 |
|
} |
| 107 |
|
|
| 108 |
< |
if (tokCommand != Token.nada) { |
| 108 |
> |
if (tokCommand != Token::nada) { |
| 109 |
|
if (lookingAtString()) { |
| 110 |
|
std::string str = getUnescapedStringLiteral(); |
| 111 |
< |
ltoken.push_back(Token(Token.string, str)); |
| 111 |
> |
ltoken.push_back(Token(Token::string, str)); |
| 112 |
|
continue; |
| 113 |
|
} |
| 114 |
< |
if ((tokCommand & Token.specialstring) != 0 && |
| 115 |
< |
lookingAtSpecialString()) { |
| 116 |
< |
std::string str = script.substr(ichToken, ichToken + cchToken); |
| 117 |
< |
ltoken.push_back(Token(Token.string, str)); |
| 114 |
> |
//if ((tokCommand & Token::specialstring) != 0 && |
| 115 |
> |
// lookingAtSpecialString()) { |
| 116 |
> |
// std::string str = script.substr(ichToken, ichToken + cchToken); |
| 117 |
> |
// ltoken.push_back(Token(Token::string, str)); |
| 118 |
> |
// continue; |
| 119 |
> |
//} |
| 120 |
> |
if (lookingAtDecimal((tokCommand & Token::negnums) != 0)) { |
| 121 |
> |
float value = lexi_cast<float>(script.substr(ichToken, cchToken)); |
| 122 |
> |
std::cout << "encount an decimal: " << value << std::endl; |
| 123 |
> |
ltoken.push_back(Token(Token::decimal, boost::any(value))); |
| 124 |
|
continue; |
| 125 |
|
} |
| 126 |
< |
if (lookingAtDecimal((tokCommand & Token.negnums) != 0)) { |
| 127 |
< |
float value = lexi_cast<float>((script.substr(ichToken, ichToken + cchToken)); |
| 128 |
< |
ltoken.push_back(Token(Token.decimal, new Float(value)));/**@todo*/ |
| 126 |
> |
if (lookingAtInteger((tokCommand & Token::negnums) != 0)) { |
| 127 |
> |
|
| 128 |
> |
int val = lexi_cast<int>(script.substr(ichToken, cchToken)); |
| 129 |
> |
std::cout << "encount an integer: " << val << std::endl; |
| 130 |
> |
ltoken.push_back(Token(Token::integer, boost::any(val))); |
| 131 |
|
continue; |
| 132 |
|
} |
| 125 |
– |
if (lookingAtInteger((tokCommand & Token.negnums) != 0)) { |
| 126 |
– |
std::string intString = script.substr(ichToken, ichToken + cchToken); |
| 127 |
– |
int val = lexi_cast<int>(intString); |
| 128 |
– |
ltoken.push_back(new Token(Token.integer, val, intString));/**@todo*/ |
| 129 |
– |
continue; |
| 130 |
– |
} |
| 133 |
|
} |
| 134 |
|
|
| 135 |
|
if (lookingAtLookupToken()) { |
| 136 |
< |
std::string ident = script.subst(ichToken, ichToken + cchToken); |
| 137 |
< |
|
| 138 |
< |
/**@todo */ |
| 139 |
< |
Token token = (Token) Token.map.get(ident); |
| 140 |
< |
if (token == NULL) { |
| 141 |
< |
|
| 136 |
> |
std::string ident = script.substr(ichToken, cchToken); |
| 137 |
> |
Token token; |
| 138 |
> |
Token* pToken = TokenMap::getInstance()->getToken(ident); |
| 139 |
> |
if (pToken != NULL) { |
| 140 |
> |
token = *pToken; |
| 141 |
> |
} else { |
| 142 |
> |
token = Token(Token::identifier, ident); |
| 143 |
|
} |
| 141 |
– |
Token token(Token.identifier, ident); |
| 142 |
– |
|
| 144 |
|
|
| 145 |
|
int tok = token.tok; |
| 146 |
|
|
| 147 |
|
switch (tokCommand) { |
| 148 |
< |
case Token.nada: |
| 148 |
> |
case Token::nada: |
| 149 |
|
ichCurrentCommand = ichToken; |
| 150 |
|
//tokenCommand = token; |
| 151 |
|
tokCommand = tok; |
| 152 |
< |
if ((tokCommand & Token.command) == 0) |
| 152 |
> |
if ((tokCommand & Token::command) == 0) |
| 153 |
|
return commandExpected(); |
| 154 |
|
break; |
| 155 |
|
|
| 156 |
< |
case Token.define: |
| 156 |
> |
case Token::define: |
| 157 |
|
if (ltoken.size() == 1) { |
| 158 |
|
// we are looking at the variable name |
| 159 |
< |
if (tok != Token.identifier && |
| 160 |
< |
(tok & Token.predefinedset) != Token.predefinedset) |
| 159 |
> |
if (tok != Token::identifier && |
| 160 |
> |
(tok & Token::predefinedset) != Token::predefinedset) |
| 161 |
|
return invalidExpressionToken(ident); |
| 162 |
|
} else { |
| 163 |
|
// we are looking at the expression |
| 164 |
< |
if (tok != Token.identifier && tok != Token.set && |
| 165 |
< |
(tok & (Token.expression | Token.predefinedset)) == 0) |
| 164 |
> |
if (tok != Token::identifier && |
| 165 |
> |
(tok & (Token::expression | Token::predefinedset)) == 0) |
| 166 |
|
return invalidExpressionToken(ident); |
| 167 |
|
} |
| 168 |
|
|
| 169 |
|
break; |
| 170 |
|
|
| 171 |
< |
case Token.select: |
| 172 |
< |
if (tok != Token.identifier && (tok & Token.expression) == 0) |
| 171 |
> |
case Token::select: |
| 172 |
> |
if (tok != Token::identifier && (tok & Token::expression) == 0) |
| 173 |
|
return invalidExpressionToken(ident); |
| 174 |
|
break; |
| 175 |
|
} |
| 184 |
|
return unrecognizedToken(); |
| 185 |
|
} |
| 186 |
|
|
| 186 |
– |
aatokenCompiled.push_back(lltoken); |
| 187 |
|
return true; |
| 188 |
|
} |
| 189 |
|
|
| 236 |
|
int ichT = ichToken + 1; |
| 237 |
|
// while (ichT < cchScript && script.charAt(ichT++) != chFirst) |
| 238 |
|
char ch; |
| 239 |
< |
boolean previousCharBackslash = false; |
| 239 |
> |
bool previousCharBackslash = false; |
| 240 |
|
while (ichT < cchScript) { |
| 241 |
< |
ch = script.[ichT++]; |
| 241 |
> |
ch = script[ichT++]; |
| 242 |
|
if (ch == '"' && !previousCharBackslash) |
| 243 |
|
break; |
| 244 |
|
previousCharBackslash = ch == '\\' ? !previousCharBackslash : false; |
| 245 |
|
} |
| 246 |
|
cchToken = ichT - ichToken; |
| 247 |
+ |
|
| 248 |
+ |
|
| 249 |
+ |
std::cout << "lookingAtString: encount " << script.substr(ichToken, cchToken) << std::endl; |
| 250 |
|
return true; |
| 251 |
|
} |
| 252 |
|
|
| 253 |
|
|
| 254 |
|
std::string SelectionCompiler::getUnescapedStringLiteral() { |
| 255 |
< |
StringBuffer sb = new StringBuffer(cchToken - 2); |
| 255 |
> |
/** @todo */ |
| 256 |
> |
std::string sb(cchToken - 2, ' '); |
| 257 |
> |
|
| 258 |
|
int ichMax = ichToken + cchToken - 1; |
| 259 |
|
int ich = ichToken + 1; |
| 260 |
|
|
| 297 |
|
} |
| 298 |
|
} |
| 299 |
|
} |
| 300 |
< |
sb.append(ch); |
| 300 |
> |
sb.append(1, ch); |
| 301 |
|
} |
| 302 |
|
|
| 303 |
< |
return "" + sb; |
| 303 |
> |
return sb; |
| 304 |
|
} |
| 305 |
|
|
| 306 |
< |
static int SelectionCompiler::getHexitValue(char ch) { |
| 306 |
> |
int SelectionCompiler::getHexitValue(char ch) { |
| 307 |
|
if (ch >= '0' && ch <= '9') |
| 308 |
|
return ch - '0'; |
| 309 |
|
else if (ch >= 'a' && ch <= 'f') |
| 324 |
|
return cchToken > 0; |
| 325 |
|
} |
| 326 |
|
|
| 327 |
< |
bool SelectionCompiler::lookingAtDecimal(boolean allowNegative) { |
| 327 |
> |
bool SelectionCompiler::lookingAtDecimal(bool allowNegative) { |
| 328 |
|
if (ichToken == cchScript) { |
| 329 |
|
return false; |
| 330 |
|
} |
| 333 |
|
if (script[ichT] == '-') { |
| 334 |
|
++ichT; |
| 335 |
|
} |
| 336 |
< |
boolean digitSeen = false; |
| 336 |
> |
bool digitSeen = false; |
| 337 |
|
char ch = 'X'; |
| 338 |
|
while (ichT < cchScript && std::isdigit(ch = script[ichT])) { |
| 339 |
|
++ichT; |
| 344 |
|
return false; |
| 345 |
|
} |
| 346 |
|
|
| 347 |
< |
// to support 1.ca, let's check the character after the dot |
| 348 |
< |
// to determine if it is an alpha |
| 344 |
< |
if (ch == '.' && (ichT + 1 < cchScript) && std::isalpha(script[ichT + 1])) { |
| 347 |
> |
// to support DMPC.1, let's check the character before the dot |
| 348 |
> |
if (ch == '.' && (ichT > 0) && std::isalpha(script[ichT - 1])) { |
| 349 |
|
return false; |
| 350 |
|
} |
| 351 |
|
|
| 358 |
|
return digitSeen; |
| 359 |
|
} |
| 360 |
|
|
| 361 |
< |
bool SelectionCompiler::lookingAtInteger(boolean allowNegative) { |
| 361 |
> |
bool SelectionCompiler::lookingAtInteger(bool allowNegative) { |
| 362 |
|
if (ichToken == cchScript) { |
| 363 |
|
return false; |
| 364 |
|
} |
| 422 |
|
return false; |
| 423 |
|
} |
| 424 |
|
case '?': // include question marks in identifier for atom expressions |
| 425 |
< |
while (ichT < cchScript && (std::isalpha(ch = script[ichT]) ||std::isdigit(ch) || |
| 426 |
< |
ch == '_' || ch == '?') ||(ch == '^' && ichT > ichToken && std::isdigit(script[ichT - 1]))) { |
| 427 |
< |
// hack for insertion codes embedded in an atom expression :-( |
| 424 |
< |
// select c3^a |
| 425 |
> |
while (ichT < cchScript && !std::isspace(ch = script[ichT]) && (std::isalpha(ch) ||std::isdigit(ch) || |
| 426 |
> |
ch == '_' || ch == '?') ) { |
| 427 |
> |
|
| 428 |
|
++ichT; |
| 429 |
|
} |
| 430 |
|
break; |
| 431 |
|
} |
| 432 |
+ |
|
| 433 |
|
cchToken = ichT - ichToken; |
| 434 |
+ |
|
| 435 |
+ |
std::cout << "lookingAtLookupToken: encount " << script.substr(ichToken, cchToken) << std::endl; |
| 436 |
|
return true; |
| 437 |
|
} |
| 438 |
|
|
| 439 |
< |
bool SelectionCompiler::compileCommand(Vector ltoken) { |
| 440 |
< |
/** todo */ |
| 435 |
< |
Token tokenCommand = (Token)ltoken.firstElement(); |
| 439 |
> |
bool SelectionCompiler::compileCommand(const std::vector<Token>& ltoken) { |
| 440 |
> |
const Token& tokenCommand = ltoken[0]; |
| 441 |
|
int tokCommand = tokenCommand.tok; |
| 442 |
< |
|
| 443 |
< |
atokenCommand = new Token[ltoken.size()]; |
| 444 |
< |
ltoken.copyInto(atokenCommand); |
| 440 |
< |
if ((tokCommand & Token.expressionCommand) != 0 && !compileExpression()) { |
| 442 |
> |
|
| 443 |
> |
atokenCommand = ltoken; |
| 444 |
> |
if ((tokCommand & Token::expressionCommand) != 0 && !compileExpression()) { |
| 445 |
|
return false; |
| 446 |
|
} |
| 447 |
+ |
|
| 448 |
|
return true; |
| 449 |
|
} |
| 450 |
|
|
| 452 |
|
/** todo */ |
| 453 |
|
int i = 1; |
| 454 |
|
int tokCommand = atokenCommand[0].tok; |
| 455 |
< |
if (tokCommand == Token.define) |
| 456 |
< |
i = 2; |
| 457 |
< |
else if ((tokCommand & Token.embeddedExpression) != 0) { |
| 458 |
< |
// look for the open parenthesis |
| 459 |
< |
while (i < atokenCommand.length && |
| 460 |
< |
atokenCommand[i].tok != Token.leftparen) |
| 455 |
> |
if (tokCommand == Token::define) { |
| 456 |
> |
i = 2; |
| 457 |
> |
} else if ((tokCommand & Token::embeddedExpression) != 0) { |
| 458 |
> |
// look for the open parenthesis |
| 459 |
> |
while (i < atokenCommand.size() && |
| 460 |
> |
atokenCommand[i].tok != Token::leftparen) |
| 461 |
|
++i; |
| 462 |
|
} |
| 463 |
< |
if (i >= atokenCommand.length) |
| 464 |
< |
return true; |
| 463 |
> |
|
| 464 |
> |
if (i >= atokenCommand.size()) { |
| 465 |
> |
return true; |
| 466 |
> |
} |
| 467 |
|
return compileExpression(i); |
| 468 |
|
} |
| 469 |
|
|
| 470 |
|
|
| 471 |
< |
bool SelectionCompiler::addTokenToPostfix(Token token) { |
| 471 |
> |
bool SelectionCompiler::addTokenToPostfix(const Token& token) { |
| 472 |
|
ltokenPostfix.push_back(token); |
| 473 |
|
return true; |
| 474 |
|
} |
| 475 |
|
|
| 476 |
|
bool SelectionCompiler::compileExpression(int itoken) { |
| 477 |
< |
ltokenPostfix = new Vector(); |
| 478 |
< |
for (int i = 0; i < itoken; ++i) |
| 477 |
> |
ltokenPostfix.clear(); |
| 478 |
> |
for (int i = 0; i < itoken; ++i) { |
| 479 |
|
addTokenToPostfix(atokenCommand[i]); |
| 480 |
< |
|
| 480 |
> |
} |
| 481 |
> |
|
| 482 |
|
atokenInfix = atokenCommand; |
| 483 |
|
itokenInfix = itoken; |
| 484 |
|
|
| 485 |
< |
addTokenToPostfix(Token.tokenExpressionBegin); |
| 485 |
> |
addTokenToPostfix(Token::tokenExpressionBegin); |
| 486 |
|
if (!clauseOr()) { |
| 487 |
|
return false; |
| 488 |
|
} |
| 489 |
|
|
| 490 |
< |
addTokenToPostfix(Token.tokenExpressionEnd); |
| 491 |
< |
if (itokenInfix != atokenInfix.length) { |
| 490 |
> |
addTokenToPostfix(Token::tokenExpressionEnd); |
| 491 |
> |
if (itokenInfix != atokenInfix.size()) { |
| 492 |
|
return endOfExpressionExpected(); |
| 493 |
|
} |
| 494 |
|
|
| 497 |
|
} |
| 498 |
|
|
| 499 |
|
Token SelectionCompiler::tokenNext() { |
| 500 |
< |
if (itokenInfix == atokenInfix.length) |
| 501 |
< |
return null; |
| 502 |
< |
return atokenInfix[itokenInfix++]; |
| 500 |
> |
if (itokenInfix == atokenInfix.size()) { |
| 501 |
> |
return Token(); |
| 502 |
> |
} |
| 503 |
> |
return atokenInfix[itokenInfix++]; |
| 504 |
|
} |
| 505 |
|
|
| 506 |
< |
Object SelectionCompiler::valuePeek() { |
| 507 |
< |
if (itokenInfix == atokenInfix.length) { |
| 508 |
< |
return null; |
| 506 |
> |
boost::any SelectionCompiler::valuePeek() { |
| 507 |
> |
if (itokenInfix == atokenInfix.size()) { |
| 508 |
> |
return boost::any(); |
| 509 |
|
} else { |
| 510 |
|
return atokenInfix[itokenInfix].value; |
| 511 |
|
} |
| 512 |
|
} |
| 513 |
|
|
| 514 |
|
int SelectionCompiler::tokPeek() { |
| 515 |
< |
if (itokenInfix == atokenInfix.length) { |
| 515 |
> |
if (itokenInfix == atokenInfix.size()) { |
| 516 |
|
return 0; |
| 517 |
|
}else { |
| 518 |
|
return atokenInfix[itokenInfix].tok; |
| 524 |
|
return false; |
| 525 |
|
} |
| 526 |
|
|
| 527 |
< |
while (tokPeek() == Token.opOr) { |
| 527 |
> |
while (tokPeek() == Token::opOr) { |
| 528 |
|
Token tokenOr = tokenNext(); |
| 529 |
|
if (!clauseAnd()) { |
| 530 |
|
return false; |
| 539 |
|
return false; |
| 540 |
|
} |
| 541 |
|
|
| 542 |
< |
while (tokPeek() == Token.opAnd) { |
| 542 |
> |
while (tokPeek() == Token::opAnd) { |
| 543 |
|
Token tokenAnd = tokenNext(); |
| 544 |
|
if (!clauseNot()) { |
| 545 |
|
return false; |
| 550 |
|
} |
| 551 |
|
|
| 552 |
|
bool SelectionCompiler::clauseNot() { |
| 553 |
< |
if (tokPeek() == Token.opNot) { |
| 553 |
> |
if (tokPeek() == Token::opNot) { |
| 554 |
|
Token tokenNot = tokenNext(); |
| 555 |
|
if (!clauseNot()) { |
| 556 |
|
return false; |
| 563 |
|
bool SelectionCompiler::clausePrimitive() { |
| 564 |
|
int tok = tokPeek(); |
| 565 |
|
switch (tok) { |
| 566 |
< |
case Token.within: |
| 566 |
> |
case Token::within: |
| 567 |
|
return clauseWithin(); |
| 568 |
< |
case Token.hyphen: // selecting a negative residue spec |
| 569 |
< |
case Token.integer: |
| 570 |
< |
case Token.seqcode: |
| 571 |
< |
case Token.asterisk: |
| 572 |
< |
case Token.leftsquare: |
| 573 |
< |
case Token.identifier: |
| 574 |
< |
case Token.x: |
| 566 |
< |
case Token.y: |
| 567 |
< |
case Token.z: |
| 568 |
< |
case Token.colon: |
| 569 |
< |
return clauseResidueSpec(); |
| 568 |
> |
|
| 569 |
> |
case Token::asterisk: |
| 570 |
> |
case Token::identifier: |
| 571 |
> |
return clauseChemObjName(); |
| 572 |
> |
|
| 573 |
> |
case Token::integer : |
| 574 |
> |
return clauseIndex(); |
| 575 |
|
default: |
| 576 |
< |
if ((tok & Token.atomproperty) == Token.atomproperty) { |
| 576 |
> |
if ((tok & Token::atomproperty) == Token::atomproperty) { |
| 577 |
|
return clauseComparator(); |
| 578 |
|
} |
| 579 |
< |
if ((tok & Token.predefinedset) != Token.predefinedset) { |
| 579 |
> |
if ((tok & Token::predefinedset) != Token::predefinedset) { |
| 580 |
|
break; |
| 581 |
|
} |
| 582 |
|
// fall into the code and below and just add the token |
| 583 |
< |
case Token.all: |
| 584 |
< |
case Token.none: |
| 583 |
> |
case Token::all: |
| 584 |
> |
case Token::none: |
| 585 |
|
return addTokenToPostfix(tokenNext()); |
| 586 |
< |
case Token.leftparen: |
| 586 |
> |
case Token::leftparen: |
| 587 |
|
tokenNext(); |
| 588 |
|
if (!clauseOr()) { |
| 589 |
|
return false; |
| 590 |
|
} |
| 591 |
< |
if (tokenNext().tok != Token.rightparen) { |
| 591 |
> |
if (tokenNext().tok != Token::rightparen) { |
| 592 |
|
return rightParenthesisExpected(); |
| 593 |
|
} |
| 594 |
|
return true; |
| 599 |
|
bool SelectionCompiler::clauseComparator() { |
| 600 |
|
Token tokenAtomProperty = tokenNext(); |
| 601 |
|
Token tokenComparator = tokenNext(); |
| 602 |
< |
if ((tokenComparator.tok & Token.comparator) == 0) { |
| 602 |
> |
if ((tokenComparator.tok & Token::comparator) == 0) { |
| 603 |
|
return comparisonOperatorExpected(); |
| 604 |
|
} |
| 605 |
|
|
| 606 |
|
Token tokenValue = tokenNext(); |
| 607 |
< |
if (tokenValue.tok != Token.integer) { |
| 608 |
< |
return integerExpected(); |
| 607 |
> |
if (tokenValue.tok != Token::integer && tokenValue.tok != Token::decimal) { |
| 608 |
> |
return numberExpected(); |
| 609 |
|
} |
| 610 |
< |
int val = tokenValue.intValue; |
| 611 |
< |
// note that a comparator instruction is a complicated instruction |
| 612 |
< |
// int intValue is the tok of the property you are comparing |
| 613 |
< |
// the value against which you are comparing is stored as an Integer |
| 614 |
< |
// in the object value |
| 615 |
< |
return addTokenToPostfix(new Token(tokenComparator.tok, |
| 616 |
< |
tokenAtomProperty.tok, |
| 617 |
< |
new Integer(val))); |
| 610 |
> |
|
| 611 |
> |
float val; |
| 612 |
> |
if (tokenValue.value.type() == typeid(int)) { |
| 613 |
> |
val = boost::any_cast<int>(tokenValue.value); |
| 614 |
> |
} else if (tokenValue.value.type() == typeid(float)) { |
| 615 |
> |
val = boost::any_cast<float>(tokenValue.value); |
| 616 |
> |
} else { |
| 617 |
> |
return false; |
| 618 |
> |
} |
| 619 |
> |
|
| 620 |
> |
boost::any floatVal; |
| 621 |
> |
floatVal = val; |
| 622 |
> |
return addTokenToPostfix(Token(tokenComparator.tok, |
| 623 |
> |
tokenAtomProperty.tok, floatVal)); |
| 624 |
|
} |
| 625 |
|
|
| 626 |
|
bool SelectionCompiler::clauseWithin() { |
| 627 |
|
tokenNext(); // WITHIN |
| 628 |
< |
if (tokenNext().tok != Token.leftparen) { // ( |
| 628 |
> |
if (tokenNext().tok != Token::leftparen) { // ( |
| 629 |
|
return leftParenthesisExpected(); |
| 630 |
|
} |
| 631 |
|
|
| 632 |
< |
Object distance; |
| 632 |
> |
boost::any distance; |
| 633 |
|
Token tokenDistance = tokenNext(); // distance |
| 634 |
|
switch(tokenDistance.tok) { |
| 635 |
< |
case Token.integer: |
| 636 |
< |
distance = new Float((tokenDistance.intValue * 4) / 1000f); |
| 626 |
< |
break; |
| 627 |
< |
case Token.decimal: |
| 635 |
> |
case Token::integer: |
| 636 |
> |
case Token::decimal: |
| 637 |
|
distance = tokenDistance.value; |
| 638 |
|
break; |
| 639 |
|
default: |
| 640 |
|
return numberOrKeywordExpected(); |
| 641 |
|
} |
| 642 |
|
|
| 643 |
< |
if (tokenNext().tok != Token.opOr) { // , |
| 643 |
> |
if (tokenNext().tok != Token::opOr) { // , |
| 644 |
|
return commaExpected(); |
| 645 |
|
} |
| 646 |
|
|
| 648 |
|
return false; |
| 649 |
|
} |
| 650 |
|
|
| 651 |
< |
if (tokenNext().tok != Token.rightparen) { // )T |
| 651 |
> |
if (tokenNext().tok != Token::rightparen) { // )T |
| 652 |
|
return rightParenthesisExpected(); |
| 653 |
|
} |
| 654 |
|
|
| 655 |
< |
return addTokenToPostfix(new Token(Token.within, distance)); |
| 655 |
> |
return addTokenToPostfix(Token(Token::within, distance)); |
| 656 |
|
} |
| 657 |
|
|
| 658 |
< |
bool SelectionCompiler:: clauseChemObject() { |
| 659 |
< |
} |
| 658 |
> |
bool SelectionCompiler::clauseChemObjName() { |
| 659 |
> |
std::string chemObjName; |
| 660 |
> |
int tok = tokPeek(); |
| 661 |
> |
if (!clauseName(chemObjName)){ |
| 662 |
> |
return false; |
| 663 |
> |
} |
| 664 |
|
|
| 652 |
– |
bool SelectionCompiler:: clauseMolecule() { |
| 653 |
– |
} |
| 665 |
|
|
| 666 |
< |
bool SelectionCompiler:: clauseMolName() { |
| 667 |
< |
} |
| 666 |
> |
tok = tokPeek(); |
| 667 |
> |
//allow two dot at most |
| 668 |
> |
if (tok == Token::dot) { |
| 669 |
> |
tokenNext(); |
| 670 |
> |
chemObjName += "."; |
| 671 |
> |
if (!clauseName(chemObjName)) { |
| 672 |
> |
return false; |
| 673 |
> |
} |
| 674 |
> |
tok = tokPeek(); |
| 675 |
> |
if (tok == Token::dot) { |
| 676 |
> |
tokenNext(); |
| 677 |
> |
chemObjName += "."; |
| 678 |
|
|
| 679 |
< |
bool SelectionCompiler:: clauseMolIndex() { |
| 680 |
< |
} |
| 679 |
> |
if (!clauseName(chemObjName)) { |
| 680 |
> |
return false; |
| 681 |
> |
} |
| 682 |
> |
} |
| 683 |
> |
} |
| 684 |
|
|
| 685 |
< |
bool SelectionCompiler:: clauseName() { |
| 685 |
> |
return addTokenToPostfix(Token(Token::name, chemObjName)); |
| 686 |
|
} |
| 687 |
|
|
| 688 |
< |
bool SelectionCompiler:: clauseIndex() { |
| 665 |
< |
} |
| 688 |
> |
bool SelectionCompiler:: clauseName(std::string& name) { |
| 689 |
|
|
| 690 |
< |
bool SelectionCompiler:: clauseStuntDoubleName() { |
| 690 |
> |
int tok = tokPeek(); |
| 691 |
> |
|
| 692 |
> |
if (tok == Token::asterisk || tok == Token::identifier || tok == Token::integer) { |
| 693 |
> |
|
| 694 |
> |
Token token = tokenNext(); |
| 695 |
> |
if (token.value.type() == typeid(std::string)) { |
| 696 |
> |
name += boost::any_cast<std::string>(token.value); |
| 697 |
> |
} else if (token.value.type() == typeid(int)){ |
| 698 |
> |
int intVal = boost::any_cast<int>(token.value); |
| 699 |
> |
char buffer[255]; |
| 700 |
> |
sprintf(buffer,"%d", intVal); |
| 701 |
> |
name += buffer; /** @todo */ |
| 702 |
> |
//name += toString<int>(intVal); |
| 703 |
> |
} |
| 704 |
> |
while(true){ |
| 705 |
> |
tok = tokPeek(); |
| 706 |
> |
switch (tok) { |
| 707 |
> |
case Token::asterisk : |
| 708 |
> |
name += "*"; |
| 709 |
> |
tokenNext(); |
| 710 |
> |
break; |
| 711 |
> |
case Token::identifier : |
| 712 |
> |
name += boost::any_cast<std::string>(tokenNext().value); |
| 713 |
> |
break; |
| 714 |
> |
case Token::integer : |
| 715 |
> |
name += toString(boost::any_cast<int>(tokenNext().value)); |
| 716 |
> |
break; |
| 717 |
> |
case Token::dot : |
| 718 |
> |
return true; |
| 719 |
> |
default : |
| 720 |
> |
return true; |
| 721 |
> |
} |
| 722 |
> |
} |
| 723 |
> |
|
| 724 |
> |
}else { |
| 725 |
> |
return false; |
| 726 |
> |
} |
| 727 |
> |
|
| 728 |
|
} |
| 729 |
|
|
| 730 |
< |
bool SelectionCompiler:: clauseStuntDoubleIndex() { |
| 730 |
> |
bool SelectionCompiler::clauseIndex(){ |
| 731 |
> |
Token token = tokenNext(); |
| 732 |
> |
if (token.tok == Token::integer) { |
| 733 |
> |
int index = boost::any_cast<int>(token.value); |
| 734 |
> |
int tok = tokPeek(); |
| 735 |
> |
std::cout << "Token::to is " << Token::to << ", tok = " << tok << std::endl; |
| 736 |
> |
if (tok == Token::to) { |
| 737 |
> |
tokenNext(); |
| 738 |
> |
tok = tokPeek(); |
| 739 |
> |
if (tok != Token::integer) { |
| 740 |
> |
return numberExpected(); |
| 741 |
> |
} |
| 742 |
> |
|
| 743 |
> |
boost::any intVal = tokenNext().value; |
| 744 |
> |
int first = index; |
| 745 |
> |
if (intVal.type() != typeid(int)){ |
| 746 |
> |
return false; |
| 747 |
> |
} |
| 748 |
> |
int second = boost::any_cast<int>(intVal); |
| 749 |
> |
|
| 750 |
> |
return addTokenToPostfix(Token(Token::index, boost::any(std::make_pair(first, second)))); |
| 751 |
> |
|
| 752 |
> |
}else { |
| 753 |
> |
return addTokenToPostfix(Token(Token::index, boost::any(index))); |
| 754 |
> |
} |
| 755 |
> |
} else { |
| 756 |
> |
return numberExpected(); |
| 757 |
> |
} |
| 758 |
|
} |
| 759 |
|
|
| 760 |
|
} |