sqlexer.cpp 20 KB

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