C:\JS_KRESREAL\HBP_konverzia\lua\llex.c C:\JS_LUA\lua-5.2.0\src\llex.c
/* /*
** $Id: llex.c,v 2.59 2011/11/30 12:43:51 roberto Exp $ ** $Id: llex.c,v 2.59 2011/11/30 12:43:51 roberto Exp $
** Lexical Analyzer ** Lexical Analyzer
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/  */ 
   
   
#include <locale.h> #include <locale.h>
#include <string.h> #include <string.h>
   
#define llex_c #define llex_c
#define LUA_CORE #define LUA_CORE
   
#include "lua.h" #include "lua.h"
   
#include "lctype.h" #include "lctype.h"
#include "ldo.h" #include "ldo.h"
#include "llex.h" #include "llex.h"
#include "lobject.h" #include "lobject.h"
#include "lparser.h" #include "lparser.h"
#include "lstate.h" #include "lstate.h"
#include "lstring.h" #include "lstring.h"
#include "ltable.h" #include "ltable.h"
#include "lzio.h" #include "lzio.h"
   
   
   
#define next(ls) (ls->current = zgetc(ls->z)) #define next(ls) (ls->current = zgetc(ls->z))
   
   
   
#define currIsNewline(ls)   (ls->current == '\n' || ls->current == '\r') #define currIsNewline(ls)   (ls->current == '\n' || ls->current == '\r')
   
   
/* ORDER RESERVED */  /* ORDER RESERVED */ 
static const char *const luaX_tokens [] = { static const char *const luaX_tokens [] = {
   "and", "break", "do", "else", "elseif",    "and", "break", "do", "else", "elseif",
   "end", "false", "for", "function", "goto", "if",    "end", "false", "for", "function", "goto", "if",
   "in", "local", "nil", "not", "or", "repeat",    "in", "local", "nil", "not", "or", "repeat",
   "return", "then", "true", "until", "while",    "return", "then", "true", "until", "while",
   "..", "...", "==", ">=", "<=", "~=", "::", "<eof>",    "..", "...", "==", ">=", "<=", "~=", "::", "<eof>",
   "<number>", "<name>", "<string>"     "<number>", "<name>", "<string>" 
#ifdef GCW_BIT  
   ,"^^", "<<",">>",        "&&","||","!"   
#endif  
}; };
   
   
#define save_and_next(ls) (save(ls, ls->current), next(ls)) #define save_and_next(ls) (save(ls, ls->current), next(ls))
   
   
static l_noret lexerror (LexState *ls, const char *msg, int token); static l_noret lexerror (LexState *ls, const char *msg, int token);
   
   
static void save (LexState *ls, int c) { static void save (LexState *ls, int c) {
 Mbuffer *b = ls->buff;  Mbuffer *b = ls->buff;
 if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) {  if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) {
   size_t newsize;    size_t newsize;
   if (luaZ_sizebuffer(b) >= MAX_SIZET/2)    if (luaZ_sizebuffer(b) >= MAX_SIZET/2)
     lexerror(ls, "lexical element too long", 0);      lexerror(ls, "lexical element too long", 0);
   newsize = luaZ_sizebuffer(b) * 2;    newsize = luaZ_sizebuffer(b) * 2;
   luaZ_resizebuffer(ls->L, b, newsize);    luaZ_resizebuffer(ls->L, b, newsize);
 }  }
 b->buffer[luaZ_bufflen(b)++] = cast(char, c);  b->buffer[luaZ_bufflen(b)++] = cast(char, c);
} }
   
   
void luaX_init (lua_State *L) { void luaX_init (lua_State *L) {
 int i;  int i;
 for (i=0; i<NUM_RESERVED; i++) {  for (i=0; i<NUM_RESERVED; i++) {
   TString *ts = luaS_new(L, luaX_tokens[i]);    TString *ts = luaS_new(L, luaX_tokens[i]);
   luaS_fix(ts);  /* reserved words are never collected */     luaS_fix(ts);  /* reserved words are never collected */ 
   ts->tsv.reserved = cast_byte(i+1);  /* reserved word */     ts->tsv.reserved = cast_byte(i+1);  /* reserved word */ 
 }  }
} }
   
   
const char *luaX_token2str (LexState *ls, int token) { const char *luaX_token2str (LexState *ls, int token) {
 if (token < FIRST_RESERVED) {  if (token < FIRST_RESERVED) {
   lua_assert(token == cast(unsigned char, token));    lua_assert(token == cast(unsigned char, token));
   return (lisprint(token)) ? luaO_pushfstring(ls->L, LUA_QL("%c"), token) :    return (lisprint(token)) ? luaO_pushfstring(ls->L, LUA_QL("%c"), token) :
                             luaO_pushfstring(ls->L, "char(%d)", token);                              luaO_pushfstring(ls->L, "char(%d)", token);
 }  }
 else {  else {
   const char *s = luaX_tokens[token - FIRST_RESERVED];    const char *s = luaX_tokens[token - FIRST_RESERVED];
   if (token < TK_EOS)    if (token < TK_EOS)
     return luaO_pushfstring(ls->L, LUA_QS, s);      return luaO_pushfstring(ls->L, LUA_QS, s);
   else    else
     return s;      return s;
 }  }
} }
   
   
static const char *txtToken (LexState *ls, int token) { static const char *txtToken (LexState *ls, int token) {
 switch (token) {  switch (token) {
   case TK_NAME:    case TK_NAME:
   case TK_STRING:    case TK_STRING:
   case TK_NUMBER:    case TK_NUMBER:
     save(ls, '\0');      save(ls, '\0');
     return luaO_pushfstring(ls->L, LUA_QS, luaZ_buffer(ls->buff));      return luaO_pushfstring(ls->L, LUA_QS, luaZ_buffer(ls->buff));
   default:    default:
     return luaX_token2str(ls, token);      return luaX_token2str(ls, token);
 }  }
} }
   
   
static l_noret lexerror (LexState *ls, const char *msg, int token) { static l_noret lexerror (LexState *ls, const char *msg, int token) {
 char buff[LUA_IDSIZE];  char buff[LUA_IDSIZE];
 luaO_chunkid(buff, getstr(ls->source), LUA_IDSIZE);  luaO_chunkid(buff, getstr(ls->source), LUA_IDSIZE);
 msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);  msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
 if (token)  if (token)
   luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token));    luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token));
 luaD_throw(ls->L, LUA_ERRSYNTAX);  luaD_throw(ls->L, LUA_ERRSYNTAX);
} }
   
   
l_noret luaX_syntaxerror (LexState *ls, const char *msg) { l_noret luaX_syntaxerror (LexState *ls, const char *msg) {
 lexerror(ls, msg, ls->t.token);  lexerror(ls, msg, ls->t.token);
} }
   
   
/* /*
** creates a new string and anchors it in function's table so that ** creates a new string and anchors it in function's table so that
** it will not be collected until the end of the function's compilation ** it will not be collected until the end of the function's compilation
** (by that time it should be anchored in function's prototype) ** (by that time it should be anchored in function's prototype)
*/  */ 
TString *luaX_newstring (LexState *ls, const char *str, size_t l) { TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
 lua_State *L = ls->L;  lua_State *L = ls->L;
 TValue *o;  /* entry for `str' */   TValue *o;  /* entry for `str' */ 
 TString *ts = luaS_newlstr(L, str, l);  /* create new string */   TString *ts = luaS_newlstr(L, str, l);  /* create new string */ 
 setsvalue2s(L, L->top++, ts);  /* temporarily anchor it in stack */   setsvalue2s(L, L->top++, ts);  /* temporarily anchor it in stack */ 
 o = luaH_set(L, ls->fs->h, L->top - 1);  o = luaH_set(L, ls->fs->h, L->top - 1);
 if (ttisnil(o)) {  /* not in use yet? (see 'addK') */   if (ttisnil(o)) {  /* not in use yet? (see 'addK') */ 
   /* boolean value does not need GC barrier;    /* boolean value does not need GC barrier;
      table has no metatable, so it does not need to invalidate cache */        table has no metatable, so it does not need to invalidate cache */ 
   setbvalue(o, 1);  /* t[string] = true */     setbvalue(o, 1);  /* t[string] = true */ 
   luaC_checkGC(L);    luaC_checkGC(L);
 }  }
 L->top--;  /* remove string from stack */   L->top--;  /* remove string from stack */ 
 return ts;  return ts;
} }
   
   
/* /*
** increment line number and skips newline sequence (any of ** increment line number and skips newline sequence (any of
** \n, \r, \n\r, or \r\n) ** \n, \r, \n\r, or \r\n)
*/  */ 
static void inclinenumber (LexState *ls) { static void inclinenumber (LexState *ls) {
 int old = ls->current;  int old = ls->current;
 lua_assert(currIsNewline(ls));  lua_assert(currIsNewline(ls));
 next(ls);  /* skip `\n' or `\r' */   next(ls);  /* skip `\n' or `\r' */ 
 if (currIsNewline(ls) && ls->current != old)  if (currIsNewline(ls) && ls->current != old)
   next(ls);  /* skip `\n\r' or `\r\n' */     next(ls);  /* skip `\n\r' or `\r\n' */ 
 if (++ls->linenumber >= MAX_INT)  if (++ls->linenumber >= MAX_INT)
   luaX_syntaxerror(ls, "chunk has too many lines");    luaX_syntaxerror(ls, "chunk has too many lines");
} }
   
   
void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source,
                   int firstchar) {                    int firstchar) {
 ls->decpoint = '.';  ls->decpoint = '.';
 ls->L = L;  ls->L = L;
 ls->current = firstchar;  ls->current = firstchar;
 ls->lookahead.token = TK_EOS;  /* no look-ahead token */   ls->lookahead.token = TK_EOS;  /* no look-ahead token */ 
 ls->z = z;  ls->z = z;
 ls->fs = NULL;  ls->fs = NULL;
 ls->linenumber = 1;  ls->linenumber = 1;
 ls->lastline = 1;  ls->lastline = 1;
 ls->source = source;  ls->source = source;
 ls->envn = luaS_new(L, LUA_ENV);  /* create env name */   ls->envn = luaS_new(L, LUA_ENV);  /* create env name */ 
 luaS_fix(ls->envn);  /* never collect this name */   luaS_fix(ls->envn);  /* never collect this name */ 
 luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */   luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */ 
} }
   
   
   
