pluto-src 0.1.1+0.10.4

/*
** $Id: llex.c $
** Lexical Analyzer
** See Copyright Notice in lua.h
*/

#define llex_c
#define LUA_CORE

#include "lprefix.h"


#include <locale.h>
#include <string.h>

#include "lua.h"

#include "lctype.h"
#include "ldebug.h"
#include "ldo.h"
#include "lerrormessage.hpp"
#include "lgc.h"
#include "llex.h"
#include "lobject.h"
#include "lparser.h"
#include "lstate.h"
#include "lstring.h"
#include "lsuggestions.hpp"
#include "ltable.h"
#include "lzio.h"

// Note that this may sometimes break parsing.
#define TOKENDUMP false

#if TOKENDUMP
#include <iostream>
#endif



#define next(ls)	(ls->current = zgetc(ls->z))


#define check_condition(ls,c,msg)	{ if (!(c)) luaX_syntaxerror(ls, msg); }


#define currIsNewline(ls)	(ls->current == '\n' || ls->current == '\r')


/* ORDER RESERVED */
static const char *const luaX_tokens [] = {
    "and", "break", "do", "else", "elseif",
    "end", "false", "for", "function", "goto", "if",
    "in", "local", "nil", "not", "or", "repeat",
    "case", "default", "as", "begin", "extends", "instanceof",
    "pluto_use",
    "pluto_switch", "pluto_continue", "pluto_enum", "pluto_new", "pluto_class", "pluto_parent", "pluto_export", "pluto_try", "pluto_catch",
          "switch",       "continue",       "enum",       "new",       "class",       "parent",       "export",       "try",       "catch",
    "let", "const", "global",
#ifdef PLUTO_PARSER_SUGGESTIONS
    "pluto_suggest_0", "pluto_suggest_1",
#endif
    "return", "then", "true", "until", "while",
    "//", "..", "...", "==", ">=", "<=", "~=", "!=", "<=>",
    "<<", ">>", "::", "<eof>",
    "<number>", "<integer>", "<name>", "<string>",
    "**", "??", ":=", "->", "|>",
    "<fallthrough annotation>", "<pluto_use annotation>",
};


#define save_and_next(ls) (save(ls, ls->current), next(ls))


static l_noret lexerror (LexState *ls, const char *msg, const Token& t);


void LexState::popContext(ParserContext ctx) {
  lua_assert(ctx != PARCTX_NONE);
  if (getContext() != ctx)
    luaX_syntaxerror(this, "parser context stack corrupted");
  parser_context_stck.pop();
}


static void save (LexState *ls, int c) {
  Mbuffer *b = ls->buff;
  if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) {
    size_t newsize;
    if (luaZ_sizebuffer(b) >= MAX_SIZE/2)
      lexerror(ls, "lexical element too long", 0);
    newsize = luaZ_sizebuffer(b) * 2;
    luaZ_resizebuffer(ls->L, b, newsize);
  }
  b->buffer[luaZ_bufflen(b)++] = cast_char(c);
}


void luaX_init (lua_State *L) {
  int i;
  TString *e = luaS_newliteral(L, LUA_ENV);  /* create env name */
  luaC_fix(L, obj2gco(e));  /* never collect this name */
  for (i=0; i<NUM_RESERVED; i++) {
    TString *ts = luaS_new(L, luaX_tokens[i]);
    luaC_fix(L, obj2gco(ts));  /* reserved words are never collected */
    ts->extra = cast_byte(i+1);  /* reserved word */
  }
}


const char *luaX_token2str (LexState *ls, const Token& t) {
  const char *ret = luaO_pushfstring(ls->L, "'%s'", luaX_token2str_noq(ls, t));
  ls->L->top.p--;
  return ret;
}


