lua/llex.c

381 lines
9.5 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2000-10-20 20:39:03 +04:00
** $Id: llex.c,v 1.71 2000/09/27 17:41:58 roberto Exp roberto $
1999-02-26 00:07:26 +03:00
** Lexical Analyzer
1997-09-16 23:25:59 +04:00
** See Copyright Notice in lua.h
*/
1993-12-23 00:15:16 +03:00
#include <ctype.h>
1999-12-02 19:41:29 +03:00
#include <stdio.h>
#include <string.h>
1993-12-23 00:15:16 +03:00
#include "lua.h"
1997-09-16 23:25:59 +04:00
#include "llex.h"
#include "lmem.h"
#include "lobject.h"
#include "lparser.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
#include "lstring.h"
#include "ltable.h"
#include "luadebug.h"
1997-09-16 23:25:59 +04:00
#include "lzio.h"
1993-12-23 00:15:16 +03:00
2000-03-03 17:58:26 +03:00
#define next(LS) (LS->current = zgetc(LS->z))
1997-09-16 23:25:59 +04:00
1998-05-27 17:08:34 +04:00
1999-07-22 23:29:42 +04:00
/* ORDER RESERVED */
2000-04-05 21:51:58 +04:00
static const char *const token2string [] = {
2000-04-12 22:57:19 +04:00
"and", "break", "do", "else", "elseif", "end", "for",
1999-08-17 00:52:00 +04:00
"function", "if", "local", "nil", "not", "or", "repeat", "return", "then",
2000-02-08 19:39:42 +03:00
"until", "while", "", "..", "...", "==", ">=", "<=", "~=", "", "", "<eof>"};
1998-05-27 17:08:34 +04:00
1997-09-16 23:25:59 +04:00
void luaX_init (lua_State *L) {
2000-03-03 17:58:26 +03:00
int i;
2000-02-08 19:39:42 +03:00
for (i=0; i<NUM_RESERVED; i++) {
2000-03-10 21:37:44 +03:00
TString *ts = luaS_new(L, token2string[i]);
1999-10-19 17:33:22 +04:00
ts->marked = (unsigned char)(RESERVEDMARK+i); /* reserved word */
1998-05-27 17:08:34 +04:00
}
}
1999-05-14 16:24:04 +04:00
#define MAXSRC 80
2000-05-24 17:54:49 +04:00
void luaX_checklimit (LexState *ls, int val, int limit, const char *msg) {
if (val > limit) {
char buff[100];
sprintf(buff, "too many %.50s (limit=%d)", msg, limit);
luaX_error(ls, buff, ls->t.token);
2000-05-24 17:54:49 +04:00
}
}
1999-08-17 00:52:00 +04:00
void luaX_syntaxerror (LexState *ls, const char *s, const char *token) {
char buff[MAXSRC];
luaO_chunkid(buff, ls->source->str, sizeof(buff));
2000-10-20 20:39:03 +04:00
luaO_verror(ls->L, "%.99s;\n last token read: `%.30s' at line %d in %.80s",
s, token, ls->linenumber, buff);
1998-05-27 17:08:34 +04:00
}
2000-01-25 21:44:21 +03:00
void luaX_error (LexState *ls, const char *s, int token) {
char buff[TOKEN_LEN];
luaX_token2str(token, buff);
2000-09-11 21:38:42 +04:00
if (buff[0] == '\0')
luaX_syntaxerror(ls, s, ls->L->Mbuffer);
2000-01-25 21:44:21 +03:00
else
luaX_syntaxerror(ls, s, buff);
1998-05-27 17:08:34 +04:00
}
void luaX_token2str (int token, char *s) {
1999-12-14 21:33:29 +03:00
if (token < 256) {
s[0] = (char)token;
s[1] = '\0';
1997-09-16 23:25:59 +04:00
}
1998-05-27 17:08:34 +04:00
else
2000-02-08 19:39:42 +03:00
strcpy(s, token2string[token-FIRST_RESERVED]);
1998-05-27 17:08:34 +04:00
}
static void luaX_invalidchar (LexState *ls, int c) {
1999-05-14 16:24:04 +04:00
char buff[8];
1999-03-26 00:05:05 +03:00
sprintf(buff, "0x%02X", c);
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(ls, "invalid control char", buff);
1997-09-16 23:25:59 +04:00
}
2000-05-26 18:04:04 +04:00
static void inclinenumber (LexState *LS) {
next(LS); /* skip '\n' */
++LS->linenumber;
2000-05-24 17:54:49 +04:00
luaX_checklimit(LS, LS->linenumber, MAX_INT, "lines in a chunk");
2000-05-26 18:04:04 +04:00
}
2000-06-19 22:05:14 +04:00
void luaX_setinput (lua_State *L, LexState *LS, ZIO *z, TString *source) {
2000-05-26 18:04:04 +04:00
LS->L = L;
LS->lookahead.token = TK_EOS; /* no look-ahead token */
LS->z = z;
LS->fs = NULL;
LS->linenumber = 1;
2000-06-21 22:13:56 +04:00
LS->lastline = 1;
2000-06-19 22:05:14 +04:00
LS->source = source;
2000-05-26 18:04:04 +04:00
next(LS); /* read first char */
if (LS->current == '#') {
do { /* skip first line */
next(LS);
} while (LS->current != '\n' && LS->current != EOZ);
}
}
1997-09-16 23:25:59 +04:00
/*
** =======================================================
1999-12-14 21:33:29 +03:00
** LEXICAL ANALYZER
1997-09-16 23:25:59 +04:00
** =======================================================
*/
2000-09-11 21:38:42 +04:00
/* use Mbuffer to store names, literal strings and numbers */
#define EXTRABUFF 128
#define checkbuffer(L, n, len) if ((len)+(n) > L->Mbuffsize) \
luaO_openspace(L, (len)+(n)+EXTRABUFF)
#define save(L, c, l) (L->Mbuffer[l++] = (char)c)
#define save_and_next(L, LS, l) (save(L, LS->current, l), next(LS))
1997-09-16 23:25:59 +04:00
2000-09-11 21:38:42 +04:00
static const char *readname (LexState *LS) {
lua_State *L = LS->L;
size_t l = 0;
checkbuffer(L, 10, l);
do {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
} while (isalnum(LS->current) || LS->current == '_');
save(L, '\0', l);
return L->Mbuffer;
}
/* LUA_NUMBER */
static void read_number (LexState *LS, int comma, SemInfo *seminfo) {
2000-09-11 21:38:42 +04:00
lua_State *L = LS->L;
size_t l = 0;
checkbuffer(L, 10, l);
if (comma) save(L, '.', l);
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
if (LS->current == '.') {
save_and_next(L, LS, l);
if (LS->current == '.') {
save_and_next(L, LS, l);
save(L, '\0', l);
luaX_error(LS, "ambiguous syntax"
" (decimal point x string concatenation)", TK_NUMBER);
}
}
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
if (LS->current == 'e' || LS->current == 'E') {
save_and_next(L, LS, l); /* read 'E' */
if (LS->current == '+' || LS->current == '-')
save_and_next(L, LS, l); /* optional exponent sign */
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
}
save(L, '\0', l);
if (!luaO_str2d(L->Mbuffer, &seminfo->r))
2000-09-11 21:38:42 +04:00
luaX_error(LS, "malformed number", TK_NUMBER);
}
static void read_long_string (LexState *LS, SemInfo *seminfo) {
2000-09-11 21:38:42 +04:00
lua_State *L = LS->L;
int cont = 0;
2000-09-11 21:38:42 +04:00
size_t l = 0;
checkbuffer(L, 10, l);
save(L, '[', l); /* save first '[' */
save_and_next(L, LS, l); /* pass the second '[' */
1998-12-03 18:45:15 +03:00
for (;;) {
2000-09-11 21:38:42 +04:00
checkbuffer(L, 10, l);
switch (LS->current) {
1997-06-16 20:50:22 +04:00
case EOZ:
2000-09-11 21:38:42 +04:00
save(L, '\0', l);
2000-03-10 21:37:44 +03:00
luaX_error(LS, "unfinished long string", TK_STRING);
2000-01-25 21:44:21 +03:00
break; /* to avoid warnings */
case '[':
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
if (LS->current == '[') {
cont++;
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
}
continue;
case ']':
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
if (LS->current == ']') {
if (cont == 0) goto endloop;
cont--;
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
}
continue;
case '\n':
2000-09-11 21:38:42 +04:00
save(L, '\n', l);
2000-05-26 18:04:04 +04:00
inclinenumber(LS);
continue;
default:
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
}
} endloop:
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l); /* skip the second ']' */
save(L, '\0', l);
seminfo->ts = luaS_newlstr(L, L->Mbuffer+2, l-5);
2000-01-25 21:44:21 +03:00
}
static void read_string (LexState *LS, int del, SemInfo *seminfo) {
2000-09-11 21:38:42 +04:00
lua_State *L = LS->L;
size_t l = 0;
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
2000-01-25 21:44:21 +03:00
while (LS->current != del) {
2000-09-11 21:38:42 +04:00
checkbuffer(L, 10, l);
2000-01-25 21:44:21 +03:00
switch (LS->current) {
case EOZ: case '\n':
2000-09-11 21:38:42 +04:00
save(L, '\0', l);
2000-03-10 21:37:44 +03:00
luaX_error(LS, "unfinished string", TK_STRING);
2000-01-25 21:44:21 +03:00
break; /* to avoid warnings */
case '\\':
next(LS); /* do not save the '\' */
switch (LS->current) {
2000-09-11 21:38:42 +04:00
case 'a': save(L, '\a', l); next(LS); break;
case 'b': save(L, '\b', l); next(LS); break;
case 'f': save(L, '\f', l); next(LS); break;
case 'n': save(L, '\n', l); next(LS); break;
case 'r': save(L, '\r', l); next(LS); break;
case 't': save(L, '\t', l); next(LS); break;
case 'v': save(L, '\v', l); next(LS); break;
case '\n': save(L, '\n', l); inclinenumber(LS); break;
2000-01-25 21:44:21 +03:00
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9': {
int c = 0;
int i = 0;
do {
c = 10*c + (LS->current-'0');
next(LS);
} while (++i<3 && isdigit(LS->current));
2000-09-11 21:38:42 +04:00
if (c != (unsigned char)c) {
save(L, '\0', l);
2000-03-10 21:37:44 +03:00
luaX_error(LS, "escape sequence too large", TK_STRING);
2000-09-11 21:38:42 +04:00
}
save(L, c, l);
2000-01-25 21:44:21 +03:00
break;
}
default: /* handles \\, \", \', and \? */
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2000-01-25 21:44:21 +03:00
}
break;
default:
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2000-01-25 21:44:21 +03:00
}
}
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l); /* skip delimiter */
save(L, '\0', l);
seminfo->ts = luaS_newlstr(L, L->Mbuffer+1, l-3);
}
1997-09-16 23:25:59 +04:00
int luaX_lex (LexState *LS, SemInfo *seminfo) {
1998-12-03 18:45:15 +03:00
for (;;) {
switch (LS->current) {
1993-12-23 00:39:15 +03:00
2000-03-03 17:58:26 +03:00
case ' ': case '\t': case '\r': /* `\r' to avoid problems with DOS */
next(LS);
continue;
1994-09-22 16:44:00 +04:00
1998-01-09 17:44:55 +03:00
case '\n':
2000-05-26 18:04:04 +04:00
inclinenumber(LS);
1998-01-09 17:44:55 +03:00
continue;
2000-08-23 00:07:56 +04:00
case '$':
luaX_error(LS, "unexpected `$' (pragmas are no longer supported)", '$');
break;
1993-12-23 00:15:16 +03:00
case '-':
2000-01-25 21:44:21 +03:00
next(LS);
if (LS->current != '-') return '-';
do { next(LS); } while (LS->current != '\n' && LS->current != EOZ);
1993-12-23 00:15:16 +03:00
continue;
1994-09-22 16:44:00 +04:00
case '[':
2000-09-11 21:38:42 +04:00
next(LS);
if (LS->current != '[') return '[';
1997-09-16 23:25:59 +04:00
else {
read_long_string(LS, seminfo);
2000-03-10 21:37:44 +03:00
return TK_STRING;
}
case '=':
2000-01-25 21:44:21 +03:00
next(LS);
if (LS->current != '=') return '=';
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_EQ; }
1993-12-23 00:15:16 +03:00
case '<':
2000-01-25 21:44:21 +03:00
next(LS);
if (LS->current != '=') return '<';
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_LE; }
1994-09-22 16:44:00 +04:00
1993-12-23 00:15:16 +03:00
case '>':
2000-01-25 21:44:21 +03:00
next(LS);
if (LS->current != '=') return '>';
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_GE; }
1994-09-22 16:44:00 +04:00
1993-12-23 00:15:16 +03:00
case '~':
2000-01-25 21:44:21 +03:00
next(LS);
if (LS->current != '=') return '~';
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_NE; }
1993-12-23 00:15:16 +03:00
case '"':
2000-01-25 21:44:21 +03:00
case '\'':
read_string(LS, LS->current, seminfo);
2000-03-10 21:37:44 +03:00
return TK_STRING;
1993-12-23 00:15:16 +03:00
case '.':
2000-09-11 21:38:42 +04:00
next(LS);
2000-01-25 21:44:21 +03:00
if (LS->current == '.') {
next(LS);
if (LS->current == '.') {
next(LS);
2000-03-10 21:37:44 +03:00
return TK_DOTS; /* ... */
}
2000-04-07 17:11:49 +04:00
else return TK_CONCAT; /* .. */
1993-12-23 00:15:16 +03:00
}
else if (!isdigit(LS->current)) return '.';
2000-09-11 21:38:42 +04:00
else {
read_number(LS, 1, seminfo);
2000-09-11 21:38:42 +04:00
return TK_NUMBER;
}
1993-12-23 00:15:16 +03:00
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
read_number(LS, 0, seminfo);
2000-03-10 21:37:44 +03:00
return TK_NUMBER;
1994-11-13 17:39:04 +03:00
1997-06-16 20:50:22 +04:00
case EOZ:
2000-03-10 21:37:44 +03:00
return TK_EOS;
2000-01-25 21:44:21 +03:00
case '_': goto tname;
default:
2000-01-25 21:44:21 +03:00
if (!isalpha(LS->current)) {
int c = LS->current;
1998-05-27 17:08:34 +04:00
if (iscntrl(c))
luaX_invalidchar(LS, c);
2000-01-25 21:44:21 +03:00
next(LS);
return c;
1997-07-01 23:32:41 +04:00
}
2000-01-25 21:44:21 +03:00
tname: { /* identifier or reserved word */
2000-09-11 21:38:42 +04:00
TString *ts = luaS_new(LS->L, readname(LS));
if (ts->marked >= RESERVEDMARK) /* reserved word? */
return ts->marked-RESERVEDMARK+FIRST_RESERVED;
seminfo->ts = ts;
2000-03-10 21:37:44 +03:00
return TK_NAME;
1997-07-01 23:32:41 +04:00
}
1993-12-23 00:15:16 +03:00
}
}
}