lua/llex.c

392 lines
10 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2001-08-31 00:54:36 +04:00
** $Id: llex.c,v 1.89 2001/07/22 00:59:36 roberto Exp $
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
2001-03-26 18:31:49 +04:00
#define LUA_PRIVATE
#include "lua.h"
1997-09-16 23:25:59 +04:00
#include "llex.h"
#include "lobject.h"
#include "lparser.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
#include "lstring.h"
#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 */
2001-02-23 20:17:25 +03:00
static const l_char *const token2string [] = {
l_s("and"), l_s("break"), l_s("do"), l_s("else"), l_s("elseif"),
2001-06-21 01:07:57 +04:00
l_s("end"), l_s("for"), l_s("function"), l_s("global"), l_s("if"),
l_s("in"), l_s("local"), l_s("nil"), l_s("not"), l_s("or"), l_s("repeat"),
l_s("return"), l_s("then"), l_s("until"), l_s("while"), l_s(""),
l_s(".."), l_s("..."), l_s("=="), l_s(">="), l_s("<="), l_s("~="),
l_s(""), l_s(""), l_s("<eof>")
2001-02-23 20:17:25 +03:00
};
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]);
lua_assert(strlen(token2string[i])+1 <= TOKEN_LEN);
2001-08-31 23:46:07 +04:00
ts->tsv.marked = cast(unsigned short, 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
2001-02-23 20:17:25 +03:00
void luaX_checklimit (LexState *ls, int val, int limit, const l_char *msg) {
2000-05-24 17:54:49 +04:00
if (val > limit) {
2001-02-23 20:17:25 +03:00
l_char buff[90];
sprintf(buff, l_s("too many %.40s (limit=%d)"), msg, limit);
luaX_error(ls, buff, ls->t.token);
2000-05-24 17:54:49 +04:00
}
}
2001-02-23 20:17:25 +03:00
void luaX_syntaxerror (LexState *ls, const l_char *s, const l_char *token) {
l_char buff[MAXSRC];
luaO_chunkid(buff, getstr(ls->source), MAXSRC);
2001-02-23 20:17:25 +03:00
luaO_verror(ls->L,
l_s("%.99s;\n last token read: `%.30s' at line %d in %.80s"),
s, token, ls->linenumber, buff);
1998-05-27 17:08:34 +04:00
}
2001-02-23 20:17:25 +03:00
void luaX_error (LexState *ls, const l_char *s, int token) {
l_char buff[TOKEN_LEN];
2000-01-25 21:44:21 +03:00
luaX_token2str(token, buff);
2001-02-23 20:17:25 +03:00
if (buff[0] == l_c('\0'))
2001-08-31 23:46:07 +04:00
luaX_syntaxerror(ls, s, cast(l_char *, G(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
}
2001-02-23 20:17:25 +03:00
void luaX_token2str (int token, l_char *s) {
2001-08-31 00:54:36 +04:00
if (token < FIRST_RESERVED) {
lua_assert(token == (l_char)token);
2001-02-23 20:17:25 +03:00
s[0] = (l_char)token;
s[1] = l_c('\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) {
2001-02-23 20:17:25 +03:00
l_char buff[8];
sprintf(buff, l_s("0x%02X"), uchar(c));
luaX_syntaxerror(ls, l_s("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) {
2001-02-22 21:59:59 +03:00
next(LS); /* skip `\n' */
++LS->linenumber;
2001-02-23 20:17:25 +03:00
luaX_checklimit(LS, LS->linenumber, MAX_INT, l_s("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 */
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('#')) {
2000-05-26 18:04:04 +04:00
do { /* skip first line */
next(LS);
2001-02-23 20:17:25 +03:00
} while (LS->current != l_c('\n') && LS->current != EOZ);
2000-05-26 18:04:04 +04:00
}
}
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))*sizeof(l_char) > G(L)->Mbuffsize) \
luaO_openspace(L, (len)+(n)+EXTRABUFF, l_char)
2000-09-11 21:38:42 +04:00
2001-08-31 23:46:07 +04:00
#define save(L, c, l) (cast(l_char *, G(L)->Mbuffer)[l++] = (l_char)c)
2000-09-11 21:38:42 +04:00
#define save_and_next(L, LS, l) (save(L, LS->current, l), next(LS))
1997-09-16 23:25:59 +04:00
2001-01-10 20:41:50 +03:00
static size_t readname (LexState *LS) {
2000-09-11 21:38:42 +04:00
lua_State *L = LS->L;
size_t l = 0;
checkbuffer(L, 10, l);
do {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
2001-02-23 20:17:25 +03:00
} while (isalnum(LS->current) || LS->current == l_c('_'));
save(L, l_c('\0'), l);
2001-01-10 20:41:50 +03:00
return l-1;
2000-09-11 21:38:42 +04:00
}
/* 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);
2001-02-23 20:17:25 +03:00
if (comma) save(L, l_c('.'), l);
2000-09-11 21:38:42 +04:00
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('.')) {
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('.')) {
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2001-02-23 20:17:25 +03:00
save(L, l_c('\0'), l);
luaX_error(LS,
l_s("ambiguous syntax (decimal point x string concatenation)"),
TK_NUMBER);
2000-09-11 21:38:42 +04:00
}
}
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('e') || LS->current == l_c('E')) {
2001-02-22 21:59:59 +03:00
save_and_next(L, LS, l); /* read `E' */
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('+') || LS->current == l_c('-'))
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l); /* optional exponent sign */
while (isdigit(LS->current)) {
checkbuffer(L, 10, l);
save_and_next(L, LS, l);
}
}
2001-02-23 20:17:25 +03:00
save(L, l_c('\0'), l);
2001-08-31 23:46:07 +04:00
if (!luaO_str2d(cast(l_char *, G(L)->Mbuffer), &seminfo->r))
2001-02-23 20:17:25 +03:00
luaX_error(LS, l_s("malformed number"), TK_NUMBER);
2000-09-11 21:38:42 +04:00
}
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);
2001-02-23 20:17:25 +03:00
save(L, l_c('['), l); /* save first `[' */
2001-02-22 21:59:59 +03:00
save_and_next(L, LS, l); /* pass the second `[' */
2001-03-07 15:49:37 +03:00
if (LS->current == l_c('\n')) /* string starts with a newline? */
inclinenumber(LS); /* skip it */
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:
2001-02-23 20:17:25 +03:00
save(L, l_c('\0'), l);
luaX_error(LS, l_s("unfinished long string"), TK_STRING);
2000-01-25 21:44:21 +03:00
break; /* to avoid warnings */
2001-02-23 20:17:25 +03:00
case l_c('['):
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('[')) {
cont++;
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
}
continue;
2001-02-23 20:17:25 +03:00
case l_c(']'):
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
2001-02-23 20:17:25 +03:00
if (LS->current == l_c(']')) {
if (cont == 0) goto endloop;
cont--;
2000-09-11 21:38:42 +04:00
save_and_next(L, LS, l);
}
continue;
2001-02-23 20:17:25 +03:00
case l_c('\n'):
save(L, l_c('\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:
2001-02-22 21:59:59 +03:00
save_and_next(L, LS, l); /* skip the second `]' */
2001-02-23 20:17:25 +03:00
save(L, l_c('\0'), l);
2001-08-31 23:46:07 +04:00
seminfo->ts = luaS_newlstr(L, cast(l_char *, G(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) {
2001-02-23 20:17:25 +03:00
case EOZ: case l_c('\n'):
save(L, l_c('\0'), l);
luaX_error(LS, l_s("unfinished string"), TK_STRING);
2000-01-25 21:44:21 +03:00
break; /* to avoid warnings */
2001-02-23 20:17:25 +03:00
case l_c('\\'):
2001-02-22 21:59:59 +03:00
next(LS); /* do not save the `\' */
2000-01-25 21:44:21 +03:00
switch (LS->current) {
2001-02-23 20:17:25 +03:00
case l_c('a'): save(L, l_c('\a'), l); next(LS); break;
case l_c('b'): save(L, l_c('\b'), l); next(LS); break;
case l_c('f'): save(L, l_c('\f'), l); next(LS); break;
case l_c('n'): save(L, l_c('\n'), l); next(LS); break;
case l_c('r'): save(L, l_c('\r'), l); next(LS); break;
case l_c('t'): save(L, l_c('\t'), l); next(LS); break;
case l_c('v'): save(L, l_c('\v'), l); next(LS); break;
case l_c('\n'): save(L, l_c('\n'), l); inclinenumber(LS); break;
default: {
if (!isdigit(LS->current))
save_and_next(L, LS, l); /* handles \\, \", \', and \? */
else { /* \xxx */
int c = 0;
int i = 0;
do {
c = 10*c + (LS->current-l_c('0'));
next(LS);
} while (++i<3 && isdigit(LS->current));
if (c > UCHAR_MAX) {
save(L, l_c('\0'), l);
luaX_error(LS, l_s("escape sequence too large"), TK_STRING);
}
save(L, c, l);
2000-09-11 21:38:42 +04:00
}
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 */
2001-02-23 20:17:25 +03:00
save(L, l_c('\0'), l);
2001-08-31 23:46:07 +04:00
seminfo->ts = luaS_newlstr(L, cast(l_char *, G(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
2001-02-23 20:17:25 +03:00
case l_c(' '): case l_c('\t'): case l_c('\r'): /* `\r' to avoid problems with DOS */
next(LS);
continue;
1994-09-22 16:44:00 +04:00
2001-02-23 20:17:25 +03:00
case l_c('\n'):
2000-05-26 18:04:04 +04:00
inclinenumber(LS);
1998-01-09 17:44:55 +03:00
continue;
2001-02-23 20:17:25 +03:00
case l_c('$'):
luaX_error(LS,
l_s("unexpected `$' (pragmas are no longer supported)"),
LS->current);
2000-08-23 00:07:56 +04:00
break;
2001-02-23 20:17:25 +03:00
case l_c('-'):
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('-')) return l_c('-');
do { next(LS); } while (LS->current != l_c('\n') && LS->current != EOZ);
1993-12-23 00:15:16 +03:00
continue;
1994-09-22 16:44:00 +04:00
2001-02-23 20:17:25 +03:00
case l_c('['):
2000-09-11 21:38:42 +04:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('[')) return l_c('[');
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;
}
2001-02-23 20:17:25 +03:00
case l_c('='):
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('=')) return l_c('=');
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_EQ; }
2001-02-23 20:17:25 +03:00
case l_c('<'):
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('=')) return l_c('<');
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_LE; }
1994-09-22 16:44:00 +04:00
2001-02-23 20:17:25 +03:00
case l_c('>'):
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('=')) return l_c('>');
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_GE; }
1994-09-22 16:44:00 +04:00
2001-02-23 20:17:25 +03:00
case l_c('~'):
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current != l_c('=')) return l_c('~');
2000-03-10 21:37:44 +03:00
else { next(LS); return TK_NE; }
1993-12-23 00:15:16 +03:00
2001-02-23 20:17:25 +03:00
case l_c('"'):
case l_c('\''):
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
2001-02-23 20:17:25 +03:00
case l_c('.'):
2000-09-11 21:38:42 +04:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('.')) {
2000-01-25 21:44:21 +03:00
next(LS);
2001-02-23 20:17:25 +03:00
if (LS->current == l_c('.')) {
2000-01-25 21:44:21 +03:00
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
}
2001-02-23 20:17:25 +03:00
else if (!isdigit(LS->current)) return l_c('.');
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
1997-06-16 20:50:22 +04:00
case EOZ:
2000-03-10 21:37:44 +03:00
return TK_EOS;
2001-02-23 20:17:25 +03:00
default: {
if (isdigit(LS->current)) {
read_number(LS, 0, seminfo);
return TK_NUMBER;
1997-07-01 23:32:41 +04:00
}
2001-02-23 20:17:25 +03:00
else if (isalpha(LS->current) || LS->current == l_c('_')) {
/* identifier or reserved word */
2001-01-10 20:41:50 +03:00
size_t l = readname(LS);
2001-08-31 23:46:07 +04:00
TString *ts = luaS_newlstr(LS->L, cast(l_char *, G(LS->L)->Mbuffer), l);
if (ts->tsv.marked >= RESERVEDMARK) /* reserved word? */
return ts->tsv.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
}
2001-02-23 20:17:25 +03:00
else {
2001-07-22 04:59:36 +04:00
l_charint c = LS->current;
2001-02-23 20:17:25 +03:00
if (iscntrl(c))
luaX_invalidchar(LS, c);
next(LS);
return c; /* single-char tokens (+ - / ...) */
}
}
1993-12-23 00:15:16 +03:00
}
}
}