Expression.cpp 15.1 KB
Newer Older
1
2
3
4
#include <iostream>
#include <locale>
#include <sstream>

5
6
#include "MantidAPI/Expression.h"

7
#include <MantidKernel/StringTokenizer.h>
8

9
10
namespace Mantid {
namespace API {
11

12
typedef Mantid::Kernel::StringTokenizer tokenizer;
13

14
15
const std::string DEFAULT_OPS_STR[] = {";", ",", "=", "== != > < <= >=",
                                       "&& || ^^", "+ -", "* /", "^"};
16

17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
namespace {
/// Make the full text of the error message
/// @param msg :: The text of the error message.
/// @param expr :: An expression string that caused the error.
/// @param i :: An index of a symbol in expr that may help identify the location
///             of the error.
std::string makeErrorMessage(const std::string &msg, const std::string &expr,
                             size_t i) {
  const size_t MAX_LEFT_SIZE = 10;
  const size_t MAX_RIGHT_SIZE = 10;
  std::ostringstream res;
  res << msg << " at\n\n";
  size_t j = i;
  size_t skip = 0;
  size_t n = expr.size();
  std::string leftEllipsis = "";
  if (i > MAX_LEFT_SIZE) {
    skip = i - MAX_LEFT_SIZE;
    leftEllipsis = "...";
    j = MAX_LEFT_SIZE + leftEllipsis.size();
    n -= skip;
  }
  std::string rightEllipsis = "";
  if (n - j > MAX_RIGHT_SIZE) {
    n = i + MAX_RIGHT_SIZE;
    rightEllipsis = "...";
  }
  // Write a substring of expr around the error indicator at symbol #i.
  res << leftEllipsis << expr.substr(skip, n) << rightEllipsis << '\n';
  res << std::string(j, ' ') << '^' << '\n';
  return res.str();
}

} // namespace

/// Constructor
/// @param msg :: The text of the error message.
/// @param expr :: An expression string that caused the error.
/// @param i :: An index of a symbol in expr that may help identify the location
///             of the error.
Expression::ParsingError::ParsingError(const std::string &msg,
                                       const std::string &expr, size_t i)
    : std::runtime_error(makeErrorMessage(msg, expr, i)) {}

/// Constructor
/// @param msg :: The text of the error message.
Expression::ParsingError::ParsingError(const std::string &msg)
    : std::runtime_error(msg) {}

66
Expression::Expression() {
67
68

  m_operators.reset(new Operators());
69
70
71
  // Define binary operators. Put them in the reverse precedence order (from
  // lower to higher prec.)
  std::vector<std::string> ops(DEFAULT_OPS_STR, DEFAULT_OPS_STR + 8);
72
73
74
75

  add_operators(ops);

  // Define unary operators
76
  std::unordered_set<std::string> unary;
77
78
79
80
81
82
83
  unary.insert("+");
  unary.insert("-");

  add_unary(unary);
}

/// contructor
84
Expression::Expression(const std::vector<std::string> &ops) {
85
86
87
88
89
  m_operators.reset(new Operators());
  add_operators(ops);
}

/// contructor
90
Expression::Expression(const std::vector<std::string> &binary,
91
                       const std::unordered_set<std::string> &unary) {
92
93
94
95
96
  m_operators.reset(new Operators());
  add_operators(binary);
  add_unary(unary);
}

97
98
99
100
101
102
103
Expression::Expression(const Expression &expr)
    : // m_tokens(expr.m_tokens),
      // m_expr(expr.m_expr),
      m_funct(expr.m_funct),
      m_op(expr.m_op), m_terms(expr.m_terms), m_operators(expr.m_operators) {}
Expression::Expression(const Expression *pexpr)
    : m_operators(pexpr->m_operators) {}
104
105

/// Assignment operator
106
Expression &Expression::operator=(const Expression &expr) {
107
108
109
110
  m_operators = expr.m_operators;
  m_funct = expr.m_funct;
  m_op = expr.m_op;
  m_terms = expr.m_terms;
111
112
  // m_expr = expr.m_expr;
  // m_tokens = expr.m_tokens;
113
114
115
  return *this;
}

116
void Expression::add_operators(const std::vector<std::string> &ops) {
117
118
  m_operators->binary = ops;
  // Fill in the precedence table (m_op_precedence)
119
  for (size_t i = 0; i < m_operators->binary.size(); i++) {
120
    char j = 0;
121
122
    tokenizer tkz(m_operators->binary[i], " ",
                  tokenizer::TOK_IGNORE_EMPTY | tokenizer::TOK_TRIM);
Hahn, Steven's avatar
Hahn, Steven committed
123
124
125
    for (const auto &index : tkz) {
      m_operators->precedence[index] = i + 1;
      m_operators->op_number[index] = j++;
126
127
128
    }
  }

129
130
  for (auto str : ops) {
    for (char c : str) {
131
132
      if (c == ' ')
        continue;
133
134
135
136
137
      m_operators->symbols.insert(c);
    }
  }
}

138
void Expression::add_unary(const std::unordered_set<std::string> &ops) {
139
  m_operators->unary = ops;
140
141
  for (const auto &op : ops) {
    m_operators->symbols.insert(op.cbegin(), op.cend());
142
143
144
  }
}

145
146
147
148
149
size_t Expression::op_prec(const std::string &op) const {
  std::map<std::string, size_t>::const_iterator i =
      m_operators->precedence.find(op);
  if (i == m_operators->precedence.end())
    return 0;
150
151
152
  return i->second;
}

153
bool Expression::is_unary(const std::string &op) const {
154
  return m_operators->unary.find(op) != m_operators->unary.end();
155
156
}

157
bool Expression::is_op_symbol(const char c) const {
158
  return m_operators->symbols.find(c) != m_operators->symbols.end();
159
160
}

161
void Expression::trim(std::string &str) {
162
163
  size_t i = str.find_first_not_of(" \t\n\r");
  size_t j = str.find_last_not_of(" \t\n\r");
164
  if (i == std::string::npos || j == std::string::npos || j < i) {
165
    str = "";
166
167
  } else {
    str = str.substr(i, j - i + 1);
168
169
170
  }
}

171
void Expression::parse(const std::string &str) {
172
173
174
  m_expr = str;
  trim(m_expr);

175
  if (m_expr.size() > 1 && m_expr.front() == '(' && m_expr.back() == ')') {
176
177
178
    if (m_expr.find('(', 1) == std::string::npos) {
      m_expr.erase(0, 1);
      m_expr.erase(m_expr.size() - 1, 1);
179
180
181
182
183
184
      trim(m_expr);
    }
  }

  tokenize();

185
  if (m_tokens.empty()) {
186
187
188
189
190
    setFunct(m_expr);
    return;
  }

  std::string op = GetOp(0);
191
  // size_t prec = m_operators->precedence[op];
192
  size_t prec = op_prec(op);
193
194
  tokenizer tkz(m_operators->binary[prec - 1], " ",
                tokenizer::TOK_IGNORE_EMPTY | tokenizer::TOK_TRIM);
195
196
197

  setFunct(*tkz.begin());

198
  for (size_t i = 0; i <= m_tokens.size(); i++) {
199
    m_terms.push_back(Expression(this));
200
    Expression &t = m_terms.back();
201
    if (i)
202
      t.m_op = GetOp(i - 1);
203
204
205
206
207
208
    t.parse(GetToken(i));
  }
  m_expr = "";
  m_tokens.clear();
}

209
void Expression::tokenize() {
210
211
  m_tokens.clear();

Peterson, Peter's avatar
Peterson, Peter committed
212
  size_t min_prec = 1000;
213
214
215
216
217
218
219
  size_t is = 0;
  size_t is1 = 0;
  unsigned int lvl = 0;
  size_t last = m_expr.size() - 1;
  bool inString = false;
  int skip = 0;
  bool canBeBinary = false;
220
221
  bool isNumber =
      false; // if parser is inside a number (important case is 123.45e+67)
222
223
224
  bool canDotBeAdded = false;
  bool canEBeAdded = false;
  bool canPlusBeAdded = false;
225
  Tokens tokens;
226
  for (size_t i = 0; i < m_expr.size(); i++) {
227
    char c = m_expr[i];
228

229
230
231
232
    if (!inString && skip == 0) {
      if (isNumber) {
        if (c == '.') {
          if (canDotBeAdded) {
233
            canDotBeAdded = false;
234
          } else {
235
236
            isNumber = false;
          }
237
238
        } else if (c == 'e' || c == 'E') {
          if (canEBeAdded) {
239
240
241
            canEBeAdded = false;
            canDotBeAdded = false;
            canPlusBeAdded = true;
242
          } else {
243
244
            isNumber = false;
          }
245
246
        } else if (c == '+' || c == '-') {
          if (canPlusBeAdded) {
247
248
249
            canPlusBeAdded = false;
            canEBeAdded = false;
            canDotBeAdded = false;
250
          } else {
251
252
            isNumber = false;
          }
253
        } else if (!isdigit(c)) {
254
255
          isNumber = false;
        }
256
      } else if (isdigit(c)) {
257
258
259
260
261
        isNumber = true;
        canDotBeAdded = true;
        canEBeAdded = true;
        canPlusBeAdded = false;
      }
262
      if (lvl == 0 && !isNumber && is_op_symbol(c)) // insert new token
263
      {
264
        if (i == last) {
265
266
267
268
          if (c == ',' || c == ';') {
            m_expr.resize(last);
            break;
          } else {
269
            throw ParsingError("A binary operator isn't followed by a value", m_expr, i);
270
          }
271
272
        }

273
        if (is_op_symbol(m_expr[i + 1])) {
274
          is1 = i + 2;
275
        } else {
276
277
278
          is1 = i + 1;
        }

279
        if (is1 > last) {
280
          throw ParsingError("Syntax error", m_expr, last);
281
282
        }

283
284
        std::string op = m_expr.substr(i, is1 - i);
        size_t prec = canBeBinary ? m_operators->precedence[op] : 0;
285
286
287
288
289
        if (!prec) // operator does not exist
        {
          std::ostringstream mess;
          bool error = true;
          // check if it's a binary and a unary operators together
290
291
          if (op.size() == 2) {
            if (is_unary(op)) {
292
293
294
295
              is1 -= 2;
              skip = 2;
              prec = min_prec + 1; // do not add token
              error = false;
296
            } else {
297
              is1 -= 1;
298
              std::string uop = op.substr(1, 1);
299
              op = op[0];
300
301
302
              if (is_op_symbol(m_expr[is1 + 1])) {
                uop += m_expr[is1 + 1];
                if (is1 + 2 > last) {
303
                  throw ParsingError("Syntax error", m_expr, is1 + 1);
304
305
                }
              }
306
              if (is_unary(uop)) {
307
                prec = m_operators->precedence[op];
308
309
                if (prec) { // we don't want to create a new token with unary
                            // operator. it is processed in SetFunct()
310
311
312
313
314
                  skip = 1;
                  error = false;
                }
              }
            }
315
316
317
          } // op.size == 2
          else if (op.size() == 1) {
            // skip = 1;
318
319
320
            prec = min_prec + 1; // do not add token
            error = false;
          }
321
          if (error) {
322
            throw ParsingError("Unrecognized operator", m_expr, i);
323
324
325
          }
        }

326
        if (prec <= min_prec) {
Peterson, Peter's avatar
Peterson, Peter committed
327
          if (prec < min_prec)
328
329
            min_prec = prec;
          Token tok(is, i - 1, is1, prec);
330
331
332
333
334
335
336
337
          tokens.push_back(tok);
          is = is1;
        }

        i = is1 - 1;

        canBeBinary = false;

338
339
      } // insert new token
      else if (c != ' ' && c != '\t' && c != '\r' && c != '\n') {
340
341
342
        canBeBinary = true;
      }

343
344
345
346
347
348
      if (c == '(')
        lvl++;
      if (c == ')') {
        if (lvl)
          lvl--;
        else {
349
          throw ParsingError("Unmatched bracket", m_expr, 0);
350
351
352
        }
      }
    } // !inString || skip
353
354
    else if (skip > 0) {
      skip--;
355
356
    }

357
    if (c == '"') {
358
      inString = !inString;
359
360
361
362
    }

  } // for i

363
  if (!tokens.empty()) {
364
    // remove operators of higher prec
365
    m_tokens.emplace_back(tokens[0]);
366
367
368
369
370
    for (size_t i = 0; i < tokens.size(); i++) {
      Token &tok = tokens[i];
      std::string op = m_expr.substr(tok.ie + 1, tok.is1 - tok.ie - 1); //?
      if (m_operators->precedence[op] == min_prec) {
        Token &last_tok = m_tokens.back();
371
        last_tok.ie = tok.ie;
372
373
        last_tok.is1 = tok.is1;
        if (i != tokens.size() - 1)
374
          m_tokens.emplace_back(tokens[i + 1]);
375
376
377
378
379
      }
    }
  }
}

380
std::string Expression::GetToken(size_t i) {
381
  if (m_tokens.empty())
382
    return m_expr;
383

384
385
386
  if (i < m_tokens.size()) {
    Token &tok = m_tokens[i];
    return m_expr.substr(tok.is, tok.ie - tok.is + 1);
387
388
  }

389
390
  if (i == m_tokens.size()) {
    Token &tok = m_tokens[i - 1];
391
392
393
394
395
396
    return m_expr.substr(tok.is1);
  }

  return "";
}

397
std::string Expression::GetOp(size_t i) {
398
  if (m_tokens.empty() || i >= m_tokens.size())
399
    return "";
400

401
402
  Token &tok = m_tokens[i];
  return m_expr.substr(tok.ie + 1, tok.is1 - tok.ie - 1);
403
404
}

405
void Expression::logPrint(const std::string &pads) const {
406
  std::string myPads = pads + "   ";
407
  if (!m_terms.empty()) {
Hahn, Steven's avatar
Hahn, Steven committed
408
    std::cerr << myPads << m_op << '[' << m_funct << ']' << "(\n";
Hahn, Steven's avatar
Hahn, Steven committed
409
410
    for (const auto &term : m_terms)
      term.logPrint(myPads);
Hahn, Steven's avatar
Hahn, Steven committed
411
    std::cerr << myPads << ")\n";
412
413
  } else
    std::cerr << myPads << m_op << m_funct << '\n';
414
415
}

416
417
void Expression::setFunct(const std::string &name) {
  if (!op_prec(name)) {
418
    std::string op;
419
420
421
    if (name.size() > 1 && is_op_symbol(name[0])) {
      op = name.substr(0, 1);
      if (name.size() > 2 && is_op_symbol(name[1])) {
422
423
424
        op += name[1];
      }
    }
425
    if (!op.empty() && is_unary(op)) {
426
427
428
429
430
431
432
433
434
435
      m_funct = op;
      Expression tmp(this);
      tmp.parse(name.substr(op.size()));
      m_terms.push_back(tmp);
      return;
    }
  }

  m_funct = name;
  trim(m_funct);
436
  if (m_funct.empty()) {
437
    throw ParsingError("Empty function name");
438
439
440
441
442
443
  }

  // Check if the function has arguments
  std::string::size_type i = std::string::npos;

  bool inQuotes = false;
444
445
  for (std::string::const_iterator c = name.begin(); c != name.end(); ++c) {
    if (*c == '"') {
446
      inQuotes = !inQuotes;
447
448
449
      continue;
    }

450
    if (!inQuotes && *c == '(') {
451
452
453
454
455
      i = c - name.begin();
      break;
    }
  }

456
  if (i != std::string::npos) {
457
    std::string::size_type j = name.find_last_of(')');
458
    if (j == std::string::npos || j < i) {
459
      throw ParsingError("Unmatched bracket", name, i);
460
461
    }

462
    if (j > i + 1) // nonzero argument list
463
    {
464
      std::string args = name.substr(i + 1, j - i - 1); //?
465
      trim(args);
466
      std::string f = name.substr(0, i);
467
468
      Expression tmp(this);
      tmp.parse(args);
469
      if (!tmp.isFunct() || tmp.name() != ",") {
470
        m_terms.push_back(tmp);
471
      } else {
472
473
474
        if (f.empty() && tmp.name() == ",") {
          f = ",";
        }
475
476
477
478
479
480
481
482
483
        std::string my_op = m_op;
        *this = tmp;
        m_op = my_op;
      }
      m_funct = f;
    }
  }
}

484
std::string Expression::str() const {
485
486
487
  bool brackets = false;
  std::ostringstream res;
  size_t prec = op_prec(m_funct);
488
  if (size() == 1 && is_unary(m_funct)) { // unary operator
489
    res << m_funct;
490
    if (op_prec(m_terms[0].m_funct) > 0) {
491
492
      brackets = true;
    }
493
  } else if (!prec) { // function with a name
494
495
    res << m_funct;
    brackets = true;
496
497
  } else if (m_op == "-" && m_funct == "+") {
    brackets = true;
498
499
  }

500
  if (!m_terms.empty()) {
501
502
    if (brackets)
      res << '(';
Hahn, Steven's avatar
Hahn, Steven committed
503
504
505
    for (const auto &term : m_terms) {
      res << term.operator_name();
      size_t prec1 = op_prec(term.m_funct);
506
      bool isItUnary = false;
Hahn, Steven's avatar
Hahn, Steven committed
507
      if (term.size() == 1 && is_unary(term.m_funct)) {
508
509
510
        prec1 = 0; // unary operator
        isItUnary = true;
      }
511
512
513
514
515
      bool bk = prec > 0 && prec1 > 0 && prec > prec1;
      if (bk)
        res << '(';
      if (isItUnary)
        res << ' ';
Hahn, Steven's avatar
Hahn, Steven committed
516
      res << term.str();
517
518
      if (bk)
        res << ')';
519
    }
520
521
    if (brackets)
      res << ')';
522
523
524
525
  }
  return res.str();
}

526
527
528
const Expression &Expression::bracketsRemoved() const {
  const Expression *e = this;
  while (e->name().empty() && e->size() == 1) {
529
530
531
532
533
    e = &e->m_terms[0];
  }
  return *e;
}

534
535
536
/**
 * Return a list of all variable names in this expression
 */
537
538
std::unordered_set<std::string> Expression::getVariables() const {
  std::unordered_set<std::string> out;
539
  if (!isFunct()) {
540
    std::string s = name();
541
    if (!s.empty() && !isdigit(s[0])) {
542
543
      out.insert(s);
    }
544
  } else {
545
546
    for (const auto &e : *this) {
      if (e.isFunct()) {
547
        std::unordered_set<std::string> tout = e.getVariables();
548
549
        out.insert(tout.begin(), tout.end());
      } else {
550
        std::string s = e.name();
551
        if (!s.empty() && !isdigit(s[0])) {
552
553
          out.insert(s);
        }
554
555
556
557
558
559
      }
    }
  }
  return out;
}

560
void Expression::rename(const std::string &newName) { m_funct = newName; }
561

562
563
564
void Expression::renameAll(const std::string &oldName,
                           const std::string &newName) {
  if (!isFunct() && name() == oldName) {
565
    rename(newName);
566
  } else {
567
568
    for (auto &term : m_terms) {
      term.renameAll(oldName, newName);
569
570
571
572
    }
  }
}

573
574
575
void Expression::toList(const std::string &sep) {
  if (name() == sep)
    return;
576
577
578
579
580
581
  Expression term(*this);
  m_terms.resize(1);
  m_terms[0] = term;
  setFunct(sep);
}

582
583
} // API
} // Mantid