llex.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445
  1. /*
  2. ** $Id: llex.c,v 2.22 2006/08/30 13:19:58 roberto Exp roberto $
  3. ** Lexical Analyzer
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <ctype.h>
  7. #include <locale.h>
  8. #include <string.h>
  9. #define llex_c
  10. #define LUA_CORE
  11. #include "lua.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. 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. "..", "...", "==", ">=", "<=", "~=",
  29. "<number>", "<name>", "<string>", "<eof>",
  30. NULL
  31. };
  32. #define save_and_next(ls) (save(ls, ls->current), next(ls))
  33. static void save (LexState *ls, int c) {
  34. Mbuffer *b = ls->buff;
  35. if (b->n + 1 > b->buffsize) {
  36. size_t newsize;
  37. if (b->buffsize >= MAX_SIZET/2)
  38. luaX_lexerror(ls, "lexical element too long", 0);
  39. newsize = b->buffsize * 2;
  40. luaZ_resizebuffer(ls->L, b, newsize);
  41. }
  42. b->buffer[b->n++] = 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. #define MAXSRC 80
  54. const char *luaX_token2str (LexState *ls, int token) {
  55. if (token < FIRST_RESERVED) {
  56. lua_assert(token == cast(unsigned char, token));
  57. return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) :
  58. luaO_pushfstring(ls->L, "%c", token);
  59. }
  60. else
  61. return luaX_tokens[token-FIRST_RESERVED];
  62. }
  63. static const char *txtToken (LexState *ls, int token) {
  64. switch (token) {
  65. case TK_NAME:
  66. case TK_STRING:
  67. case TK_NUMBER:
  68. save(ls, '\0');
  69. return luaZ_buffer(ls->buff);
  70. default:
  71. return luaX_token2str(ls, token);
  72. }
  73. }
  74. void luaX_lexerror (LexState *ls, const char *msg, int token) {
  75. char buff[MAXSRC];
  76. luaO_chunkid(buff, getstr(ls->source), MAXSRC);
  77. msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
  78. if (token)
  79. luaO_pushfstring(ls->L, "%s near " LUA_QS, msg, txtToken(ls, token));
  80. luaD_throw(ls->L, LUA_ERRSYNTAX);
  81. }
  82. void luaX_syntaxerror (LexState *ls, const char *msg) {
  83. luaX_lexerror(ls, msg, ls->t.token);
  84. }
  85. TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
  86. lua_State *L = ls->L;
  87. TValue *o; /* entry for `str' */
  88. TString *ts = luaS_newlstr(L, str, l);
  89. setsvalue2s(L, L->top++, ts); /* anchor string */
  90. o = luaH_setstr(L, ls->fs->h, ts);
  91. if (ttisnil(o))
  92. setbvalue(o, 1); /* make sure `str' will not be collected */
  93. L->top--;
  94. return ts;
  95. }
  96. static void inclinenumber (LexState *ls) {
  97. int old = ls->current;
  98. lua_assert(currIsNewline(ls));
  99. next(ls); /* skip `\n' or `\r' */
  100. if (currIsNewline(ls) && ls->current != old)
  101. next(ls); /* skip `\n\r' or `\r\n' */
  102. if (++ls->linenumber >= MAX_INT)
  103. luaX_syntaxerror(ls, "chunk has too many lines");
  104. }
  105. void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
  106. ls->decpoint = '.';
  107. ls->L = L;
  108. ls->lookahead.token = TK_EOS; /* no look-ahead token */
  109. ls->z = z;
  110. ls->fs = NULL;
  111. ls->linenumber = 1;
  112. ls->lastline = 1;
  113. ls->source = source;
  114. luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */
  115. next(ls); /* read first char */
  116. }
  117. /*
  118. ** =======================================================
  119. ** LEXICAL ANALYZER
  120. ** =======================================================
  121. */
  122. static int check_next (LexState *ls, const char *set) {
  123. if (ls->current == '\0' || !strchr(set, ls->current))
  124. return 0;
  125. save_and_next(ls);
  126. return 1;
  127. }
  128. static void buffreplace (LexState *ls, char from, char to) {
  129. size_t n = luaZ_bufflen(ls->buff);
  130. char *p = luaZ_buffer(ls->buff);
  131. while (n--)
  132. if (p[n] == from) p[n] = to;
  133. }
  134. static void trydecpoint (LexState *ls, SemInfo *seminfo) {
  135. /* format error: try to update decimal point separator */
  136. struct lconv *cv = localeconv();
  137. char old = ls->decpoint;
  138. ls->decpoint = (cv ? cv->decimal_point[0] : '.');
  139. buffreplace(ls, old, ls->decpoint); /* try updated decimal separator */
  140. if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {
  141. /* format error with correct decimal point: no more options */
  142. buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */
  143. luaX_lexerror(ls, "malformed number", TK_NUMBER);
  144. }
  145. }
  146. /* LUA_NUMBER */
  147. static void read_numeral (LexState *ls, SemInfo *seminfo) {
  148. lua_assert(isdigit(ls->current));
  149. do {
  150. save_and_next(ls);
  151. } while (isdigit(ls->current) || ls->current == '.');
  152. if (check_next(ls, "Ee")) /* `E'? */
  153. check_next(ls, "+-"); /* optional exponent sign */
  154. while (isalnum(ls->current) || ls->current == '_')
  155. save_and_next(ls);
  156. save(ls, '\0');
  157. buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */
  158. if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) /* format error? */
  159. trydecpoint(ls, seminfo); /* try to update decimal point separator */
  160. }
  161. static int skip_sep (LexState *ls) {
  162. int count = 0;
  163. int s = ls->current;
  164. lua_assert(s == '[' || s == ']');
  165. save_and_next(ls);
  166. while (ls->current == '=') {
  167. save_and_next(ls);
  168. count++;
  169. }
  170. return (ls->current == s) ? count : (-count) - 1;
  171. }
  172. static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
  173. save_and_next(ls); /* skip 2nd `[' */
  174. if (currIsNewline(ls)) /* string starts with a newline? */
  175. inclinenumber(ls); /* skip it */
  176. for (;;) {
  177. switch (ls->current) {
  178. case EOZ:
  179. luaX_lexerror(ls, (seminfo) ? "unfinished long string" :
  180. "unfinished long comment", TK_EOS);
  181. break; /* to avoid warnings */
  182. case ']': {
  183. if (skip_sep(ls) == sep) {
  184. save_and_next(ls); /* skip 2nd `]' */
  185. goto endloop;
  186. }
  187. break;
  188. }
  189. case '\n':
  190. case '\r': {
  191. save(ls, '\n');
  192. inclinenumber(ls);
  193. if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
  194. break;
  195. }
  196. default: {
  197. if (seminfo) save_and_next(ls);
  198. else next(ls);
  199. }
  200. }
  201. } endloop:
  202. if (seminfo)
  203. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
  204. luaZ_bufflen(ls->buff) - 2*(2 + sep));
  205. }
  206. static void read_string (LexState *ls, int del, SemInfo *seminfo) {
  207. save_and_next(ls);
  208. while (ls->current != del) {
  209. switch (ls->current) {
  210. case EOZ:
  211. luaX_lexerror(ls, "unfinished string", TK_EOS);
  212. continue; /* to avoid warnings */
  213. case '\n':
  214. case '\r':
  215. luaX_lexerror(ls, "unfinished string", TK_STRING);
  216. continue; /* to avoid warnings */
  217. case '\\': {
  218. int c;
  219. next(ls); /* do not save the `\' */
  220. switch (ls->current) {
  221. case 'a': c = '\a'; break;
  222. case 'b': c = '\b'; break;
  223. case 'f': c = '\f'; break;
  224. case 'n': c = '\n'; break;
  225. case 'r': c = '\r'; break;
  226. case 't': c = '\t'; break;
  227. case 'v': c = '\v'; break;
  228. case '\n': /* go through */
  229. case '\r': save(ls, '\n'); inclinenumber(ls); continue;
  230. case EOZ: continue; /* will raise an error next loop */
  231. default: {
  232. if (!isdigit(ls->current))
  233. save_and_next(ls); /* handles \\, \", \', and \? */
  234. else { /* \xxx */
  235. int i = 0;
  236. c = 0;
  237. do {
  238. c = 10*c + (ls->current-'0');
  239. next(ls);
  240. } while (++i<3 && isdigit(ls->current));
  241. if (c > UCHAR_MAX)
  242. luaX_lexerror(ls, "escape sequence too large", TK_STRING);
  243. save(ls, c);
  244. }
  245. continue;
  246. }
  247. }
  248. save(ls, c);
  249. next(ls);
  250. continue;
  251. }
  252. default:
  253. save_and_next(ls);
  254. }
  255. }
  256. save_and_next(ls); /* skip delimiter */
  257. seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
  258. luaZ_bufflen(ls->buff) - 2);
  259. }
  260. static int llex (LexState *ls, SemInfo *seminfo) {
  261. luaZ_resetbuffer(ls->buff);
  262. for (;;) {
  263. switch (ls->current) {
  264. case '\n':
  265. case '\r': {
  266. inclinenumber(ls);
  267. continue;
  268. }
  269. case '-': {
  270. next(ls);
  271. if (ls->current != '-') return '-';
  272. /* else is a comment */
  273. next(ls);
  274. if (ls->current == '[') {
  275. int sep = skip_sep(ls);
  276. luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
  277. if (sep >= 0) {
  278. read_long_string(ls, NULL, sep); /* long comment */
  279. luaZ_resetbuffer(ls->buff);
  280. continue;
  281. }
  282. }
  283. /* else short comment */
  284. while (!currIsNewline(ls) && ls->current != EOZ)
  285. next(ls);
  286. continue;
  287. }
  288. case '[': {
  289. int sep = skip_sep(ls);
  290. if (sep >= 0) {
  291. read_long_string(ls, seminfo, sep);
  292. return TK_STRING;
  293. }
  294. else if (sep == -1) return '[';
  295. else luaX_lexerror(ls, "invalid long string delimiter", TK_STRING);
  296. }
  297. case '=': {
  298. next(ls);
  299. if (ls->current != '=') return '=';
  300. else { next(ls); return TK_EQ; }
  301. }
  302. case '<': {
  303. next(ls);
  304. if (ls->current != '=') return '<';
  305. else { next(ls); return TK_LE; }
  306. }
  307. case '>': {
  308. next(ls);
  309. if (ls->current != '=') return '>';
  310. else { next(ls); return TK_GE; }
  311. }
  312. case '~': {
  313. next(ls);
  314. if (ls->current != '=') return '~';
  315. else { next(ls); return TK_NE; }
  316. }
  317. case '"':
  318. case '\'': {
  319. read_string(ls, ls->current, seminfo);
  320. return TK_STRING;
  321. }
  322. case '.': {
  323. save_and_next(ls);
  324. if (check_next(ls, ".")) {
  325. if (check_next(ls, "."))
  326. return TK_DOTS; /* ... */
  327. else return TK_CONCAT; /* .. */
  328. }
  329. else if (!isdigit(ls->current)) return '.';
  330. else {
  331. read_numeral(ls, seminfo);
  332. return TK_NUMBER;
  333. }
  334. }
  335. case EOZ: {
  336. return TK_EOS;
  337. }
  338. default: {
  339. if (isspace(ls->current)) {
  340. lua_assert(!currIsNewline(ls));
  341. next(ls);
  342. continue;
  343. }
  344. else if (isdigit(ls->current)) {
  345. read_numeral(ls, seminfo);
  346. return TK_NUMBER;
  347. }
  348. else if (isalpha(ls->current) || ls->current == '_') {
  349. /* identifier or reserved word */
  350. TString *ts;
  351. do {
  352. save_and_next(ls);
  353. } while (isalnum(ls->current) || ls->current == '_');
  354. ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
  355. luaZ_bufflen(ls->buff));
  356. if (ts->tsv.reserved > 0) /* reserved word? */
  357. return ts->tsv.reserved - 1 + FIRST_RESERVED;
  358. else {
  359. seminfo->ts = ts;
  360. return TK_NAME;
  361. }
  362. }
  363. else {
  364. int c = ls->current;
  365. next(ls);
  366. return c; /* single-char tokens (+ - / ...) */
  367. }
  368. }
  369. }
  370. }
  371. }
  372. void luaX_next (LexState *ls) {
  373. ls->lastline = ls->linenumber;
  374. if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */
  375. ls->t = ls->lookahead; /* use this one */
  376. ls->lookahead.token = TK_EOS; /* and discharge it */
  377. }
  378. else
  379. ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */
  380. }
  381. void luaX_lookahead (LexState *ls) {
  382. lua_assert(ls->lookahead.token == TK_EOS);
  383. ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
  384. }