lua/llex.c

447 lines
12 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2000-04-07 17:11:49 +04:00
** $Id: llex.c,v 1.55 2000/04/05 17:51: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
#define LUA_REENTRANT
#include "lauxlib.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 "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
#define save(L, c) luaL_addchar(L, c)
#define save_and_next(L, LS) (save(L, LS->current), next(LS))
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 [] = {
"and", "break", "do", "else", "elseif", "end",
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
1999-08-17 00:52:00 +04:00
void luaX_syntaxerror (LexState *ls, const char *s, const char *token) {
char buff[MAXSRC];
2000-03-03 17:58:26 +03:00
luaL_chunkid(buff, zname(ls->z), sizeof(buff));
luaL_verror(ls->L, "%.100s;\n last token read: `%.50s' 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);
if (buff[0] == '\0') {
save(ls->L, '\0');
luaX_syntaxerror(ls, s, luaL_buffer(ls->L));
}
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
}
static void firstline (LexState *LS)
{
2000-03-03 17:58:26 +03:00
int c = zgetc(LS->z);
if (c == '#')
2000-03-03 17:58:26 +03:00
while ((c=zgetc(LS->z)) != '\n' && c != EOZ) /* skip first line */;
zungetc(LS->z);
}
void luaX_setinput (lua_State *L, LexState *LS, ZIO *z) {
LS->L = L;
LS->current = '\n';
LS->linenumber = 0;
LS->iflevel = 0;
LS->ifstate[0].skip = 0;
LS->ifstate[0].elsepart = 1; /* to avoid a free $else */
2000-03-03 17:58:26 +03:00
LS->z = z;
1998-05-27 17:08:34 +04:00
LS->fs = NULL;
firstline(LS);
luaL_resetbuffer(L);
1993-12-23 00:15:16 +03:00
}
/*
1997-09-16 23:25:59 +04:00
** =======================================================
** PRAGMAS
** =======================================================
*/
1999-05-14 16:24:04 +04:00
static void skipspace (LexState *LS) {
while (LS->current == ' ' || LS->current == '\t' || LS->current == '\r')
next(LS);
}
static int checkcond (lua_State *L, LexState *LS, const char *buff) {
1999-08-17 00:52:00 +04:00
static const char *const opts[] = {"nil", "1", NULL};
int i = luaL_findstring(buff, opts);
if (i >= 0) return i;
else if (isalpha((unsigned char)buff[0]) || buff[0] == '_')
return luaS_globaldefined(L, buff);
else {
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "invalid $if condition", buff);
return 0; /* to avoid warnings */
}
}
1999-05-14 16:24:04 +04:00
static void readname (LexState *LS, char *buff) {
int i = 0;
skipspace(LS);
while (isalnum(LS->current) || LS->current == '_') {
if (i >= PRAGMASIZE) {
buff[PRAGMASIZE] = 0;
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "pragma too long", buff);
}
buff[i++] = (char)LS->current;
next(LS);
}
buff[i] = 0;
}
static void inclinenumber (lua_State *L, LexState *LS);
static void ifskip (lua_State *L, LexState *LS) {
while (LS->ifstate[LS->iflevel].skip) {
if (LS->current == '\n')
inclinenumber(L, LS);
else if (LS->current == EOZ)
2000-03-10 21:37:44 +03:00
luaX_error(LS, "input ends inside a $if", TK_EOS);
else next(LS);
}
}
static void inclinenumber (lua_State *L, LexState *LS) {
1999-08-17 00:52:00 +04:00
static const char *const pragmas [] =
{"debug", "nodebug", "endinput", "end", "ifnot", "if", "else", NULL};
next(LS); /* skip '\n' */
++LS->linenumber;
if (LS->current == '$') { /* is a pragma? */
char buff[PRAGMASIZE+1];
int ifnot = 0;
int skip = LS->ifstate[LS->iflevel].skip;
next(LS); /* skip $ */
readname(LS, buff);
switch (luaL_findstring(buff, pragmas)) {
case 0: /* debug */
if (!skip) L->debug = 1;
break;
case 1: /* nodebug */
if (!skip) L->debug = 0;
break;
case 2: /* endinput */
if (!skip) {
LS->current = EOZ;
LS->iflevel = 0; /* to allow $endinput inside a $if */
}
break;
case 3: /* end */
if (LS->iflevel-- == 0)
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "unmatched $end", "$end");
break;
case 4: /* ifnot */
ifnot = 1;
/* go through */
case 5: /* if */
if (LS->iflevel == MAX_IFS-1)
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "too many nested $ifs", "$if");
readname(LS, buff);
LS->iflevel++;
LS->ifstate[LS->iflevel].elsepart = 0;
LS->ifstate[LS->iflevel].condition = checkcond(L, LS, buff) ? !ifnot : ifnot;
LS->ifstate[LS->iflevel].skip = skip || !LS->ifstate[LS->iflevel].condition;
break;
case 6: /* else */
if (LS->ifstate[LS->iflevel].elsepart)
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "unmatched $else", "$else");
LS->ifstate[LS->iflevel].elsepart = 1;
LS->ifstate[LS->iflevel].skip = LS->ifstate[LS->iflevel-1].skip ||
LS->ifstate[LS->iflevel].condition;
1997-04-14 23:08:09 +04:00
break;
default:
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "unknown pragma", buff);
}
skipspace(LS);
if (LS->current == '\n') /* pragma must end with a '\n' ... */
inclinenumber(L, LS);
else if (LS->current != EOZ) /* or eof */
1998-05-27 17:08:34 +04:00
luaX_syntaxerror(LS, "invalid pragma format", buff);
ifskip(L, LS);
}
}
1993-12-23 00:15:16 +03:00
1997-09-16 23:25:59 +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-01-25 21:44:21 +03:00
static void read_long_string (lua_State *L, LexState *LS) {
int cont = 0;
1998-12-03 18:45:15 +03:00
for (;;) {
switch (LS->current) {
1997-06-16 20:50:22 +04:00
case EOZ:
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 '[':
save_and_next(L, LS);
if (LS->current == '[') {
cont++;
save_and_next(L, LS);
}
continue;
case ']':
save_and_next(L, LS);
if (LS->current == ']') {
if (cont == 0) goto endloop;
cont--;
save_and_next(L, LS);
}
continue;
case '\n':
save(L, '\n');
inclinenumber(L, LS);
continue;
default:
save_and_next(L, LS);
}
} endloop:
save_and_next(L, LS); /* skip the second ']' */
LS->seminfo.ts = luaS_newlstr(L, L->Mbuffer+(L->Mbuffbase+2),
L->Mbuffnext-L->Mbuffbase-4);
2000-01-25 21:44:21 +03:00
}
static void read_string (lua_State *L, LexState *LS, int del) {
save_and_next(L, LS);
while (LS->current != del) {
switch (LS->current) {
case EOZ: case '\n':
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) {
case 'a': save(L, '\a'); next(LS); break;
case 'b': save(L, '\b'); next(LS); break;
case 'f': save(L, '\f'); next(LS); break;
case 'n': save(L, '\n'); next(LS); break;
case 'r': save(L, '\r'); next(LS); break;
case 't': save(L, '\t'); next(LS); break;
case 'v': save(L, '\v'); next(LS); break;
case '\n': save(L, '\n'); inclinenumber(L, LS); break;
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));
if (c != (unsigned char)c)
2000-03-10 21:37:44 +03:00
luaX_error(LS, "escape sequence too large", TK_STRING);
2000-01-25 21:44:21 +03:00
save(L, c);
break;
}
default: /* handles \\, \", \', and \? */
save(L, LS->current);
next(LS);
}
break;
default:
save_and_next(L, LS);
}
}
save_and_next(L, LS); /* skip delimiter */
LS->seminfo.ts = luaS_newlstr(L, L->Mbuffer+(L->Mbuffbase+1),
L->Mbuffnext-L->Mbuffbase-2);
}
1997-09-16 23:25:59 +04:00
1998-05-27 17:08:34 +04:00
int luaX_lex (LexState *LS) {
lua_State *L = LS->L;
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':
inclinenumber(L, LS);
1998-01-09 17:44:55 +03:00
continue;
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 '[':
luaL_resetbuffer(L);
save_and_next(L, LS);
if (LS->current != '[') return '[';
1997-09-16 23:25:59 +04:00
else {
save_and_next(L, LS); /* pass the second '[' */
2000-01-25 21:44:21 +03:00
read_long_string(L, LS);
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 '\'':
luaL_resetbuffer(L);
2000-01-25 21:44:21 +03:00
read_string(L, LS, LS->current);
2000-03-10 21:37:44 +03:00
return TK_STRING;
1993-12-23 00:15:16 +03:00
case '.':
luaL_resetbuffer(L);
save_and_next(L, 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 '.';
else goto fraction; /* LS->current is a digit */
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':
luaL_resetbuffer(L);
do {
save_and_next(L, LS);
} while (isdigit(LS->current));
if (LS->current == '.') {
save_and_next(L, LS);
if (LS->current == '.') {
save(L, '.');
2000-01-25 21:44:21 +03:00
luaX_error(LS, "ambiguous syntax"
2000-03-10 21:37:44 +03:00
" (decimal point x string concatenation)", TK_NUMBER);
1997-09-16 23:25:59 +04:00
}
}
1999-07-22 23:29:42 +04:00
fraction: /* LUA_NUMBER */
while (isdigit(LS->current))
save_and_next(L, LS);
2000-01-25 21:44:21 +03:00
if (LS->current == 'e' || LS->current == 'E') {
save_and_next(L, LS); /* read 'E' */
if (LS->current == '+' || LS->current == '-')
1999-12-30 15:40:29 +03:00
save_and_next(L, LS); /* optional exponent sign */
while (isdigit(LS->current))
save_and_next(L, LS);
1993-12-23 00:15:16 +03:00
}
save(L, '\0');
if (!luaO_str2d(L->Mbuffer+L->Mbuffbase, &LS->seminfo.r))
2000-03-10 21:37:44 +03:00
luaX_error(LS, "malformed number", TK_NUMBER);
return TK_NUMBER;
1994-11-13 17:39:04 +03:00
1997-06-16 20:50:22 +04:00
case EOZ:
if (LS->iflevel > 0)
2000-03-10 21:37:44 +03:00
luaX_error(LS, "input ends inside a $if", TK_EOS);
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-03-10 21:37:44 +03:00
TString *ts;
luaL_resetbuffer(L);
1997-07-01 23:32:41 +04:00
do {
save_and_next(L, LS);
} while (isalnum(LS->current) || LS->current == '_');
save(L, '\0');
ts = luaS_new(L, L->Mbuffer+L->Mbuffbase);
if (ts->marked >= RESERVEDMARK) /* reserved word? */
return ts->marked-RESERVEDMARK+FIRST_RESERVED;
1998-05-27 17:08:34 +04:00
LS->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
}
}
}