/* Converts a token into a string, same as luaX_token2str, but doesn't quote the token. */
const char *luaX_token2str_noq (LexState *ls, const Token& t) {
  const char *ret;
  if (t.token < FIRST_RESERVED) {  /* single-byte symbols? */
    if (lisprint(t.token)) {
      ret = luaO_pushfstring(ls->L, "%c", t.token);
      ls->L->top.p--;
    } else { /* control character */
      ret = luaO_pushfstring(ls->L, "'<\\%d>'", t.token);
      ls->L->top.p--;
    }
  }
  else switch (t.token) {
    case TK_NAME: case TK_STRING:
      if (!ls->hasDoneLexerPass())
        return luaX_tokens[t.token - FIRST_RESERVED];
      ret = luaO_pushfstring(ls->L, "%s", getstr(t.seminfo.ts));
      ls->L->top.p--;
      break;
    case TK_FLT:
      if (!ls->hasDoneLexerPass()) {
        save(ls, '\0');
        ret = luaO_pushfstring(ls->L, "%s", luaZ_buffer(ls->buff));
      }
      else {
        ret = luaO_pushfstring(ls->L, "%f", t.seminfo.r);
      }
      ls->L->top.p--;
      break;
    case TK_INT:
      if (!ls->hasDoneLexerPass()) {
        save(ls, '\0');
        ret = luaO_pushfstring(ls->L, "%s", luaZ_buffer(ls->buff));
      }
      else {
        ret = luaO_pushfstring(ls->L, "%I", t.seminfo.i);
      }
      ls->L->top.p--;
      break;
    default:
      const char *s = luaX_tokens[t.token - FIRST_RESERVED];
      if (t.token < TK_EOS) { /* fixed format (symbols and reserved words)? */
          ret = luaO_pushfstring(ls->L, "%s", s);
          ls->L->top.p--;
      } else  /* names, strings, and numerals */
        return s;
  }
  return ret;
}


const char* luaX_reserved2str (int token) {
  return luaX_tokens[token - FIRST_RESERVED];
}


static l_noret lexerror (LexState *ls, const char *msg, const Token& t) {
  msg = luaG_addinfo(ls->L, msg, ls->source, ls->getLineNumber());
  auto err = new Pluto::ErrorMessage{ ls, HRED "syntax error: " BWHT };
  err->addMsg(msg);
  if (t.token) {
    err->addMsg(" near ")
       .addMsg(luaX_token2str(ls, t))
       .addSrcLine(ls->getLineNumber())
       .addGenericHere()
       .finalize();
  }
  else {
    err->addSrcLine(ls->getLineNumber())
       .addGenericHere()
       .finalize();
  }
  delete err;
  luaD_throw(ls->L, LUA_ERRSYNTAX);
}


l_noret luaX_syntaxerror (LexState *ls, const char *msg) {
  lexerror(ls, msg, ls->t);
}


/*
** Creates a new string and anchors it in scanner's table so that it
** will not be collected until the end of the compilation; by that time
** it should be anchored somewhere. It also internalizes long strings,
** ensuring there is only one copy of each unique string.  The table
** here is used as a set: the string enters as the key, while its value
** is irrelevant. We use the string itself as the value only because it
** is a TValue readily available. Later, the code generation can change
** this value.
*/
TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
  lua_State *L = ls->L;
  TString *ts = luaS_newlstr(L, str, l);  /* create new string */
  const TValue *o = luaH_getstr(ls->h, ts);
  if (!ttisnil(o))  /* string already present? */
    ts = keystrval(nodefromval(o));  /* get saved copy */
  else {  /* not in use yet */
    TValue *stv = s2v(L->top.p++);  /* reserve stack space for string */
    setsvalue(L, stv, ts);  /* temporarily anchor the string */
    luaH_finishset(L, ls->h, stv, o, stv);  /* t[string] = string */
    /* table is not a metatable, so it does not need to invalidate cache */
    luaC_checkGC(L);
    L->top.p--;  /* remove string from stack */
  }
  return ts;
}


LUAI_FUNC TString* luaX_newstring (LexState *ls, const char *str) {
  return luaX_newstring(ls, str, strlen(str));
}


/*
** increment line number and skips newline sequence (any of
** \n, \r, \n\r, or \r\n)
*/
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' */

  ls->lines.emplace_back(std::string{});
}


