llex.c 13 KB

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