sqlexer.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626
  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 { NEXT(); RETURN_TOKEN(TK_EQ); }
  202. case _SC('<'):
  203. NEXT();
  204. switch(CUR_CHAR) {
  205. case _SC('='):
  206. NEXT();
  207. if(CUR_CHAR == _SC('>')) {
  208. NEXT();
  209. RETURN_TOKEN(TK_3WAYSCMP);
  210. }
  211. RETURN_TOKEN(TK_LE)
  212. break;
  213. case _SC('-'): NEXT(); RETURN_TOKEN(TK_NEWSLOT); break;
  214. case _SC('<'): NEXT(); RETURN_TOKEN(TK_SHIFTL); break;
  215. case _SC('/'): NEXT(); RETURN_TOKEN(TK_ATTR_OPEN); break;
  216. }
  217. RETURN_TOKEN('<');
  218. case _SC('>'):
  219. NEXT();
  220. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_GE);}
  221. else if(CUR_CHAR == _SC('>')){
  222. NEXT();
  223. if(CUR_CHAR == _SC('>')){
  224. NEXT();
  225. RETURN_TOKEN(TK_USHIFTR);
  226. }
  227. RETURN_TOKEN(TK_SHIFTR);
  228. }
  229. else { RETURN_TOKEN('>') }
  230. case _SC('!'):
  231. NEXT();
  232. if (CUR_CHAR != _SC('=')){ RETURN_TOKEN('!')}
  233. else { NEXT(); RETURN_TOKEN(TK_NE); }
  234. case _SC('@'): {
  235. SQInteger stype;
  236. NEXT();
  237. if(CUR_CHAR != _SC('"')) {
  238. RETURN_TOKEN('@');
  239. }
  240. if((stype=ReadString('"',true))!=-1) {
  241. RETURN_TOKEN(stype);
  242. }
  243. Error(_SC("error parsing the string"));
  244. }
  245. case _SC('"'):
  246. case _SC('\''): {
  247. SQInteger stype;
  248. if((stype=ReadString(CUR_CHAR,false))!=-1){
  249. RETURN_TOKEN(stype);
  250. }
  251. Error(_SC("error parsing the string"));
  252. }
  253. case _SC('{'): case _SC('}'): case _SC('('): case _SC(')'): case _SC('['): case _SC(']'):
  254. case _SC(';'): case _SC(','): case _SC('?'): case _SC('~'):
  255. {
  256. SQInteger ret = CUR_CHAR;
  257. NEXT();
  258. if((ret == _SC('[') || ret == _SC('{') || ret == _SC('(')) && CUR_CHAR == _SC('=')){
  259. //lets try lua literal delimiters
  260. SQInteger stype;
  261. if((stype=ReadString(ret,true))!=-1){
  262. RETURN_TOKEN(stype);
  263. }
  264. Error(_SC("error parsing the string"));
  265. }
  266. else RETURN_TOKEN(ret);
  267. }
  268. case _SC('.'):
  269. NEXT();
  270. if (CUR_CHAR != _SC('.')){ RETURN_TOKEN('.') }
  271. NEXT();
  272. if (CUR_CHAR != _SC('.')){ Error(_SC("invalid token '..'")); }
  273. NEXT();
  274. RETURN_TOKEN(TK_VARPARAMS);
  275. case _SC('^'):
  276. NEXT();
  277. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_XOR_EQ);}
  278. RETURN_TOKEN('^');
  279. case _SC('&'):
  280. NEXT();
  281. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_AND_EQ);}
  282. if (CUR_CHAR != _SC('&')){ RETURN_TOKEN('&') }
  283. else { NEXT(); RETURN_TOKEN(TK_AND); }
  284. case _SC('|'):
  285. NEXT();
  286. //if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_BIT_OR_EQ);}
  287. if (CUR_CHAR != _SC('|')){ RETURN_TOKEN('|') }
  288. else { NEXT(); RETURN_TOKEN(TK_OR); }
  289. case _SC(':'):
  290. NEXT();
  291. if (CUR_CHAR != _SC(':')){ RETURN_TOKEN(':') }
  292. else { NEXT(); RETURN_TOKEN(TK_DOUBLE_COLON); }
  293. case _SC('*'):
  294. NEXT();
  295. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MULEQ);}
  296. else RETURN_TOKEN('*');
  297. case _SC('%'):
  298. NEXT();
  299. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MODEQ);}
  300. else RETURN_TOKEN('%');
  301. case _SC('-'):
  302. NEXT();
  303. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_MINUSEQ);}
  304. else if (CUR_CHAR == _SC('-')){ NEXT(); RETURN_TOKEN(TK_MINUSMINUS);}
  305. else if (CUR_CHAR == _SC('>')){ NEXT(); RETURN_TOKEN('.');} //accept C/C++ like pointers
  306. else RETURN_TOKEN('-');
  307. case _SC('+'):
  308. NEXT();
  309. if (CUR_CHAR == _SC('=')){ NEXT(); RETURN_TOKEN(TK_PLUSEQ);}
  310. else if (CUR_CHAR == _SC('+')){ NEXT(); RETURN_TOKEN(TK_PLUSPLUS);}
  311. else RETURN_TOKEN('+');
  312. case SQUIRREL_EOB:
  313. return 0;
  314. default:{
  315. if (scisdigit(CUR_CHAR)) {
  316. SQInteger ret = ReadNumber();
  317. RETURN_TOKEN(ret);
  318. }
  319. else if (scisalpha(CUR_CHAR) || CUR_CHAR == _SC('_')) {
  320. SQInteger t = ReadID();
  321. RETURN_TOKEN(t);
  322. }
  323. else {
  324. SQInteger c = CUR_CHAR;
  325. if (sciscntrl((int)c)) Error(_SC("unexpected character(control)"));
  326. NEXT();
  327. RETURN_TOKEN(c);
  328. }
  329. RETURN_TOKEN(0);
  330. }
  331. }
  332. }
  333. return 0;
  334. }
  335. SQInteger SQLexer::GetIDType(SQChar *s)
  336. {
  337. SQObjectPtr t;
  338. if(_keywords->Get(SQString::Create(_sharedstate, s), t)) {
  339. return SQInteger(_integer(t));
  340. }
  341. return TK_IDENTIFIER;
  342. }
  343. SQInteger SQLexer::ReadString(SQInteger ndelim,bool verbatim)
  344. {
  345. INIT_TEMP_STRING();
  346. SQInteger start_equals = 0;
  347. SQChar cdelim1, cdelim2;
  348. if(ndelim == _SC('{')){
  349. cdelim1 = _SC('{');
  350. cdelim2 = _SC('}');
  351. }
  352. else if(ndelim == _SC('(')){
  353. cdelim1 = _SC('(');
  354. cdelim2 = _SC(')');
  355. }
  356. else {
  357. cdelim1 = _SC('[');
  358. cdelim2 = _SC(']');
  359. }
  360. if(CUR_CHAR == _SC('=')){
  361. //lua like literal
  362. while(!IS_EOB() && CUR_CHAR == _SC('=')) {
  363. ++start_equals;
  364. NEXT();
  365. }
  366. if(CUR_CHAR != cdelim1){
  367. //it's not a lua literal delimiter
  368. Error(_SC("expect '%c' on literal delimiter"), cdelim1);
  369. return -1;
  370. }
  371. ndelim = cdelim2;
  372. }
  373. NEXT();
  374. if(IS_EOB()) return -1;
  375. if(start_equals && CUR_CHAR == _SC('\n')) {
  376. ++_currentline;
  377. NEXT(); //if a new line follows the start of delimiter drop it
  378. if(IS_EOB()) return -1;
  379. }
  380. for(;;) {
  381. while(CUR_CHAR != ndelim) {
  382. switch(CUR_CHAR) {
  383. case SQUIRREL_EOB:
  384. Error(_SC("unfinished string"));
  385. return -1;
  386. case _SC('\n'):
  387. if(!verbatim) Error(_SC("newline in a constant"));
  388. APPEND_CHAR(CUR_CHAR); NEXT();
  389. _currentline++;
  390. break;
  391. case _SC('\\'):
  392. if(verbatim) {
  393. APPEND_CHAR('\\'); NEXT();
  394. }
  395. else {
  396. NEXT();
  397. switch(CUR_CHAR) {
  398. case _SC('x'): NEXT(); {
  399. if(!isxdigit(CUR_CHAR)) Error(_SC("hexadecimal number expected"));
  400. const SQInteger maxdigits = 4;
  401. SQChar temp[maxdigits+1];
  402. SQInteger n = 0;
  403. while(isxdigit(CUR_CHAR) && n < maxdigits) {
  404. temp[n] = CUR_CHAR;
  405. n++;
  406. NEXT();
  407. }
  408. temp[n] = 0;
  409. SQChar *sTemp;
  410. APPEND_CHAR((SQChar)scstrtoul(temp,&sTemp,16));
  411. }
  412. break;
  413. case _SC('t'): APPEND_CHAR(_SC('\t')); NEXT(); break;
  414. case _SC('a'): APPEND_CHAR(_SC('\a')); NEXT(); break;
  415. case _SC('b'): APPEND_CHAR(_SC('\b')); NEXT(); break;
  416. case _SC('n'): APPEND_CHAR(_SC('\n')); NEXT(); break;
  417. case _SC('r'): APPEND_CHAR(_SC('\r')); NEXT(); break;
  418. case _SC('v'): APPEND_CHAR(_SC('\v')); NEXT(); break;
  419. case _SC('f'): APPEND_CHAR(_SC('\f')); NEXT(); break;
  420. case _SC('0'): APPEND_CHAR(_SC('\0')); NEXT(); break;
  421. case _SC('\\'): APPEND_CHAR(_SC('\\')); NEXT(); break;
  422. case _SC('"'): APPEND_CHAR(_SC('"')); NEXT(); break;
  423. case _SC('\''): APPEND_CHAR(_SC('\'')); NEXT(); break;
  424. default:
  425. Error(_SC("unrecognised escaper char"));
  426. break;
  427. }
  428. }
  429. break;
  430. default:
  431. APPEND_CHAR(CUR_CHAR);
  432. NEXT();
  433. }
  434. }
  435. NEXT();
  436. if(start_equals){
  437. bool lastBraceAdded = false;
  438. if(CUR_CHAR == _SC('=')){
  439. SQInteger end_equals = start_equals;
  440. NEXT();
  441. if(CUR_CHAR == _SC('=') || CUR_CHAR == cdelim2){
  442. --end_equals;
  443. while(!IS_EOB() && CUR_CHAR == _SC('=')) {
  444. --end_equals;
  445. NEXT();
  446. }
  447. if(end_equals) Error(_SC("expect same number of '=' on literal delimiter"));
  448. if(CUR_CHAR != cdelim2) Error(_SC("expect '%c' to close literal delimiter"), cdelim2);
  449. NEXT();
  450. break;
  451. }
  452. APPEND_CHAR(cdelim2); //the first NEXT() after break the while loop
  453. APPEND_CHAR(_SC('='));
  454. lastBraceAdded = true;
  455. }
  456. if(!lastBraceAdded) APPEND_CHAR(cdelim2); //the first NEXT() after break the while loop
  457. APPEND_CHAR(CUR_CHAR);
  458. NEXT();
  459. }
  460. else if(verbatim && CUR_CHAR == '"') { //double quotation
  461. APPEND_CHAR(CUR_CHAR);
  462. NEXT();
  463. }
  464. else {
  465. break;
  466. }
  467. }
  468. TERMINATE_BUFFER();
  469. SQInteger len = _longstr.size()-1;
  470. if(ndelim == _SC('\'')) {
  471. if(len == 0) Error(_SC("empty constant"));
  472. if(len > 1) Error(_SC("constant too long"));
  473. _nvalue = _longstr[0];
  474. return TK_INTEGER;
  475. }
  476. _svalue = &_longstr[0];
  477. return TK_STRING_LITERAL;
  478. }
  479. void LexHexadecimal(const SQChar *s,SQUnsignedInteger *res)
  480. {
  481. *res = 0;
  482. while(*s != 0)
  483. {
  484. if(scisdigit(*s)) *res = (*res)*16+((*s++)-'0');
  485. else if(scisxdigit(*s)) *res = (*res)*16+(toupper(*s++)-'A'+10);
  486. else { assert(0); }
  487. }
  488. }
  489. void LexInteger(const SQChar *s,SQUnsignedInteger *res)
  490. {
  491. *res = 0;
  492. while(*s != 0)
  493. {
  494. *res = (*res)*10+((*s++)-'0');
  495. }
  496. }
  497. SQInteger scisodigit(SQInteger c) { return c >= _SC('0') && c <= _SC('7'); }
  498. void LexOctal(const SQChar *s,SQUnsignedInteger *res)
  499. {
  500. *res = 0;
  501. while(*s != 0)
  502. {
  503. if(scisodigit(*s)) *res = (*res)*8+((*s++)-'0');
  504. else { assert(0); }
  505. }
  506. }
  507. SQInteger isexponent(SQInteger c) { return c == 'e' || c=='E'; }
  508. #define MAX_HEX_DIGITS (sizeof(SQInteger)*2)
  509. SQInteger SQLexer::ReadNumber()
  510. {
  511. #define TINT 1
  512. #define TFLOAT 2
  513. #define THEX 3
  514. #define TSCIENTIFIC 4
  515. #define TOCTAL 5
  516. SQInteger type = TINT, firstchar = CUR_CHAR;
  517. SQUnsignedInteger itmp;
  518. SQChar *sTemp;
  519. INIT_TEMP_STRING();
  520. NEXT();
  521. if(firstchar == _SC('0') && (toupper(CUR_CHAR) == _SC('X') || scisodigit(CUR_CHAR)) ) {
  522. if(scisodigit(CUR_CHAR)) {
  523. type = TOCTAL;
  524. while(scisodigit(CUR_CHAR)) {
  525. APPEND_CHAR(CUR_CHAR);
  526. NEXT();
  527. }
  528. if(scisdigit(CUR_CHAR)) Error(_SC("invalid octal number"));
  529. }
  530. else {
  531. NEXT();
  532. type = THEX;
  533. while(isxdigit(CUR_CHAR)) {
  534. APPEND_CHAR(CUR_CHAR);
  535. NEXT();
  536. }
  537. if(_longstr.size() > MAX_HEX_DIGITS) Error(_SC("too many digits for an Hex number"));
  538. }
  539. }
  540. else {
  541. APPEND_CHAR((int)firstchar);
  542. while (CUR_CHAR == _SC('.') || scisdigit(CUR_CHAR) || isexponent(CUR_CHAR)) {
  543. if(CUR_CHAR == _SC('.') || isexponent(CUR_CHAR)) type = TFLOAT;
  544. if(isexponent(CUR_CHAR)) {
  545. if(type != TFLOAT) Error(_SC("invalid numeric format"));
  546. type = TSCIENTIFIC;
  547. APPEND_CHAR(CUR_CHAR);
  548. NEXT();
  549. if(CUR_CHAR == '+' || CUR_CHAR == '-'){
  550. APPEND_CHAR(CUR_CHAR);
  551. NEXT();
  552. }
  553. if(!scisdigit(CUR_CHAR)) Error(_SC("exponent expected"));
  554. }
  555. APPEND_CHAR(CUR_CHAR);
  556. NEXT();
  557. }
  558. }
  559. TERMINATE_BUFFER();
  560. switch(type) {
  561. case TSCIENTIFIC:
  562. case TFLOAT:
  563. _fvalue = (SQFloat)scstrtod(&_longstr[0],&sTemp);
  564. return TK_FLOAT;
  565. case TINT:
  566. LexInteger(&_longstr[0],&itmp);
  567. break;
  568. case THEX:
  569. LexHexadecimal(&_longstr[0],&itmp);
  570. break;
  571. case TOCTAL:
  572. LexOctal(&_longstr[0],&itmp);
  573. break;
  574. }
  575. switch(type) {
  576. case TINT:
  577. case THEX:
  578. case TOCTAL:
  579. if(itmp > INT_MAX) Error(_SC("integer overflow"));
  580. _nvalue = (SQInteger) itmp;
  581. return TK_INTEGER;
  582. }
  583. return 0;
  584. }
  585. SQInteger SQLexer::ReadID()
  586. {
  587. SQInteger res;
  588. INIT_TEMP_STRING();
  589. do {
  590. APPEND_CHAR(CUR_CHAR);
  591. NEXT();
  592. } while(scisalnum(CUR_CHAR) || CUR_CHAR == _SC('_'));
  593. TERMINATE_BUFFER();
  594. res = GetIDType(&_longstr[0]);
  595. if(res == TK_IDENTIFIER || res == TK_CONSTRUCTOR || res == TK_DESTRUCTOR) {
  596. _svalue = &_longstr[0];
  597. }
  598. return res;
  599. }