rusefi
/
lua
mirror of https://github.com/rusefi/lua.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

no more pragmas

This commit is contained in:
Roberto Ierusalimschy 2000-05-26 11:04:04 -03:00
parent ed94a85f0c
commit c39345fba3
3 changed files with 46 additions and 172 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

189
llex.c
View File

@ -1,5 +1,5 @@
/* /*
** $Id: llex.c,v 1.60 2000/05/24 18:04:17 roberto Exp roberto $ ** $Id: llex.c,v 1.61 2000/05/25 18:59:59 roberto Exp roberto $
** Lexical Analyzer ** Lexical Analyzer
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/ */
@ -96,149 +96,53 @@ static void luaX_invalidchar (LexState *ls, int c) {
} }
static void firstline (LexState *LS) static const char *readname (lua_State *L, LexState *LS) {
{ luaL_resetbuffer(L);
int c = zgetc(LS->z); do {
if (c == '#') save_and_next(L, LS);
while ((c=zgetc(LS->z)) != '\n' && c != EOZ) /* skip first line */; } while (isalnum(LS->current) || LS->current == '_');
zungetc(LS->z); save(L, '\0');
return L->Mbuffer+L->Mbuffbase;
}
static void inclinenumber (LexState *LS) {
next(LS); /* skip '\n' */
++LS->linenumber;
luaX_checklimit(LS, LS->linenumber, MAX_INT, "lines in a chunk");
}
static void checkpragma (lua_State *L, LexState *LS) {
static const char *const pragmas [] = {"debug", "nodebug", NULL};
if (LS->current == '$') { /* is a pragma? */
switch (luaL_findstring(readname(L, LS)+1, pragmas)) {
case 0: /* debug */
L->debug = 1;
break;
case 1: /* nodebug */
L->debug = 0;
break;
default:
luaX_error(LS, "unknown pragma", TK_STRING);
}
}
} }
void luaX_setinput (lua_State *L, LexState *LS, ZIO *z) { void luaX_setinput (lua_State *L, LexState *LS, ZIO *z) {
LS->L = L; LS->L = L;
LS->current = '\n';
LS->lookahead.token = TK_EOS; /* no look-ahead token */ LS->lookahead.token = TK_EOS; /* no look-ahead token */
LS->linenumber = 0;
LS->iflevel = 0;
LS->ifstate[0].skip = 0;
LS->ifstate[0].elsepart = 1; /* to avoid a free $else */
LS->z = z; LS->z = z;
LS->fs = NULL; LS->fs = NULL;
firstline(LS); LS->linenumber = 1;
luaL_resetbuffer(L); next(LS); /* read first char */
} if (LS->current == '#') {
do { /* skip first line */
/*
** =======================================================
** PRAGMAS
** =======================================================
*/
static void skipspace (LexState *LS) {
while (LS->current == ' ' || LS->current == '\t' || LS->current == '\r')
next(LS); next(LS);
} } while (LS->current != '\n' && LS->current != EOZ);
static int globaldefined (lua_State *L, const char *name) {
const TObject *value = luaH_getglobal(L, name);
return ttype(value) != TAG_NIL;
}
static int checkcond (lua_State *L, LexState *LS, const char *buff) {
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 globaldefined(L, buff);
else {
luaX_syntaxerror(LS, "invalid $if condition", buff);
return 0; /* to avoid warnings */
}
}
static void readname (LexState *LS, char *buff) {
int i = 0;
skipspace(LS);
while (isalnum(LS->current) || LS->current == '_') {
if (i >= PRAGMASIZE) {
buff[PRAGMASIZE] = 0;
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)
luaX_error(LS, "input ends inside a $if", TK_EOS);
else next(LS);
}
}
static void inclinenumber (lua_State *L, LexState *LS) {
static const char *const pragmas [] =
{"debug", "nodebug", "endinput", "end", "ifnot", "if", "else", NULL};
next(LS); /* skip '\n' */
++LS->linenumber;
luaX_checklimit(LS, LS->linenumber, MAX_INT, "lines in a chunk");
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)
luaX_syntaxerror(LS, "unmatched $end", "$end");
break;
case 4: /* ifnot */
ifnot = 1;
/* go through */
case 5: /* if */
if (LS->iflevel == MAX_IFS-1)
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)
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;
break;
default:
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 */
luaX_syntaxerror(LS, "invalid pragma format", buff);
ifskip(L, LS);
} }
else checkpragma(L, LS);
} }
@ -275,7 +179,7 @@ static void read_long_string (lua_State *L, LexState *LS) {
continue; continue;
case '\n': case '\n':
save(L, '\n'); save(L, '\n');
inclinenumber(L, LS); inclinenumber(LS);
continue; continue;
default: default:
save_and_next(L, LS); save_and_next(L, LS);
@ -304,7 +208,7 @@ static void read_string (lua_State *L, LexState *LS, int del) {
case 'r': save(L, '\r'); next(LS); break; case 'r': save(L, '\r'); next(LS); break;
case 't': save(L, '\t'); next(LS); break; case 't': save(L, '\t'); next(LS); break;
case 'v': save(L, '\v'); next(LS); break; case 'v': save(L, '\v'); next(LS); break;
case '\n': save(L, '\n'); inclinenumber(L, LS); break; case '\n': save(L, '\n'); inclinenumber(LS); break;
case '0': case '1': case '2': case '3': case '4': case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9': { case '5': case '6': case '7': case '8': case '9': {
int c = 0; int c = 0;
@ -343,7 +247,8 @@ int luaX_lex (LexState *LS) {
continue; continue;
case '\n': case '\n':
inclinenumber(L, LS); inclinenumber(LS);
checkpragma(L, LS);
continue; continue;
case '-': case '-':
@ -432,8 +337,6 @@ int luaX_lex (LexState *LS) {
return TK_NUMBER; return TK_NUMBER;
case EOZ: case EOZ:
if (LS->iflevel > 0)
luaX_error(LS, "input ends inside a $if", TK_EOS);
return TK_EOS; return TK_EOS;
case '_': goto tname; case '_': goto tname;
@ -447,13 +350,7 @@ int luaX_lex (LexState *LS) {
return c; return c;
} }
tname: { /* identifier or reserved word */ tname: { /* identifier or reserved word */
TString *ts; TString *ts = luaS_new(L, readname(L, LS));
luaL_resetbuffer(L);
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? */ if (ts->marked >= RESERVEDMARK) /* reserved word? */
return ts->marked-RESERVEDMARK+FIRST_RESERVED; return ts->marked-RESERVEDMARK+FIRST_RESERVED;
LS->t.seminfo.ts = ts; LS->t.seminfo.ts = ts;

13
llex.h
View File

@ -1,5 +1,5 @@
/* /*
** $Id: llex.h,v 1.26 2000/05/24 18:04:17 roberto Exp roberto $ ** $Id: llex.h,v 1.27 2000/05/25 18:59:59 roberto Exp roberto $
** Lexical Analyzer ** Lexical Analyzer
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/ */
@ -35,15 +35,6 @@ enum RESERVED {
#define NUM_RESERVED ((int)(TK_WHILE-FIRST_RESERVED+1)) #define NUM_RESERVED ((int)(TK_WHILE-FIRST_RESERVED+1))
/* `ifState' keeps the state of each nested $if the lexical is dealing with. */
struct ifState {
int elsepart; /* true if it's in the $else part */
int condition; /* true if $if condition is true */
int skip; /* true if part must be skipped */
};
typedef struct Token { typedef struct Token {
int token; int token;
union { union {
@ -60,8 +51,6 @@ typedef struct LexState {
struct lua_State *L; struct lua_State *L;
struct zio *z; /* input stream */ struct zio *z; /* input stream */
int linenumber; /* input line counter */ int linenumber; /* input line counter */
int iflevel; /* level of nested $if's (for lexical analysis) */
struct ifState ifstate[MAX_IFS];
} LexState; } LexState;

14
llimits.h
View File

@ -1,5 +1,5 @@
/* /*
** $Id: llimits.h,v 1.6 2000/04/26 13:43:25 roberto Exp roberto $ ** $Id: llimits.h,v 1.7 2000/05/24 13:54:49 roberto Exp roberto $
** Limits, basic types, and some other "instalation-dependent" definitions ** Limits, basic types, and some other "instalation-dependent" definitions
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/ */
@ -179,18 +179,6 @@ typedef unsigned long Instruction;
#endif #endif
/* maximum depth of nested $ifs */
#ifndef MAX_IFS
#define MAX_IFS 5 /* arbitrary limit */
#endif
/* maximum size of a pragma line */
#ifndef PRAGMASIZE
#define PRAGMASIZE 80 /* arbitrary limit */
#endif
/* maximum lookback to find a real constant (for code generation) */ /* maximum lookback to find a real constant (for code generation) */
#ifndef LOOKBACKNUMS #ifndef LOOKBACKNUMS
#define LOOKBACKNUMS 20 /* arbitrary constant */ #define LOOKBACKNUMS 20 /* arbitrary constant */