static int llex (LexState *ls, SemInfo *seminfo, int *column);
void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source,
                    int firstchar) {
  ls->t.token = 0;
  ls->L = L;
  ls->current = firstchar;
  ls->z = z;
  ls->fs = NULL;
  ls->source = source;
  ls->envn = luaS_newliteral(L, LUA_ENV);  /* get env name */
  luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */

  while (true) {  /* perform lexer pass */
    Token t;
    t.column = (int)ls->getLineBuff().size();
    t.token = llex(ls, &t.seminfo, &t.column);
    t.line = (int)ls->lines.size();
    ls->tokens.emplace_back(std::move(t));
    if (t.token == TK_EOS) break;
  }

#if TOKENDUMP
  luaX_setpos(ls, 0);
  int line = 0;
  while (ls->t.token != TK_EOS) {
    if (ls->t.line != line) {
      line = ls->t.line;
      std::cout << "\nLine " << line << ":";
    }
    std::cout << " " << luaX_token2str_noq(ls, ls->t.token);
    luaX_next(ls);
  }
  std::cout << "\n";
  lua_assert(ls->tidx + 1 == ls->tokens.size());
  luaX_setpos(ls, 0);
#endif
}



/*
** =======================================================
** LEXICAL ANALYZER
** =======================================================
*/


static int check_next1 (LexState *ls, int c) {
  if (ls->current == c) {
    next(ls);
    return 1;
  }
  else return 0;
}


/*
** Check whether current char is in set 'set' (with two chars) and
** saves it
*/
static int check_next2 (LexState *ls, const char *set) {
  lua_assert(set[2] == '\0');
  if (ls->current == set[0] || ls->current == set[1]) {
    save_and_next(ls);
    return 1;
  }
  else return 0;
}


/* LUA_NUMBER */
/*
** This function is quite liberal in what it accepts, as 'luaO_str2num'
** will reject ill-formed numerals. Roughly, it accepts the following
** pattern:
**
**   %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))*
**
** The only tricky part is to accept [+-] only after a valid exponent
** mark, to avoid reading '3-4' or '0xe+1' as a single number.
**
** The caller might have already read an initial dot.
*/
static int read_numeral (LexState *ls, SemInfo *seminfo) {
  TValue obj;
  const char *expo = "Ee";
  int first = ls->current;
  lua_assert(lisdigit(ls->current));
  save_and_next(ls);
  if (first == '0' && check_next2(ls, "xX"))  /* hexadecimal? */
    expo = "Pp";
  for (;;) {
    if (check_next2(ls, expo))  /* exponent mark? */
      check_next2(ls, "-+");  /* optional exponent sign */
    else if (lisxdigit(ls->current) || ls->current == '.' || ls->current == '_') { /* '%x|%.' */
      if (ls->current != '_')
        save_and_next(ls);
      else
        next(ls);
    }
    else break;
  }
  if (lislalpha(ls->current))  /* is numeral touching a letter? */
    save_and_next(ls);  /* force an error */
  save(ls, '\0');
  if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0)  /* format error? */
    lexerror(ls, "malformed number", TK_FLT);
  if (ttisinteger(&obj)) {
    seminfo->i = ivalue(&obj);
    return TK_INT;
  }
  else {
    lua_assert(ttisfloat(&obj));
    seminfo->r = fltvalue(&obj);
    return TK_FLT;
  }
}


/*
** read a sequence '[=*[' or ']=*]', leaving the last bracket. If
** sequence is well formed, return its number of '='s + 2; otherwise,
** return 1 if it is a single bracket (no '='s and no 2nd bracket);
** otherwise (an unfinished '[==...') return 0.
*/
static size_t skip_sep (LexState *ls) {
  size_t 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 + 2
         : (count == 0) ? 1
         : 0;
}


static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) {
  int line = ls->getLineNumber();  /* initial line (for error message) */
  save_and_next(ls);  /* skip 2nd '[' */
  if (currIsNewline(ls))  /* string starts with a newline? */
    inclinenumber(ls);  /* skip it */
  for (;;) {
    switch (ls->current) {
      case EOZ: {  /* error */
        const char *what = (seminfo ? "string" : "comment");
        const char *msg = luaO_pushfstring(ls->L,
                     "unfinished long %s (starting at line %d)", what, line);
        lexerror(ls, msg, TK_EOS);
        break;  /* to avoid warnings */
      }
      case ']': {
        if (skip_sep(ls) == sep) {
          save_and_next(ls);  /* skip 2nd ']' */
          goto endloop;
        }
        break;
      }
      case '\n': case '\r': {
        save(ls, '\n');
        inclinenumber(ls);
        if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */
        break;
      }
      default: {
        ls->appendLineBuff(ls->current);
        if (seminfo) save_and_next(ls);
        else next(ls);
      }
    }
  } endloop:
  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
                                   luaZ_bufflen(ls->buff) - sep - 1);
}


