llex.c 15 KB

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