parser.c

   1 #include <malloc.h>
   2 #include <math.h>
   3 #include <stdio.h>
   4 #include <stdlib.h>
   5 #include <string.h>
   6
   7 #include "debug.h"
   8
   9 #include "parser.h"
  10
  11 /* global variables */
  12
  13 double answer = 0;
  14
  15 #define DEFAULT_STORAGE_SIZE 10
  16 int storage_size = -1;
  17
  18 double *storage = NULL;
  19
  20 #define DEFAULT_FORMAT "=> %.6g\n"
  21 char *format = NULL;
  22 char *minform = NULL;
  23
  24 workspace_t *programs = NULL;
  25 int nb_programs = 0;
  26
  27 /* compare codes */
  28
  29 int codecmp (char *ref, char *str)
  30 {
  31     int sig;
  32
  33     while (*ref != '\0') {
  34         if (*ref == '\t') {
  35              sig = (*str == '.') ? -1 : ((*str >= '0') && (*str <= '9'));
  36         } else {
  37             sig = *str - *ref;
  38         }
  39         if (sig != 0) {
  40             return (sig > 0) ? 1 : -1;
  41         }
  42         str++;
  43         ref++;
  44     }
  45
  46     return 0;
  47 }
  48
  49 /* calloc or die function */
  50
  51 void *callocordie (size_t count, size_t size)
  52 {
  53     void *new = calloc (count, size);
  54     if (new == NULL) {
  55         VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
  56         exit (1);
  57     }
  58     return new;
  59 }
  60
  61 /* allocate new element */
  62
  63 element_t *newelement (func_t function, int nbops, int prio)
  64 {
  65     element_t *new = (element_t *) callocordie (1, sizeof (element_t));
  66     if (nbops) {
  67         new->ops = (element_t **) callocordie (nbops, sizeof (element_t *));
  68     }
  69     new->func = function;
  70     new->nbops = nbops;
  71     new->prio = prio;
  72
  73     return new;
  74 }
  75
  76 /* desallocate element */
  77
  78 void delelement (element_t *root)
  79 {
  80     if ((root != NULL) && (root != ERROR_OP)) {
  81         int i;
  82         for (i = 0; i < root->nbops; i++) {
  83             if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) {
  84                 delelement (root->ops[i]);
  85             }
  86         }
  87         if (root->nbops) {
  88             free (root->ops);
  89         }
  90         free (root);
  91     }
  92 }
  93
  94 /* duplicate element */
  95
  96 element_t *dupelement (element_t *root)
  97 {
  98     element_t *tmp = NULL;
  99     int i;
 100
 101     if ((root == NULL) || (root == ERROR_OP)) {
 102         return root;
 103     }
 104     tmp = newelement (root->func, root->nbops, root->prio);
 105     tmp->value = root->value;
 106     for (i = 0; i < root->nbops; i++) {
 107         tmp->ops[i] = dupelement (root->ops[i]);
 108     }
 109     return tmp;
 110 }
 111
 112 /* functions */
 113
 114 #define NB_OPERATORS 14
 115 keyword_t operators[NB_OPERATORS] = {
 116     { "+\t", Add, 2, 1, 1},
 117     { "-\t", Sub, 2, 1, 1},
 118     { "*",   Mul, 2, 1, 2},
 119     { "/",   Div, 2, 1, 2},
 120     { "%",   Mod, 2, 1, 3},
 121     { "^",   Pow, 2, 1, 4},
 122     { "==",  Equal, 2, 2, -1},
 123     { "!=",  Diff, 2, 2, -1},
 124     { ">=",  Ge, 2, 2, -1},
 125     { "<=",  Le, 2, 2, -1},
 126     { ">",   Gt, 2, 1, -1},
 127     { "<",   Lt, 2, 1, -1},
 128     { "&",   And, 2, 1, -2},
 129     { "|",   Or, 2, 1, -2}
 130 };
 131
 132 #define NB_FUNCTIONS 31
 133 keyword_t functions[NB_FUNCTIONS] = {
 134     { "sqrt", Sqr, 1, 4, 5},
 135     { "pow",  Pow, 2, 3, 5},
 136     { "cos",  Cos, 1, 3, 5},
 137     { "sin",  Sin, 1, 3, 5},
 138     { "tan",  Tan, 1, 3, 5},
 139     { "acos", Acos, 1, 4, 5},
 140     { "asin", Asin, 1, 4, 5},
 141     { "atan", Atan, 1, 4, 5},
 142     { "log",  Log, 1, 3, 5},
 143     { "exp",  Exp, 1, 3, 5},
 144     { "abs",  Abs, 1, 3, 5},
 145     { "floor", Floor, 1, 5, 5},
 146     { "ceil", Ceil, 1, 4, 5},
 147     { "sto",  Store, 2, 3, 5},
 148     { "rcl",  Recall, 1, 3, 5},
 149     { "inc",  Inc, 1, 3, 5},
 150     { "dec",  Dec, 1, 3, 5},
 151     { "disp", Disp, 0, 4, 9},
 152     { "mem",  Mem, 1, 3, 9},
 153     { "clr",  Clear, 0, 3, 9},
 154     { "quit", Quit, 0, 4, 9},
 155     { "help", Help, 0, 4, 9},
 156     { "!",    Not, 1, 1, 6},
 157     { "cond", Cond, 3, 4, 5},
 158     { "while", While, 2, 5, 5},
 159     { "print", Print, 1, 5, 5},
 160     { "prog", Prog, 3, 4, 9},
 161     { "call", Call, 10, 4, 5},
 162     { "ls",   List, 0, 2, 9},
 163     { "edit", Edit, 1, 4, 9},
 164     { "del",  Del, 1, 3, 9}
 165 };
 166
 167 #define NB_CONSTANTS 3
 168 keyword_t constants[NB_CONSTANTS] = {
 169     { "ans", Ans, 0, 3, 5},
 170     { "e",   E, 0, 1, 5},
 171     { "pi",  Pi, 0, 2, 5}
 172 };
 173
 174 #define NB_SYMBOLS 4
 175 char *symbols[NB_SYMBOLS] = {
 176     "(", ")", "{", "}"
 177 };
 178
 179 /* subparser function */
 180
 181 element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio)
 182 {
 183     element_t *new = newelement (func, nbops, prio);
 184     new->ops[0] = *proot;
 185     new->ops[1] = parser (*pstr, pstr, new->prio);
 186     if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) {
 187         delelement (new->ops[1]);
 188         new->ops[1] = ERROR_OP;
 189     }
 190     if (new->ops[1] == ERROR_OP) {
 191         delelement (new);
 192         *proot = NULL;
 193         return ERROR_OP;
 194     }
 195     *proot = newelement (Val, 1, 5);
 196     (*proot)->ops[0] = new;
 197
 198     return *proot;
 199 }
 200
 201 /* parser function */
 202
 203 element_t *parser (char *str, char **next, int prio)
 204 {
 205     element_t *root = NULL;
 206     int i;
 207
 208     VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n"));
 209
 210     /* main loop */
 211     while (*str != '\0') {
 212         int found = 0;
 213         element_t *new = NULL;
 214         VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str));
 215
 216         /* end without printing */
 217
 218         if (*str == ';') {
 219             if (root) {
 220                 root->hidden = 1;
 221             }
 222             break;
 223         }
 224
 225         /* skip spaces and tabs */
 226
 227         if ((*str == ' ') || (*str == '\t')) {
 228             str++;
 229             continue;
 230         }
 231
 232         /* check for open brace */
 233
 234         if (*str == '{') {
 235             VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n"));
 236             if (root != NULL) {
 237                 delelement (root);
 238                 return ERROR_OP;
 239             }
 240             element_t **prog = NULL;
 241             new = newelement (Code, 0, 5);
 242             root = new;
 243             prog = &root;
 244
 245             do {
 246                 new = parser (str + 1, &str, 0);
 247                 if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 248                     delelement (new);
 249                     new = ERROR_OP;
 250                 }
 251                 if (new == ERROR_OP) {
 252                     delelement (root);
 253                     return ERROR_OP;
 254                 }
 255                 element_t *newprog = newelement (Code, (*prog)->nbops + 1, 5);
 256                 for (i = 0; i < (*prog)->nbops; i++) {
 257                     newprog->ops[i] = (*prog)->ops[i];
 258                     (*prog)->ops[i] = NULL;
 259                 }
 260                 newprog->ops[(*prog)->nbops] = new;
 261                 delelement (*prog);
 262                 (*prog) = newprog;
 263             } while (*str == ',');
 264
 265             if (*str != '}') {
 266                 delelement (root);
 267                 return ERROR_OP;
 268             }
 269             str++;
 270             VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n"));
 271             continue;
 272         }
 273
 274         /* check for open bracket */
 275
 276         if (*str == '(') {
 277             VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n"));
 278             if (root) {
 279                 do {
 280                     found = 0;
 281                     new = parser (str + 1, &str, 0);
 282                     if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 283                         delelement (new);
 284                         new = ERROR_OP;
 285                     }
 286                     if ((new == NULL) || (new == ERROR_OP)) {
 287                         delelement (root);
 288                         return ERROR_OP;
 289                     }
 290                     for (i = 0; i < root->nbops; i++) {
 291                         if (root->ops[i] == NULL) {
 292                             root->ops[i] = new;
 293                             found = 1;
 294                             break;
 295                         }
 296                     }
 297                     if (!found) {
 298                         delelement (new);
 299                         delelement (root);
 300                         return ERROR_OP;
 301                     }
 302                 } while (*str == ',');
 303             } else {
 304                 root = newelement (Val, 1, 5);
 305                 new = parser (str + 1, &str, 0);
 306                 if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 307                     delelement (new);
 308                     new = ERROR_OP;
 309                 }
 310                 if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) {
 311                     delelement (new);
 312                     delelement (root);
 313                     return ERROR_OP;
 314                 }
 315                 root->ops[0] = new;
 316             }
 317             if (*str != ')') {
 318                 delelement (root);
 319                 return ERROR_OP;
 320             }
 321             str++;
 322             VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n"));
 323             continue;
 324         }
 325
 326         /* check for closing bracket, closing brace or koma */
 327
 328         if ((*str == ')') || (*str == '}') || (*str == ',')) {
 329             if (prio == -9) {
 330                 delelement (root);
 331                 return ERROR_OP;
 332             }
 333             if (next != NULL) {
 334                 *next = str;
 335             }
 336             return root;
 337         }
 338
 339         /* look for operators */
 340
 341         for (i = 0; i < NB_OPERATORS; i++) {
 342             keyword_t *operator = operators + i;
 343             if (codecmp (operator->keyword, str) == 0) {
 344                 VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n"));
 345                 if (root) {
 346                     if ((prio) && (prio > operator->prio)) {
 347                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 348                         *next = str;
 349                         return root;
 350                     }
 351                     str += operator->offset;
 352                     VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func));
 353                     if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) {
 354                         delelement (root);
 355                         return ERROR_OP;
 356                     }
 357                 } else if (*str == '-') {
 358                     root = newelement (Sig, 1, 9);
 359                 } else {
 360                     return ERROR_OP;
 361                 }
 362                 found = 1;
 363                 VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n"));
 364                 break;
 365             }
 366         }
 367         if (found) {
 368             continue;
 369         }
 370
 371         /* look for functions */
 372
 373         for (i = 0; i < NB_FUNCTIONS; i++) {
 374             keyword_t *function = functions + i;
 375             if (codecmp (function->keyword, str) == 0) {
 376                 VERBOSE (DEBUG, fprintf (stdout, "start processing function\n"));
 377                 if (root == NULL) {
 378                     VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func));
 379                     root = newelement (function->func, function->nbops, function->prio);
 380                 } else {
 381                     delelement (root);
 382                     return ERROR_OP;
 383                 }
 384                 str += function->offset;
 385                 found = 1;
 386                 VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n"));
 387                 break;
 388             }
 389         }
 390         if (found) {
 391             continue;
 392         }
 393
 394         /* look for constant */
 395
 396         for (i = 0; i < NB_CONSTANTS; i++) {
 397             keyword_t *constant = constants + i;
 398             if (codecmp (constant->keyword, str) == 0) {
 399                 VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n"));
 400                 if (root == NULL) {
 401                     VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func));
 402                     root = newelement (constant->func, constant->nbops, constant->prio);
 403                 } else {
 404                     delelement (root);
 405                     return ERROR_OP;
 406                 }
 407                 str += constant->offset;
 408                 found = 1;
 409                 VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n"));
 410                 break;
 411             }
 412         }
 413         if (found) {
 414             continue;
 415         }
 416
 417         /* look for number */
 418
 419         if (((*str >= '0') && (*str <= '9')) ||
 420             (*str == '.') || (*str == '+') || (*str == '-')) {
 421             VERBOSE (DEBUG, fprintf (stdout, "start processing value\n"));
 422             char *pt;
 423             double value = strtod (str, &pt);
 424             VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value));
 425             if (str != pt) {
 426                 if ((root == NULL) || (root->prio == 6)) {
 427                     new = newelement (Val, 1, 5);
 428                     new->value = value;
 429                     if (root == NULL) {
 430                         root = new;
 431                     } else {
 432                         for (i = 0; i < root->nbops; i++) {
 433                             if (root->ops[i] == NULL) {
 434                                 root->ops[i] = new;
 435                                 found = 1;
 436                                 break;
 437                             }
 438                         }
 439                         if (!found) {
 440                             delelement (new);
 441                             delelement (root);
 442                             return ERROR_OP;
 443                         }
 444                     }
 445                     str = pt;
 446                 } else if ((*str == '+') || (*str == '-')) {
 447                     if ((prio) && (prio > 1)) {
 448                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 449                         *next = str;
 450                         return root;
 451                     }
 452                     if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) {
 453                         delelement (root);
 454                         return ERROR_OP;
 455                     }
 456                 } else {
 457                     delelement (root);
 458                     return ERROR_OP;
 459                 }
 460                 found = 1;
 461             }
 462             VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n"));
 463         }
 464
 465         /* error */
 466
 467         if (!found) {
 468             delelement (root);
 469             return ERROR_OP;
 470         }
 471
 472     }
 473
 474     if (next != NULL) {
 475         *next = str;
 476     }
 477
 478     return root;
 479 }
 480
 481 /* print element tree */
 482
 483 void print_element (element_t *root, int level)
 484 {
 485     char *func = NULL;
 486     int i;
 487
 488     if ((root == NULL) || (root == ERROR_OP)) {
 489         return;
 490     }
 491
 492     for (i = 0; i < level; i++) {
 493         fprintf (stdout, " ");
 494     }
 495
 496     switch (root->func) {
 497     case Val: func = "Value"; break;
 498     case Sig: func = "Sign"; break;
 499     case Add: func = "Addition"; break;
 500     case Sub: func = "Subtraction"; break;
 501     case Mul: func = "Multiplication"; break;
 502     case Div: func = "Division"; break;
 503     case Mod: func = "Modulo"; break;
 504     case Pow: func = "Power"; break;
 505     case Sqr: func = "Square Root"; break;
 506     case Cos: func = "Cosine"; break;
 507     case Sin: func = "Sine"; break;
 508     case Tan: func = "Tangent"; break;
 509     case Acos: func = "Arc Cosine"; break;
 510     case Asin: func = "Arc Sine"; break;
 511     case Atan: func = "Arc Tangent"; break;
 512     case Log: func = "Logarithm"; break;
 513     case Exp: func = "Exponantial"; break;
 514     case Abs: func = "Absolute value"; break;
 515     case Ceil: func = "Ceil value"; break;
 516     case Floor: func = "Floor value"; break;
 517     case Store: func = "Store"; break;
 518     case Recall: func = "Recall"; break;
 519     case Inc: func = "Increase"; break;
 520     case Dec: func = "Decrease"; break;
 521     case Disp: func = "Display"; break;
 522     case Mem: func = "Memory"; break;
 523     case Clear: func = "Clear"; break;
 524     case Quit: func = "Quit"; break;
 525     case Help: func = "Help"; break;
 526     case Ans: func = "Ans"; break;
 527     case Pi: func = "Pi"; break;
 528     case E: func = "E"; break;
 529     case Equal: func = "Equal"; break;
 530     case Diff: func = "Different"; break;
 531     case Ge: func = "Greater or equal"; break;
 532     case Le: func = "Lesser or equal"; break;
 533     case Gt: func = "Greater"; break;
 534     case Lt: func = "Lesser"; break;
 535     case And: func = "And"; break;
 536     case Or: func = "Or"; break;
 537     case Not: func = "Not"; break;
 538     case Cond: func = "Condition"; break;
 539     case While: func = "While"; break;
 540     case Code: func = "Code"; break;
 541     case Print: func = "Print"; break;
 542     case Prog: func = "Program"; break;
 543     case Call: func = "Call"; break;
 544     case List: func = "List"; break;
 545     case Edit: func = "Edit"; break;
 546     case Del: func = "Del"; break;
 547     }
 548
 549     fprintf (stdout, "Function: %s\n", func);
 550
 551     if ((root->func == Val) && (root->ops[0] == NULL)) {
 552         for (i = 0; i < level; i++) {
 553             fprintf (stdout, " ");
 554         }
 555         fprintf (stdout, "value: %f\n", root->value);
 556     } else {
 557         for (i = 0; i < root->nbops; i++) {
 558             print_element (root->ops[i], level + 1);
 559         }
 560     }
 561 }
 562
 563 /* storage functions */
 564
 565 void memory (int nb)
 566 {
 567     int i, l;
 568     double *tmp = NULL;
 569     if (nb != storage_size) {
 570         l = (nb < storage_size) ? nb : storage_size;
 571         tmp = (double *) callocordie (nb, sizeof (double));
 572         for (i = 0; i < l; i++) {
 573             tmp[i] = storage[i];
 574         }
 575         if (storage != NULL) {
 576             free (storage);
 577         }
 578         storage = tmp;
 579         storage_size = nb;
 580     }
 581 }
 582
 583 double store (int index, double value)
 584 {
 585     if (storage_size == -1) {
 586         memory (DEFAULT_STORAGE_SIZE);
 587     }
 588     if ((index > 0) && (index <= storage_size)) {
 589         storage[index - 1] = value;
 590     } else {
 591         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 592     }
 593     return value;
 594 }
 595
 596 double recall (int index)
 597 {
 598     if (storage_size == -1) {
 599         memory (DEFAULT_STORAGE_SIZE);
 600     }
 601     if ((index > 0) && (index <= storage_size)) {
 602         return storage[index - 1];
 603     } else {
 604         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 605     }
 606     return 0;
 607 }
 608
 609 double increase (int index)
 610 {
 611     if (storage_size == -1) {
 612         memory (DEFAULT_STORAGE_SIZE);
 613     }
 614     if ((index > 0) && (index <= storage_size)) {
 615         return storage[index - 1]++;
 616     } else {
 617         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 618     }
 619     return 0;
 620 }
 621
 622 double decrease (int index)
 623 {
 624     if (storage_size == -1) {
 625         memory (DEFAULT_STORAGE_SIZE);
 626     }
 627     if ((index > 0) && (index <= storage_size)) {
 628         return storage[index - 1]--;
 629     } else {
 630         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 631     }
 632     return 0;
 633 }
 634
 635 void display (void)
 636 {
 637     int i;
 638     if (storage_size == -1) {
 639         memory (DEFAULT_STORAGE_SIZE);
 640     }
 641     fprintf (stdout, "storage:");
 642     for (i = 0; i < storage_size; i++) {
 643         fprintf (stdout, " ");
 644         fprintf (stdout, minform, storage[i]);
 645     }
 646     fprintf (stdout, "\n");
 647 }
 648
 649 void clear ()
 650 {
 651     int i;
 652     for (i = 0; i < storage_size; i++) {
 653         storage[i] = 0;
 654     }
 655 }
 656
 657 /* While do function */
 658
 659 double while_do (element_t *cond, element_t *action)
 660 {
 661     double ret = 0;
 662     element_t *temp = NULL;
 663
 664     VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n"));
 665     while (1) {
 666         VERBOSE (DEBUG, fprintf (stdout, "loop...\n"));
 667
 668         temp = dupelement (cond);
 669         if (!evaluate_element (temp, 0)) {
 670             break;
 671         }
 672         if (action) {
 673             temp = dupelement (action);
 674             ret = evaluate_element (temp, 0);
 675         }
 676     }
 677
 678     VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n"));
 679
 680     return ret;
 681 }
 682
 683 /* program function */
 684
 685 double execute_code (element_t **prog, int nbcalls)
 686 {
 687     double ret = 0;
 688     int i;
 689     for (i = 0; i < nbcalls; i++) {
 690         ret = evaluate_element (prog[i], 0);
 691         prog[i] = NULL;
 692     }
 693     return ret;
 694 }
 695
 696 /* print function */
 697
 698 void set_format (char *prompt, int precision)
 699 {
 700     char buffer[128] = {0};
 701     free_format ();
 702     sprintf (buffer, "%s%%.%dg\n", prompt, precision);
 703     format = strdup (buffer);
 704     sprintf (buffer, "%%.%dg", precision);
 705     minform = strdup (buffer);
 706 }
 707
 708 void free_format ()
 709 {
 710     if (format) {
 711         free (format);
 712         format = NULL;
 713     }
 714     if (minform) {
 715         free (minform);
 716         minform = NULL;
 717     }
 718 }
 719
 720 double print (double value)
 721 {
 722     fprintf (stdout, format ? format : DEFAULT_FORMAT, value);
 723     fflush (stdout);
 724     return value;
 725 }
 726
 727 /* quit function */
 728
 729 void quit (void)
 730 {
 731     fprintf (stdout, "bye\n");
 732     exit (0);
 733 }
 734
 735 /* program function */
 736
 737 void prog (int id, int nbmems, element_t *root)
 738 {
 739     int i, n = -1;
 740
 741     if (programs == NULL) {
 742
 743         /* initial memory allocation */
 744         programs = (workspace_t *) callocordie (1, sizeof (workspace_t));
 745         nb_programs = 1;
 746         n = 0;
 747
 748     } else {
 749
 750         /* look for existing program */
 751         for (i = 0; i < nb_programs; i++) {
 752             if ((programs + i)->id == id) {
 753                 n = i;
 754                 break;
 755             }
 756         }
 757         if (n == -1) {
 758
 759             /* new program */
 760             n = nb_programs++;
 761             workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t));
 762             memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t));
 763             free (programs);
 764             programs = tmp;
 765         } else {
 766
 767             /* clean old program */
 768             if ((programs + n)->storage) {
 769                 free ((programs + n)->storage);
 770             }
 771             if ((programs + n)->root) {
 772                 delelement ((programs + n)->root);
 773             }
 774         }
 775     }
 776
 777     /* set program */
 778     (programs + n)->id = id;
 779     (programs + n)->answer = 0;
 780     (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double));
 781     (programs + n)->storage_size = nbmems;
 782     (programs + n)->root = dupelement (root);
 783 }
 784
 785 double call (int id, int nbops, element_t **ops)
 786 {
 787     workspace_t tmp = {0};
 788     int i, n = -1;
 789     double ret = 0;
 790
 791     if (programs) {
 792
 793         /* look for program */
 794         for (i = 0; i < nb_programs; i++) {
 795             if ((programs + i)->id == id) {
 796                 n = i;
 797                 break;
 798             }
 799         }
 800         if (n == -1) {
 801             VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 802             return 0;
 803         }
 804
 805         /* store context */
 806         tmp.answer = answer;
 807         tmp.storage = storage;
 808         tmp.storage_size = storage_size;
 809
 810         /* change context */
 811         answer = 0;
 812         storage = (programs + n)->storage;
 813         storage_size = (programs + n)->storage_size;
 814         if (nbops > storage_size) {
 815             double *tmp = (double *) callocordie (nbops, sizeof (double));
 816             memcpy (tmp, storage, storage_size * sizeof (double));
 817             free (storage);
 818             storage = tmp;
 819             storage_size = nbops;
 820         }
 821         for (i = 0; i < nbops; i++) {
 822             double val = evaluate_element (ops[i], 0);
 823             store (i + 1, val);
 824         }
 825
 826         /* evaluate program */
 827         element_t *elements = dupelement ((programs + n)->root);
 828         ret = evaluate_element (elements, 0);
 829
 830         /* restore context */
 831         answer = tmp.answer;
 832         storage = tmp.storage;
 833         storage_size = tmp.storage_size;
 834     }
 835
 836     return ret;
 837 }
 838
 839 void list ()
 840 {
 841     int i;
 842     if (programs != NULL) {
 843         fprintf (stdout, "programs:");
 844         for (i = 0; i < nb_programs; i++) {
 845             fprintf (stdout, " %d", (programs + i)->id);
 846         }
 847         fprintf (stdout, "\n");
 848     }
 849 }
 850
 851 void edit (int id)
 852 { }
 853
 854 void del (int id)
 855 { }
 856
 857 /* help message */
 858
 859 void help (void)
 860 {
 861     fprintf (stdout, "calc is a simple calculator\n\n");
 862     fprintf (stdout, "supported operators:");
 863     fprintf (stdout, " + - * / %% ^\n");
 864     fprintf (stdout, "camparison operators:");
 865     fprintf (stdout, " == != >= <= > <\n");
 866     fprintf (stdout, "logical operators:");
 867     fprintf (stdout, " & | !\n");
 868     fprintf (stdout, "mathematic functions:");
 869     fprintf (stdout, " pow sqrt log exp\n");
 870     fprintf (stdout, "trig. func.:");
 871     fprintf (stdout, " cos sin tan acos asin atan\n");
 872     fprintf (stdout, "supported functions:");
 873     fprintf (stdout, " abs ceil floor\n");
 874     fprintf (stdout, "storage functions:");
 875     fprintf (stdout, " mem sto rcl inc dec disp\n");
 876     fprintf (stdout, "prog. functions:");
 877     fprintf (stdout, " cond while print {} ;\n");
 878     fprintf (stdout, "misc. functions:");
 879     fprintf (stdout, " quit help\n");
 880     fprintf (stdout, "supported constants:");
 881     fprintf (stdout, " e pi\n");
 882 }
 883
 884 /* evaluate element tree */
 885
 886 #define MASK_SUB 0x1
 887 #define MASK_DIV 0x2
 888
 889 double evaluate_element (element_t *root, char mask)
 890 {
 891     double op0 = 0, op1 = 0;
 892     char nextmask = mask;
 893     int i, nb;
 894
 895     if ((root == NULL) || (root == ERROR_OP)) {
 896         VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
 897         return 0;
 898     }
 899
 900     /* mask to manage sub operator sub and div */
 901     switch (root->func) {
 902     case Add:
 903         nextmask &= ~MASK_SUB;
 904         nextmask &= ~MASK_DIV;
 905         break;
 906     case Sub:
 907         nextmask |= MASK_SUB;
 908         nextmask &= ~MASK_DIV;
 909         break;
 910     case Mul:
 911         nextmask &= ~MASK_DIV;
 912         break;
 913     case Div:
 914         nextmask |= MASK_DIV;
 915         break;
 916     default:
 917         nextmask = mask;
 918     }
 919
 920     switch (root->func) {
 921     case Val:
 922     case Sig:
 923         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value;
 924         break;
 925     case Add:
 926     case Sub:
 927     case Mul:
 928     case Div:
 929     case Mod:
 930     case Pow:
 931     case Store:
 932     case Equal:
 933     case Diff:
 934     case Ge:
 935     case Le:
 936     case Gt:
 937     case Lt:
 938     case And:
 939     case Or:
 940     case Prog:
 941         if (root->ops[1]) {
 942             op1 = evaluate_element (root->ops[1], nextmask);
 943         } else if (root->func != Store) {
 944             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
 945             return 0;
 946         }
 947         /* fallthrough */
 948     case Sqr:
 949     case Cos:
 950     case Sin:
 951     case Tan:
 952     case Acos:
 953     case Asin:
 954     case Atan:
 955     case Log:
 956     case Exp:
 957     case Abs:
 958     case Ceil:
 959     case Floor:
 960     case Recall:
 961     case Inc:
 962     case Dec:
 963     case Not:
 964     case Mem:
 965     case Cond:
 966     case Call:
 967     case Edit:
 968     case Del:
 969         if (root->ops[0]) {
 970             op0 = evaluate_element (root->ops[0], 0);
 971         } else {
 972             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
 973             return 0;
 974         }
 975         break;
 976     case Disp:
 977     case Clear:
 978     case Quit:
 979     case Help:
 980     case Ans:
 981     case Pi:
 982     case E:
 983     case Code:
 984     case List:
 985         break;
 986     case While:
 987         if (root->ops[0] == NULL) {
 988             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
 989             return 0;
 990         }
 991         break;
 992     case Print:
 993         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer;
 994         break;
 995     }
 996
 997     switch (root->func) {
 998     case Val: return op0;
 999     case Sig: return -op0;
1000     case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1;
1001     case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1;
1002     case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1;
1003     case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1;
1004     case Mod: return fmod (op0, op1);
1005     case Pow: return pow (op0, op1);
1006     case Sqr: return sqrt (op0);
1007     case Cos: return cos (op0);
1008     case Sin: return sin (op0);
1009     case Tan: return tan (op0);
1010     case Acos: return acos (op0);
1011     case Asin: return asin (op0);
1012     case Atan: return atan (op0);
1013     case Log: return log (op0);
1014     case Exp: return exp (op0);
1015     case Abs: return fabs (op0);
1016     case Ceil: return ceil (op0);
1017     case Floor: return floor (op0);
1018     case Store: return store ((int)op0, (op1) ? op1 : answer);
1019     case Recall: return recall ((int)op0);
1020     case Inc: return increase ((int)op0);
1021     case Dec: return decrease ((int)op0);
1022     case Disp: display (); break;
1023     case Mem: memory ((int)op0); break;
1024     case Clear: clear (); break;
1025     case Quit: quit (); break;
1026     case Help: help (); break;
1027     case Ans: return answer;
1028     case Pi: return M_PI;
1029     case E: return M_E;
1030     case Equal: return op0 == op1;
1031     case Diff: return op0 != op1;
1032     case Ge: return op0 >= op1;
1033     case Le: return op0 <= op1;
1034     case Gt: return op0 > op1;
1035     case Lt: return op0 < op1;
1036     case And: return (op0 != 0) && (op1 != 0);
1037     case Or: return (op0 != 0) || (op1 != 0);
1038     case Not: return (op0 == 0);
1039     case Cond:
1040         if ((op0) && (root->ops[1])) {
1041             return evaluate_element (root->ops[1], 0);
1042         } else if ((!op0) && (root->ops[2])) {
1043             return evaluate_element (root->ops[2], 0);
1044         } else {
1045             return 0;
1046         }
1047     case While: return while_do (root->ops[0], root->ops[1]);
1048     case Code: return execute_code (root->ops, root->nbops);
1049     case Print: return print (op0);
1050     case Prog: prog ((int)op0, (int)op1, root->ops[2]); break;
1051     case Call:
1052         for (i = 1, nb =0; i < root->nbops; i++) {
1053             if (root->ops[i]) {
1054                 nb++;
1055             }
1056         }
1057         return call ((int)op0, nb, root->ops + 1);
1058     case List: list (); break;
1059     case Edit: edit ((int)op0); break;
1060     case Del: del ((int)op0); break;
1061     }
1062
1063     return 0;
1064 }
1065
1066 char **generate_completion_list ()
1067 {
1068     int i, j, l = 0;
1069     char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
1070
1071     for (i = 0; i < NB_OPERATORS; i++) {
1072         list[l] = strdup ((operators + i)->keyword);
1073         for (j = 0; j < (int)strlen (list[l]); j++) {
1074             if (list[i][j] == '\t') {
1075                 list[i][j] = '\0';
1076             }
1077         }
1078         if (list[l] != NULL) {
1079             l++;
1080         }
1081     }
1082
1083     for (i = 0; i < NB_FUNCTIONS; i++) {
1084         list[l] = strdup ((functions + i)->keyword);
1085         if (list[l] != NULL) {
1086             l++;
1087         }
1088     }
1089
1090     for (i = 0; i < NB_CONSTANTS; i++) {
1091         list[l] = strdup ((constants + i)->keyword);
1092         if (list[l] != NULL) {
1093             l++;
1094         }
1095     }
1096
1097     for (i = 0; i < NB_SYMBOLS; i++) {
1098         list[l] = strdup (symbols[i]);
1099         if (list[l] != NULL) {
1100             l++;
1101         }
1102     }
1103
1104     return (list);
1105 }
1106
1107 void free_completion_list (char **list)
1108 {
1109     int i;
1110
1111     if (list) {
1112         for (i = 0; i < NB_FUNCTIONS + NB_CONSTANTS; i++) {
1113             if (list[i] != NULL) {
1114                 free (list[i]);
1115             }
1116         }
1117         free (list);
1118     }
1119 }
1120
1121
1122 /* vim: set ts=4 sw=4 et: */