static void esccheck (LexState *ls, int c, const char *msg) {
  if (!c) {
    if (ls->current != EOZ)
      save_and_next(ls);  /* add current to buffer for error message */
    lexerror(ls, msg, TK_STRING);
  }
}


static int gethexa (LexState *ls) {
  save_and_next(ls);
  esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected");
  return luaO_hexavalue(ls->current);
}


static int readhexaesc (LexState *ls) {
  int r = gethexa(ls);
  r = (r << 4) + gethexa(ls);
  luaZ_buffremove(ls->buff, 2);  /* remove saved chars from buffer */
  return r;
}


static unsigned long readutf8esc (LexState *ls) {
  unsigned long r;
  int i = 4;  /* chars to be removed: '\', 'u', '{', and first digit */
  save_and_next(ls);  /* skip 'u' */
  esccheck(ls, ls->current == '{', "missing '{'");
  r = gethexa(ls);  /* must have at least one digit */
  while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) {
    i++;
    esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large");
    r = (r << 4) + luaO_hexavalue(ls->current);
  }
  esccheck(ls, ls->current == '}', "missing '}'");
  next(ls);  /* skip '}' */
  luaZ_buffremove(ls->buff, i);  /* remove saved chars from buffer */
  return r;
}


static void utf8esc (LexState *ls) {
  char buff[UTF8BUFFSZ];
  int n = luaO_utf8esc(buff, readutf8esc(ls));
  for (; n > 0; n--)  /* add 'buff' to string */
    save(ls, buff[UTF8BUFFSZ - n]);
}


static int readdecesc (LexState *ls) {
  int i;
  int r = 0;  /* result accumulator */
  for (i = 0; i < 3 && lisdigit(ls->current); i++) {  /* read up to 3 digits */
    r = 10*r + ls->current - '0';
    save_and_next(ls);
  }
  esccheck(ls, r <= UCHAR_MAX, "decimal escape too large");
  luaZ_buffremove(ls->buff, i);  /* remove read digits from buffer */
  return r;
}


static void process_string_escape (LexState *ls) {
  int c;  /* final character to be saved */
  save_and_next(ls);  /* keep '\\' for error messages */
  ls->appendLineBuff((char)ls->current);
  switch (ls->current) {
    case 'a': c = '\a'; goto read_save;
    case 'b': c = '\b'; goto read_save;
    case 'f': c = '\f'; goto read_save;
    case 'n': c = '\n'; goto read_save;
    case 'r': c = '\r'; goto read_save;
    case 't': c = '\t'; goto read_save;
    case 'v': c = '\v'; goto read_save;
    case 'x': c = readhexaesc(ls); goto read_save;
    case 'u': utf8esc(ls);  return;  /* no save */
    case '\n': case '\r':
      inclinenumber(ls); c = '\n'; goto only_save;
    case '\\': case '\"': case '\'': case '{':
      c = ls->current; goto read_save;
    case EOZ: return;  /* no save, will raise an error next loop */
    case 'z': {  /* zap following span of spaces */
      luaZ_buffremove(ls->buff, 1);  /* remove '\\' */
      next(ls);  /* skip the 'z' */
      while (lisspace(ls->current)) {
        if (currIsNewline(ls)) inclinenumber(ls);
        else next(ls);
      }
      return;  /* no save */
    }
    default: {
      esccheck(ls, lisdigit(ls->current), "invalid escape sequence");
      c = readdecesc(ls);  /* digital escape '\ddd' */
      goto only_save;
    }
  }
 read_save:
   next(ls);
   /* go through */
 only_save:
   luaZ_buffremove(ls->buff, 1);  /* remove '\\' */
   save(ls, c);
}

static void read_string (LexState *ls, int del, SemInfo *seminfo) {
  ls->appendLineBuff((char)del);
  next(ls);  /* keep delimiter (for error messages) */
  while (ls->current != del) {
    ls->appendLineBuff((char)ls->current);
    switch (ls->current) {
      case EOZ:
        lexerror(ls, "unfinished string", TK_EOS);
        break;  /* to avoid warnings */
      case '\n':
      case '\r':
        lexerror(ls, "unfinished string", TK_STRING);
        break;  /* to avoid warnings */
      case '\\':  /* escape sequences */
        process_string_escape(ls);
        break;
      default:
        save_and_next(ls);
    }
  }
  ls->appendLineBuff((char)del);
  next(ls);  /* skip delimiter */
  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff), luaZ_bufflen(ls->buff));
}


