sqlexer.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634
  1. /*
  2. see copyright notice in squirrel.h
  3. */
  4. #include "sqpcheader.h"
  5. #include <ctype.h>
  6. #include <stdlib.h>
  7. #include <limits.h>
  8. #include "sqtable.h"
  9. #include "sqstring.h"
  10. #include "sqcompiler.h"
  11. #include "sqlexer.h"
  12. #define CUR_CHAR (_currdata)
  13. #define RETURN_TOKEN(t) { _prevtoken = _curtoken; _curtoken = t; return t;}
  14. #define IS_EOB() (CUR_CHAR <= SQUIRREL_EOB)
  15. #define NEXT() {Next();_currentcolumn++;}
  16. #define INIT_TEMP_STRING() { _longstr.resize(0);}
  17. #define APPEND_CHAR(c) { _longstr.push_back(c);}
  18. #define TERMINATE_BUFFER() {_longstr.push_back(_SC('\0'));}
  19. #define ADD_KEYWORD(key,id) tbl->NewSlot( SQString::Create(_sharedstate, _SC(#key)) ,SQInteger(id))
  20. SQLexer::SQLexer(){_keywords=0;}
  21. SQLexer::~SQLexer()
  22. {
  23. _keywords->Release();
  24. }
  25. void SQLexer::Init(SQSharedState *ss, SQLEXREADFUNC rg, SQUserPointer up,CompilerErrorFunc efunc,void *ed)
  26. {
  27. _errfunc = efunc;
  28. _errtarget = ed;
  29. _sharedstate = ss;
  30. if(_keywords) _keywords->Release();
  31. _keywords = GetKeywords();
  32. _readf = rg;
  33. _up = up;
  34. _lasttokenline = _currentline = 1;
  35. _currentcolumn = 0;
  36. _prevtoken = -1;
  37. _reached_eof = SQFalse;
  38. Next();
  39. }
  40. SQTable * SQLexer::GetKeywords()
  41. {
  42. SQTable *tbl = SQTable::Create(_sharedstate, (TK_LAST_ENUM_TOKEN - TK_FIRST_ENUM_TOKEN - 1) /*26*/);
  43. ADD_KEYWORD(while, TK_WHILE);
  44. ADD_KEYWORD(do, TK_DO);
  45. ADD_KEYWORD(if, TK_IF);
  46. ADD_KEYWORD(else, TK_ELSE);
  47. ADD_KEYWORD(break, TK_BREAK);
  48. ADD_KEYWORD(continue, TK_CONTINUE);
  49. ADD_KEYWORD(return, TK_RETURN);
  50. ADD_KEYWORD(null, TK_NULL);
  51. ADD_KEYWORD(NULL, TK_NULL);
  52. ADD_KEYWORD(function, TK_FUNCTION);
  53. ADD_KEYWORD(local, TK_LOCAL);
  54. ADD_KEYWORD(var, TK_LOCAL);
  55. ADD_KEYWORD(char_t, TK_LOCAL_CHAR_T);
  56. ADD_KEYWORD(wchar_t, TK_LOCAL_WCHAR_T);
  57. ADD_KEYWORD(bool_t, TK_LOCAL_BOOL_T);
  58. ADD_KEYWORD(table_t, TK_LOCAL_TABLE_T);
  59. ADD_KEYWORD(array_t, TK_LOCAL_ARRAY_T);
  60. ADD_KEYWORD(int8_t, TK_LOCAL_INT8_T);
  61. ADD_KEYWORD(int16_t, TK_LOCAL_INT16_T);
  62. ADD_KEYWORD(int32_t, TK_LOCAL_INT32_T);
  63. ADD_KEYWORD(int64_t, TK_LOCAL_INT64_T);
  64. ADD_KEYWORD(int_t, TK_LOCAL_INT_T);
  65. ADD_KEYWORD(uint8_t, TK_LOCAL_UINT8_T);
  66. ADD_KEYWORD(uint16_t, TK_LOCAL_UINT16_T);
  67. ADD_KEYWORD(uint32_t, TK_LOCAL_UINT32_T);
  68. ADD_KEYWORD(uint64_t, TK_LOCAL_UINT64_T);
  69. ADD_KEYWORD(uint_t, TK_LOCAL_UINT_T);
  70. ADD_KEYWORD(float_t, TK_LOCAL_FLOAT_T);
  71. ADD_KEYWORD(double_t, TK_LOCAL_DOUBLE_T);
  72. ADD_KEYWORD(long_double_t, TK_LOCAL_LONG_DOUBLE_T);
  73. ADD_KEYWORD(for, TK_FOR);
  74. ADD_KEYWORD(foreach, TK_FOREACH);
  75. ADD_KEYWORD(in, TK_IN);
  76. ADD_KEYWORD(typeof, TK_TYPEOF);
  77. ADD_KEYWORD(base, TK_BASE);
  78. ADD_KEYWORD(delete, TK_DELETE);
  79. ADD_KEYWORD(try, TK_TRY);
  80. ADD_KEYWORD(catch, TK_CATCH);
  81. ADD_KEYWORD(throw, TK_THROW);
  82. ADD_KEYWORD(clone, TK_CLONE);
  83. ADD_KEYWORD(yield, TK_YIELD);
  84. ADD_KEYWORD(resume, TK_RESUME);
  85. ADD_KEYWORD(switch, TK_SWITCH);
  86. ADD_KEYWORD(case, TK_CASE);
  87. ADD_KEYWORD(default, TK_DEFAULT);
  88. ADD_KEYWORD(this, TK_THIS);
  89. ADD_KEYWORD(class,TK_CLASS);
  90. ADD_KEYWORD(extends,TK_EXTENDS);
  91. ADD_KEYWORD(constructor,TK_CONSTRUCTOR);
  92. ADD_KEYWORD(destructor,TK_DESTRUCTOR);
  93. ADD_KEYWORD(instanceof,TK_INSTANCEOF);
  94. ADD_KEYWORD(true,TK_TRUE);
  95. ADD_KEYWORD(false,TK_FALSE);
  96. ADD_KEYWORD(static,TK_STATIC);
  97. ADD_KEYWORD(enum,TK_ENUM);
  98. ADD_KEYWORD(const,TK_CONST);
  99. ADD_KEYWORD(__LINE__,TK___LINE__);
  100. ADD_KEYWORD(__FUNCTION__,TK___FUNCTION__);
  101. ADD_KEYWORD(__FILE__,TK___FILE__);
  102. ADD_KEYWORD(private,TK_PRIVATE);
  103. ADD_KEYWORD(public,TK_PUBLIC);
  104. ADD_KEYWORD(new,TK_IGNORE);
  105. return tbl;
  106. }
  107. void SQLexer::Error(const SQChar *fmt, ...)
  108. {
  109. static SQChar temp[256];
  110. va_list vl;
  111. va_start(vl, fmt);
  112. scvsprintf(temp, fmt, vl);
  113. va_end(vl);
  114. _errfunc(_errtarget,temp);
  115. }
  116. void SQLexer::Next()
  117. {
  118. SQInteger t = _readf(_up);
  119. if(t > MAX_CHAR) Error(_SC("Invalid character"));
  120. if(t != 0) {
  121. _currdata = (LexChar)t;
  122. return;
  123. }
  124. _currdata = SQUIRREL_EOB;
  125. _reached_eof = SQTrue;
  126. }
  127. const SQChar *SQLexer::Tok2Str(SQInteger tok)
  128. {
  129. SQObjectPtr itr, key, val;
  130. SQInteger nitr;
  131. while((nitr = _keywords->Next(false,itr, key, val)) != -1) {
  132. itr = (SQInteger)nitr;
  133. if(((SQInteger)_integer(val)) == tok)
  134. return _stringval(key);
  135. }
  136. return NULL;
  137. }
  138. void SQLexer::LexBlockComment()
  139. {
  140. /*
  141. if(CUR_CHAR == _SC('*'))
  142. {
  143. NEXT();
  144. if(CUR_CHAR != _SC('*')){ //document comment
  145. printf("Doument comment found at line %d\n", _currentline);
  146. }
  147. }
  148. */
  149. bool done = false;
  150. while(!done) {
  151. switch(CUR_CHAR) {
  152. case _SC('*'): { NEXT(); if(CUR_CHAR == _SC('/')) { done = true; NEXT(); }}; continue;
  153. case _SC('\n'): _currentline++; NEXT(); continue;
  154. case SQUIRREL_EOB: Error(_SC("missing \"*/\" in comment"));
  155. default: NEXT();
  156. }
  157. }
  158. }
  159. void SQLexer::LexLineComment()
  160. {
  161. do { NEXT(); } while (CUR_CHAR != _SC('\n') && (!IS_EOB()));
  162. }
  163. SQInteger SQLexer::Lex()
  164. {
  165. _lasttokenline = _currentline;
  166. while(CUR_CHAR != SQUIRREL_EOB) {
  167. switch(CUR_CHAR){
  168. case _SC('\t'): case _SC('\r'): case _SC(' '): NEXT(); continue;
  169. case _SC('\n'):
  170. _currentline++;
  171. _prevtoken=_curtoken;
  172. _curtoken=_SC('\n');
  173. NEXT();
  174. _currentcolumn=1;
  175. continue;
  176. case _SC('#'): LexLineComment(); continue;
  177. case _SC('/'):
  178. NEXT();
  179. switch(CUR_CHAR){
  180. case _SC('*'):
  181. NEXT();
  182. LexBlockComment();
  183. continue;
  184. case _SC('/'):
  185. LexLineComment();
  186. continue;
  187. case _SC('='):
  188. NEXT();
  189. RETURN_TOKEN(TK_DIVEQ);
  190. continue;
  191. case _SC('>'):
  192. NEXT();
  193. RETURN_TOKEN(TK_ATTR_CLOSE);
  194. continue;
  195. default:
  196. RETURN_TOKEN('/');
  197. }
  198. case _SC('='):
  199. NEXT();
  200. if (CUR_CHAR != _SC('=')){ RETURN_TOKEN('=') }
  201. else {
  202. NEXT();
  203. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_EQ_IDENTITY) }
  204. else { RETURN_TOKEN(TK_EQ); }
  205. }
  206. case _SC('<'):
  207. NEXT();
  208. switch(CUR_CHAR) {
  209. case _SC('='):
  210. NEXT();
  211. if(CUR_CHAR == _SC('>')) {
  212. NEXT();
  213. RETURN_TOKEN(TK_3WAYSCMP);
  214. }
  215. RETURN_TOKEN(TK_LE)
  216. break;
  217. case _SC('-'): NEXT(); RETURN_TOKEN(TK_NEWSLOT); break;
  218. case _SC('<'): NEXT(); RETURN_TOKEN(TK_SHIFTL); break;
  219. case _SC('/'): NEXT(); RETURN_TOKEN(TK_ATTR_OPEN); break;
  220. }
  221. RETURN_TOKEN('<');
  222. case _SC('>'):
  223. NEXT();
  224. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_GE);}
  225. else if(CUR_CHAR == _SC('>')){
  226. NEXT();
  227. if(CUR_CHAR == _SC('>')){
  228. NEXT();
  229. RETURN_TOKEN(TK_USHIFTR);
  230. }
  231. RETURN_TOKEN(TK_SHIFTR);
  232. }
  233. else { RETURN_TOKEN('>') }
  234. case _SC('!'):
  235. NEXT();
  236. if (CUR_CHAR != _SC('=')){ RETURN_TOKEN('!')}
  237. else {
  238. NEXT();
  239. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_NE_IDENTITY)}
  240. else { RETURN_TOKEN(TK_NE); }
  241. }
  242. case _SC('@'): {
  243. SQInteger stype;
  244. NEXT();
  245. if(CUR_CHAR != _SC('"')) {
  246. RETURN_TOKEN('@');
  247. }
  248. if((stype=ReadString('"',true))!=-1) {
  249. RETURN_TOKEN(stype);
  250. }
  251. Error(_SC("error parsing the string"));
  252. }
  253. case _SC('"'):
  254. case _SC('\''): {
  255. SQInteger stype;
  256. if((stype=ReadString(CUR_CHAR,false))!=-1){
  257. RETURN_TOKEN(stype);
  258. }
  259. Error(_SC("error parsing the string"));
  260. }
  261. case _SC('{'): case _SC('}'): case _SC('('): case _SC(')'): case _SC('['): case _SC(']'):
  262. case _SC(';'): case _SC(','): case _SC('?'): case _SC('~'):
  263. {
  264. SQInteger ret = CUR_CHAR;
  265. NEXT();
  266. if((ret == _SC('[') || ret == _SC('{') || ret == _SC('(')) && CUR_CHAR == _SC('=')){
  267. //lets try lua literal delimiters
  268. SQInteger stype;
  269. if((stype=ReadString(ret,true))!=-1){
  270. RETURN_TOKEN(stype);
  271. }
  272. Error(_SC("error parsing the string"));
  273. }
  274. else RETURN_TOKEN(ret);
  275. }
  276. case _SC('.'):
  277. NEXT();
  278. if (CUR_CHAR != _SC('.')){ RETURN_TOKEN('.') }
  279. NEXT();
  280. if (CUR_CHAR != _SC('.')){ Error(_SC("invalid token '..'")); }
  281. NEXT();
  282. RETURN_TOKEN(TK_VARPARAMS);
  283. case _SC('^'):
  284. NEXT();
  285. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_XOR_EQ);}
  286. RETURN_TOKEN('^');
  287. case _SC('&'):
  288. NEXT();
  289. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_AND_EQ);}
  290. if (CUR_CHAR != _SC('&')){ RETURN_TOKEN('&') }
  291. else { NEXT(); RETURN_TOKEN(TK_AND); }
  292. case _SC('|'):
  293. NEXT();
  294. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_OR_EQ);}
  295. if (CUR_CHAR != _SC('|')){ RETURN_TOKEN('|') }
  296. else { NEXT(); RETURN_TOKEN(TK_OR); }
  297. case _SC(':'):
  298. NEXT();
  299. if (CUR_CHAR != _SC(':')){ RETURN_TOKEN(':') }
  300. else { NEXT(); RETURN_TOKEN(TK_DOUBLE_COLON); }
  301. case _SC('*'):
  302. NEXT();
  303. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MULEQ);}
  304. else RETURN_TOKEN('*');
  305. case _SC('%'):
  306. NEXT();
  307. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MODEQ);}
  308. else RETURN_TOKEN('%');
  309. case _SC('-'):
  310. NEXT();
  311. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MINUSEQ);}
  312. else if (CUR_CHAR == _SC('-')){ NEXT(); RETURN_TOKEN(TK_MINUSMINUS);}
  313. else if (CUR_CHAR == _SC('>')){ NEXT(); RETURN_TOKEN('.');} //accept C/C++ like pointers
  314. else RETURN_TOKEN('-');
  315. case _SC('+'):
  316. NEXT();
  317. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_PLUSEQ);}
  318. else if (CUR_CHAR == _SC('+')){ NEXT(); RETURN_TOKEN(TK_PLUSPLUS);}
  319. else RETURN_TOKEN('+');
  320. case SQUIRREL_EOB:
  321. return 0;
  322. default:{
  323. if (scisdigit(CUR_CHAR)) {
  324. SQInteger ret = ReadNumber();
  325. RETURN_TOKEN(ret);
  326. }
  327. else if (scisalpha(CUR_CHAR) || CUR_CHAR == _SC('_')) {
  328. SQInteger t = ReadID();
  329. RETURN_TOKEN(t);
  330. }
  331. else {
  332. SQInteger c = CUR_CHAR;
  333. if (sciscntrl((int)c)) Error(_SC("unexpected character(control)"));
  334. NEXT();
  335. RETURN_TOKEN(c);
  336. }
  337. RETURN_TOKEN(0);
  338. }
  339. }
  340. }
  341. return 0;
  342. }
  343. SQInteger SQLexer::GetIDType(const SQChar *s,SQInteger len)
  344. {
  345. SQObjectPtr t;
  346. if(_keywords->GetStr(s,len, t)) {
  347. return SQInteger(_integer(t));
  348. }
  349. return TK_IDENTIFIER;
  350. }
  351. SQInteger SQLexer::ReadString(SQInteger ndelim,bool verbatim)
  352. {
  353. INIT_TEMP_STRING();
  354. SQInteger start_equals = 0;
  355. SQChar cdelim1, cdelim2;
  356. if(ndelim == _SC('{')){
  357. cdelim1 = _SC('{');
  358. cdelim2 = _SC('}');
  359. }
  360. else if(ndelim == _SC('(')){
  361. cdelim1 = _SC('(');
  362. cdelim2 = _SC(')');
  363. }
  364. else {
  365. cdelim1 = _SC('[');
  366. cdelim2 = _SC(']');
  367. }
  368. if(CUR_CHAR == _SC('=')){
  369. //lua like literal
  370. while(!IS_EOB() && CUR_CHAR == _SC('=')) {
  371. ++start_equals;
  372. NEXT();
  373. }
  374. if(CUR_CHAR != cdelim1){
  375. //it's not a lua literal delimiter
  376. Error(_SC("expect '%c' on literal delimiter"), cdelim1);
  377. return -1;
  378. }
  379. ndelim = cdelim2;
  380. }
  381. NEXT();
  382. if(IS_EOB()) return -1;
  383. if(start_equals && CUR_CHAR == _SC('\n')) {
  384. ++_currentline;
  385. NEXT(); //if a new line follows the start of delimiter drop it
  386. if(IS_EOB()) return -1;
  387. }
  388. for(;;) {
  389. while(CUR_CHAR != ndelim) {
  390. switch(CUR_CHAR) {
  391. case SQUIRREL_EOB:
  392. Error(_SC("unfinished string"));
  393. return -1;
  394. case _SC('\n'):
  395. if(!verbatim) Error(_SC("newline in a constant"));
  396. APPEND_CHAR(CUR_CHAR); NEXT();
  397. _currentline++;
  398. break;
  399. case _SC('\\'):
  400. if(verbatim) {
  401. APPEND_CHAR('\\'); NEXT();
  402. }
  403. else {
  404. NEXT();
  405. switch(CUR_CHAR) {
  406. case _SC('x'): NEXT(); {
  407. if(!isxdigit(CUR_CHAR)) Error(_SC("hexadecimal number expected"));
  408. const SQInteger maxdigits = 4;
  409. SQChar temp[maxdigits+1];
  410. SQInteger n = 0;
  411. while(isxdigit(CUR_CHAR) && n < maxdigits) {
  412. temp[n] = CUR_CHAR;
  413. n++;
  414. NEXT();
  415. }
  416. temp[n] = 0;
  417. SQChar *sTemp;
  418. APPEND_CHAR((SQChar)scstrtoul(temp,&sTemp,16));
  419. }
  420. break;
  421. case _SC('t'): APPEND_CHAR(_SC('\t')); NEXT(); break;
  422. case _SC('a'): APPEND_CHAR(_SC('\a')); NEXT(); break;
  423. case _SC('b'): APPEND_CHAR(_SC('\b')); NEXT(); break;
  424. case _SC('n'): APPEND_CHAR(_SC('\n')); NEXT(); break;
  425. case _SC('r'): APPEND_CHAR(_SC('\r')); NEXT(); break;
  426. case _SC('v'): APPEND_CHAR(_SC('\v')); NEXT(); break;
  427. case _SC('f'): APPEND_CHAR(_SC('\f')); NEXT(); break;
  428. case _SC('0'): APPEND_CHAR(_SC('\0')); NEXT(); break;
  429. case _SC('\\'): APPEND_CHAR(_SC('\\')); NEXT(); break;
  430. case _SC('"'): APPEND_CHAR(_SC('"')); NEXT(); break;
  431. case _SC('\''): APPEND_CHAR(_SC('\'')); NEXT(); break;
  432. default:
  433. Error(_SC("unrecognised escaper char"));
  434. break;
  435. }
  436. }
  437. break;
  438. default:
  439. APPEND_CHAR(CUR_CHAR);
  440. NEXT();
  441. }
  442. }
  443. NEXT();
  444. if(start_equals){
  445. bool lastBraceAdded = false;
  446. if(CUR_CHAR == _SC('=')){
  447. SQInteger end_equals = start_equals;
  448. NEXT();
  449. if(CUR_CHAR == _SC('=') || CUR_CHAR == cdelim2){
  450. --end_equals;
  451. while(!IS_EOB() && CUR_CHAR == _SC('=')) {
  452. --end_equals;
  453. NEXT();
  454. }
  455. if(end_equals) Error(_SC("expect same number of '=' on literal delimiter"));
  456. if(CUR_CHAR != cdelim2) Error(_SC("expect '%c' to close literal delimiter"), cdelim2);
  457. NEXT();
  458. break;
  459. }
  460. APPEND_CHAR(cdelim2); //the first NEXT() after break the while loop
  461. APPEND_CHAR(_SC('='));
  462. lastBraceAdded = true;
  463. }
  464. if(!lastBraceAdded) APPEND_CHAR(cdelim2); //the first NEXT() after break the while loop
  465. APPEND_CHAR(CUR_CHAR);
  466. NEXT();
  467. }
  468. else if(verbatim && CUR_CHAR == '"') { //double quotation
  469. APPEND_CHAR(CUR_CHAR);
  470. NEXT();
  471. }
  472. else {
  473. break;
  474. }
  475. }
  476. TERMINATE_BUFFER();
  477. SQInteger len = _longstr.size()-1;
  478. if(ndelim == _SC('\'')) {
  479. if(len == 0) Error(_SC("empty constant"));
  480. if(len > 1) Error(_SC("constant too long"));
  481. _nvalue = _longstr[0];
  482. return TK_INTEGER;
  483. }
  484. _svalue = &_longstr[0];
  485. return TK_STRING_LITERAL;
  486. }
  487. void LexHexadecimal(const SQChar *s,SQUnsignedInteger *res)
  488. {
  489. *res = 0;
  490. while(*s != 0)
  491. {
  492. if(scisdigit(*s)) *res = (*res)*16+((*s++)-'0');
  493. else if(scisxdigit(*s)) *res = (*res)*16+(toupper(*s++)-'A'+10);
  494. else { assert(0); }
  495. }
  496. }
  497. void LexInteger(const SQChar *s,SQUnsignedInteger *res)
  498. {
  499. *res = 0;
  500. while(*s != 0)
  501. {
  502. *res = (*res)*10+((*s++)-'0');
  503. }
  504. }
  505. SQInteger scisodigit(SQInteger c) { return c >= _SC('0') && c <= _SC('7'); }
  506. void LexOctal(const SQChar *s,SQUnsignedInteger *res)
  507. {
  508. *res = 0;
  509. while(*s != 0)
  510. {
  511. if(scisodigit(*s)) *res = (*res)*8+((*s++)-'0');
  512. else { assert(0); }
  513. }
  514. }
  515. SQInteger isexponent(SQInteger c) { return c == 'e' || c=='E'; }
  516. #define MAX_HEX_DIGITS (sizeof(SQInteger)*2)
  517. SQInteger SQLexer::ReadNumber()
  518. {
  519. #define TINT 1
  520. #define TFLOAT 2
  521. #define THEX 3
  522. #define TSCIENTIFIC 4
  523. #define TOCTAL 5
  524. SQInteger type = TINT, firstchar = CUR_CHAR;
  525. SQUnsignedInteger itmp;
  526. SQChar *sTemp;
  527. INIT_TEMP_STRING();
  528. NEXT();
  529. if(firstchar == _SC('0') && (toupper(CUR_CHAR) == _SC('X') || scisodigit(CUR_CHAR)) ) {
  530. if(scisodigit(CUR_CHAR)) {
  531. type = TOCTAL;
  532. while(scisodigit(CUR_CHAR)) {
  533. APPEND_CHAR(CUR_CHAR);
  534. NEXT();
  535. }
  536. if(scisdigit(CUR_CHAR)) Error(_SC("invalid octal number"));
  537. }
  538. else {
  539. NEXT();
  540. type = THEX;
  541. while(isxdigit(CUR_CHAR)) {
  542. APPEND_CHAR(CUR_CHAR);
  543. NEXT();
  544. }
  545. if(_longstr.size() > MAX_HEX_DIGITS) Error(_SC("too many digits for an Hex number"));
  546. }
  547. }
  548. else {
  549. APPEND_CHAR((int)firstchar);
  550. while (CUR_CHAR == _SC('.') || scisdigit(CUR_CHAR) || isexponent(CUR_CHAR)) {
  551. if(CUR_CHAR == _SC('.') || isexponent(CUR_CHAR)) type = TFLOAT;
  552. if(isexponent(CUR_CHAR)) {
  553. if(type != TFLOAT) Error(_SC("invalid numeric format"));
  554. type = TSCIENTIFIC;
  555. APPEND_CHAR(CUR_CHAR);
  556. NEXT();
  557. if(CUR_CHAR == '+' || CUR_CHAR == '-'){
  558. APPEND_CHAR(CUR_CHAR);
  559. NEXT();
  560. }
  561. if(!scisdigit(CUR_CHAR)) Error(_SC("exponent expected"));
  562. }
  563. APPEND_CHAR(CUR_CHAR);
  564. NEXT();
  565. }
  566. }
  567. TERMINATE_BUFFER();
  568. switch(type) {
  569. case TSCIENTIFIC:
  570. case TFLOAT:
  571. _fvalue = (SQFloat)scstrtod(&_longstr[0],&sTemp);
  572. return TK_FLOAT;
  573. case TINT:
  574. LexInteger(&_longstr[0],&itmp);
  575. break;
  576. case THEX:
  577. LexHexadecimal(&_longstr[0],&itmp);
  578. break;
  579. case TOCTAL:
  580. LexOctal(&_longstr[0],&itmp);
  581. break;
  582. }
  583. switch(type) {
  584. case TINT:
  585. case THEX:
  586. case TOCTAL:
  587. if(itmp > INT_MAX) Error(_SC("integer overflow"));
  588. _nvalue = (SQInteger) itmp;
  589. return TK_INTEGER;
  590. }
  591. return 0;
  592. }
  593. SQInteger SQLexer::ReadID()
  594. {
  595. SQInteger res;
  596. INIT_TEMP_STRING();
  597. do {
  598. APPEND_CHAR(CUR_CHAR);
  599. NEXT();
  600. } while(scisalnum(CUR_CHAR) || CUR_CHAR == _SC('_'));
  601. TERMINATE_BUFFER();
  602. res = GetIDType(&_longstr[0],_longstr.size() - 1);
  603. if(res == TK_IDENTIFIER || res == TK_CONSTRUCTOR || res == TK_DESTRUCTOR) {
  604. _svalue = &_longstr[0];
  605. }
  606. return res;
  607. }