llex.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548
  1. /*
  2. ** $Id: llex.c,v 2.67 2013/06/19 14:27:00 roberto Exp roberto $
  3. ** Lexical Analyzer
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <locale.h>
  7. #include <string.h>
  8. #define llex_c
  9. #define LUA_CORE
  10. #include "lua.h"
  11. #include "lctype.h"
  12. #include "ldo.h"
  13. #include "lgc.h"
  14. #include "llex.h"
  15. #include "lobject.h"
  16. #include "lparser.h"
  17. #include "lstate.h"
  18. #include "lstring.h"
  19. #include "ltable.h"
  20. #include "lzio.h"
  21. #define next(ls) (ls->current = zgetc(ls->z))
  22. #define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r')
  23. /* ORDER RESERVED */
  24. static const char *const luaX_tokens [] = {
  25. "and", "break", "do", "else", "elseif",
  26. "end", "false", "for", "function", "goto", "if",
  27. "in", "local", "nil", "not", "or", "repeat",
  28. "return", "then", "true", "until", "while",
  29. "//", "..", "...", "==", ">=", "<=", "~=", "::", "<eof>",
  30. "<number>", "<number>", "<name>", "<string>"
  31. };
  32. #define save_and_next(ls) (save(ls, ls->current), next(ls))
  33. static l_noret lexerror (LexState *ls, const char *msg, int token);
  34. static void save (LexState *ls, int c) {
  35. Mbuffer *b = ls->buff;
  36. if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) {
  37. size_t newsize;
  38. if (luaZ_sizebuffer(b) >= MAX_SIZE/2)
  39. lexerror(ls, "lexical element too long", 0);
  40. newsize = luaZ_sizebuffer(b) * 2;
  41. luaZ_resizebuffer(ls->L, b, newsize);
  42. }
  43. b->buffer[luaZ_bufflen(b)++] = cast(char, c);
  44. }
  45. void luaX_init (lua_State *L) {
  46. int i;
  47. TString *e = luaS_new(L, LUA_ENV); /* create env name */
  48. luaC_fix(L, obj2gco(e)); /* never collect this name */
  49. for (i=0; i<NUM_RESERVED; i++) {
  50. TString *ts = luaS_new(L, luaX_tokens[i]);
  51. luaC_fix(L, obj2gco(ts)); /* reserved words are never collected */
  52. ts->tsv.extra = cast_byte(i+1); /* reserved word */
  53. }
  54. }
  55. const char *luaX_token2str (LexState *ls, int token) {
  56. if (token < FIRST_RESERVED) { /* single-byte symbols? */
  57. lua_assert(token == cast(unsigned char, token));
  58. return (lisprint(token)) ? luaO_pushfstring(ls->L, LUA_QL("%c"), token) :
  59. luaO_pushfstring(ls->L, "char(%d)", token);
  60. }
  61. else {
  62. const char *s = luaX_tokens[token - FIRST_RESERVED];
  63. if (token < TK_EOS) /* fixed format (symbols and reserved words)? */
  64. return luaO_pushfstring(ls->L, LUA_QS, s);
  65. else /* names, strings, and numerals */
  66. return s;
  67. }
  68. }
  69. static const char *txtToken (LexState *ls, int token) {
  70. switch (token) {
  71. case TK_NAME: case TK_STRING:
  72. case TK_FLT: case TK_INT:
  73. save(ls, '\0');
  74. return luaO_pushfstring(ls->L, LUA_QS, luaZ_buffer(ls->buff));
  75. default:
  76. return luaX_token2str(ls, token);
  77. }
  78. }
  79. static l_noret lexerror (LexState *ls, const char *msg, int token) {
  80. char buff[LUA_IDSIZE];
  81. luaO_chunkid(buff, getstr(ls->source), LUA_IDSIZE);
  82. msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
  83. if (token)
  84. luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token));
  85. luaD_throw(ls->L, LUA_ERRSYNTAX);
  86. }
  87. l_noret luaX_syntaxerror (LexState *ls, const char *msg) {
  88. lexerror(ls, msg, ls->t.token);
  89. }
  90. /*
  91. ** creates a new string and anchors it in function's table so that
  92. ** it will not be collected until the end of the function's compilation
  93. ** (by that time it should be anchored in function's prototype)
  94. */
  95. TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
  96. lua_State *L = ls->L;
  97. TValue *o; /* entry for `str' */
  98. TString *ts = luaS_newlstr(L, str, l); /* create new string */
  99. setsvalue2s(L, L->top++, ts); /* temporarily anchor it in stack */
  100. o = luaH_set(L, ls->fs->h, L->top - 1);
  101. if (ttisnil(o)) { /* not in use yet? (see 'addK') */
  102. /* boolean value does not need GC barrier;
  103. table has no metatable, so it does not need to invalidate cache */
  104. setbvalue(o, 1); /* t[string] = true */
  105. luaC_checkGC(L);
  106. }
  107. L->top--; /* remove string from stack */
  108. return ts;
  109. }
  110. /*
  111. ** increment line number and skips newline sequence (any of
  112. ** \n, \r, \n\r, or \r\n)
  113. */
  114. static void inclinenumber (LexState *ls) {
  115. int old = ls->current;
  116. lua_assert(currIsNewline(ls));
  117. next(ls); /* skip `\n' or `\r' */
  118. if (currIsNewline(ls) && ls->current != old)
  119. next(ls); /* skip `\n\r' or `\r\n' */
  120. if (++ls->linenumber >= MAX_INT)
  121. luaX_syntaxerror(ls, "chunk has too many lines");
  122. }
  123. void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source,
  124. int firstchar) {
  125. ls->decpoint = '.';
  126. ls->L = L;
  127. ls->current = firstchar;
  128. ls->lookahead.token = TK_EOS; /* no look-ahead token */
  129. ls->z = z;
  130. ls->fs = NULL;
  131. ls->linenumber = 1;
  132. ls->lastline = 1;
  133. ls->source = source;
  134. ls->envn = luaS_new(L, LUA_ENV); /* get env name */
  135. luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */
  136. }
  137. /*
  138. ** =======================================================
  139. ** LEXICAL ANALYZER
  140. ** =======================================================
  141. */
  142. static int check_next (LexState *ls, const char *set) {
  143. if (ls->current == '\0' || !strchr(set, ls->current))
  144. return 0;
  145. save_and_next(ls);
  146. return 1;
  147. }
  148. /*
  149. ** change all characters 'from' in buffer to 'to'
  150. */
  151. static void buffreplace (LexState *ls, char from, char to) {
  152. size_t n = luaZ_bufflen(ls->buff);
  153. char *p = luaZ_buffer(ls->buff);
  154. while (n--)
  155. if (p[n] == from) p[n] = to;
  156. }
  157. #if !defined(getlocaledecpoint)
  158. #define getlocaledecpoint() (localeconv()->decimal_point[0])
  159. #endif
  160. #define buff2d(b,e) luaO_str2d(luaZ_buffer(b), luaZ_bufflen(b) - 1, e)
  161. /*
  162. ** in case of format error, try to change decimal point separator to
  163. ** the one defined in the current locale and check again
  164. */
  165. static void trydecpoint (LexState *ls, SemInfo *seminfo) {
  166. char old = ls->decpoint;
  167. ls->decpoint = getlocaledecpoint();
  168. buffreplace(ls, old, ls->decpoint); /* try new decimal separator */
  169. if (!buff2d(ls->buff, &seminfo->r)) {
  170. /* format error with correct decimal point: no more options */
  171. buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */
  172. lexerror(ls, "malformed number", TK_FLT);
  173. }
  174. }
  175. /* LUA_NUMBER */
  176. /*
  177. ** this function is quite liberal in what it accepts, as 'luaO_str2d'
  178. ** will reject ill-formed numerals. 'isf' means the numeral is not
  179. ** an integer (it has a dot or an exponent).
  180. */
  181. static int read_numeral (LexState *ls, SemInfo *seminfo, int isf) {
  182. const char *expo = "Ee";
  183. int first = ls->current;
  184. lua_assert(lisdigit(ls->current));
  185. save_and_next(ls);
  186. if (first == '0' && check_next(ls, "Xx")) /* hexadecimal? */
  187. expo = "Pp";
  188. for (;;) {
  189. if (check_next(ls, expo)) { /* exponent part? */
  190. check_next(ls, "+-"); /* optional exponent sign */
  191. isf = 1;
  192. }
  193. if (lisxdigit(ls->current))
  194. save_and_next(ls);
  195. else if (ls->current == '.') {
  196. save_and_next(ls);
  197. isf = 1;
  198. }
  199. else break;
  200. }
  201. save(ls, '\0');
  202. if (!isf) {
  203. if (!luaO_str2int(luaZ_buffer(ls->buff), luaZ_bufflen(ls->buff) - 1,
  204. &seminfo->i))
  205. lexerror(ls, "malformed number", TK_INT);
  206. return TK_INT;
  207. }
  208. else {
  209. buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */
  210. if (!buff2d(ls->buff, &seminfo->r)) /* format error? */
  211. trydecpoint(ls, seminfo); /* try to update decimal point separator */
  212. return TK_FLT;
  213. }
  214. }
  215. /*
  216. ** skip a sequence '[=*[' or ']=*]' and return its number of '='s or
  217. ** -1 if sequence is malformed
  218. */
  219. static int skip_sep (LexState *ls) {
  220. int count = 0;
  221. int s = ls->current;
  222. lua_assert(s == '[' || s == ']');
  223. save_and_next(ls);
  224. while (ls->current == '=') {
  225. save_and_next(ls);
  226. count++;
  227. }
  228. return (ls->current == s) ? count : (-count) - 1;
  229. }
  230. static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
  231. save_and_next(ls); /* skip 2nd `[' */
  232. if (currIsNewline(ls)) /* string starts with a newline? */
  233. inclinenumber(ls); /* skip it */
  234. for (;;) {
  235. switch (ls->current) {
  236. case EOZ:
  237. lexerror(ls, (seminfo) ? "unfinished long string" :
  238. "unfinished long comment", TK_EOS);
  239. break; /* to avoid warnings */
  240. case ']': {
  241. if (skip_sep(ls) == sep) {
  242. save_and_next(ls); /* skip 2nd `]' */
  243. goto endloop;
  244. }
  245. break;
  246. }
  247. case '\n': case '\r': {
  248. save(ls, '\n');
  249. inclinenumber(ls);
  250. if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
  251. break;
  252. }
  253. default: {
  254. if (seminfo) save_and_next(ls);
  255. else next(ls);
  256. }
  257. }
  258. } endloop:
  259. if (seminfo)
  260. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
  261. luaZ_bufflen(ls->buff) - 2*(2 + sep));
  262. }
  263. static void escerror (LexState *ls, int *c, int n, const char *msg) {
  264. int i;
  265. luaZ_resetbuffer(ls->buff); /* prepare error message */
  266. save(ls, '\\');
  267. for (i = 0; i < n && c[i] != EOZ; i++)
  268. save(ls, c[i]);
  269. lexerror(ls, msg, TK_STRING);
  270. }
  271. static int readhexaesc (LexState *ls) {
  272. int c[3], i; /* keep input for error message */
  273. int r = 0; /* result accumulator */
  274. c[0] = 'x'; /* for error message */
  275. for (i = 1; i < 3; i++) { /* read two hexadecimal digits */
  276. c[i] = next(ls);
  277. if (!lisxdigit(c[i]))
  278. escerror(ls, c, i + 1, "hexadecimal digit expected");
  279. r = (r << 4) + luaO_hexavalue(c[i]);
  280. }
  281. return r;
  282. }
  283. static int readdecesc (LexState *ls) {
  284. int c[3], i;
  285. int r = 0; /* result accumulator */
  286. for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */
  287. c[i] = ls->current;
  288. r = 10*r + c[i] - '0';
  289. next(ls);
  290. }
  291. if (r > UCHAR_MAX)
  292. escerror(ls, c, i, "decimal escape too large");
  293. return r;
  294. }
  295. static void read_string (LexState *ls, int del, SemInfo *seminfo) {
  296. save_and_next(ls); /* keep delimiter (for error messages) */
  297. while (ls->current != del) {
  298. switch (ls->current) {
  299. case EOZ:
  300. lexerror(ls, "unfinished string", TK_EOS);
  301. break; /* to avoid warnings */
  302. case '\n':
  303. case '\r':
  304. lexerror(ls, "unfinished string", TK_STRING);
  305. break; /* to avoid warnings */
  306. case '\\': { /* escape sequences */
  307. int c; /* final character to be saved */
  308. next(ls); /* do not save the `\' */
  309. switch (ls->current) {
  310. case 'a': c = '\a'; goto read_save;
  311. case 'b': c = '\b'; goto read_save;
  312. case 'f': c = '\f'; goto read_save;
  313. case 'n': c = '\n'; goto read_save;
  314. case 'r': c = '\r'; goto read_save;
  315. case 't': c = '\t'; goto read_save;
  316. case 'v': c = '\v'; goto read_save;
  317. case 'x': c = readhexaesc(ls); goto read_save;
  318. case '\n': case '\r':
  319. inclinenumber(ls); c = '\n'; goto only_save;
  320. case '\\': case '\"': case '\'':
  321. c = ls->current; goto read_save;
  322. case EOZ: goto no_save; /* will raise an error next loop */
  323. case 'z': { /* zap following span of spaces */
  324. next(ls); /* skip the 'z' */
  325. while (lisspace(ls->current)) {
  326. if (currIsNewline(ls)) inclinenumber(ls);
  327. else next(ls);
  328. }
  329. goto no_save;
  330. }
  331. default: {
  332. if (!lisdigit(ls->current))
  333. escerror(ls, &ls->current, 1, "invalid escape sequence");
  334. /* digital escape \ddd */
  335. c = readdecesc(ls);
  336. goto only_save;
  337. }
  338. }
  339. read_save: next(ls); /* read next character */
  340. only_save: save(ls, c); /* save 'c' */
  341. no_save: break;
  342. }
  343. default:
  344. save_and_next(ls);
  345. }
  346. }
  347. save_and_next(ls); /* skip delimiter */
  348. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
  349. luaZ_bufflen(ls->buff) - 2);
  350. }
  351. static int llex (LexState *ls, SemInfo *seminfo) {
  352. luaZ_resetbuffer(ls->buff);
  353. for (;;) {
  354. switch (ls->current) {
  355. case '\n': case '\r': { /* line breaks */
  356. inclinenumber(ls);
  357. break;
  358. }
  359. case ' ': case '\f': case '\t': case '\v': { /* spaces */
  360. next(ls);
  361. break;
  362. }
  363. case '-': { /* '-' or '--' (comment) */
  364. next(ls);
  365. if (ls->current != '-') return '-';
  366. /* else is a comment */
  367. next(ls);
  368. if (ls->current == '[') { /* long comment? */
  369. int sep = skip_sep(ls);
  370. luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
  371. if (sep >= 0) {
  372. read_long_string(ls, NULL, sep); /* skip long comment */
  373. luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */
  374. break;
  375. }
  376. }
  377. /* else short comment */
  378. while (!currIsNewline(ls) && ls->current != EOZ)
  379. next(ls); /* skip until end of line (or end of file) */
  380. break;
  381. }
  382. case '[': { /* long string or simply '[' */
  383. int sep = skip_sep(ls);
  384. if (sep >= 0) {
  385. read_long_string(ls, seminfo, sep);
  386. return TK_STRING;
  387. }
  388. else if (sep == -1) return '[';
  389. else lexerror(ls, "invalid long string delimiter", TK_STRING);
  390. }
  391. case '=': {
  392. next(ls);
  393. if (ls->current != '=') return '=';
  394. else { next(ls); return TK_EQ; }
  395. }
  396. case '<': {
  397. next(ls);
  398. if (ls->current != '=') return '<';
  399. else { next(ls); return TK_LE; }
  400. }
  401. case '>': {
  402. next(ls);
  403. if (ls->current != '=') return '>';
  404. else { next(ls); return TK_GE; }
  405. }
  406. case '/': {
  407. next(ls);
  408. if (ls->current != '/') return '/';
  409. else { next(ls); return TK_IDIV; }
  410. }
  411. case '~': {
  412. next(ls);
  413. if (ls->current != '=') return '~';
  414. else { next(ls); return TK_NE; }
  415. }
  416. case ':': {
  417. next(ls);
  418. if (ls->current != ':') return ':';
  419. else { next(ls); return TK_DBCOLON; }
  420. }
  421. case '"': case '\'': { /* short literal strings */
  422. read_string(ls, ls->current, seminfo);
  423. return TK_STRING;
  424. }
  425. case '.': { /* '.', '..', '...', or number */
  426. save_and_next(ls);
  427. if (check_next(ls, ".")) {
  428. if (check_next(ls, "."))
  429. return TK_DOTS; /* '...' */
  430. else return TK_CONCAT; /* '..' */
  431. }
  432. else if (!lisdigit(ls->current)) return '.';
  433. else return read_numeral(ls, seminfo, 1);
  434. }
  435. case '0': case '1': case '2': case '3': case '4':
  436. case '5': case '6': case '7': case '8': case '9': {
  437. return read_numeral(ls, seminfo, 0);
  438. }
  439. case EOZ: {
  440. return TK_EOS;
  441. }
  442. default: {
  443. if (lislalpha(ls->current)) { /* identifier or reserved word? */
  444. TString *ts;
  445. do {
  446. save_and_next(ls);
  447. } while (lislalnum(ls->current));
  448. ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
  449. luaZ_bufflen(ls->buff));
  450. seminfo->ts = ts;
  451. if (isreserved(ts)) /* reserved word? */
  452. return ts->tsv.extra - 1 + FIRST_RESERVED;
  453. else {
  454. return TK_NAME;
  455. }
  456. }
  457. else { /* single-char tokens (+ - / ...) */
  458. int c = ls->current;
  459. next(ls);
  460. return c;
  461. }
  462. }
  463. }
  464. }
  465. }
  466. void luaX_next (LexState *ls) {
  467. ls->lastline = ls->linenumber;
  468. if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
  469. ls->t = ls->lookahead; /* use this one */
  470. ls->lookahead.token = TK_EOS; /* and discharge it */
  471. }
  472. else
  473. ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */
  474. }
  475. int luaX_lookahead (LexState *ls) {
  476. lua_assert(ls->lookahead.token == TK_EOS);
  477. ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
  478. return ls->lookahead.token;
  479. }