llex.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. /*
  2. ** $Id: llex.c,v 2.58 2011/08/15 19:41:58 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 "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.reserved = cast_byte(i+1); /* reserved word */
  50. }
  51. }
  52. const char *luaX_token2str (LexState *ls, int token) {
  53. if (token < FIRST_RESERVED) {
  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)
  61. return luaO_pushfstring(ls->L, LUA_QS, s);
  62. else
  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. static void read_numeral (LexState *ls, SemInfo *seminfo) {
  176. lua_assert(lisdigit(ls->current));
  177. do {
  178. save_and_next(ls);
  179. if (check_next(ls, "EePp")) /* exponent part? */
  180. check_next(ls, "+-"); /* optional exponent sign */
  181. } while (lislalnum(ls->current) || ls->current == '.');
  182. save(ls, '\0');
  183. buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */
  184. if (!buff2d(ls->buff, &seminfo->r)) /* format error? */
  185. trydecpoint(ls, seminfo); /* try to update decimal point separator */
  186. }
  187. /*
  188. ** skip a sequence '[=*[' or ']=*]' and return its number of '='s or
  189. ** -1 if sequence is malformed
  190. */
  191. static int skip_sep (LexState *ls) {
  192. int count = 0;
  193. int s = ls->current;
  194. lua_assert(s == '[' || s == ']');
  195. save_and_next(ls);
  196. while (ls->current == '=') {
  197. save_and_next(ls);
  198. count++;
  199. }
  200. return (ls->current == s) ? count : (-count) - 1;
  201. }
  202. static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
  203. save_and_next(ls); /* skip 2nd `[' */
  204. if (currIsNewline(ls)) /* string starts with a newline? */
  205. inclinenumber(ls); /* skip it */
  206. for (;;) {
  207. switch (ls->current) {
  208. case EOZ:
  209. lexerror(ls, (seminfo) ? "unfinished long string" :
  210. "unfinished long comment", TK_EOS);
  211. break; /* to avoid warnings */
  212. case ']': {
  213. if (skip_sep(ls) == sep) {
  214. save_and_next(ls); /* skip 2nd `]' */
  215. goto endloop;
  216. }
  217. break;
  218. }
  219. case '\n': case '\r': {
  220. save(ls, '\n');
  221. inclinenumber(ls);
  222. if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
  223. break;
  224. }
  225. default: {
  226. if (seminfo) save_and_next(ls);
  227. else next(ls);
  228. }
  229. }
  230. } endloop:
  231. if (seminfo)
  232. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
  233. luaZ_bufflen(ls->buff) - 2*(2 + sep));
  234. }
  235. static void escerror (LexState *ls, int *c, int n, const char *msg) {
  236. int i;
  237. luaZ_resetbuffer(ls->buff); /* prepare error message */
  238. save(ls, '\\');
  239. for (i = 0; i < n && c[i] != EOZ; i++)
  240. save(ls, c[i]);
  241. lexerror(ls, msg, TK_STRING);
  242. }
  243. static int readhexaesc (LexState *ls) {
  244. int c[3], i; /* keep input for error message */
  245. int r = 0; /* result accumulator */
  246. c[0] = 'x'; /* for error message */
  247. for (i = 1; i < 3; i++) { /* read two hexa digits */
  248. c[i] = next(ls);
  249. if (!lisxdigit(c[i]))
  250. escerror(ls, c, i + 1, "hexadecimal digit expected");
  251. r = (r << 4) + luaO_hexavalue(c[i]);
  252. }
  253. return r;
  254. }
  255. static int readdecesc (LexState *ls) {
  256. int c[3], i;
  257. int r = 0; /* result accumulator */
  258. for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */
  259. c[i] = ls->current;
  260. r = 10*r + c[i] - '0';
  261. next(ls);
  262. }
  263. if (r > UCHAR_MAX)
  264. escerror(ls, c, i, "decimal escape too large");
  265. return r;
  266. }
  267. static void read_string (LexState *ls, int del, SemInfo *seminfo) {
  268. save_and_next(ls); /* keep delimiter (for error messages) */
  269. while (ls->current != del) {
  270. switch (ls->current) {
  271. case EOZ:
  272. lexerror(ls, "unfinished string", TK_EOS);
  273. break; /* to avoid warnings */
  274. case '\n':
  275. case '\r':
  276. lexerror(ls, "unfinished string", TK_STRING);
  277. break; /* to avoid warnings */
  278. case '\\': { /* escape sequences */
  279. int c; /* final character to be saved */
  280. next(ls); /* do not save the `\' */
  281. switch (ls->current) {
  282. case 'a': c = '\a'; goto read_save;
  283. case 'b': c = '\b'; goto read_save;
  284. case 'f': c = '\f'; goto read_save;
  285. case 'n': c = '\n'; goto read_save;
  286. case 'r': c = '\r'; goto read_save;
  287. case 't': c = '\t'; goto read_save;
  288. case 'v': c = '\v'; goto read_save;
  289. case 'x': c = readhexaesc(ls); goto read_save;
  290. case '\n': case '\r':
  291. inclinenumber(ls); c = '\n'; goto only_save;
  292. case '\\': case '\"': case '\'':
  293. c = ls->current; goto read_save;
  294. case EOZ: goto no_save; /* will raise an error next loop */
  295. case 'z': { /* zap following span of spaces */
  296. next(ls); /* skip the 'z' */
  297. while (lisspace(ls->current)) {
  298. if (currIsNewline(ls)) inclinenumber(ls);
  299. else next(ls);
  300. }
  301. goto no_save;
  302. }
  303. default: {
  304. if (!lisdigit(ls->current))
  305. escerror(ls, &ls->current, 1, "invalid escape sequence");
  306. /* digital escape \ddd */
  307. c = readdecesc(ls);
  308. goto only_save;
  309. }
  310. }
  311. read_save: next(ls); /* read next character */
  312. only_save: save(ls, c); /* save 'c' */
  313. no_save: break;
  314. }
  315. default:
  316. save_and_next(ls);
  317. }
  318. }
  319. save_and_next(ls); /* skip delimiter */
  320. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
  321. luaZ_bufflen(ls->buff) - 2);
  322. }
  323. static int llex (LexState *ls, SemInfo *seminfo) {
  324. luaZ_resetbuffer(ls->buff);
  325. for (;;) {
  326. switch (ls->current) {
  327. case '\n': case '\r': { /* line breaks */
  328. inclinenumber(ls);
  329. break;
  330. }
  331. case ' ': case '\f': case '\t': case '\v': { /* spaces */
  332. next(ls);
  333. break;
  334. }
  335. case '-': { /* '-' or '--' (comment) */
  336. next(ls);
  337. if (ls->current != '-') return '-';
  338. /* else is a comment */
  339. next(ls);
  340. if (ls->current == '[') { /* long comment? */
  341. int sep = skip_sep(ls);
  342. luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
  343. if (sep >= 0) {
  344. read_long_string(ls, NULL, sep); /* skip long comment */
  345. luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */
  346. break;
  347. }
  348. }
  349. /* else short comment */
  350. while (!currIsNewline(ls) && ls->current != EOZ)
  351. next(ls); /* skip until end of line (or end of file) */
  352. break;
  353. }
  354. case '[': { /* long string or simply '[' */
  355. int sep = skip_sep(ls);
  356. if (sep >= 0) {
  357. read_long_string(ls, seminfo, sep);
  358. return TK_STRING;
  359. }
  360. else if (sep == -1) return '[';
  361. else lexerror(ls, "invalid long string delimiter", TK_STRING);
  362. }
  363. case '=': {
  364. next(ls);
  365. if (ls->current != '=') return '=';
  366. else { next(ls); return TK_EQ; }
  367. }
  368. case '<': {
  369. next(ls);
  370. if (ls->current != '=') return '<';
  371. else { next(ls); return TK_LE; }
  372. }
  373. case '>': {
  374. next(ls);
  375. if (ls->current != '=') return '>';
  376. else { next(ls); return TK_GE; }
  377. }
  378. case '~': {
  379. next(ls);
  380. if (ls->current != '=') return '~';
  381. else { next(ls); return TK_NE; }
  382. }
  383. case ':': {
  384. next(ls);
  385. if (ls->current != ':') return ':';
  386. else { next(ls); return TK_DBCOLON; }
  387. }
  388. case '"': case '\'': { /* short literal strings */
  389. read_string(ls, ls->current, seminfo);
  390. return TK_STRING;
  391. }
  392. case '.': { /* '.', '..', '...', or number */
  393. save_and_next(ls);
  394. if (check_next(ls, ".")) {
  395. if (check_next(ls, "."))
  396. return TK_DOTS; /* '...' */
  397. else return TK_CONCAT; /* '..' */
  398. }
  399. else if (!lisdigit(ls->current)) return '.';
  400. /* else go through */
  401. }
  402. case '0': case '1': case '2': case '3': case '4':
  403. case '5': case '6': case '7': case '8': case '9': {
  404. read_numeral(ls, seminfo);
  405. return TK_NUMBER;
  406. }
  407. case EOZ: {
  408. return TK_EOS;
  409. }
  410. default: {
  411. if (lislalpha(ls->current)) { /* identifier or reserved word? */
  412. TString *ts;
  413. do {
  414. save_and_next(ls);
  415. } while (lislalnum(ls->current));
  416. ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
  417. luaZ_bufflen(ls->buff));
  418. seminfo->ts = ts;
  419. if (ts->tsv.reserved > 0) /* reserved word? */
  420. return ts->tsv.reserved - 1 + FIRST_RESERVED;
  421. else {
  422. return TK_NAME;
  423. }
  424. }
  425. else { /* single-char tokens (+ - / ...) */
  426. int c = ls->current;
  427. next(ls);
  428. return c;
  429. }
  430. }
  431. }
  432. }
  433. }
  434. void luaX_next (LexState *ls) {
  435. ls->lastline = ls->linenumber;
  436. if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
  437. ls->t = ls->lookahead; /* use this one */
  438. ls->lookahead.token = TK_EOS; /* and discharge it */
  439. }
  440. else
  441. ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */
  442. }
  443. int luaX_lookahead (LexState *ls) {
  444. lua_assert(ls->lookahead.token == TK_EOS);
  445. ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
  446. return ls->lookahead.token;
  447. }