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             if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) {
  87                 delelement (root->ops[i]);
  88             }
  89         }
  90         if (root->nbops) {
  91             free (root->ops);
  92         }
  93         free (root);
  94     }
  95 }
  96
  97 /* duplicate element */
  98
  99 element_t *dupelement (element_t *root)
 100 {
 101     element_t *tmp = NULL;
 102     int i;
 103
 104     if ((root == NULL) || (root == ERROR_OP)) {
 105         return root;
 106     }
 107     tmp = newelement (root->func, root->nbops, root->prio);
 108     tmp->value = root->value;
 109     for (i = 0; i < root->nbops; i++) {
 110         tmp->ops[i] = dupelement (root->ops[i]);
 111     }
 112     return tmp;
 113 }
 114
 115 /* functions */
 116
 117 #define NB_OPERATORS 14
 118 keyword_t operators[NB_OPERATORS] = {
 119     { "+\t", Add, 2, 1, 1},
 120     { "-\t", Sub, 2, 1, 1},
 121     { "*",   Mul, 2, 1, 2},
 122     { "/",   Div, 2, 1, 2},
 123     { "%",   Mod, 2, 1, 3},
 124     { "^",   Pow, 2, 1, 4},
 125     { "==",  Equal, 2, 2, -1},
 126     { "!=",  Diff, 2, 2, -1},
 127     { ">=",  Ge, 2, 2, -1},
 128     { "<=",  Le, 2, 2, -1},
 129     { ">",   Gt, 2, 1, -1},
 130     { "<",   Lt, 2, 1, -1},
 131     { "&",   And, 2, 1, -2},
 132     { "|",   Or, 2, 1, -2}
 133 };
 134
 135 #define NB_FUNCTIONS 31
 136 keyword_t functions[NB_FUNCTIONS] = {
 137     { "sqrt", Sqr, 1, 4, 5},
 138     { "pow",  Pow, 2, 3, 5},
 139     { "cos",  Cos, 1, 3, 5},
 140     { "sin",  Sin, 1, 3, 5},
 141     { "tan",  Tan, 1, 3, 5},
 142     { "acos", Acos, 1, 4, 5},
 143     { "asin", Asin, 1, 4, 5},
 144     { "atan", Atan, 1, 4, 5},
 145     { "log",  Log, 1, 3, 5},
 146     { "exp",  Exp, 1, 3, 5},
 147     { "abs",  Abs, 1, 3, 5},
 148     { "floor", Floor, 1, 5, 5},
 149     { "ceil", Ceil, 1, 4, 5},
 150     { "sto",  Store, 2, 3, 5},
 151     { "rcl",  Recall, 1, 3, 5},
 152     { "inc",  Inc, 1, 3, 5},
 153     { "dec",  Dec, 1, 3, 5},
 154     { "disp", Disp, 0, 4, 9},
 155     { "mem",  Mem, 1, 3, 9},
 156     { "clr",  Clear, 0, 3, 9},
 157     { "quit", Quit, 0, 4, 9},
 158     { "help", Help, 0, 4, 9},
 159     { "!",    Not, 1, 1, 6},
 160     { "cond", Cond, 3, 4, 5},
 161     { "while", While, 2, 5, 5},
 162     { "print", Print, 1, 5, 5},
 163     { "prog", Prog, 3, 4, 9},
 164     { "call", Call, 10, 4, 5},
 165     { "ls",   List, 0, 2, 9},
 166     { "edit", Edit, 1, 4, 9},
 167     { "del",  Del, 1, 3, 9}
 168 };
 169
 170 #define NB_CONSTANTS 3
 171 keyword_t constants[NB_CONSTANTS] = {
 172     { "ans", Ans, 0, 3, 5},
 173     { "e",   E, 0, 1, 5},
 174     { "pi",  Pi, 0, 2, 5}
 175 };
 176
 177 #define NB_SYMBOLS 4
 178 char *symbols[NB_SYMBOLS] = {
 179     "(", ")", "{", "}"
 180 };
 181
 182 /* subparser function */
 183
 184 element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio)
 185 {
 186     element_t *new = newelement (func, nbops, prio);
 187     new->ops[0] = *proot;
 188     new->ops[1] = parser (*pstr, pstr, new->prio);
 189     if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) {
 190         delelement (new->ops[1]);
 191         new->ops[1] = ERROR_OP;
 192     }
 193     if (new->ops[1] == ERROR_OP) {
 194         delelement (new);
 195         *proot = NULL;
 196         return ERROR_OP;
 197     }
 198     *proot = newelement (Val, 1, 5);
 199     (*proot)->ops[0] = new;
 200
 201     return *proot;
 202 }
 203
 204 /* parser function */
 205
 206 element_t *parser (char *str, char **next, int prio)
 207 {
 208     element_t *root = NULL;
 209     char *string = str;
 210     int i;
 211
 212     VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n"));
 213
 214     /* main loop */
 215     while (*str != '\0') {
 216         int found = 0;
 217         element_t *new = NULL;
 218         VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str));
 219
 220         /* end without printing */
 221
 222         if (*str == ';') {
 223             if (root) {
 224                 root->hidden = 1;
 225             }
 226             break;
 227         }
 228
 229         /* skip spaces and tabs */
 230
 231         if ((*str == ' ') || (*str == '\t')) {
 232             str++;
 233             continue;
 234         }
 235
 236         /* check for open brace */
 237
 238         if (*str == '{') {
 239             VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n"));
 240             if (root != NULL) {
 241                 delelement (root);
 242                 return ERROR_OP;
 243             }
 244             element_t **prog = NULL;
 245             new = newelement (Code, 0, 5);
 246             root = new;
 247             prog = &root;
 248
 249             do {
 250                 new = parser (str + 1, &str, 0);
 251                 if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 252                     delelement (new);
 253                     new = ERROR_OP;
 254                 }
 255                 if (new == ERROR_OP) {
 256                     delelement (root);
 257                     return ERROR_OP;
 258                 }
 259                 element_t *newprog = newelement (Code, (*prog)->nbops + 1, 5);
 260                 for (i = 0; i < (*prog)->nbops; i++) {
 261                     newprog->ops[i] = (*prog)->ops[i];
 262                     (*prog)->ops[i] = NULL;
 263                 }
 264                 newprog->ops[(*prog)->nbops] = new;
 265                 delelement (*prog);
 266                 (*prog) = newprog;
 267             } while (*str == ',');
 268
 269             if (*str != '}') {
 270                 delelement (root);
 271                 return ERROR_OP;
 272             }
 273             str++;
 274             VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n"));
 275             continue;
 276         }
 277
 278         /* check for open bracket */
 279
 280         if (*str == '(') {
 281             VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n"));
 282             if (root) {
 283                 do {
 284                     found = 0;
 285                     new = parser (str + 1, &str, 0);
 286                     if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 287                         delelement (new);
 288                         new = ERROR_OP;
 289                     }
 290                     if ((new == NULL) || (new == ERROR_OP)) {
 291                         delelement (root);
 292                         return ERROR_OP;
 293                     }
 294                     for (i = 0; i < root->nbops; i++) {
 295                         if (root->ops[i] == NULL) {
 296                             root->ops[i] = new;
 297                             found = 1;
 298                             break;
 299                         }
 300                     }
 301                     if (!found) {
 302                         delelement (new);
 303                         delelement (root);
 304                         return ERROR_OP;
 305                     }
 306                 } while (*str == ',');
 307             } else {
 308                 root = newelement (Val, 1, 5);
 309                 new = parser (str + 1, &str, 0);
 310                 if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 311                     delelement (new);
 312                     new = ERROR_OP;
 313                 }
 314                 if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) {
 315                     delelement (new);
 316                     delelement (root);
 317                     return ERROR_OP;
 318                 }
 319                 root->ops[0] = new;
 320             }
 321             if (*str != ')') {
 322                 delelement (root);
 323                 return ERROR_OP;
 324             }
 325             str++;
 326             VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n"));
 327             continue;
 328         }
 329
 330         /* check for closing bracket, closing brace or koma */
 331
 332         if ((*str == ')') || (*str == '}') || (*str == ',')) {
 333             if (prio == -9) {
 334                 delelement (root);
 335                 return ERROR_OP;
 336             }
 337             if (next != NULL) {
 338                 *next = str;
 339             }
 340             return root;
 341         }
 342
 343         /* look for operators */
 344
 345         for (i = 0; i < NB_OPERATORS; i++) {
 346             keyword_t *operator = operators + i;
 347             if (codecmp (operator->keyword, str) == 0) {
 348                 VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n"));
 349                 if (root) {
 350                     if ((prio) && (prio > operator->prio)) {
 351                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 352                         *next = str;
 353                         return root;
 354                     }
 355                     str += operator->offset;
 356                     VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func));
 357                     if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) {
 358                         delelement (root);
 359                         return ERROR_OP;
 360                     }
 361                 } else if (*str == '-') {
 362                     root = newelement (Sig, 1, 9);
 363                 } else {
 364                     return ERROR_OP;
 365                 }
 366                 found = 1;
 367                 VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n"));
 368                 break;
 369             }
 370         }
 371         if (found) {
 372             continue;
 373         }
 374
 375         /* look for functions */
 376
 377         for (i = 0; i < NB_FUNCTIONS; i++) {
 378             keyword_t *function = functions + i;
 379             if (codecmp (function->keyword, str) == 0) {
 380                 VERBOSE (DEBUG, fprintf (stdout, "start processing function\n"));
 381                 if (root == NULL) {
 382                     VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func));
 383                     root = newelement (function->func, function->nbops, function->prio);
 384                 } else {
 385                     delelement (root);
 386                     return ERROR_OP;
 387                 }
 388                 str += function->offset;
 389                 found = 1;
 390                 VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n"));
 391                 break;
 392             }
 393         }
 394         if (found) {
 395             continue;
 396         }
 397
 398         /* look for constant */
 399
 400         for (i = 0; i < NB_CONSTANTS; i++) {
 401             keyword_t *constant = constants + i;
 402             if (codecmp (constant->keyword, str) == 0) {
 403                 VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n"));
 404                 if (root == NULL) {
 405                     VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func));
 406                     root = newelement (constant->func, constant->nbops, constant->prio);
 407                 } else {
 408                     delelement (root);
 409                     return ERROR_OP;
 410                 }
 411                 str += constant->offset;
 412                 found = 1;
 413                 VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n"));
 414                 break;
 415             }
 416         }
 417         if (found) {
 418             continue;
 419         }
 420
 421         /* look for number */
 422
 423         if (((*str >= '0') && (*str <= '9')) ||
 424             (*str == '.') || (*str == '+') || (*str == '-')) {
 425             VERBOSE (DEBUG, fprintf (stdout, "start processing value\n"));
 426             char *pt;
 427             double value = strtod (str, &pt);
 428             VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value));
 429             if (str != pt) {
 430                 if ((root == NULL) || (root->prio == 6)) {
 431                     new = newelement (Val, 1, 5);
 432                     new->value = value;
 433                     if (root == NULL) {
 434                         root = new;
 435                     } else {
 436                         for (i = 0; i < root->nbops; i++) {
 437                             if (root->ops[i] == NULL) {
 438                                 root->ops[i] = new;
 439                                 found = 1;
 440                                 break;
 441                             }
 442                         }
 443                         if (!found) {
 444                             delelement (new);
 445                             delelement (root);
 446                             return ERROR_OP;
 447                         }
 448                     }
 449                     str = pt;
 450                 } else if ((*str == '+') || (*str == '-')) {
 451                     if ((prio) && (prio > 1)) {
 452                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 453                         *next = str;
 454                         return root;
 455                     }
 456                     if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) {
 457                         delelement (root);
 458                         return ERROR_OP;
 459                     }
 460                 } else {
 461                     delelement (root);
 462                     return ERROR_OP;
 463                 }
 464                 found = 1;
 465             }
 466             VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n"));
 467         }
 468
 469         /* error */
 470
 471         if (!found) {
 472             delelement (root);
 473             return ERROR_OP;
 474         }
 475
 476     }
 477
 478     if (next != NULL) {
 479         *next = str;
 480     }
 481
 482     /* save string */
 483     if (root != NULL) {
 484         root->string = string;
 485     }
 486
 487     return root;
 488 }
 489
 490 /* print element tree */
 491
 492 void print_element (element_t *root, int level)
 493 {
 494     char *func = NULL;
 495     int i;
 496
 497     if ((root == NULL) || (root == ERROR_OP)) {
 498         return;
 499     }
 500
 501     for (i = 0; i < level; i++) {
 502         fprintf (stdout, " ");
 503     }
 504
 505     switch (root->func) {
 506     case Val: func = "Value"; break;
 507     case Sig: func = "Sign"; break;
 508     case Add: func = "Addition"; break;
 509     case Sub: func = "Subtraction"; break;
 510     case Mul: func = "Multiplication"; break;
 511     case Div: func = "Division"; break;
 512     case Mod: func = "Modulo"; break;
 513     case Pow: func = "Power"; break;
 514     case Sqr: func = "Square Root"; break;
 515     case Cos: func = "Cosine"; break;
 516     case Sin: func = "Sine"; break;
 517     case Tan: func = "Tangent"; break;
 518     case Acos: func = "Arc Cosine"; break;
 519     case Asin: func = "Arc Sine"; break;
 520     case Atan: func = "Arc Tangent"; break;
 521     case Log: func = "Logarithm"; break;
 522     case Exp: func = "Exponantial"; break;
 523     case Abs: func = "Absolute value"; break;
 524     case Ceil: func = "Ceil value"; break;
 525     case Floor: func = "Floor value"; break;
 526     case Store: func = "Store"; break;
 527     case Recall: func = "Recall"; break;
 528     case Inc: func = "Increase"; break;
 529     case Dec: func = "Decrease"; break;
 530     case Disp: func = "Display"; break;
 531     case Mem: func = "Memory"; break;
 532     case Clear: func = "Clear"; break;
 533     case Quit: func = "Quit"; break;
 534     case Help: func = "Help"; break;
 535     case Ans: func = "Ans"; break;
 536     case Pi: func = "Pi"; break;
 537     case E: func = "E"; break;
 538     case Equal: func = "Equal"; break;
 539     case Diff: func = "Different"; break;
 540     case Ge: func = "Greater or equal"; break;
 541     case Le: func = "Lesser or equal"; break;
 542     case Gt: func = "Greater"; break;
 543     case Lt: func = "Lesser"; break;
 544     case And: func = "And"; break;
 545     case Or: func = "Or"; break;
 546     case Not: func = "Not"; break;
 547     case Cond: func = "Condition"; break;
 548     case While: func = "While"; break;
 549     case Code: func = "Code"; break;
 550     case Print: func = "Print"; break;
 551     case Prog: func = "Program"; break;
 552     case Call: func = "Call"; break;
 553     case List: func = "List"; break;
 554     case Edit: func = "Edit"; break;
 555     case Del: func = "Del"; break;
 556     }
 557
 558     fprintf (stdout, "Function: %s\n", func);
 559
 560     if ((root->func == Val) && (root->ops[0] == NULL)) {
 561         for (i = 0; i < level; i++) {
 562             fprintf (stdout, " ");
 563         }
 564         fprintf (stdout, "value: %f\n", root->value);
 565     } else {
 566         for (i = 0; i < root->nbops; i++) {
 567             print_element (root->ops[i], level + 1);
 568         }
 569     }
 570 }
 571
 572 /* storage functions */
 573
 574 void memory (int nb)
 575 {
 576     int i, l;
 577     double *tmp = NULL;
 578     if (nb != storage_size) {
 579         l = (nb < storage_size) ? nb : storage_size;
 580         tmp = (double *) callocordie (nb, sizeof (double));
 581         for (i = 0; i < l; i++) {
 582             tmp[i] = storage[i];
 583         }
 584         if (storage != NULL) {
 585             free (storage);
 586         }
 587         storage = tmp;
 588         storage_size = nb;
 589     }
 590 }
 591
 592 double store (int index, double value)
 593 {
 594     if (storage_size == -1) {
 595         memory (DEFAULT_STORAGE_SIZE);
 596     }
 597     if ((index > 0) && (index <= storage_size)) {
 598         storage[index - 1] = value;
 599     } else {
 600         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 601     }
 602     return value;
 603 }
 604
 605 double recall (int index)
 606 {
 607     if (storage_size == -1) {
 608         memory (DEFAULT_STORAGE_SIZE);
 609     }
 610     if ((index > 0) && (index <= storage_size)) {
 611         return storage[index - 1];
 612     } else {
 613         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 614     }
 615     return 0;
 616 }
 617
 618 double increase (int index)
 619 {
 620     if (storage_size == -1) {
 621         memory (DEFAULT_STORAGE_SIZE);
 622     }
 623     if ((index > 0) && (index <= storage_size)) {
 624         return storage[index - 1]++;
 625     } else {
 626         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 627     }
 628     return 0;
 629 }
 630
 631 double decrease (int index)
 632 {
 633     if (storage_size == -1) {
 634         memory (DEFAULT_STORAGE_SIZE);
 635     }
 636     if ((index > 0) && (index <= storage_size)) {
 637         return storage[index - 1]--;
 638     } else {
 639         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 640     }
 641     return 0;
 642 }
 643
 644 void display (void)
 645 {
 646     int i;
 647     if (storage_size == -1) {
 648         memory (DEFAULT_STORAGE_SIZE);
 649     }
 650     fprintf (stdout, "storage:");
 651     for (i = 0; i < storage_size; i++) {
 652         fprintf (stdout, " ");
 653         fprintf (stdout, minform, storage[i]);
 654     }
 655     fprintf (stdout, "\n");
 656 }
 657
 658 void clear ()
 659 {
 660     int i;
 661     for (i = 0; i < storage_size; i++) {
 662         storage[i] = 0;
 663     }
 664 }
 665
 666 /* While do function */
 667
 668 double while_do (element_t *cond, element_t *action)
 669 {
 670     double ret = 0;
 671     element_t *temp = NULL;
 672
 673     VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n"));
 674     while (1) {
 675         VERBOSE (DEBUG, fprintf (stdout, "loop...\n"));
 676
 677         temp = dupelement (cond);
 678         if (!evaluate_element (temp, 0)) {
 679             break;
 680         }
 681         if (action) {
 682             temp = dupelement (action);
 683             ret = evaluate_element (temp, 0);
 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         prog[i] = NULL;
 701     }
 702     return ret;
 703 }
 704
 705 /* print function */
 706
 707 void set_format (char *prompt, int precision)
 708 {
 709     char buffer[128] = {0};
 710     free_format ();
 711     sprintf (buffer, "%s%%.%dg\n", prompt, precision);
 712     format = strdup (buffer);
 713     sprintf (buffer, "%%.%dg", precision);
 714     minform = strdup (buffer);
 715 }
 716
 717 void free_format ()
 718 {
 719     if (format) {
 720         free (format);
 721         format = NULL;
 722     }
 723     if (minform) {
 724         free (minform);
 725         minform = NULL;
 726     }
 727 }
 728
 729 double print (double value)
 730 {
 731     fprintf (stdout, format ? format : DEFAULT_FORMAT, value);
 732     fflush (stdout);
 733     return value;
 734 }
 735
 736 /* quit function */
 737
 738 void quit (void)
 739 {
 740     fprintf (stdout, "bye\n");
 741     exit (0);
 742 }
 743
 744 /* program function */
 745
 746 void prog (int id, int nbmems, element_t *root)
 747 {
 748     int i, n = -1;
 749
 750     if (programs == NULL) {
 751
 752         /* initial memory allocation */
 753         programs = (workspace_t *) callocordie (1, sizeof (workspace_t));
 754         nb_programs = 1;
 755         n = 0;
 756
 757     } else {
 758
 759         /* look for existing program */
 760         for (i = 0; i < nb_programs; i++) {
 761             if ((programs + i)->id == id) {
 762                 n = i;
 763                 break;
 764             }
 765         }
 766         if (n == -1) {
 767
 768             /* new program */
 769             n = nb_programs++;
 770             workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t));
 771             memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t));
 772             free (programs);
 773             programs = tmp;
 774         } else {
 775
 776             /* clean old program */
 777             if ((programs + n)->storage) {
 778                 free ((programs + n)->storage);
 779             }
 780             if ((programs + n)->root) {
 781                 delelement ((programs + n)->root);
 782             }
 783             if ((programs + n)->string) {
 784                 free ((programs + n)->string);
 785                 (programs + n)->string = NULL;
 786             }
 787         }
 788     }
 789
 790     /* set program */
 791     (programs + n)->id = id;
 792     (programs + n)->answer = 0;
 793     (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double));
 794     (programs + n)->storage_size = nbmems;
 795     (programs + n)->root = dupelement (root);
 796 }
 797
 798 double call (int id, int nbops, element_t **ops)
 799 {
 800     workspace_t tmp = {0};
 801     int i, n = -1;
 802     double ret = 0;
 803
 804     if (programs) {
 805
 806         /* look for program */
 807         for (i = 0; i < nb_programs; i++) {
 808             if ((programs + i)->id == id) {
 809                 n = i;
 810                 break;
 811             }
 812         }
 813     }
 814     if (n == -1) {
 815         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 816         return 0;
 817     }
 818
 819     /* store context */
 820     tmp.answer = answer;
 821     tmp.storage = storage;
 822     tmp.storage_size = storage_size;
 823
 824     /* change context */
 825     answer = 0;
 826     storage = (programs + n)->storage;
 827     storage_size = (programs + n)->storage_size;
 828     if (nbops > storage_size) {
 829         double *tmp = (double *) callocordie (nbops, sizeof (double));
 830         memcpy (tmp, storage, storage_size * sizeof (double));
 831         free (storage);
 832         storage = tmp;
 833         storage_size = nbops;
 834     }
 835     for (i = 0; i < nbops; i++) {
 836         double val = evaluate_element (ops[i], 0);
 837         store (i + 1, val);
 838     }
 839
 840     /* evaluate program */
 841     element_t *elements = dupelement ((programs + n)->root);
 842     ret = evaluate_element (elements, 0);
 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, " pow sqrt log exp\n");
 968     fprintf (stdout, "trig. func.:");
 969     fprintf (stdout, " cos sin tan acos asin atan\n");
 970     fprintf (stdout, "supported functions:");
 971     fprintf (stdout, " abs ceil floor\n");
 972     fprintf (stdout, "storage functions:");
 973     fprintf (stdout, " mem sto rcl inc dec disp\n");
 974     fprintf (stdout, "prog. functions:");
 975     fprintf (stdout, " cond while print {} ;\n");
 976     fprintf (stdout, "misc. functions:");
 977     fprintf (stdout, " quit help\n");
 978     fprintf (stdout, "supported constants:");
 979     fprintf (stdout, " e pi\n");
 980 }
 981
 982 /* evaluate element tree */
 983
 984 #define MASK_SUB 0x1
 985 #define MASK_DIV 0x2
 986
 987 double evaluate_element (element_t *root, char mask)
 988 {
 989     double op0 = 0, op1 = 0;
 990     char nextmask = mask;
 991     int i, nb;
 992
 993     if ((root == NULL) || (root == ERROR_OP)) {
 994         VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
 995         return 0;
 996     }
 997
 998     /* mask to manage sub operator sub and div */
 999     switch (root->func) {
1000     case Add:
1001         nextmask &= ~MASK_SUB;
1002         nextmask &= ~MASK_DIV;
1003         break;
1004     case Sub:
1005         nextmask |= MASK_SUB;
1006         nextmask &= ~MASK_DIV;
1007         break;
1008     case Mul:
1009         nextmask &= ~MASK_DIV;
1010         break;
1011     case Div:
1012         nextmask |= MASK_DIV;
1013         break;
1014     default:
1015         nextmask = mask;
1016     }
1017
1018     switch (root->func) {
1019     case Val:
1020     case Sig:
1021         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value;
1022         break;
1023     case Add:
1024     case Sub:
1025     case Mul:
1026     case Div:
1027     case Mod:
1028     case Pow:
1029     case Store:
1030     case Equal:
1031     case Diff:
1032     case Ge:
1033     case Le:
1034     case Gt:
1035     case Lt:
1036     case And:
1037     case Or:
1038     case Prog:
1039         if (root->ops[1]) {
1040             op1 = evaluate_element (root->ops[1], nextmask);
1041         } else if (root->func != Store) {
1042             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
1043             return 0;
1044         }
1045         /* fallthrough */
1046     case Sqr:
1047     case Cos:
1048     case Sin:
1049     case Tan:
1050     case Acos:
1051     case Asin:
1052     case Atan:
1053     case Log:
1054     case Exp:
1055     case Abs:
1056     case Ceil:
1057     case Floor:
1058     case Recall:
1059     case Inc:
1060     case Dec:
1061     case Not:
1062     case Mem:
1063     case Cond:
1064     case Call:
1065     case Edit:
1066     case Del:
1067         if (root->ops[0]) {
1068             op0 = evaluate_element (root->ops[0], 0);
1069         } else {
1070             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1071             return 0;
1072         }
1073         break;
1074     case Disp:
1075     case Clear:
1076     case Quit:
1077     case Help:
1078     case Ans:
1079     case Pi:
1080     case E:
1081     case Code:
1082     case List:
1083         break;
1084     case While:
1085         if (root->ops[0] == NULL) {
1086             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1087             return 0;
1088         }
1089         break;
1090     case Print:
1091         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer;
1092         break;
1093     }
1094
1095     switch (root->func) {
1096     case Val: return op0;
1097     case Sig: return -op0;
1098     case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1;
1099     case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1;
1100     case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1;
1101     case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1;
1102     case Mod: return fmod (op0, op1);
1103     case Pow: return pow (op0, op1);
1104     case Sqr: return sqrt (op0);
1105     case Cos: return cos (op0);
1106     case Sin: return sin (op0);
1107     case Tan: return tan (op0);
1108     case Acos: return acos (op0);
1109     case Asin: return asin (op0);
1110     case Atan: return atan (op0);
1111     case Log: return log (op0);
1112     case Exp: return exp (op0);
1113     case Abs: return fabs (op0);
1114     case Ceil: return ceil (op0);
1115     case Floor: return floor (op0);
1116     case Store: return store ((int)op0, (op1) ? op1 : answer);
1117     case Recall: return recall ((int)op0);
1118     case Inc: return increase ((int)op0);
1119     case Dec: return decrease ((int)op0);
1120     case Disp: display (); break;
1121     case Mem: memory ((int)op0); break;
1122     case Clear: clear (); break;
1123     case Quit: quit (); break;
1124     case Help: help (); break;
1125     case Ans: return answer;
1126     case Pi: return M_PI;
1127     case E: return M_E;
1128     case Equal: return op0 == op1;
1129     case Diff: return op0 != op1;
1130     case Ge: return op0 >= op1;
1131     case Le: return op0 <= op1;
1132     case Gt: return op0 > op1;
1133     case Lt: return op0 < op1;
1134     case And: return (op0 != 0) && (op1 != 0);
1135     case Or: return (op0 != 0) || (op1 != 0);
1136     case Not: return (op0 == 0);
1137     case Cond:
1138         if ((op0) && (root->ops[1])) {
1139             return evaluate_element (root->ops[1], 0);
1140         } else if ((!op0) && (root->ops[2])) {
1141             return evaluate_element (root->ops[2], 0);
1142         } else {
1143             return 0;
1144         }
1145     case While: return while_do (root->ops[0], root->ops[1]);
1146     case Code: return execute_code (root->ops, root->nbops);
1147     case Print: return print (op0);
1148     case Prog:
1149         prog ((int)op0, (int)op1, root->ops[2]);
1150         savestring ((int)op0, root->string);
1151         break;
1152     case Call:
1153         for (i = 1, nb =0; i < root->nbops; i++) {
1154             if (root->ops[i]) {
1155                 nb++;
1156             }
1157         }
1158         return call ((int)op0, nb, root->ops + 1);
1159     case List: list (); break;
1160     case Edit: edit ((int)op0); break;
1161     case Del: del ((int)op0); break;
1162     }
1163
1164     return 0;
1165 }
1166
1167 char **generate_completion_list ()
1168 {
1169     int i, j, l = 0;
1170     char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
1171
1172     for (i = 0; i < NB_OPERATORS; i++) {
1173         list[l] = strdup ((operators + i)->keyword);
1174         for (j = 0; j < (int)strlen (list[l]); j++) {
1175             if (list[i][j] == '\t') {
1176                 list[i][j] = '\0';
1177             }
1178         }
1179         if (list[l] != NULL) {
1180             l++;
1181         }
1182     }
1183
1184     for (i = 0; i < NB_FUNCTIONS; i++) {
1185         list[l] = strdup ((functions + i)->keyword);
1186         if (list[l] != NULL) {
1187             l++;
1188         }
1189     }
1190
1191     for (i = 0; i < NB_CONSTANTS; i++) {
1192         list[l] = strdup ((constants + i)->keyword);
1193         if (list[l] != NULL) {
1194             l++;
1195         }
1196     }
1197
1198     for (i = 0; i < NB_SYMBOLS; i++) {
1199         list[l] = strdup (symbols[i]);
1200         if (list[l] != NULL) {
1201             l++;
1202         }
1203     }
1204
1205     return (list);
1206 }
1207
1208 void free_completion_list (char **list)
1209 {
1210     int i;
1211
1212     if (list) {
1213         for (i = 0; i < NB_FUNCTIONS + NB_CONSTANTS; i++) {
1214             if (list[i] != NULL) {
1215                 free (list[i]);
1216             }
1217         }
1218         free (list);
1219     }
1220 }
1221
1222
1223 /* vim: set ts=4 sw=4 et: */