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     if (count * size == 0) {
  54         return NULL;
  55     }
  56     void *new = calloc (count, size);
  57     if (new == NULL) {
  58         VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
  59         exit (1);
  60     }
  61     return new;
  62 }
  63
  64 /* allocate new element */
  65
  66 element_t *newelement (func_t function, int nbops, int prio)
  67 {
  68     element_t *new = (element_t *) callocordie (1, sizeof (element_t));
  69     if (nbops) {
  70         new->ops = (element_t **) callocordie (nbops, sizeof (element_t *));
  71     }
  72     new->func = function;
  73     new->nbops = nbops;
  74     new->prio = prio;
  75
  76     return new;
  77 }
  78
  79 /* desallocate element */
  80
  81 void delelement (element_t *root)
  82 {
  83     if ((root != NULL) && (root != ERROR_OP)) {
  84         int i;
  85         for (i = 0; i < root->nbops; i++) {
  86             delelement (root->ops[i]);
  87         }
  88         if (root->nbops) {
  89             free (root->ops);
  90         }
  91         free (root);
  92     }
  93 }
  94
  95 /* duplicate element */
  96
  97 element_t *dupelement (element_t *root)
  98 {
  99     element_t *tmp = NULL;
 100     int i;
 101
 102     if ((root == NULL) || (root == ERROR_OP)) {
 103         return root;
 104     }
 105     tmp = newelement (root->func, root->nbops, root->prio);
 106     tmp->value = root->value;
 107     for (i = 0; i < root->nbops; i++) {
 108         tmp->ops[i] = dupelement (root->ops[i]);
 109     }
 110     return tmp;
 111 }
 112
 113 /* functions */
 114
 115 #define NB_OPERATORS 14
 116 keyword_t operators[NB_OPERATORS] = {
 117     { "+\t", Add, 2, 1, 1},
 118     { "-\t", Sub, 2, 1, 1},
 119     { "*",   Mul, 2, 1, 2},
 120     { "/",   Div, 2, 1, 2},
 121     { "%",   Mod, 2, 1, 3},
 122     { "^",   Pow, 2, 1, 4},
 123     { "==",  Equal, 2, 2, -1},
 124     { "!=",  Diff, 2, 2, -1},
 125     { ">=",  Ge, 2, 2, -1},
 126     { "<=",  Le, 2, 2, -1},
 127     { ">",   Gt, 2, 1, -1},
 128     { "<",   Lt, 2, 1, -1},
 129     { "&",   And, 2, 1, -2},
 130     { "|",   Or, 2, 1, -2}
 131 };
 132
 133 #define NB_FUNCTIONS 32
 134 keyword_t functions[NB_FUNCTIONS] = {
 135     { "sqrt", Sqr, 1, 4, 5},
 136     { "pow",  Pow, 2, 3, 5},
 137     { "cos",  Cos, 1, 3, 5},
 138     { "sin",  Sin, 1, 3, 5},
 139     { "tan",  Tan, 1, 3, 5},
 140     { "acos", Acos, 1, 4, 5},
 141     { "asin", Asin, 1, 4, 5},
 142     { "atan", Atan, 1, 4, 5},
 143     { "ln",   Ln, 1, 2, 5},
 144     { "log",  Log, 1, 3, 5},
 145     { "exp",  Exp, 1, 3, 5},
 146     { "abs",  Abs, 1, 3, 5},
 147     { "floor", Floor, 1, 5, 5},
 148     { "ceil", Ceil, 1, 4, 5},
 149     { "sto",  Store, 2, 3, 5},
 150     { "rcl",  Recall, 1, 3, 5},
 151     { "inc",  Inc, 1, 3, 5},
 152     { "dec",  Dec, 1, 3, 5},
 153     { "disp", Disp, 0, 4, 9},
 154     { "mem",  Mem, 1, 3, 9},
 155     { "clr",  Clear, 0, 3, 9},
 156     { "quit", Quit, 0, 4, 9},
 157     { "help", Help, 0, 4, 9},
 158     { "!",    Not, 1, 1, 6},
 159     { "cond", Cond, 3, 4, 5},
 160     { "while", While, 2, 5, 5},
 161     { "print", Print, 1, 5, 5},
 162     { "prog", Prog, 3, 4, 9},
 163     { "call", Call, 10, 4, 5},
 164     { "ls",   List, 0, 2, 9},
 165     { "edit", Edit, 1, 4, 9},
 166     { "del",  Del, 1, 3, 9}
 167 };
 168
 169 #define NB_CONSTANTS 3
 170 keyword_t constants[NB_CONSTANTS] = {
 171     { "ans", Ans, 0, 3, 5},
 172     { "e",   E, 0, 1, 5},
 173     { "pi",  Pi, 0, 2, 5}
 174 };
 175
 176 #define NB_SYMBOLS 4
 177 char *symbols[NB_SYMBOLS] = {
 178     "(", ")", "{", "}"
 179 };
 180
 181 /* subparser function */
 182
 183 element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio)
 184 {
 185     element_t *new = newelement (func, nbops, prio);
 186     new->ops[0] = *proot;
 187     new->ops[1] = parser (*pstr, pstr, new->prio);
 188     if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) {
 189         delelement (new->ops[1]);
 190         new->ops[1] = ERROR_OP;
 191     }
 192     if (new->ops[1] == ERROR_OP) {
 193         delelement (new);
 194         *proot = NULL;
 195         return ERROR_OP;
 196     }
 197     *proot = newelement (Val, 1, 5);
 198     (*proot)->ops[0] = new;
 199
 200     return *proot;
 201 }
 202
 203 /* parser function */
 204
 205 element_t *parser (char *str, char **next, int prio)
 206 {
 207     element_t *root = NULL;
 208     char *string = str;
 209     int i;
 210
 211     VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n"));
 212
 213     /* main loop */
 214     while (*str != '\0') {
 215         int found = 0;
 216         element_t *new = NULL;
 217         VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str));
 218
 219         /* end without printing */
 220
 221         if (*str == ';') {
 222             if (root) {
 223                 root->hidden = 1;
 224             }
 225             break;
 226         }
 227
 228         /* skip spaces and tabs */
 229
 230         if ((*str == ' ') || (*str == '\t')) {
 231             str++;
 232             continue;
 233         }
 234
 235         /* check for open brace */
 236
 237         if (*str == '{') {
 238             VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n"));
 239             if (root != NULL) {
 240                 delelement (root);
 241                 return ERROR_OP;
 242             }
 243             root = newelement (Code, 0, 5);
 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, root->nbops + 1, 5);
 256                 for (i = 0; i < root->nbops; i++) {
 257                     newprog->ops[i] = root->ops[i];
 258                     root->ops[i] = NULL;
 259                 }
 260                 newprog->ops[root->nbops] = new;
 261                 delelement (root);
 262                 root = 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     /* save string */
 479     if (root != NULL) {
 480         root->string = string;
 481     }
 482
 483     return root;
 484 }
 485
 486 /* print element tree */
 487
 488 void print_element (element_t *root, int level)
 489 {
 490     char *func = NULL;
 491     int i;
 492
 493     if ((root == NULL) || (root == ERROR_OP)) {
 494         return;
 495     }
 496
 497     for (i = 0; i < level; i++) {
 498         fprintf (stdout, " ");
 499     }
 500
 501     switch (root->func) {
 502     case Val: func = "Value"; break;
 503     case Sig: func = "Sign"; break;
 504     case Add: func = "Addition"; break;
 505     case Sub: func = "Subtraction"; break;
 506     case Mul: func = "Multiplication"; break;
 507     case Div: func = "Division"; break;
 508     case Mod: func = "Modulo"; break;
 509     case Pow: func = "Power"; break;
 510     case Sqr: func = "Square Root"; break;
 511     case Cos: func = "Cosine"; break;
 512     case Sin: func = "Sine"; break;
 513     case Tan: func = "Tangent"; break;
 514     case Acos: func = "Arc Cosine"; break;
 515     case Asin: func = "Arc Sine"; break;
 516     case Atan: func = "Arc Tangent"; break;
 517     case Ln: func = "Logarithm (e base)"; break;
 518     case Log: func = "Logarithm (10 base)"; break;
 519     case Exp: func = "Exponantial"; break;
 520     case Abs: func = "Absolute value"; break;
 521     case Ceil: func = "Ceil value"; break;
 522     case Floor: func = "Floor value"; break;
 523     case Store: func = "Store"; break;
 524     case Recall: func = "Recall"; break;
 525     case Inc: func = "Increase"; break;
 526     case Dec: func = "Decrease"; break;
 527     case Disp: func = "Display"; break;
 528     case Mem: func = "Memory"; break;
 529     case Clear: func = "Clear"; break;
 530     case Quit: func = "Quit"; break;
 531     case Help: func = "Help"; break;
 532     case Ans: func = "Ans"; break;
 533     case Pi: func = "Pi"; break;
 534     case E: func = "E"; break;
 535     case Equal: func = "Equal"; break;
 536     case Diff: func = "Different"; break;
 537     case Ge: func = "Greater or equal"; break;
 538     case Le: func = "Lesser or equal"; break;
 539     case Gt: func = "Greater"; break;
 540     case Lt: func = "Lesser"; break;
 541     case And: func = "And"; break;
 542     case Or: func = "Or"; break;
 543     case Not: func = "Not"; break;
 544     case Cond: func = "Condition"; break;
 545     case While: func = "While"; break;
 546     case Code: func = "Code"; break;
 547     case Print: func = "Print"; break;
 548     case Prog: func = "Program"; break;
 549     case Call: func = "Call"; break;
 550     case List: func = "List"; break;
 551     case Edit: func = "Edit"; break;
 552     case Del: func = "Del"; break;
 553     }
 554
 555     fprintf (stdout, "Function: %s\n", func);
 556
 557     if ((root->func == Val) && (root->ops[0] == NULL)) {
 558         for (i = 0; i < level; i++) {
 559             fprintf (stdout, " ");
 560         }
 561         fprintf (stdout, "value: %f\n", root->value);
 562     } else {
 563         for (i = 0; i < root->nbops; i++) {
 564             print_element (root->ops[i], level + 1);
 565         }
 566     }
 567 }
 568
 569 /* storage functions */
 570
 571 void memory (int nb)
 572 {
 573     int i, l;
 574     double *tmp = NULL;
 575     if (nb != storage_size) {
 576         l = (nb < storage_size) ? nb : storage_size;
 577         tmp = (double *) callocordie (nb, sizeof (double));
 578         for (i = 0; i < l; i++) {
 579             tmp[i] = storage[i];
 580         }
 581         if (storage != NULL) {
 582             free (storage);
 583         }
 584         storage = tmp;
 585         storage_size = nb;
 586     }
 587 }
 588
 589 double store (int index, double value)
 590 {
 591     if (storage_size == -1) {
 592         memory (DEFAULT_STORAGE_SIZE);
 593     }
 594     if ((index > 0) && (index <= storage_size)) {
 595         storage[index - 1] = value;
 596     } else {
 597         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 598     }
 599     return value;
 600 }
 601
 602 double recall (int index)
 603 {
 604     if (storage_size == -1) {
 605         memory (DEFAULT_STORAGE_SIZE);
 606     }
 607     if ((index > 0) && (index <= storage_size)) {
 608         return storage[index - 1];
 609     } else {
 610         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 611     }
 612     return 0;
 613 }
 614
 615 double increase (int index)
 616 {
 617     if (storage_size == -1) {
 618         memory (DEFAULT_STORAGE_SIZE);
 619     }
 620     if ((index > 0) && (index <= storage_size)) {
 621         return storage[index - 1]++;
 622     } else {
 623         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 624     }
 625     return 0;
 626 }
 627
 628 double decrease (int index)
 629 {
 630     if (storage_size == -1) {
 631         memory (DEFAULT_STORAGE_SIZE);
 632     }
 633     if ((index > 0) && (index <= storage_size)) {
 634         return storage[index - 1]--;
 635     } else {
 636         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 637     }
 638     return 0;
 639 }
 640
 641 void display (void)
 642 {
 643     int i;
 644     if (storage_size == -1) {
 645         memory (DEFAULT_STORAGE_SIZE);
 646     }
 647     fprintf (stdout, "storage:");
 648     for (i = 0; i < storage_size; i++) {
 649         fprintf (stdout, " ");
 650         fprintf (stdout, minform, storage[i]);
 651     }
 652     fprintf (stdout, "\n");
 653 }
 654
 655 void clear ()
 656 {
 657     int i;
 658     for (i = 0; i < storage_size; i++) {
 659         storage[i] = 0;
 660     }
 661 }
 662
 663 /* While do function */
 664
 665 double while_do (element_t *cond, element_t *action)
 666 {
 667     double ret = 0;
 668     element_t *temp = NULL;
 669
 670     VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n"));
 671     while (1) {
 672         VERBOSE (DEBUG, fprintf (stdout, "loop...\n"));
 673
 674         temp = dupelement (cond);
 675         double test = evaluate_element (temp, 0);
 676         delelement (temp);
 677         if (!test) {
 678             break;
 679         }
 680         if (action) {
 681             temp = dupelement (action);
 682             ret = evaluate_element (temp, 0);
 683             delelement (temp);
 684         }
 685     }
 686
 687     VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n"));
 688
 689     return ret;
 690 }
 691
 692 /* program function */
 693
 694 double execute_code (element_t **prog, int nbcalls)
 695 {
 696     double ret = 0;
 697     int i;
 698     for (i = 0; i < nbcalls; i++) {
 699         ret = evaluate_element (prog[i], 0);
 700     }
 701     return ret;
 702 }
 703
 704 /* print function */
 705
 706 void set_format (char *prompt, int precision)
 707 {
 708     char buffer[128] = {0};
 709     free_format ();
 710     sprintf (buffer, "%s%%.%dg\n", prompt, precision);
 711     format = strdup (buffer);
 712     sprintf (buffer, "%%.%dg", precision);
 713     minform = strdup (buffer);
 714 }
 715
 716 void free_format ()
 717 {
 718     if (format) {
 719         free (format);
 720         format = NULL;
 721     }
 722     if (minform) {
 723         free (minform);
 724         minform = NULL;
 725     }
 726 }
 727
 728 double print (double value)
 729 {
 730     fprintf (stdout, format ? format : DEFAULT_FORMAT, value);
 731     fflush (stdout);
 732     return value;
 733 }
 734
 735 /* quit function */
 736
 737 void quit (void)
 738 {
 739     fprintf (stdout, "bye\n");
 740     exit (0);
 741 }
 742
 743 /* program function */
 744
 745 void prog (int id, int nbmems, element_t *root)
 746 {
 747     int i, n = -1;
 748
 749     if (programs == NULL) {
 750
 751         /* initial memory allocation */
 752         programs = (workspace_t *) callocordie (1, sizeof (workspace_t));
 753         nb_programs = 1;
 754         n = 0;
 755
 756     } else {
 757
 758         /* look for existing program */
 759         for (i = 0; i < nb_programs; i++) {
 760             if ((programs + i)->id == id) {
 761                 n = i;
 762                 break;
 763             }
 764         }
 765         if (n == -1) {
 766
 767             /* new program */
 768             n = nb_programs++;
 769             workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t));
 770             memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t));
 771             free (programs);
 772             programs = tmp;
 773         } else {
 774
 775             /* clean old program */
 776             if ((programs + n)->storage) {
 777                 free ((programs + n)->storage);
 778             }
 779             if ((programs + n)->root) {
 780                 delelement ((programs + n)->root);
 781             }
 782             if ((programs + n)->string) {
 783                 free ((programs + n)->string);
 784                 (programs + n)->string = NULL;
 785             }
 786         }
 787     }
 788
 789     /* set program */
 790     (programs + n)->id = id;
 791     (programs + n)->answer = 0;
 792     (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double));
 793     (programs + n)->storage_size = nbmems;
 794     (programs + n)->root = dupelement (root);
 795 }
 796
 797 double call (int id, int nbops, element_t **ops)
 798 {
 799     workspace_t tmp = {0};
 800     int i, n = -1;
 801     double ret = 0;
 802
 803     if (programs) {
 804
 805         /* look for program */
 806         for (i = 0; i < nb_programs; i++) {
 807             if ((programs + i)->id == id) {
 808                 n = i;
 809                 break;
 810             }
 811         }
 812     }
 813     if (n == -1) {
 814         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 815         return 0;
 816     }
 817
 818     /* store context */
 819     tmp.answer = answer;
 820     tmp.storage = storage;
 821     tmp.storage_size = storage_size;
 822
 823     /* change context */
 824     answer = 0;
 825     storage = (programs + n)->storage;
 826     storage_size = (programs + n)->storage_size;
 827     if (nbops > storage_size) {
 828         double *tmp = (double *) callocordie (nbops, sizeof (double));
 829         memcpy (tmp, storage, storage_size * sizeof (double));
 830         free (storage);
 831         (programs + n)->storage = storage = tmp;
 832         (programs + n)->storage_size = storage_size = nbops;
 833     }
 834     for (i = 0; i < nbops; i++) {
 835         double val = evaluate_element (ops[i], 0);
 836         store (i + 1, val);
 837     }
 838
 839     /* evaluate program */
 840     element_t *elements = dupelement ((programs + n)->root);
 841     ret = evaluate_element (elements, 0);
 842     delelement (elements);
 843
 844     /* restore context */
 845     answer = tmp.answer;
 846     storage = tmp.storage;
 847     storage_size = tmp.storage_size;
 848
 849     return ret;
 850 }
 851
 852 void list ()
 853 {
 854     int i;
 855     fprintf (stdout, "programs:");
 856     for (i = 0; i < nb_programs; i++) {
 857         fprintf (stdout, " %d", (programs + i)->id);
 858     }
 859     fprintf (stdout, "\n");
 860 }
 861
 862 void edit (int id)
 863 {
 864     int i, n = -1;
 865
 866     if (programs) {
 867
 868         /* look for program */
 869         for (i = 0; i < nb_programs; i++) {
 870             if ((programs + i)->id == id) {
 871                 n = i;
 872                 break;
 873             }
 874         }
 875     }
 876     if (n == -1) {
 877         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 878         return;
 879     }
 880
 881     /* set string program */
 882     fprintf (stdout, "edit: %s\n", (programs + n)->string);
 883 }
 884
 885 void savestring (int id, char *string)
 886 {
 887     int i, n = -1;
 888
 889     if (programs) {
 890
 891         /* look for program */
 892         for (i = 0; i < nb_programs; i++) {
 893             if ((programs + i)->id == id) {
 894                 n = i;
 895                 break;
 896             }
 897         }
 898     }
 899
 900     /* unnecesary code */
 901     //if (n == -1) {
 902     //    VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 903     //    return;
 904     //}
 905     //if ((programs + n)->string) {
 906     //    free ((programs + n)->string);
 907     //}
 908
 909     (programs + n)->string = strdup (string);
 910 }
 911
 912 void del (int id)
 913 {
 914     int i, j, n = -1;
 915
 916     if (programs) {
 917
 918         /* look for program */
 919         for (i = 0; i < nb_programs; i++) {
 920             if ((programs + i)->id == id) {
 921                 n = i;
 922                 break;
 923             }
 924         }
 925     }
 926     if (n == -1) {
 927         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 928         return;
 929     }
 930
 931     /* clean program */
 932     if ((programs + n)->storage) {
 933         free ((programs + n)->storage);
 934     }
 935     if ((programs + n)->root) {
 936         delelement ((programs + n)->root);
 937     }
 938     if ((programs + n)->string) {
 939         free ((programs + n)->string);
 940     }
 941
 942     /* remove entry */
 943     workspace_t *tmp = (workspace_t *) callocordie (nb_programs - 1, sizeof (workspace_t));
 944     for (i = 0, j = 0; i < nb_programs; i++) {
 945         if (i != n) {
 946             memcpy (tmp + j, programs + i, sizeof (workspace_t));
 947             j++;
 948         }
 949     }
 950     free (programs);
 951     programs = tmp;
 952     nb_programs--;
 953 }
 954
 955 /* help message */
 956
 957 void help (void)
 958 {
 959     fprintf (stdout, "calc is a simple calculator\n\n");
 960     fprintf (stdout, "supported operators:");
 961     fprintf (stdout, " + - * / %% ^\n");
 962     fprintf (stdout, "camparison operators:");
 963     fprintf (stdout, " == != >= <= > <\n");
 964     fprintf (stdout, "logical operators:");
 965     fprintf (stdout, " & | !\n");
 966     fprintf (stdout, "mathematic functions:");
 967     fprintf (stdout, " exp ln log pow sqrt\n");
 968     fprintf (stdout, "trig. func.:");
 969     fprintf (stdout, " acos asin atan cos sin tan\n");
 970     fprintf (stdout, "supported functions:");
 971     fprintf (stdout, " abs ceil floor\n");
 972     fprintf (stdout, "stor. functions:");
 973     fprintf (stdout, " clear dec disp inc mem rcl sto\n");
 974     fprintf (stdout, "cond. functions:");
 975     fprintf (stdout, " cond print while {} ;\n");
 976     fprintf (stdout, "prog. functions:");
 977     fprintf (stdout, " call del edit ls prog\n");
 978     fprintf (stdout, "misc. functions:");
 979     fprintf (stdout, " help quit\n");
 980     fprintf (stdout, "supported constants:");
 981     fprintf (stdout, " ans e pi\n");
 982 }
 983
 984 /* evaluate element tree */
 985
 986 #define MASK_SUB 0x1
 987 #define MASK_DIV 0x2
 988
 989 double evaluate_element (element_t *root, char mask)
 990 {
 991     double op0 = 0, op1 = 0;
 992     char nextmask = mask;
 993     int i, nb;
 994
 995     if ((root == NULL) || (root == ERROR_OP)) {
 996         VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
 997         return 0;
 998     }
 999
1000     /* mask to manage sub operator sub and div */
1001     switch (root->func) {
1002     case Add:
1003         nextmask &= ~MASK_SUB;
1004         nextmask &= ~MASK_DIV;
1005         break;
1006     case Sub:
1007         nextmask |= MASK_SUB;
1008         nextmask &= ~MASK_DIV;
1009         break;
1010     case Mul:
1011         nextmask &= ~MASK_DIV;
1012         break;
1013     case Div:
1014         nextmask |= MASK_DIV;
1015         break;
1016     default:
1017         nextmask = mask;
1018     }
1019
1020     switch (root->func) {
1021     case Val:
1022     case Sig:
1023         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value;
1024         break;
1025     case Add:
1026     case Sub:
1027     case Mul:
1028     case Div:
1029     case Mod:
1030     case Pow:
1031     case Store:
1032     case Equal:
1033     case Diff:
1034     case Ge:
1035     case Le:
1036     case Gt:
1037     case Lt:
1038     case And:
1039     case Or:
1040     case Prog:
1041         if (root->ops[1]) {
1042             op1 = evaluate_element (root->ops[1], nextmask);
1043         } else if (root->func != Store) {
1044             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
1045             return 0;
1046         }
1047         /* fallthrough */
1048     case Sqr:
1049     case Cos:
1050     case Sin:
1051     case Tan:
1052     case Acos:
1053     case Asin:
1054     case Atan:
1055     case Ln:
1056     case Log:
1057     case Exp:
1058     case Abs:
1059     case Ceil:
1060     case Floor:
1061     case Recall:
1062     case Inc:
1063     case Dec:
1064     case Not:
1065     case Mem:
1066     case Cond:
1067     case Call:
1068     case Edit:
1069     case Del:
1070         if (root->ops[0]) {
1071             op0 = evaluate_element (root->ops[0], 0);
1072         } else {
1073             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1074             return 0;
1075         }
1076         break;
1077     case Disp:
1078     case Clear:
1079     case Quit:
1080     case Help:
1081     case Ans:
1082     case Pi:
1083     case E:
1084     case Code:
1085     case List:
1086         break;
1087     case While:
1088         if (root->ops[0] == NULL) {
1089             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1090             return 0;
1091         }
1092         break;
1093     case Print:
1094         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer;
1095         break;
1096     }
1097
1098     switch (root->func) {
1099     case Val: return op0;
1100     case Sig: return -op0;
1101     case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1;
1102     case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1;
1103     case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1;
1104     case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1;
1105     case Mod: return fmod (op0, op1);
1106     case Pow: return pow (op0, op1);
1107     case Sqr: return sqrt (op0);
1108     case Cos: return cos (op0);
1109     case Sin: return sin (op0);
1110     case Tan: return tan (op0);
1111     case Acos: return acos (op0);
1112     case Asin: return asin (op0);
1113     case Atan: return atan (op0);
1114     case Ln: return log (op0);
1115     case Log: return log10 (op0);
1116     case Exp: return exp (op0);
1117     case Abs: return fabs (op0);
1118     case Ceil: return ceil (op0);
1119     case Floor: return floor (op0);
1120     case Store: return store ((int)op0, (op1) ? op1 : answer);
1121     case Recall: return recall ((int)op0);
1122     case Inc: return increase ((int)op0);
1123     case Dec: return decrease ((int)op0);
1124     case Disp: display (); break;
1125     case Mem: memory ((int)op0); break;
1126     case Clear: clear (); break;
1127     case Quit: quit (); break;
1128     case Help: help (); break;
1129     case Ans: return answer;
1130     case Pi: return M_PI;
1131     case E: return M_E;
1132     case Equal: return op0 == op1;
1133     case Diff: return op0 != op1;
1134     case Ge: return op0 >= op1;
1135     case Le: return op0 <= op1;
1136     case Gt: return op0 > op1;
1137     case Lt: return op0 < op1;
1138     case And: return (op0 != 0) && (op1 != 0);
1139     case Or: return (op0 != 0) || (op1 != 0);
1140     case Not: return (op0 == 0);
1141     case Cond:
1142         if ((op0) && (root->ops[1])) {
1143             return evaluate_element (root->ops[1], 0);
1144         } else if ((!op0) && (root->ops[2])) {
1145             return evaluate_element (root->ops[2], 0);
1146         } else {
1147             return 0;
1148         }
1149     case While: return while_do (root->ops[0], root->ops[1]);
1150     case Code: return execute_code (root->ops, root->nbops);
1151     case Print: return print (op0);
1152     case Prog:
1153         prog ((int)op0, (int)op1, root->ops[2]);
1154         savestring ((int)op0, root->string);
1155         break;
1156     case Call:
1157         for (i = 1, nb =0; i < root->nbops; i++) {
1158             if (root->ops[i]) {
1159                 nb++;
1160             }
1161         }
1162         return call ((int)op0, nb, root->ops + 1);
1163     case List: list (); break;
1164     case Edit: edit ((int)op0); break;
1165     case Del: del ((int)op0); break;
1166     }
1167
1168     return 0;
1169 }
1170
1171 char **generate_completion_list ()
1172 {
1173     int i, j, l = 0;
1174     char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
1175
1176     for (i = 0; i < NB_OPERATORS; i++) {
1177         list[l] = strdup ((operators + i)->keyword);
1178         for (j = 0; j < (int)strlen (list[l]); j++) {
1179             if (list[i][j] == '\t') {
1180                 list[i][j] = '\0';
1181             }
1182         }
1183         if (list[l] != NULL) {
1184             l++;
1185         }
1186     }
1187
1188     for (i = 0; i < NB_FUNCTIONS; i++) {
1189         list[l] = strdup ((functions + i)->keyword);
1190         if (list[l] != NULL) {
1191             l++;
1192         }
1193     }
1194
1195     for (i = 0; i < NB_CONSTANTS; i++) {
1196         list[l] = strdup ((constants + i)->keyword);
1197         if (list[l] != NULL) {
1198             l++;
1199         }
1200     }
1201
1202     for (i = 0; i < NB_SYMBOLS; i++) {
1203         list[l] = strdup (symbols[i]);
1204         if (list[l] != NULL) {
1205             l++;
1206         }
1207     }
1208
1209     return (list);
1210 }
1211
1212 void free_completion_list (char **list)
1213 {
1214     int i;
1215
1216     if (list) {
1217         for (i = 0; i < NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1; i++) {
1218             if (list[i] != NULL) {
1219                 free (list[i]);
1220             }
1221         }
1222         free (list);
1223     }
1224 }
1225
1226
1227 /* vim: set ts=4 sw=4 et: */