/* /*
** ======================================================= ** =======================================================
** LEXICAL ANALYZER ** LEXICAL ANALYZER
** ======================================================= ** =======================================================
*/  */ 
   
   
   
static int check_next (LexState *ls, const char *set) { static int check_next (LexState *ls, const char *set) {
 if (ls->current == '\0' || !strchr(set, ls->current))  if (ls->current == '\0' || !strchr(set, ls->current))
   return 0;    return 0;
 save_and_next(ls);  save_and_next(ls);
 return 1;  return 1;
} }
   
   
/* /*
** change all characters 'from' in buffer to 'to' ** change all characters 'from' in buffer to 'to'
*/  */ 
static void buffreplace (LexState *ls, char from, char to) { static void buffreplace (LexState *ls, char from, char to) {
 size_t n = luaZ_bufflen(ls->buff);  size_t n = luaZ_bufflen(ls->buff);
 char *p = luaZ_buffer(ls->buff);  char *p = luaZ_buffer(ls->buff);
 while (n--)  while (n--)
   if (p[n] == from) p[n] = to;    if (p[n] == from) p[n] = to;
} }
   
   
#if !defined(getlocaledecpoint) #if !defined(getlocaledecpoint)
#define getlocaledecpoint() (localeconv()->decimal_point[0]) #define getlocaledecpoint() (localeconv()->decimal_point[0])
#endif #endif
   
   
#define buff2d(b,e) luaO_str2d(luaZ_buffer(b), luaZ_bufflen(b) - 1, e) #define buff2d(b,e) luaO_str2d(luaZ_buffer(b), luaZ_bufflen(b) - 1, e)
   
