sqlexer.cpp 24 KB

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