llex.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  1. /*
  2. ** $Id: llex.c,v 2.33 2009/05/18 17:28:04 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", "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 void 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. lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);
  50. ts->tsv.reserved = cast_byte(i+1); /* reserved word */
  51. }
  52. }
  53. const char *luaX_token2str (LexState *ls, int token) {
  54. if (token < FIRST_RESERVED) {
  55. lua_assert(token == cast(unsigned char, token));
  56. return (lisprint(token)) ? luaO_pushfstring(ls->L, LUA_QL("%c"), token) :
  57. luaO_pushfstring(ls->L, "char(%d)", token);
  58. }
  59. else {
  60. const char *s = luaX_tokens[token - FIRST_RESERVED];
  61. if (token < TK_EOS)
  62. return luaO_pushfstring(ls->L, LUA_QS, s);
  63. else
  64. return s;
  65. }
  66. }
  67. static const char *txtToken (LexState *ls, int token) {
  68. switch (token) {
  69. case TK_NAME:
  70. case TK_STRING:
  71. case TK_NUMBER:
  72. save(ls, '\0');
  73. return luaO_pushfstring(ls->L, LUA_QS, luaZ_buffer(ls->buff));
  74. default:
  75. return luaX_token2str(ls, token);
  76. }
  77. }
  78. static void lexerror (LexState *ls, const char *msg, int token) {
  79. char buff[LUA_IDSIZE];
  80. luaO_chunkid(buff, getstr(ls->source), LUA_IDSIZE);
  81. msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
  82. if (token)
  83. luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token));
  84. luaD_throw(ls->L, LUA_ERRSYNTAX);
  85. }
  86. void luaX_syntaxerror (LexState *ls, const char *msg) {
  87. lexerror(ls, msg, ls->t.token);
  88. }
  89. TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
  90. lua_State *L = ls->L;
  91. TValue *o; /* entry for `str' */
  92. TString *ts = luaS_newlstr(L, str, l);
  93. setsvalue2s(L, L->top++, ts); /* anchor string */
  94. o = luaH_setstr(L, ls->fs->h, ts);
  95. if (ttisnil(o)) {
  96. setbvalue(o, 1); /* make sure `str' will not be collected */
  97. luaC_checkGC(L);
  98. }
  99. L->top--;
  100. return ts;
  101. }
  102. static void inclinenumber (LexState *ls) {
  103. int old = ls->current;
  104. lua_assert(currIsNewline(ls));
  105. next(ls); /* skip `\n' or `\r' */
  106. if (currIsNewline(ls) && ls->current != old)
  107. next(ls); /* skip `\n\r' or `\r\n' */
  108. if (++ls->linenumber >= MAX_INT)
  109. luaX_syntaxerror(ls, "chunk has too many lines");
  110. }
  111. void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
  112. ls->decpoint = '.';
  113. ls->L = L;
  114. ls->lookahead.token = TK_EOS; /* no look-ahead token */
  115. ls->z = z;
  116. ls->fs = NULL;
  117. ls->linenumber = 1;
  118. ls->lastline = 1;
  119. ls->source = source;
  120. luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */
  121. next(ls); /* read first char */
  122. }
  123. /*
  124. ** =======================================================
  125. ** LEXICAL ANALYZER
  126. ** =======================================================
  127. */
  128. static int check_next (LexState *ls, const char *set) {
  129. if (ls->current == '\0' || !strchr(set, ls->current))
  130. return 0;
  131. save_and_next(ls);
  132. return 1;
  133. }
  134. static void buffreplace (LexState *ls, char from, char to) {
  135. size_t n = luaZ_bufflen(ls->buff);
  136. char *p = luaZ_buffer(ls->buff);
  137. while (n--)
  138. if (p[n] == from) p[n] = to;
  139. }
  140. #if !defined(getlocaledecpoint)
  141. #define getlocaledecpoint() (localeconv()->decimal_point[0])
  142. #endif
  143. static void trydecpoint (LexState *ls, SemInfo *seminfo) {
  144. /* format error: try to update decimal point separator */
  145. char old = ls->decpoint;
  146. ls->decpoint = getlocaledecpoint();
  147. buffreplace(ls, old, ls->decpoint); /* try updated decimal separator */
  148. if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {
  149. /* format error with correct decimal point: no more options */
  150. buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */
  151. lexerror(ls, "malformed number", TK_NUMBER);
  152. }
  153. }
  154. /* LUA_NUMBER */
  155. static void read_numeral (LexState *ls, SemInfo *seminfo) {
  156. lua_assert(lisdigit(ls->current));
  157. do {
  158. save_and_next(ls);
  159. } while (lisdigit(ls->current) || ls->current == '.');
  160. if (check_next(ls, "Ee")) /* `E'? */
  161. check_next(ls, "+-"); /* optional exponent sign */
  162. while (lislalnum(ls->current))
  163. save_and_next(ls);
  164. save(ls, '\0');
  165. buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */
  166. if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) /* format error? */
  167. trydecpoint(ls, seminfo); /* try to update decimal point separator */
  168. }
  169. static int skip_sep (LexState *ls) {
  170. int count = 0;
  171. int s = ls->current;
  172. lua_assert(s == '[' || s == ']');
  173. save_and_next(ls);
  174. while (ls->current == '=') {
  175. save_and_next(ls);
  176. count++;
  177. }
  178. return (ls->current == s) ? count : (-count) - 1;
  179. }
  180. static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
  181. save_and_next(ls); /* skip 2nd `[' */
  182. if (currIsNewline(ls)) /* string starts with a newline? */
  183. inclinenumber(ls); /* skip it */
  184. for (;;) {
  185. switch (ls->current) {
  186. case EOZ:
  187. lexerror(ls, (seminfo) ? "unfinished long string" :
  188. "unfinished long comment", TK_EOS);
  189. break; /* to avoid warnings */
  190. case ']': {
  191. if (skip_sep(ls) == sep) {
  192. save_and_next(ls); /* skip 2nd `]' */
  193. goto endloop;
  194. }
  195. break;
  196. }
  197. case '\n':
  198. case '\r': {
  199. save(ls, '\n');
  200. inclinenumber(ls);
  201. if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
  202. break;
  203. }
  204. default: {
  205. if (seminfo) save_and_next(ls);
  206. else next(ls);
  207. }
  208. }
  209. } endloop:
  210. if (seminfo)
  211. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
  212. luaZ_bufflen(ls->buff) - 2*(2 + sep));
  213. }
  214. static int hexavalue (int c) {
  215. if (lisdigit(c)) return c - '0';
  216. else if (lisupper(c)) return c - 'A' + 10;
  217. else return c - 'a' + 10;
  218. }
  219. static int readhexaesc (LexState *ls) {
  220. int c1, c2 = EOZ;
  221. if (!lisxdigit(c1 = next(ls)) || !lisxdigit(c2 = next(ls))) {
  222. luaZ_resetbuffer(ls->buff); /* prepare error message */
  223. save(ls, '\\'); save(ls, 'x');
  224. if (c1 != EOZ) save(ls, c1);
  225. if (c2 != EOZ) save(ls, c2);
  226. lexerror(ls, "hexadecimal digit expected", TK_STRING);
  227. }
  228. return (hexavalue(c1) << 4) + hexavalue(c2);
  229. }
  230. static int readdecesc (LexState *ls) {
  231. int c1 = ls->current, c2, c3;
  232. int c = c1 - '0';
  233. if (lisdigit(c2 = next(ls))) {
  234. c = 10*c + c2 - '0';
  235. if (lisdigit(c3 = next(ls))) {
  236. c = 10*c + c3 - '0';
  237. if (c > UCHAR_MAX) {
  238. luaZ_resetbuffer(ls->buff); /* prepare error message */
  239. save(ls, '\\');
  240. save(ls, c1); save(ls, c2); save(ls, c3);
  241. lexerror(ls, "decimal escape too large", TK_STRING);
  242. }
  243. return c;
  244. }
  245. }
  246. /* else, has read one character that was not a digit */
  247. zungetc(ls->z); /* return it to input stream */
  248. return c;
  249. }
  250. static void read_string (LexState *ls, int del, SemInfo *seminfo) {
  251. save_and_next(ls);
  252. while (ls->current != del) {
  253. switch (ls->current) {
  254. case EOZ:
  255. lexerror(ls, "unfinished string", TK_EOS);
  256. continue; /* to avoid warnings */
  257. case '\n':
  258. case '\r':
  259. lexerror(ls, "unfinished string", TK_STRING);
  260. continue; /* to avoid warnings */
  261. case '\\': { /* escape sequences */
  262. int c; /* final character to be saved */
  263. next(ls); /* do not save the `\' */
  264. switch (ls->current) {
  265. case 'a': c = '\a'; break;
  266. case 'b': c = '\b'; break;
  267. case 'f': c = '\f'; break;
  268. case 'n': c = '\n'; break;
  269. case 'r': c = '\r'; break;
  270. case 't': c = '\t'; break;
  271. case 'v': c = '\v'; break;
  272. case 'x': c = readhexaesc(ls); break;
  273. case '\n':
  274. case '\r': save(ls, '\n'); inclinenumber(ls); continue;
  275. case EOZ: continue; /* will raise an error next loop */
  276. default: {
  277. if (!lisdigit(ls->current))
  278. c = ls->current; /* handles \\, \", \', and \? */
  279. else /* digital escape \ddd */
  280. c = readdecesc(ls);
  281. break;
  282. }
  283. }
  284. next(ls);
  285. save(ls, c);
  286. continue;
  287. }
  288. default:
  289. save_and_next(ls);
  290. }
  291. }
  292. save_and_next(ls); /* skip delimiter */
  293. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
  294. luaZ_bufflen(ls->buff) - 2);
  295. }
  296. static int llex (LexState *ls, SemInfo *seminfo) {
  297. luaZ_resetbuffer(ls->buff);
  298. for (;;) {
  299. switch (ls->current) {
  300. case '\n':
  301. case '\r': {
  302. inclinenumber(ls);
  303. continue;
  304. }
  305. case '-': {
  306. next(ls);
  307. if (ls->current != '-') return '-';
  308. /* else is a comment */
  309. next(ls);
  310. if (ls->current == '[') {
  311. int sep = skip_sep(ls);
  312. luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
  313. if (sep >= 0) {
  314. read_long_string(ls, NULL, sep); /* long comment */
  315. luaZ_resetbuffer(ls->buff);
  316. continue;
  317. }
  318. }
  319. /* else short comment */
  320. while (!currIsNewline(ls) && ls->current != EOZ)
  321. next(ls);
  322. continue;
  323. }
  324. case '[': {
  325. int sep = skip_sep(ls);
  326. if (sep >= 0) {
  327. read_long_string(ls, seminfo, sep);
  328. return TK_STRING;
  329. }
  330. else if (sep == -1) return '[';
  331. else lexerror(ls, "invalid long string delimiter", TK_STRING);
  332. }
  333. case '=': {
  334. next(ls);
  335. if (ls->current != '=') return '=';
  336. else { next(ls); return TK_EQ; }
  337. }
  338. case '<': {
  339. next(ls);
  340. if (ls->current != '=') return '<';
  341. else { next(ls); return TK_LE; }
  342. }
  343. case '>': {
  344. next(ls);
  345. if (ls->current != '=') return '>';
  346. else { next(ls); return TK_GE; }
  347. }
  348. case '~': {
  349. next(ls);
  350. if (ls->current != '=') return '~';
  351. else { next(ls); return TK_NE; }
  352. }
  353. case '"':
  354. case '\'': {
  355. read_string(ls, ls->current, seminfo);
  356. return TK_STRING;
  357. }
  358. case '.': {
  359. save_and_next(ls);
  360. if (check_next(ls, ".")) {
  361. if (check_next(ls, "."))
  362. return TK_DOTS; /* ... */
  363. else return TK_CONCAT; /* .. */
  364. }
  365. else if (!lisdigit(ls->current)) return '.';
  366. else {
  367. read_numeral(ls, seminfo);
  368. return TK_NUMBER;
  369. }
  370. }
  371. case EOZ: {
  372. return TK_EOS;
  373. }
  374. default: {
  375. if (lisspace(ls->current)) {
  376. lua_assert(!currIsNewline(ls));
  377. next(ls);
  378. continue;
  379. }
  380. else if (lisdigit(ls->current)) {
  381. read_numeral(ls, seminfo);
  382. return TK_NUMBER;
  383. }
  384. else if (lislalpha(ls->current)) {
  385. /* identifier or reserved word */
  386. TString *ts;
  387. do {
  388. save_and_next(ls);
  389. } while (lislalnum(ls->current));
  390. ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
  391. luaZ_bufflen(ls->buff));
  392. if (ts->tsv.reserved > 0) /* reserved word? */
  393. return ts->tsv.reserved - 1 + FIRST_RESERVED;
  394. else {
  395. seminfo->ts = ts;
  396. return TK_NAME;
  397. }
  398. }
  399. else {
  400. int c = ls->current;
  401. next(ls);
  402. return c; /* single-char tokens (+ - / ...) */
  403. }
  404. }
  405. }
  406. }
  407. }
  408. void luaX_next (LexState *ls) {
  409. ls->lastline = ls->linenumber;
  410. if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
  411. ls->t = ls->lookahead; /* use this one */
  412. ls->lookahead.token = TK_EOS; /* and discharge it */
  413. }
  414. else
  415. ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */
  416. }
  417. int luaX_lookahead (LexState *ls) {
  418. lua_assert(ls->lookahead.token == TK_EOS);
  419. ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
  420. return ls->lookahead.token;
  421. }