/* /*
** in case of format error, try to change decimal point separator to ** in case of format error, try to change decimal point separator to
** the one defined in the current locale and check again ** the one defined in the current locale and check again
*/  */ 
static void trydecpoint (LexState *ls, SemInfo *seminfo) { static void trydecpoint (LexState *ls, SemInfo *seminfo) {
 char old = ls->decpoint;  char old = ls->decpoint;
 ls->decpoint = getlocaledecpoint();  ls->decpoint = getlocaledecpoint();
 buffreplace(ls, old, ls->decpoint);  /* try new decimal separator */   buffreplace(ls, old, ls->decpoint);  /* try new decimal separator */ 
 if (!buff2d(ls->buff, &seminfo->r)) {  if (!buff2d(ls->buff, &seminfo->r)) {
   /* format error with correct decimal point: no more options */     /* format error with correct decimal point: no more options */ 
   buffreplace(ls, ls->decpoint, '.');  /* undo change (for error message) */     buffreplace(ls, ls->decpoint, '.');  /* undo change (for error message) */ 
   lexerror(ls, "malformed number", TK_NUMBER);    lexerror(ls, "malformed number", TK_NUMBER);
 }  }
} }
   
   
/* LUA_NUMBER */  /* LUA_NUMBER */ 
static void read_numeral (LexState *ls, SemInfo *seminfo) { static void read_numeral (LexState *ls, SemInfo *seminfo) {
 lua_assert(lisdigit(ls->current));  lua_assert(lisdigit(ls->current));
 do {  do {
   save_and_next(ls);    save_and_next(ls);
   if (check_next(ls, "EePp"))  /* exponent part? */     if (check_next(ls, "EePp"))  /* exponent part? */ 
     check_next(ls, "+-");  /* optional exponent sign */       check_next(ls, "+-");  /* optional exponent sign */ 
 } while (lislalnum(ls->current) || ls->current == '.');  } while (lislalnum(ls->current) || ls->current == '.');
 save(ls, '\0');  save(ls, '\0');
 buffreplace(ls, '.', ls->decpoint);  /* follow locale for decimal point */   buffreplace(ls, '.', ls->decpoint);  /* follow locale for decimal point */ 
 if (!buff2d(ls->buff, &seminfo->r))  /* format error? */   if (!buff2d(ls->buff, &seminfo->r))  /* format error? */ 
   trydecpoint(ls, seminfo); /* try to update decimal point separator */     trydecpoint(ls, seminfo); /* try to update decimal point separator */ 
} }
   
   
/* /*
** skip a sequence '[=*[' or ']=*]' and return its number of '='s or ** skip a sequence '[=*[' or ']=*]' and return its number of '='s or
** -1 if sequence is malformed ** -1 if sequence is malformed
*/  */ 
static int skip_sep (LexState *ls) { static int skip_sep (LexState *ls) {
 int count = 0;  int count = 0;
 int s = ls->current;  int s = ls->current;
 lua_assert(s == '[' || s == ']');  lua_assert(s == '[' || s == ']');
 save_and_next(ls);  save_and_next(ls);
 while (ls->current == '=') {  while (ls->current == '=') {
   save_and_next(ls);    save_and_next(ls);
   count++;    count++;
 }  }
 return (ls->current == s) ? count : (-count) - 1;  return (ls->current == s) ? count : (-count) - 1;
} }
   
   
static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) { static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
 save_and_next(ls);  /* skip 2nd `[' */   save_and_next(ls);  /* skip 2nd `[' */ 
 if (currIsNewline(ls))  /* string starts with a newline? */   if (currIsNewline(ls))  /* string starts with a newline? */ 
   inclinenumber(ls);  /* skip it */     inclinenumber(ls);  /* skip it */ 
 for (;;) {  for (;;) {
   switch (ls->current) {    switch (ls->current) {
     case EOZ:      case EOZ:
       lexerror(ls, (seminfo) ? "unfinished long string" :        lexerror(ls, (seminfo) ? "unfinished long string" :
                                "unfinished long comment", TK_EOS);                                 "unfinished long comment", TK_EOS);
       break;  /* to avoid warnings */         break;  /* to avoid warnings */ 
     case ']': {      case ']': {
       if (skip_sep(ls) == sep) {        if (skip_sep(ls) == sep) {
         save_and_next(ls);  /* skip 2nd `]' */           save_and_next(ls);  /* skip 2nd `]' */ 
         goto endloop;          goto endloop;
       }        }
       break;        break;
     }      }
     case '\n': case '\r': {      case '\n': case '\r': {
       save(ls, '\n');        save(ls, '\n');
       inclinenumber(ls);        inclinenumber(ls);
       if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */         if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */ 
       break;        break;
     }      }
     default: {      default: {
       if (seminfo) save_and_next(ls);        if (seminfo) save_and_next(ls);
       else next(ls);        else next(ls);
     }      }
   }    }
 } endloop:  } endloop:
 if (seminfo)  if (seminfo)
   seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),    seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
                                    luaZ_bufflen(ls->buff) - 2*(2 + sep));                                     luaZ_bufflen(ls->buff) - 2*(2 + sep));
} }
   
   
static void escerror (LexState *ls, int *c, int n, const char *msg) { static void escerror (LexState *ls, int *c, int n, const char *msg) {
 int i;  int i;
 luaZ_resetbuffer(ls->buff);  /* prepare error message */   luaZ_resetbuffer(ls->buff);  /* prepare error message */ 
 save(ls, '\\');  save(ls, '\\');
 for (i = 0; i < n && c[i] != EOZ; i++)  for (i = 0; i < n && c[i] != EOZ; i++)
   save(ls, c[i]);    save(ls, c[i]);
 lexerror(ls, msg, TK_STRING);  lexerror(ls, msg, TK_STRING);
} }
   
   
static int readhexaesc (LexState *ls) { static int readhexaesc (LexState *ls) {
 int c[3], i;  /* keep input for error message */   int c[3], i;  /* keep input for error message */ 
 int r = 0;  /* result accumulator */   int r = 0;  /* result accumulator */ 
 c[0] = 'x';  /* for error message */   c[0] = 'x';  /* for error message */ 
 for (i = 1; i < 3; i++) {  /* read two hexa digits */   for (i = 1; i < 3; i++) {  /* read two hexa digits */ 
   c[i] = next(ls);    c[i] = next(ls);
   if (!lisxdigit(c[i]))    if (!lisxdigit(c[i]))
     escerror(ls, c, i + 1, "hexadecimal digit expected");      escerror(ls, c, i + 1, "hexadecimal digit expected");
   r = (r << 4) + luaO_hexavalue(c[i]);    r = (r << 4) + luaO_hexavalue(c[i]);
 }  }
 return r;  return r;
} }
   
   
static int readdecesc (LexState *ls) { static int readdecesc (LexState *ls) {
 int c[3], i;  int c[3], i;
 int r = 0;  /* result accumulator */   int r = 0;  /* result accumulator */ 
 for (i = 0; i < 3 && lisdigit(ls->current); i++) {  /* read up to 3 digits */   for (i = 0; i < 3 && lisdigit(ls->current); i++) {  /* read up to 3 digits */ 
   c[i] = ls->current;    c[i] = ls->current;
   r = 10*r + c[i] - '0';    r = 10*r + c[i] - '0';
   next(ls);    next(ls);
 }  }
     if (r > UCHAR_MAX)  if (r > UCHAR_MAX)
       escerror(ls, c, i, "decimal escape too large");    escerror(ls, c, i, "decimal escape too large");
     return r;  return r;
} }
   
   
static void read_string (LexState *ls, int del, SemInfo *seminfo) { static void read_string (LexState *ls, int del, SemInfo *seminfo) {
 save_and_next(ls);  /* keep delimiter (for error messages) */   save_and_next(ls);  /* keep delimiter (for error messages) */ 
 while (ls->current != del) {  while (ls->current != del) {
   switch (ls->current) {    switch (ls->current) {
     case EOZ:      case EOZ:
       lexerror(ls, "unfinished string", TK_EOS);        lexerror(ls, "unfinished string", TK_EOS);
       break;  /* to avoid warnings */         break;  /* to avoid warnings */ 
     case '\n':      case '\n':
     case '\r':      case '\r':
       lexerror(ls, "unfinished string", TK_STRING);        lexerror(ls, "unfinished string", TK_STRING);
       break;  /* to avoid warnings */         break;  /* to avoid warnings */ 
     case '\\': {  /* escape sequences */       case '\\': {  /* escape sequences */ 
       int c;  /* final character to be saved */         int c;  /* final character to be saved */ 
       next(ls);  /* do not save the `\' */         next(ls);  /* do not save the `\' */ 
       switch (ls->current) {        switch (ls->current) {
         case 'a': c = '\a'; goto read_save;          case 'a': c = '\a'; goto read_save;
         case 'b': c = '\b'; goto read_save;          case 'b': c = '\b'; goto read_save;
         case 'f': c = '\f'; goto read_save;          case 'f': c = '\f'; goto read_save;
         case 'n': c = '\n'; goto read_save;          case 'n': c = '\n'; goto read_save;
         case 'r': c = '\r'; goto read_save;          case 'r': c = '\r'; goto read_save;
         case 't': c = '\t'; goto read_save;          case 't': c = '\t'; goto read_save;
         case 'v': c = '\v'; goto read_save;          case 'v': c = '\v'; goto read_save;
         case 'x': c = readhexaesc(ls); goto read_save;          case 'x': c = readhexaesc(ls); goto read_save;
         case '\n': case '\r':          case '\n': case '\r':
           inclinenumber(ls); c = '\n'; goto only_save;            inclinenumber(ls); c = '\n'; goto only_save;
         case '\\': case '\"': case '\'':          case '\\': case '\"': case '\'':
           c = ls->current; goto read_save;            c = ls->current; goto read_save;
         case EOZ: goto no_save;  /* will raise an error next loop */           case EOZ: goto no_save;  /* will raise an error next loop */ 
         case 'z': {  /* zap following span of spaces */           case 'z': {  /* zap following span of spaces */ 
           next(ls);  /* skip the 'z' */             next(ls);  /* skip the 'z' */ 
           while (lisspace(ls->current)) {            while (lisspace(ls->current)) {
             if (currIsNewline(ls)) inclinenumber(ls);              if (currIsNewline(ls)) inclinenumber(ls);
             else next(ls);              else next(ls);
           }            }
           goto no_save;            goto no_save;
         }          }
         default: {          default: {
           if (!lisdigit(ls->current))            if (!lisdigit(ls->current))
             escerror(ls, &ls->current, 1, "invalid escape sequence");              escerror(ls, &ls->current, 1, "invalid escape sequence");
           /* digital escape \ddd */             /* digital escape \ddd */ 
           c = readdecesc(ls);            c = readdecesc(ls);
           goto only_save;            goto only_save;
         }          }
       }        }
      read_save: next(ls);  /* read next character */        read_save: next(ls);  /* read next character */ 
      only_save: save(ls, c);  /* save 'c' */        only_save: save(ls, c);  /* save 'c' */ 
      no_save: break;       no_save: break;
     }      }
     default:      default:
       save_and_next(ls);        save_and_next(ls);
   }    }
 }  }
 save_and_next(ls);  /* skip delimiter */   save_and_next(ls);  /* skip delimiter */ 
 seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
                                  luaZ_bufflen(ls->buff) - 2);                                   luaZ_bufflen(ls->buff) - 2);
} }
   
   
static int llex (LexState *ls, SemInfo *seminfo) { static int llex (LexState *ls, SemInfo *seminfo) {
 luaZ_resetbuffer(ls->buff);  luaZ_resetbuffer(ls->buff);
 for (;;) {  for (;;) {
   switch (ls->current) {    switch (ls->current) {
     case '\n': case '\r': {  /* line breaks */       case '\n': case '\r': {  /* line breaks */ 
       inclinenumber(ls);        inclinenumber(ls);
       break;        break;
     }      }
     case ' ': case '\f': case '\t': case '\v': {  /* spaces */       case ' ': case '\f': case '\t': case '\v': {  /* spaces */ 
       next(ls);        next(ls);
       break;        break;
     }      }
     case '-': {  /* '-' or '--' (comment) */       case '-': {  /* '-' or '--' (comment) */ 
       next(ls);        next(ls);
       if (ls->current != '-') return '-';        if (ls->current != '-') return '-';
       /* else is a comment */         /* else is a comment */ 
       next(ls);        next(ls);
       if (ls->current == '[') {  /* long comment? */         if (ls->current == '[') {  /* long comment? */ 
         int sep = skip_sep(ls);          int sep = skip_sep(ls);
         luaZ_resetbuffer(ls->buff);  /* `skip_sep' may dirty the buffer */           luaZ_resetbuffer(ls->buff);  /* `skip_sep' may dirty the buffer */ 
         if (sep >= 0) {          if (sep >= 0) {
           read_long_string(ls, NULL, sep);  /* skip long comment */             read_long_string(ls, NULL, sep);  /* skip long comment */ 
           luaZ_resetbuffer(ls->buff);  /* previous call may dirty the buff. */             luaZ_resetbuffer(ls->buff);  /* previous call may dirty the buff. */ 
           break;            break;
         }          }
       }        }
       /* else short comment */         /* else short comment */ 
       while (!currIsNewline(ls) && ls->current != EOZ)        while (!currIsNewline(ls) && ls->current != EOZ)
         next(ls);  /* skip until end of line (or end of file) */           next(ls);  /* skip until end of line (or end of file) */ 
       break;        break;
     }      }
     case '[': {  /* long string or simply '[' */       case '[': {  /* long string or simply '[' */ 
       int sep = skip_sep(ls);        int sep = skip_sep(ls);
       if (sep >= 0) {        if (sep >= 0) {
         read_long_string(ls, seminfo, sep);          read_long_string(ls, seminfo, sep);
         return TK_STRING;          return TK_STRING;
       }        }
       else if (sep == -1) return '[';        else if (sep == -1) return '[';
       else lexerror(ls, "invalid long string delimiter", TK_STRING);        else lexerror(ls, "invalid long string delimiter", TK_STRING);
     }      }
     case '=': {      case '=': {
       next(ls);        next(ls);
       if (ls->current != '=') return '=';        if (ls->current != '=') return '=';
       else { next(ls); return TK_EQ; }        else { next(ls); return TK_EQ; }
     }      }
#ifdef GCW_BIT  
     case '&': {  
       next(ls);  
       if (ls->current != '&') return '&';  
       else { next(ls); return TK_LAND; }  
       }  
     case '|': {  
       next(ls);  
       if (ls->current != '|') return '|';  
       else { next(ls); return TK_LOR; }  
       }  
   
     case '^': {  
       next(ls);  
       if (ls->current != '^') return '^';  
       else { next(ls); return TK_BXOR; }  
       }  
#endif  
     case '<': {      case '<': {
       next(ls);        next(ls);
#ifndef GCW_BIT  
       if (ls->current != '=') return '<';        if (ls->current != '=') return '<';
       else { next(ls); return TK_LE; }        else { next(ls); return TK_LE; }
#else  
       switch (ls->current) {  
         case '=': next(ls); return TK_LE; break;  
         case '<': next(ls); return TK_BLSH; break;  
         default: return '<'; }  
#endif  
     }      }
     case '>': {      case '>': {
       next(ls);        next(ls);
#ifndef GCW_BIT  
       if (ls->current != '=') return '>';        if (ls->current != '=') return '>';
       else { next(ls); return TK_GE; }        else { next(ls); return TK_GE; }
#else  
       switch (ls->current) {  
         case '=': next(ls); return TK_GE; break;  
         case '>': next(ls); return TK_BRSH; break;  
         default: return '>'; }  
#endif  
     }      }
     case '~': {      case '~': {
       next(ls);        next(ls);
       if (ls->current != '=') return '~';        if (ls->current != '=') return '~';
       else { next(ls); return TK_NE; }        else { next(ls); return TK_NE; }
     }      }
     case ':': {      case ':': {
       next(ls);        next(ls);
       if (ls->current != ':') return ':';        if (ls->current != ':') return ':';
       else { next(ls); return TK_DBCOLON; }        else { next(ls); return TK_DBCOLON; }
     }      }
     case '"': case '\'': {  /* short literal strings */       case '"': case '\'': {  /* short literal strings */ 
       read_string(ls, ls->current, seminfo);        read_string(ls, ls->current, seminfo);
       return TK_STRING;        return TK_STRING;
     }      }
     case '.': {  /* '.', '..', '...', or number */       case '.': {  /* '.', '..', '...', or number */ 
       save_and_next(ls);        save_and_next(ls);
       if (check_next(ls, ".")) {        if (check_next(ls, ".")) {
         if (check_next(ls, "."))          if (check_next(ls, "."))
           return TK_DOTS;   /* '...' */             return TK_DOTS;   /* '...' */ 
         else return TK_CONCAT;   /* '..' */           else return TK_CONCAT;   /* '..' */ 
       }        }
       else if (!lisdigit(ls->current)) return '.';        else if (!lisdigit(ls->current)) return '.';
       /* else go through */         /* else go through */ 
     }      }
     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': {
       read_numeral(ls, seminfo);        read_numeral(ls, seminfo);
       return TK_NUMBER;        return TK_NUMBER;
     }      }
     case EOZ: {      case EOZ: {
       return TK_EOS;        return TK_EOS;
     }      }
     default: {      default: {
       if (lislalpha(ls->current)) {  /* identifier or reserved word? */         if (lislalpha(ls->current)) {  /* identifier or reserved word? */ 
         TString *ts;          TString *ts;
         do {          do {
           save_and_next(ls);            save_and_next(ls);
         } while (lislalnum(ls->current));          } while (lislalnum(ls->current));
         ts = luaX_newstring(ls, luaZ_buffer(ls->buff),          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
                                 luaZ_bufflen(ls->buff));                                  luaZ_bufflen(ls->buff));
         seminfo->ts = ts;          seminfo->ts = ts;
         if (ts->tsv.reserved > 0)  /* reserved word? */           if (ts->tsv.reserved > 0)  /* reserved word? */ 
           return ts->tsv.reserved - 1 + FIRST_RESERVED;            return ts->tsv.reserved - 1 + FIRST_RESERVED;
         else {          else {
           return TK_NAME;            return TK_NAME;
         }          }
       }        }
       else {  /* single-char tokens (+ - / ...) */         else {  /* single-char tokens (+ - / ...) */ 
         int c = ls->current;          int c = ls->current;
         next(ls);          next(ls);
         return c;          return c;
       }        }
     }      }
   }    }
 }  }
} }
   
   
void luaX_next (LexState *ls) { void luaX_next (LexState *ls) {
 ls->lastline = ls->linenumber;  ls->lastline = ls->linenumber;
 if (ls->lookahead.token != TK_EOS) {  /* is there a look-ahead token? */   if (ls->lookahead.token != TK_EOS) {  /* is there a look-ahead token? */ 
   ls->t = ls->lookahead;  /* use this one */     ls->t = ls->lookahead;  /* use this one */ 
   ls->lookahead.token = TK_EOS;  /* and discharge it */     ls->lookahead.token = TK_EOS;  /* and discharge it */ 
 }  }
 else  else
   ls->t.token = llex(ls, &ls->t.seminfo);  /* read next token */     ls->t.token = llex(ls, &ls->t.seminfo);  /* read next token */ 
} }
   
   
int luaX_lookahead (LexState *ls) { int luaX_lookahead (LexState *ls) {
 lua_assert(ls->lookahead.token == TK_EOS);  lua_assert(ls->lookahead.token == TK_EOS);
 ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);  ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
 return ls->lookahead.token;  return ls->lookahead.token;
} }