static int llex (LexState *ls, SemInfo *seminfo, int *column) {
  luaZ_resetbuffer(ls->buff);
  for (;;) {
    switch (ls->current) {
      case '\n': case '\r': {  /* Line breaks. */
        inclinenumber(ls);
        break;
      }
      case ' ': case '\f': case '\t': case '\v': {  /* spaces */
        if (ls->getLineBuff().find_first_not_of(ls->current) != std::string::npos) {
          ls->appendLineBuff(ls->current);
        }
        if (column)
          ++*column;
        next(ls);
        break;
      }
      case '-': {  /* '-', '--' (comment), or '->' (arrow) */
        next(ls);
        ls->appendLineBuff('-');
        if (check_next1(ls, '=')) { /* compound op */
          ls->appendLineBuff('=');
          seminfo->i = '-';
          return '=';
        }
        else if (check_next1(ls, '>')) {
          ls->appendLineBuff('>');
          return TK_ARROW;
        }
        else {
          if (ls->current != '-') {
            return '-';
          }
          /* else is a comment */
          ls->appendLineBuff('-');
          next(ls);
          if (ls->current == '[') {  /* long comment? */
            ls->appendLineBuff('[');
            size_t sep = skip_sep(ls);
            luaZ_resetbuffer(ls->buff);  /* 'skip_sep' may dirty the buffer */
            if (sep >= 2) {
              ls->appendLineBuff(sep - 2, '=');
              ls->appendLineBuff('[');
              SemInfo si;
              read_long_string(ls, &si, sep);  /* skip long comment */
              luaZ_resetbuffer(ls->buff);  /* 'read_long_string' may dirty the buffer */
              if (strstr(getstr(si.ts), "@pluto_warnings") != nullptr)
                ls->lexPushWarningOverride().processComment(getstr(si.ts));
              ls->appendLineBuff(']');
              ls->appendLineBuff(sep - 2, '=');
              ls->appendLineBuff(']');
              if (ls->getLineBuff().find("@fallthrough") != std::string::npos)
                return TK_FALLTHROUGH;
              break;
            }
          }
          /* else short comment */
          while (ls->current == ' ') {
            ls->appendLineBuff(' ');
            next(ls);  /* skip leading spaces */
          }
          if (ls->current == '@') {  /* attribute? */
            ls->appendLineBuff('@');
            save_and_next(ls);
            while (lislalnum(ls->current))
              save_and_next(ls);
            ls->appendLineBuff(luaZ_buffer(ls->buff), luaZ_bufflen(ls->buff));
            if (strncmp(luaZ_buffer(ls->buff), "pluto_use", luaZ_bufflen(ls->buff)) == 0) {
              return TK_USEANN;
            }
          }
          while (!currIsNewline(ls) && ls->current != EOZ) {
            ls->appendLineBuff(ls->current);
            save_and_next(ls);  /* skip until end of line (or end of file) */
          }
          if (strstr(luaZ_buffer(ls->buff), "@pluto_warnings") != nullptr)
            ls->lexPushWarningOverride().processComment(luaZ_buffer(ls->buff));
          luaZ_resetbuffer(ls->buff);
          if (ls->getLineBuff().find("@fallthrough") != std::string::npos)
            return TK_FALLTHROUGH;
          break;
        }
      }
      case '[': {  /* long string or simply '[' */
        ls->appendLineBuff('[');
        size_t sep = skip_sep(ls);
        luaZ_resetbuffer(ls->buff);
        if (sep >= 2) {
          ls->appendLineBuff(sep - 2, '=');
          ls->appendLineBuff('[');
          read_long_string(ls, seminfo, sep);
          ls->appendLineBuff(']');
          ls->appendLineBuff(sep - 2, '=');
          ls->appendLineBuff(']');
          return TK_STRING;
        }
        else if (sep == 0)  /* '[=...' missing second bracket? */
          lexerror(ls, "invalid long string delimiter", TK_STRING);
        return '[';
      }
      case '=': {
        next(ls);
        if (check_next1(ls, '=')) {
          ls->appendLineBuff("==");
          return TK_EQ;  /* '==' */
        }
        else {
          ls->appendLineBuff('=');
          return '=';
        }
      }
      case '<': {
        next(ls);
        if (check_next1(ls, '=')) {
          if (check_next1(ls, '>')) {
            ls->appendLineBuff("<=>");
            ls->uses_spaceship = true;
            return TK_SPACESHIP;  /* '<=>' */
          }
          else {
            ls->appendLineBuff("<=");
            return TK_LE;  /* '<=' */
          }
        }
        else if (check_next1(ls, '<')) {
          if (check_next1(ls, '=')) {  /* compound support */
            ls->appendLineBuff("<<=");
            seminfo->i = TK_SHL;  /* <<= */
            return '=';
          }
          else {
            ls->appendLineBuff("<<");
            return TK_SHL;  /* '<<' */
          }
        }
        else {
          ls->appendLineBuff('<');
          return '<';
        }
      }
      case '>': {
        next(ls);
        if (check_next1(ls, '=')) {
          ls->appendLineBuff(">=");
          return TK_GE;  /* '>=' */
        }
        else if (check_next1(ls, '>')) {
          if (check_next1(ls, '=')) {  /* compound support */
            ls->appendLineBuff(">>=");
            seminfo->i = TK_SHR;  /* >>= */
            return '=';
          }
          else {
            ls->appendLineBuff(">>");
            return TK_SHR;  /* '>>' */
          }
        }
        else {
          ls->appendLineBuff('>');
          return '>';
        }
      }
      case '/': {
        next(ls);
        if (check_next1(ls, '=')) {  /* compound support */
          ls->appendLineBuff("/=");
          seminfo->i = '/';
          return '=';
        } else {
          if (check_next1(ls, '/')) {
            if (!check_next1(ls, '=')) {
              ls->appendLineBuff("//");
              return TK_IDIV;  /* '//' */
            }
            else {  /* floor division compound support */
              ls->appendLineBuff("//=");
              seminfo->i = TK_IDIV;
              return '=';
            }
          }
          else {
            ls->appendLineBuff('/');
            return '/';
          }
        }
      }
      case ':': {
        next(ls);
        if (check_next1(ls, ':')) {
          ls->appendLineBuff("::");
          return TK_DBCOLON;  /* '::' */
        }
        else if (check_next1(ls, '=')) {
          ls->appendLineBuff(":=");
          return TK_WALRUS;
        }
        else {
          ls->appendLineBuff(':');
          return ':';
        }
      }
      case '"':
      case '\'': {  /* short literal strings */
        read_string(ls, ls->current, seminfo);
        return TK_STRING;
      }
      case '$': {  /* interpolated strings */
        next(ls);  /* skip '$' */
        ls->appendLineBuff('$');
        const char del = ls->current;
        if (!check_next1(ls, '"') && !check_next1(ls, '\''))
          return '$';
        ls->appendLineBuff(del);
        {
          Token& t = ls->tokens.emplace_back(Token{});
          t.token = '(';
          t.line = (int)ls->lines.size();
          t.column = (int)ls->getLineBuff().size();
        }
        bool need_concat = false;
        while (ls->current != del) {
          switch (ls->current) {
            case '{':
              if (need_concat) {
                need_concat = false;

                Token& t = ls->tokens.emplace_back(Token{});
                t.token = TK_CONCAT;
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size();
              }
              if (luaZ_bufflen(ls->buff) != 0) {
                { Token& t = ls->tokens.emplace_back(Token{});
                t.token = TK_STRING;
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size();
                t.seminfo.ts = luaX_newstring(ls, luaZ_buffer(ls->buff), luaZ_bufflen(ls->buff));
                luaZ_resetbuffer(ls->buff); }

                { Token& t = ls->tokens.emplace_back(Token{});
                t.token = TK_CONCAT;
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size(); }
              }
              next(ls);  /* skip '{' */
              ls->appendLineBuff('{');
              {
                Token& t = ls->tokens.emplace_back(Token{});
                t.token = '(';
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size();
              }
              while (true) {
                Token t;
                t.token = llex(ls, &t.seminfo, nullptr);
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size();
                if (t.token == '}' || t.token == TK_EOS) break;
                ls->tokens.emplace_back(std::move(t));
              }
              {
                Token& t = ls->tokens.emplace_back(Token{});
                t.token = ')';
                t.line = (int)ls->lines.size();
                t.column = (int)ls->getLineBuff().size();
              }
              need_concat = true;
              break;
            case EOZ:
              lexerror(ls, "unfinished string", TK_EOS);
              break;  /* to avoid warnings */
            case '\n':
            case '\r':
              ls->appendLineBuff((char)ls->current);
              lexerror(ls, "unfinished string", TK_STRING);
              break;  /* to avoid warnings */
            case '\\':  /* escape sequences */
              ls->appendLineBuff((char)ls->current);
              process_string_escape(ls);
              break;
            default:
              ls->appendLineBuff((char)ls->current);
              save_and_next(ls);
          }
        }
        if (luaZ_bufflen(ls->buff) != 0) {
          if (need_concat) {
            need_concat = false;
          
            Token& t = ls->tokens.emplace_back(Token{});
            t.token = TK_CONCAT;
            t.line = (int)ls->lines.size();
            t.column = (int)ls->getLineBuff().size();
          }
          
          Token& t = ls->tokens.emplace_back(Token{});
          t.token = TK_STRING;
          t.line = (int)ls->lines.size();
          t.column = (int)ls->getLineBuff().size();
          t.seminfo.ts = luaX_newstring(ls, luaZ_buffer(ls->buff), luaZ_bufflen(ls->buff));
          luaZ_resetbuffer(ls->buff);
        }
        next(ls);  /* skip delimiter */
        ls->appendLineBuff(del);
        {
          Token& t = ls->tokens.emplace_back(Token{});
          t.token = ')';
          t.line = (int)ls->lines.size();
          t.column = (int)ls->getLineBuff().size();
        }
        break;
      }
      case '.': {  /* '.', '..', '...', or number */
        save_and_next(ls);
        if (check_next1(ls, '.')) {
          if (check_next1(ls, '.')) {
            ls->appendLineBuff("...");
            return TK_DOTS;   /* '...' */
          }
          else {
            if (check_next1(ls, '=')) {
              ls->appendLineBuff("..=");
              seminfo->i = TK_CONCAT;
              return '=';
            } else {
              ls->appendLineBuff("..");
              return TK_CONCAT;   /* '..' */
            }
          }
        }
        else if (!lisdigit(ls->current)) {
          ls->appendLineBuff('.');
          return '.';
        }
        else {
          int ret = read_numeral(ls, seminfo);
          if (ret == TK_INT)
            ls->appendLineBuff(std::to_string(seminfo->i));
          else
            ls->appendLineBuff(std::to_string(seminfo->r));
          return ret;
        }
      }
      case '0': case '1': case '2': case '3': case '4':
      case '5': case '6': case '7': case '8': case '9': {
        int ret = read_numeral(ls, seminfo);
        if (ret == TK_INT)
          ls->appendLineBuff(std::to_string(seminfo->i));
        else
          ls->appendLineBuff(std::to_string(seminfo->r));
        return ret;
      }
      case '_': {  /* arbitrary underscores for more readable long numbers */
        if (lislalpha(ls->current)) {
          TString *ts;
          do {
            save_and_next(ls);
          } while (lislalnum(ls->current));
          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
                                  luaZ_bufflen(ls->buff));
          seminfo->ts = ts;
          ls->appendLineBuff(getstr(ts));
          if (isreserved(ts))
            return ts->extra - 1 + FIRST_RESERVED;
          else {
            return TK_NAME;
          }
        } else {  /* needed to emulate default check because _ is fairly multi-purpose. */
          next(ls);
          if (lisdigit(ls->current)) {
            int ret = read_numeral(ls, seminfo);
            if (ret == TK_INT)
              ls->appendLineBuff(std::to_string(seminfo->i));
            else
              ls->appendLineBuff(std::to_string(seminfo->r));
            return ret;  /* arbitrary character detected in numeral */
          } else {
            ls->appendLineBuff('_');
            return '_';  /* this is a normal underscore */
          }
        }
      }
      case '~': {
        next(ls);
        if (check_next1(ls, '=')) {
          ls->appendLineBuff("~=");
          return TK_NE;
        } else {
          ls->appendLineBuff('~');
          return '~';
        }
      }
      case '!': {
        next(ls);
        if (check_next1(ls, '=')) {
          ls->appendLineBuff("!=");
          return TK_NE2;  /* '!=' */
        }
        ls->appendLineBuff('!');
        seminfo->ts = luaX_newliteral(ls, "!");
        return TK_NOT;
      }
      case '?': {
        next(ls);
        if (check_next1(ls, '?')) {
          if (check_next1(ls, '=')) {
            ls->appendLineBuff("?\?=");
            seminfo->i = TK_COAL;
            return '=';
          } else {
            ls->appendLineBuff("??");
            return TK_COAL;
          }
        }
        else {
          ls->appendLineBuff('?');
          return '?';
        }
      }
      case '*': {  /* special case compound, need to support mul, exponent, and augmented mul */
        next(ls);
        if (check_next1(ls, '=')) {
          ls->appendLineBuff("*=");
          seminfo->i = '*';
          return '=';  /* '*=' */
        }
        else if (check_next1(ls, '*')) { /*  got '**' */  
          if (check_next1(ls, '=')) {  /* compound support; **= */
            ls->appendLineBuff("**=");
            seminfo->i = TK_POW;
            return '=';
          }
          else {
            ls->appendLineBuff("**");
            return TK_POW;  /* '**' */
          }
        }
        else {
          ls->appendLineBuff('*');
          return '*';
        }
      }
      case '|': {
        int c = ls->current;
        next(ls);
        ls->appendLineBuff(c);
        if (check_next1(ls, '=')) {
          seminfo->i = c;
          ls->appendLineBuff('=');
          return '=';
        }
        if (check_next1(ls, '>')) {
          ls->appendLineBuff('>');
          return TK_PIPE;
        }
        return c;
      }
      /* compound support */
      case '+': case '^':
      case '%': case '&': {
        int c = ls->current;
        next(ls);
        if (check_next1(ls, '=')) {
          seminfo->i = c;
          ls->appendLineBuff(c);
          ls->appendLineBuff('=');
          return '=';
        } else {
          ls->appendLineBuff(c);
          return c;
        }
      }
      /* end of compound support */
      case EOZ: {
        return TK_EOS;
      }
      default: {
        if (lislalpha(ls->current)
#ifndef PLUTO_NO_UTF8
            || ((ls->current & 0b10000000) && ls->current != EOF)
#endif
          ) {  /* identifier or reserved word? */
          TString *ts;
          do {
            save_and_next(ls);
          } while (lislalnum(ls->current)
#ifndef PLUTO_NO_UTF8
              || ((ls->current & 0b10000000) && ls->current != EOF)
#endif
            );
          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
                                  luaZ_bufflen(ls->buff));
          seminfo->ts = ts;
          ls->appendLineBuff(ts->toCpp());
          if (isreserved(ts)) {  /* reserved word? */
            int t = ts->extra - 1 + FIRST_RESERVED;
            if (t == TK_NEW || t == TK_PNEW) {
              ls->uses_new = true;
            }
            else if (t == TK_EXTENDS) {
              ls->uses_extends = true;
            }
            else if (t == TK_INSTANCEOF) {
              ls->uses_instanceof = true;
            }
            return t;
          }
          else {
            return TK_NAME;
          }
        }
        else {  /* single-char tokens ('+', '*', '%', '{', '}', ...) */
          int c = ls->current;
          next(ls);
          ls->appendLineBuff(c);
          return c;
        }
      }
    }
  }
}


static void luaX_onPosUpdate (LexState *ls) {
  /* update ls->t */
  ls->t = ls->tokens.at(ls->tidx);
  /* update ls->lastline */
  --ls->tidx;
  ls->lastline = ls->getLineNumber();
  ++ls->tidx;
}


void luaX_next (LexState *ls) {
  ++ls->tidx;
  luaX_onPosUpdate(ls);
}


void luaX_prev (LexState *ls) {
  --ls->tidx;
  luaX_onPosUpdate(ls);
}


size_t luaX_getpos (LexState *ls) {
  return ls->tidx;
}


void luaX_setpos(LexState *ls, size_t pos) {
  ls->tidx = pos;
  luaX_onPosUpdate(ls);
}


int luaX_lookahead (LexState *ls) {
  return ls->tokens.at(ls->tidx + 1).token;
}


const Token& luaX_lookbehind (LexState *ls) {
  return ls->tokens.at(ls->tidx - 1);
}