lua/llex.c

416 lines
11 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2004-12-03 23:54:12 +03:00
** $Id: llex.c,v 2.8 2004/12/03 20:44:19 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>
#include <string.h>
1993-12-23 00:15:16 +03:00
2002-12-04 20:38:31 +03:00
#define llex_c
#define LUA_CORE
2002-12-04 20:38:31 +03:00
#include "lua.h"
#include "ldo.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
#define next(ls) (ls->current = zgetc(ls->z))
1997-09-16 23:25:59 +04:00
1997-09-16 23:25:59 +04:00
#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r')
1998-05-27 17:08:34 +04:00
1999-07-22 23:29:42 +04:00
/* ORDER RESERVED */
2004-12-02 15:59:10 +03:00
const char *const luaX_tokens [] = {
"and", "break", "do", "else", "elseif",
2002-09-03 15:57:38 +04:00
"end", "false", "for", "function", "if",
"in", "local", "nil", "not", "or", "repeat",
2004-12-03 23:54:12 +03:00
"return", "then", "true", "until", "while",
"..", "...", "==", ">=", "<=", "~=",
2004-12-03 23:54:12 +03:00
"<number>", "<name>", "<string>", "<eof>",
2004-12-02 15:59:10 +03:00
NULL
2001-02-23 20:17:25 +03:00
};
1998-05-27 17:08:34 +04:00
1997-09-16 23:25:59 +04:00
#define save_and_next(ls) (save(ls, ls->current), next(ls))
static void save (LexState *ls, int c) {
Mbuffer *b = ls->buff;
if (b->n + 1 > b->buffsize) {
size_t newsize;
if (b->buffsize >= MAX_SIZET/2)
luaX_lexerror(ls, "lexical element too long", 0);
newsize = b->buffsize * 2;
luaZ_resizebuffer(ls->L, b, newsize);
}
b->buffer[b->n++] = cast(char, c);
}
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++) {
2004-12-02 15:59:10 +03:00
TString *ts = luaS_new(L, luaX_tokens[i]);
luaS_fix(ts); /* reserved words are never collected */
2004-12-02 15:59:10 +03:00
lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);
ts->tsv.reserved = cast(lu_byte, i+1); /* 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
2003-09-05 00:00:28 +04:00
const char *luaX_token2str (LexState *ls, int token) {
if (token < FIRST_RESERVED) {
2004-11-24 22:16:03 +03:00
lua_assert(token == cast(unsigned char, token));
2003-09-05 00:00:28 +04:00
return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) :
luaO_pushfstring(ls->L, "%c", token);
}
else
2004-12-02 15:59:10 +03:00
return luaX_tokens[token-FIRST_RESERVED];
2003-09-05 00:00:28 +04:00
}
static const char *txtToken (LexState *ls, int token) {
switch (token) {
case TK_NAME:
case TK_STRING:
case TK_NUMBER:
save(ls, '\0');
2003-09-05 00:00:28 +04:00
return luaZ_buffer(ls->buff);
default:
2003-09-05 00:00:28 +04:00
return luaX_token2str(ls, token);
1997-09-16 23:25:59 +04:00
}
1998-05-27 17:08:34 +04:00
}
2004-03-12 22:53:56 +03:00
void luaX_lexerror (LexState *ls, const char *msg, int token) {
char buff[MAXSRC];
luaO_chunkid(buff, getstr(ls->source), MAXSRC);
2004-03-12 22:53:56 +03:00
msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
if (token)
luaO_pushfstring(ls->L, "%s near `%s'", msg, txtToken(ls, token));
luaD_throw(ls->L, LUA_ERRSYNTAX);
}
2003-09-05 00:00:28 +04:00
void luaX_syntaxerror (LexState *ls, const char *msg) {
luaX_lexerror(ls, msg, ls->t.token);
1997-09-16 23:25:59 +04:00
}
TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
lua_State *L = ls->L;
2003-08-28 01:01:44 +04:00
TString *ts = luaS_newlstr(L, str, l);
TValue *o = luaH_setstr(L, ls->fs->h, ts); /* entry for `str' */
2003-08-28 01:01:44 +04:00
if (ttisnil(o))
setbvalue(o, 1); /* make sure `str' will not be collected */
return ts;
}
static void inclinenumber (LexState *ls) {
int old = ls->current;
lua_assert(currIsNewline(ls));
next(ls); /* skip `\n' or `\r' */
if (currIsNewline(ls) && ls->current != old)
next(ls); /* skip `\n\r' or `\r\n' */
2004-03-12 22:53:56 +03:00
if (++ls->linenumber >= MAX_INT)
luaX_syntaxerror(ls, "chunk has too many lines");
2000-05-26 18:04:04 +04:00
}
void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
ls->L = L;
ls->lookahead.token = TK_EOS; /* no look-ahead token */
ls->z = z;
ls->fs = NULL;
ls->linenumber = 1;
ls->lastline = 1;
ls->source = source;
luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */
next(ls); /* read first char */
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
2000-09-11 21:38:42 +04:00
/* LUA_NUMBER */
static void read_numeral (LexState *ls, SemInfo *seminfo) {
while (isdigit(ls->current)) {
save_and_next(ls);
2000-09-11 21:38:42 +04:00
}
if (ls->current == '.') {
save_and_next(ls);
if (ls->current == '.') {
save_and_next(ls);
luaX_lexerror(ls,
"ambiguous syntax (decimal point x string concatenation)",
2001-02-23 20:17:25 +03:00
TK_NUMBER);
2000-09-11 21:38:42 +04:00
}
}
while (isdigit(ls->current)) {
save_and_next(ls);
2000-09-11 21:38:42 +04:00
}
if (ls->current == 'e' || ls->current == 'E') {
save_and_next(ls); /* read `E' */
if (ls->current == '+' || ls->current == '-')
save_and_next(ls); /* optional exponent sign */
while (isdigit(ls->current)) {
save_and_next(ls);
2000-09-11 21:38:42 +04:00
}
}
save(ls, '\0');
if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r))
luaX_lexerror(ls, "malformed number", TK_NUMBER);
2000-09-11 21:38:42 +04:00
}
static int skip_sep (LexState *ls) {
int count = 0;
int s = ls->current;
lua_assert(s == '[' || s == ']');
save_and_next(ls);
while (ls->current == '=') {
save_and_next(ls);
count++;
}
return (ls->current == s) ? count : (-count) - 1;
}
static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
int cont = 0;
save_and_next(ls); /* skip 2nd `[' */
if (currIsNewline(ls)) /* string starts with a newline? */
inclinenumber(ls); /* skip it */
1998-12-03 18:45:15 +03:00
for (;;) {
switch (ls->current) {
1997-06-16 20:50:22 +04:00
case EOZ:
luaX_lexerror(ls, (seminfo) ? "unfinished long string" :
2002-03-08 22:25:24 +03:00
"unfinished long comment", TK_EOS);
2000-01-25 21:44:21 +03:00
break; /* to avoid warnings */
case '[':
if (skip_sep(ls) == sep) {
save_and_next(ls); /* skip 2nd `[' */
cont++;
}
continue;
case ']':
if (skip_sep(ls) == sep) {
save_and_next(ls); /* skip 2nd `]' */
if (cont-- == 0) goto endloop;
}
continue;
case '\n':
case '\r':
save(ls, '\n');
inclinenumber(ls);
if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */
continue;
default:
if (seminfo) save_and_next(ls);
else next(ls);
}
} endloop:
2002-03-08 22:07:01 +03:00
if (seminfo)
seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
luaZ_bufflen(ls->buff) - 2*(2 + sep));
2000-01-25 21:44:21 +03:00
}
static void read_string (LexState *ls, int del, SemInfo *seminfo) {
save_and_next(ls);
while (ls->current != del) {
switch (ls->current) {
case EOZ:
luaX_lexerror(ls, "unfinished string", TK_EOS);
continue; /* to avoid warnings */
case '\n':
case '\r':
luaX_lexerror(ls, "unfinished string", TK_STRING);
continue; /* to avoid warnings */
case '\\': {
int c;
next(ls); /* do not save the `\' */
switch (ls->current) {
case 'a': c = '\a'; break;
case 'b': c = '\b'; break;
case 'f': c = '\f'; break;
case 'n': c = '\n'; break;
case 'r': c = '\r'; break;
case 't': c = '\t'; break;
case 'v': c = '\v'; break;
case '\n': /* go through */
case '\r': save(ls, '\n'); inclinenumber(ls); continue;
case EOZ: continue; /* will raise an error next loop */
2001-02-23 20:17:25 +03:00
default: {
if (!isdigit(ls->current))
save_and_next(ls); /* handles \\, \", \', and \? */
2001-02-23 20:17:25 +03:00
else { /* \xxx */
int i = 0;
c = 0;
2001-02-23 20:17:25 +03:00
do {
c = 10*c + (ls->current-'0');
next(ls);
} while (++i<3 && isdigit(ls->current));
if (c > UCHAR_MAX)
luaX_lexerror(ls, "escape sequence too large", TK_STRING);
save(ls, c);
2000-09-11 21:38:42 +04:00
}
continue;
2000-01-25 21:44:21 +03:00
}
}
save(ls, c);
next(ls);
continue;
}
2000-01-25 21:44:21 +03:00
default:
save_and_next(ls);
2000-01-25 21:44:21 +03:00
}
}
save_and_next(ls); /* skip delimiter */
seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
luaZ_bufflen(ls->buff) - 2);
}
1997-09-16 23:25:59 +04:00
int luaX_lex (LexState *ls, SemInfo *seminfo) {
luaZ_resetbuffer(ls->buff);
1998-12-03 18:45:15 +03:00
for (;;) {
switch (ls->current) {
case '\n':
case '\r': {
inclinenumber(ls);
1998-01-09 17:44:55 +03:00
continue;
}
case '-': {
next(ls);
if (ls->current != '-') return '-';
2002-03-08 22:07:01 +03:00
/* else is a comment */
next(ls);
if (ls->current == '[') {
int sep = skip_sep(ls);
luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */
if (sep >= 0) {
read_long_string(ls, NULL, sep); /* long comment */
luaZ_resetbuffer(ls->buff);
continue;
}
}
/* else short comment */
while (!currIsNewline(ls) && ls->current != EOZ)
next(ls);
1993-12-23 00:15:16 +03:00
continue;
}
case '[': {
int sep = skip_sep(ls);
if (sep >= 0) {
read_long_string(ls, seminfo, sep);
2000-03-10 21:37:44 +03:00
return TK_STRING;
}
else if (sep == -1) return '[';
else luaX_lexerror(ls, "invalid long string delimiter", TK_STRING);
}
case '=': {
next(ls);
if (ls->current != '=') return '=';
else { next(ls); return TK_EQ; }
}
case '<': {
next(ls);
if (ls->current != '=') return '<';
else { next(ls); return TK_LE; }
}
case '>': {
next(ls);
if (ls->current != '=') return '>';
else { next(ls); return TK_GE; }
}
case '~': {
next(ls);
if (ls->current != '=') return '~';
else { next(ls); return TK_NE; }
}
case '"':
case '\'': {
read_string(ls, ls->current, seminfo);
2000-03-10 21:37:44 +03:00
return TK_STRING;
}
case '.': {
save_and_next(ls);
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_numeral(ls, seminfo);
2000-09-11 21:38:42 +04:00
return TK_NUMBER;
}
}
case EOZ: {
2000-03-10 21:37:44 +03:00
return TK_EOS;
}
2001-02-23 20:17:25 +03:00
default: {
if (isspace(ls->current)) {
lua_assert(!currIsNewline(ls));
next(ls);
continue;
}
else if (isdigit(ls->current)) {
read_numeral(ls, seminfo);
2001-02-23 20:17:25 +03:00
return TK_NUMBER;
1997-07-01 23:32:41 +04:00
}
else if (isalpha(ls->current) || ls->current == '_') {
2001-02-23 20:17:25 +03:00
/* identifier or reserved word */
TString *ts;
do {
save_and_next(ls);
} while (isalnum(ls->current) || ls->current == '_');
ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
luaZ_bufflen(ls->buff));
if (ts->tsv.reserved > 0) /* reserved word? */
return ts->tsv.reserved - 1 + FIRST_RESERVED;
2003-09-05 00:00:28 +04:00
else {
seminfo->ts = ts;
return TK_NAME;
}
1997-07-01 23:32:41 +04:00
}
2001-02-23 20:17:25 +03:00
else {
int c = ls->current;
next(ls);
2001-02-23 20:17:25 +03:00
return c; /* single-char tokens (+ - / ...) */
}
}
1993-12-23 00:15:16 +03:00
}
}
}
#undef next