campo-sirio/include/expr.cpp

1085 lines
25 KiB
C++
Raw Normal View History

#include <ctype.h>
#include <stdlib.h>
#define __EXPR_CPP
#include <expr.h>
#include <stack.h>
#include <utility.h>
#include <date.h>
TValue::TValue(const real& val)
{
_r = val;
_s = val.string();
_t = _numexpr;
}
void TCodearray::clear()
{
destroy();
TArray::add(new TCode(_endsym));
}
void TCodearray::add(TCodesym sym, const TValue& val)
{
TArray::insert(new TCode(sym, val), last());
}
TObject * TCode::dup() const
{
TCode * o = new TCode(*this);
return o;
}
TCode& TCode::operator =(const TCode& b)
{
_sym = b._sym;
_val = b._val;
return *this;
}
TObject * TVar::dup() const
{
TVar * o = new TVar(*this);
return o;
}
void TVararray::add(const char* name, const TValue& val)
{
TArray::add(new TVar(name, val));
}
void TVararray::set(const char* name, const real& val)
{
for (int i = 0; i < items(); i++)
if (strcmp(((TVar *) objptr(i))->getname(), name) == 0)
{
TArray::add(new TValue(val), i);
return;
}
}
void TVararray::set(const char* name, const char* val)
{
for (int i = 0; i < items(); i++)
if (strcmp(((TVar *) objptr(i))->getname(), name) == 0)
{
TArray::add(new TValue(val), i);
return;
}
}
real __r;
const real& TVararray::getnum(const char* name)
{
int i;
for (i = 0; i < items(); i++)
{
if (strcmp(((TVar*) objptr(i))->getname(), name) == 0)
{
__r = ((TVar*) objptr(i))->number();
return __r;
}
}
fatal_box("Unknown variable : %s", name);
return __r;
}
const real& TVararray::getnum(int varnum)
{
if (varnum >= items())
fatal_box("invalid variable number : %d", varnum);
__r = ((TVar*) objptr(varnum))->number();
return __r;
}
const char* TVararray::getstring(const char* name)
{
const char* s = NULL;
int i;
for (i = 0; i < items(); i++)
{
if (strcmp(((TVar*) objptr(i))->getname(), name) == 0)
return ((TVar*) objptr(i))->string();
}
fatal_box("Unknown variable : %s", name);
return s;
}
const char* TVararray::getstring(int varnum)
{
if (varnum >= items())
fatal_box("invalid variable number : %d", varnum);
return ((TVar*) objptr(varnum))->string();
}
///////////////////////////////////////////////////////////
// TExpression
///////////////////////////////////////////////////////////
TExpression::TExpression(const char* expression, TTypeexp type)
: _original(expression)
{
_val = real(0.0);
_dirty = TRUE;
_type = type;
if (!compile(expression, type))
{
error_box("Wrong expression : %s", expression);
_code.clear();
}
}
TExpression::TExpression(TTypeexp type)
: _original("")
{
_val = real(0.0);
_dirty = FALSE;
_type = type;
_code.clear();
}
TExpression::TExpression(const TExpression & expr)
: _code(expr._code), _var(expr._var),
_val(expr._val), _dirty(expr._dirty),
_type(expr._type), _original(expr._original)
{
}
TObject* TExpression::dup() const
{
TExpression* o = new TExpression(*this);
return o;
}
TExpression::operator const real&()
{
if (user_func_dirty() || _dirty) eval();
_dirty = FALSE;
return _val.number();
}
TExpression::operator const char*()
{
if (user_func_dirty() || _dirty) eval();
_dirty = FALSE;
return _val.string();
}
void TExpression::print_on(ostream& out) const
{ out << _original; }
void TExpression::evaluate_user_func(const char * name, int nparms, TStack & stack, TTypeexp type) const
{
NFCHECK("Unknown function : %s ", name);
for ( int i = nparms ; i > 0; i--)
stack.pop();
stack.push(ZERO);
}
TExpression::operator bool()
{
if (user_func_dirty() || _dirty) eval();
_dirty = FALSE;
return !_val.number().is_zero();
}
void TExpression::setvar(const char* varname, const real& val)
{
_dirty |= _var.getnum(varname) != val;
_var.set(varname, val);
}
void TExpression::setvar(int varnum, const real& val)
{
_dirty |= _var.getnum(varnum) != val;
_var.set(varnum, val);
}
void TExpression::setvar(const char* varname, const char* val)
{
_dirty |= strcmp(_var.getstring(varname), val) != 0;
_var.set(varname, val);
}
void TExpression::setvar(int varnum, const char* val)
{
_dirty |= strcmp(_var.getstring(varnum), val) != 0;
_var.set(varnum, val);
}
void TExpression::eval()
{
TStack evalstack(50);
TBit_array types;
int type_pointer = 0;
TCode instr;
real o1, o2;
TString s1, s2;
types.set(type_pointer, (_type == _numexpr));
TTypeexp type = _type;
_code.begin();
while (!_code.end())
{
instr = _code.step();
switch (instr.getsym())
{
case _invalid:
case _endsym:
break;
case _variable:
if (type == _strexpr)
{
s1 = _var.getstring(instr.string());
evalstack.push(s1);
}
else
{
o1 = _var.getnum(instr.string());
evalstack.push(o1);
}
break;
case _number:
o1 = instr.number();
evalstack.push(o1);
break;
case _string:
s1 = instr.string();
evalstack.push(s1);
break;
case _plus:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
s1 << s2;
evalstack.push(s1);
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(o1 + o2));
}
break;
case _minus:
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(o1 - o2));
break;
case _multiply:
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(o1 * o2));
break;
case _divide:
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(o1 / o2));
break;
case _chgs:
o1 = (real&) evalstack.pop();
evalstack.push(-o1);
break;
case _and:
if (type == _strexpr)
{
o2 = real((const char*)(TString&)evalstack.pop());
o1 = real((const char*)(TString&)evalstack.pop());
evalstack.push(TString((o1 != ZERO && o2 != ZERO) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 != ZERO && o2 != ZERO) ? 1.0 : 0.0));
}
break;
case _or:
if (type == _strexpr)
{
o2 = real((const char*) (TString&)evalstack.pop());
o1 = real((const char*) (TString&)evalstack.pop());
evalstack.push(TString((o1 != ZERO || o2 != ZERO) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 != ZERO || o2 != ZERO) ? 1.0 : 0.0));
}
break;
case _not:
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 == ZERO) ? 1.0 : 0.0));
break;
case _equal:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1 == s2) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 == o2) ? 1.0 : 0.0));
}
break;
case _match:
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1.match(s2)) ? "1" : "0"));
break;
case _noteq:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString(s1 != s2 ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 != o2) ? 1.0 : 0.0));
}
break;
case _lt:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1 < (const char*)s2) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 < o2) ? 1.0 : 0.0));
}
break;
case _gt:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1 > (const char*)s2) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 > o2) ? 1.0 : 0.0));
}
break;
case _lteq:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1 <= (const char*)s2) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 <= o2) ? 1.0 : 0.0));
}
break;
case _gteq:
if (type == _strexpr)
{
s2 = (TString&) evalstack.pop();
s1 = (TString&) evalstack.pop();
evalstack.push(TString((s1 >= (const char*)s2) ? "1" : "0"));
}
else
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real((o1 >= o2) ? 1.0 : 0.0));
}
break;
case _userfunc:
{
const int nparms = (int) ((real &) evalstack.pop()).integer();
evaluate_user_func(instr.string(), nparms, evalstack, type);
}
break;
case _sqrt:
evalstack.push(real(sqrt((real&) evalstack.pop())));
break;
case _sqr:
evalstack.push(real(sqr((real&) evalstack.pop())));
break;
case _exp10:
evalstack.push(real(exp10((real&) evalstack.pop())));
break;
case _exp:
evalstack.push(real(exp((real&) evalstack.pop())));
break;
case _log10:
evalstack.push(real(log10((real&) evalstack.pop())));
break;
case _log:
evalstack.push(real(log((real&) evalstack.pop())));
break;
case _sin:
evalstack.push(real(sin((real&) evalstack.pop())));
break;
case _cos:
evalstack.push(real(cos((real&) evalstack.pop())));
break;
case _tan:
evalstack.push(real(tan((real&) evalstack.pop())));
break;
case _left:
o2 = (real&) evalstack.pop();
s2 = (TString&) evalstack.pop();
s1 = s2.left((int)o2.integer());
evalstack.push(s1);
break;
case _right:
o2 = (real&) evalstack.pop();
s2 = (TString&) evalstack.pop();
s1 = s2.right((int)o2.integer());
evalstack.push(s1);
break;
case _mid:
{
int count = (int)((const real&)evalstack.pop()).integer();
if (count == 0) count--;
const int from = (int)((const real&)evalstack.pop()).integer() - 1;
const TString& s = ((const TString&)evalstack.pop()).mid(from, count);
evalstack.push(s);
}
break;
case _substr:
{
const int to = (int)((const real&)evalstack.pop()).integer();
const int from = (int)((const real&)evalstack.pop()).integer() - 1;
const TString& s = ((const TString&)evalstack.pop()).sub(from, to);
evalstack.push(s);
}
break;
case _pow:
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(pow(o1, o2)));
break;
case _min:
o2 = (real&)evalstack.pop();
o1 = (real&)evalstack.pop();
evalstack.push(real(fnc_min(o1, o2)));
break;
case _max:
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
evalstack.push(real(fnc_max(o1, o2)));
break;
case _upper:
s1 = (TString&) evalstack.pop();
s1.upper();
evalstack.push(s1);
break;
case _round:
{
const int ndec = (int)((real&) evalstack.pop()).integer();
o1 = (real&) evalstack.pop();
o1.round(ndec);
evalstack.push(o1);
}
break;
case _trunc:
{
const int ndec = (int)((real&) evalstack.pop()).integer();
o1 = (real&) evalstack.pop();
o1.trunc(ndec);
evalstack.push(o1);
}
break;
case _ceil:
{
const int ndec = (int)((real&) evalstack.pop()).integer();
o1 = (real&) evalstack.pop();
o1.ceil(ndec);
evalstack.push(o1);
}
break;
case _perc:
{
o2 = (real&) evalstack.pop();
o1 = (real&) evalstack.pop();
const real val = real(o1 * o2 / 100.0);
evalstack.push(val);
}
break;
case _scorp:
{
const real percent = (real&)evalstack.pop();
real val = (real&)evalstack.pop();
val -= val * percent / (percent + 100.0);
evalstack.push(val);
}
break;
case _if:
{
if (type == _strexpr)
{
s1 = (TString&)evalstack.pop();
s2 = (TString&)evalstack.pop();
const real cond = (real) (TString&) evalstack.pop();;
evalstack.push(cond.is_zero() ? s1 : s2);
}
else
{
o1 = (real&)evalstack.pop();
o2 = (real&)evalstack.pop();
const real cond = (real&) evalstack.pop();;
evalstack.push(cond.is_zero() ? o1 : o2);
}
}
break;
case _ansi:
{
const TDate d((const TString&)evalstack.pop());
const TString16 s(d.string(ANSI));
evalstack.push(s);
}
case _num:
type_pointer++;
types.set(type_pointer, FALSE);
type = _strexpr;
break;
case _endnum:
type_pointer--;
type = types[type_pointer] ? _numexpr : _strexpr;
if (type == _numexpr)
evalstack.push(real((TString &) evalstack.pop()));
break;
case _str:
type_pointer++;
types.set(type_pointer, TRUE);
type = _numexpr;
break;
case _endstr:
type_pointer--;
type = types[type_pointer] ? _numexpr : _strexpr;
if (type == _strexpr)
evalstack.push(TString(((real &) evalstack.pop()).string()));
break;
default:
NFCHECK("operazione non valida %d", (int) instr.getsym());
break;
}
}
if (_type == _strexpr)
_val = (TString&)evalstack.pop();
else
_val = (real&)evalstack.pop();
}
HIDDEN const char* _s;
HIDDEN char _tok[81];
TCodesym TExpression::tok2fun(const char* tok) const
{
const int MAX_TOK = 26;
HIDDEN const char* fnstr[MAX_TOK] = { "ANSI", "CEIL", "COS", "EXP", "EXP10",
"IF", "LEFT", "LOG", "LOG10", "MAX",
"MID", "MIN", "NUM", "PERC", "POW",
"RIGHT", "ROUND", "SCORP", "SIN", "SQR",
"SQRT", "STR", "SUBSTR","TAN", "TRUNC",
"UPPER"};
HIDDEN TCodesym fntok[MAX_TOK] = { _ansi, _ceil, _cos, _exp, _exp10,
_if, _left, _log, _log10, _max,
_mid, _min, _num, _perc, _pow,
_right, _round, _scorp, _sin, _sqr,
_sqrt, _str, _substr, _tan, _trunc,
_upper};
int f = 0, l = MAX_TOK-1, i;
while (TRUE)
{
i = (f+l)>>1;
const int cmp = stricmp(tok, fnstr[i]);
if (cmp == 0)
break;
if (cmp > 0) f = i+1;
else l = i-1;
if (f > l)
{
i = -1;
break;
}
}
return i >= 0 ? fntok[i] : _invalid;
}
TCodesym TExpression::__gettoken(bool reduct)
{
TCodesym sym = _invalid;
int i = 0;
_tok[0] = '\0';
while (isspace(*_s)) _s++;
if (!*_s) return _endsym;
if ((reduct) && (*_s == ','))
{
_s++;
return _comma;
}
if (isdigit(*_s) || (*_s == '.') || (*_s == ','))
{
sym = _number;
while (isalpha(*_s) || isdigit(*_s) || (*_s == '-') || (*_s == '[') ||
(*_s == ']') || (*_s == '.') || (*_s == ':') ||
(!reduct && (*_s == ',')))
{
if (*_s == '-')
{
if (_s[1] != '>') break;
_tok[i++] = *(_s++);
_tok[i++] = *(_s++);
sym = _variable;
}
else
{
if (sym == _number)
if ((isalpha(*_s)) ||(*_s == '[') || (*_s == ']') ||
(*_s == ',') || (*_s == ':')) sym = _variable;
_tok[i++] = *(_s++);
}
}
_tok[i] = '\0';
return sym;
}
if (isalpha(*_s) || (*_s == '#'))
{
_tok[i++] = *(_s++);
while (isalpha(*_s) || isdigit(*_s) || (*_s == '-') || (*_s == '[') ||
(*_s == ']') || (*_s == ':') || (!reduct && (*_s == ',')))
{
if (*_s == '-')
{
if (_s[1] != '>') break;
_tok[i++] = *(_s++);
}
_tok[i++] = *(_s++);
}
_tok[i] = '\0';
sym = tok2fun(_tok); // Guy was here!
if (sym != _invalid)
return sym;
for (const char * p = _s; isspace(*p); p++);
if (*p == '(')
return _userfunc;
return _variable;
}
switch (*_s)
{
case '"' :
case '\'' :
{
const char sep = *_s;
_s++;
while ((*_s) && (*_s != sep))
_tok[i++] = *(_s++);
_tok[i] = '\0';
if (*_s == sep) _s++;
return _string;
}
case ',' :
_s++;
return _comma;
case '(' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _lpar;
case ')' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _rpar;
case '+' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _plus;
case '-' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _minus;
case '*' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _multiply;
case '/' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _divide;
case '&' :
_tok[i++] = *(_s++);
if (*_s != '&') break;
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _and;
case '|' :
_tok[i++] = *(_s++);
if (*_s != '|') break;
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _or;
case '!' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
if (*_s == '=')
{
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _noteq;
}
return _not;
case '=' :
_tok[i++] = *(_s++);
if (*_s == '=') _tok[i++] = *(_s++);
_tok[i] = '\0';
return _equal;
case '?' :
_tok[i++] = *(_s++);
if (*_s == '=') _tok[i++] = *(_s++);
_tok[i] = '\0';
return _match;
case '>' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
if (*_s == '=')
{
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _gteq;
}
return _gt;
case '<' :
_tok[i++] = *(_s++);
_tok[i] = '\0';
if (*_s == '=')
{
_tok[i++] = *(_s++);
_tok[i] = '\0';
return _lteq;
}
return _lt;
default:
break;
}
return _invalid;
}
TCodesym TExpression::__factor(TCodesym startsym)
{
TCodesym sym = _invalid;
switch (startsym)
{
case _lpar:
sym = __gettoken();
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken();
break;
case _variable:
case _number:
case _string:
_code.add(startsym, _tok);
if (startsym == _variable)
{
for (int i = 0 ; i < numvar(); i++)
if (strcmp(_tok, varname(i)) == 0) break;
if (i == numvar()) _var.add(_tok);
}
sym = __gettoken(TRUE);
break;
case _userfunc:
{
TValue val (_tok);
sym = __gettoken();
if (sym == _lpar)
{
sym = __gettoken();
int nparms = sym == _rpar ? 0 : 1;
if (sym != _rpar)
{
while ((sym = __expression(sym)) == _comma)
{
sym = __gettoken(TRUE);
nparms++;
}
}
if (sym == _rpar)
{
_code.add(_number, real(nparms));
_code.add(startsym, val);
_user_func_defined = TRUE;
sym = __gettoken(TRUE);
}
}
}
break;
case _sqrt:
case _sqr:
case _exp10:
case _exp:
case _log10:
case _log:
case _sin:
case _cos:
case _tan:
case _ansi:
sym = __gettoken();
if (sym == _lpar) sym = __gettoken();
else break;
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken();
else break;
_code.add(startsym);
break;
case _upper:
sym = __gettoken();
if (sym == _lpar) sym = __gettoken();
else break;
if ((sym == _string) || (sym == _variable)) sym = __expression(sym);
else break;
if (sym == _rpar) sym = __gettoken();
else break;
_code.add(startsym);
break;
case _left:
case _right:
case _pow:
case _min:
case _max:
case _round:
case _ceil:
case _trunc:
case _perc:
case _scorp:
sym = __gettoken();
if (sym == _lpar) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _comma) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken(TRUE);
else break;
_code.add(startsym);
break;
case _mid:
case _substr:
sym = __gettoken();
if (sym == _lpar) sym = __gettoken(TRUE);
else break;
if ((sym == _string) || (sym == _variable)) sym = __expression(sym);
else break;
if (sym == _comma) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _comma) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken(TRUE);
else break;
_code.add(startsym);
break;
case _if:
sym = __gettoken();
if (sym == _lpar) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _comma) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _comma) sym = __gettoken(TRUE);
else break;
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken(TRUE);
else break;
_code.add(startsym);
break;
case _num:
case _str:
_code.add(startsym);
sym = __gettoken();
if (sym == _lpar) sym = __gettoken();
else break;
sym = __expression(sym);
if (sym == _rpar) sym = __gettoken();
else break;
_code.add(startsym == _num ? _endnum : _endstr);
break;
default:
break;
}
return sym;
}
TCodesym TExpression::__term(TCodesym startsym)
{
TCodesym sym;
sym = __factor(startsym);
while ((sym != _endsym) && ((sym == _multiply) || (sym == _divide)))
{
TCodesym savedsym = sym;
sym = __gettoken();
sym = __factor(sym);
_code.add(savedsym);
}
return sym;
}
TCodesym TExpression::__expression(TCodesym startsym)
{
TCodesym sym;
if ((startsym == _minus) || (startsym == _not) || (startsym == _plus))
sym =__gettoken();
else sym = startsym;
sym = __term(sym);
if ((startsym == _minus) || (startsym == _not))
_code.add(startsym == _not ? startsym : _chgs);
while ((sym != _endsym) &&
((sym == _minus) || (sym == _plus) || (sym == _equal) ||
(sym == _noteq) || (sym == _gt) || (sym == _lt) ||
(sym == _gteq) || (sym == _lteq) || (sym == _and) ||
(sym == _or) || (sym == _match)))
{
TCodesym savedsym = sym;
sym = __gettoken();
sym = __term(sym);
_code.add(savedsym);
}
return(sym);
}
bool TExpression::set(const char* expression, TTypeexp type)
{
_original = expression;
_type = type;
_dirty = TRUE;
return compile(expression, type);
}
bool TExpression::compile(const char* expression, TTypeexp type)
{
TString sc(256);
TCodesym currsym;
_user_func_defined = FALSE;
_s = expression;
_type = type;
while (((currsym = __gettoken()) != _endsym) && (currsym != _invalid))
{
if (currsym == _variable)
{
char *s1 = _tok;
while ((*s1) && (*s1 != '[')) s1++;
if (!*s1) sc << " " << _tok;
else
{
*s1 = '\0';
s1++;
char *s2 = s1;
while ((*s1) && (*s1 != ',')) s1++;
if (!*s1) sc << " " << _tok;
else
{
*s1 = '\0';
s1++;
int n1 = atoi(s2);
s2 = s1;
while ((*s1) && (*s1 != ']')) s1++;
if (!*s1) sc << " " << _tok;
else
{
const int n2 = atoi(s2);
sc << format(" mid(%s,%d,%d)", _tok, n1, (n2 < n1) ? 0 : n2 - n1 + 1);
}
}
}
}
else
if (currsym == _string)
{
const char sep (strchr(_tok, '\"') != NULL ? '\'' : '\"');
sc << sep << _tok << sep;
}
else sc << " " << _tok;
}
_s = sc;
_val = real(0.0);
_code.clear();
if (!*_s) return TRUE;
if ((currsym = __gettoken()) == _invalid) return FALSE;
return __expression(currsym) == _endsym;
}
const char* TExpression::last_compiled_token() const
{
return _tok;
}