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     root->string = string;
 484
 485     return root;
 486 }
 487
 488 /* print element tree */
 489
 490 void print_element (element_t *root, int level)
 491 {
 492     char *func = NULL;
 493     int i;
 494
 495     if ((root == NULL) || (root == ERROR_OP)) {
 496         return;
 497     }
 498
 499     for (i = 0; i < level; i++) {
 500         fprintf (stdout, " ");
 501     }
 502
 503     switch (root->func) {
 504     case Val: func = "Value"; break;
 505     case Sig: func = "Sign"; break;
 506     case Add: func = "Addition"; break;
 507     case Sub: func = "Subtraction"; break;
 508     case Mul: func = "Multiplication"; break;
 509     case Div: func = "Division"; break;
 510     case Mod: func = "Modulo"; break;
 511     case Pow: func = "Power"; break;
 512     case Sqr: func = "Square Root"; break;
 513     case Cos: func = "Cosine"; break;
 514     case Sin: func = "Sine"; break;
 515     case Tan: func = "Tangent"; break;
 516     case Acos: func = "Arc Cosine"; break;
 517     case Asin: func = "Arc Sine"; break;
 518     case Atan: func = "Arc Tangent"; break;
 519     case Log: func = "Logarithm"; break;
 520     case Exp: func = "Exponantial"; break;
 521     case Abs: func = "Absolute value"; break;
 522     case Ceil: func = "Ceil value"; break;
 523     case Floor: func = "Floor value"; break;
 524     case Store: func = "Store"; break;
 525     case Recall: func = "Recall"; break;
 526     case Inc: func = "Increase"; break;
 527     case Dec: func = "Decrease"; break;
 528     case Disp: func = "Display"; break;
 529     case Mem: func = "Memory"; break;
 530     case Clear: func = "Clear"; break;
 531     case Quit: func = "Quit"; break;
 532     case Help: func = "Help"; break;
 533     case Ans: func = "Ans"; break;
 534     case Pi: func = "Pi"; break;
 535     case E: func = "E"; break;
 536     case Equal: func = "Equal"; break;
 537     case Diff: func = "Different"; break;
 538     case Ge: func = "Greater or equal"; break;
 539     case Le: func = "Lesser or equal"; break;
 540     case Gt: func = "Greater"; break;
 541     case Lt: func = "Lesser"; break;
 542     case And: func = "And"; break;
 543     case Or: func = "Or"; break;
 544     case Not: func = "Not"; break;
 545     case Cond: func = "Condition"; break;
 546     case While: func = "While"; break;
 547     case Code: func = "Code"; break;
 548     case Print: func = "Print"; break;
 549     case Prog: func = "Program"; break;
 550     case Call: func = "Call"; break;
 551     case List: func = "List"; break;
 552     case Edit: func = "Edit"; break;
 553     case Del: func = "Del"; break;
 554     }
 555
 556     fprintf (stdout, "Function: %s\n", func);
 557
 558     if ((root->func == Val) && (root->ops[0] == NULL)) {
 559         for (i = 0; i < level; i++) {
 560             fprintf (stdout, " ");
 561         }
 562         fprintf (stdout, "value: %f\n", root->value);
 563     } else {
 564         for (i = 0; i < root->nbops; i++) {
 565             print_element (root->ops[i], level + 1);
 566         }
 567     }
 568 }
 569
 570 /* storage functions */
 571
 572 void memory (int nb)
 573 {
 574     int i, l;
 575     double *tmp = NULL;
 576     if (nb != storage_size) {
 577         l = (nb < storage_size) ? nb : storage_size;
 578         tmp = (double *) callocordie (nb, sizeof (double));
 579         for (i = 0; i < l; i++) {
 580             tmp[i] = storage[i];
 581         }
 582         if (storage != NULL) {
 583             free (storage);
 584         }
 585         storage = tmp;
 586         storage_size = nb;
 587     }
 588 }
 589
 590 double store (int index, double value)
 591 {
 592     if (storage_size == -1) {
 593         memory (DEFAULT_STORAGE_SIZE);
 594     }
 595     if ((index > 0) && (index <= storage_size)) {
 596         storage[index - 1] = value;
 597     } else {
 598         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 599     }
 600     return value;
 601 }
 602
 603 double recall (int index)
 604 {
 605     if (storage_size == -1) {
 606         memory (DEFAULT_STORAGE_SIZE);
 607     }
 608     if ((index > 0) && (index <= storage_size)) {
 609         return storage[index - 1];
 610     } else {
 611         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 612     }
 613     return 0;
 614 }
 615
 616 double increase (int index)
 617 {
 618     if (storage_size == -1) {
 619         memory (DEFAULT_STORAGE_SIZE);
 620     }
 621     if ((index > 0) && (index <= storage_size)) {
 622         return storage[index - 1]++;
 623     } else {
 624         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 625     }
 626     return 0;
 627 }
 628
 629 double decrease (int index)
 630 {
 631     if (storage_size == -1) {
 632         memory (DEFAULT_STORAGE_SIZE);
 633     }
 634     if ((index > 0) && (index <= storage_size)) {
 635         return storage[index - 1]--;
 636     } else {
 637         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size));
 638     }
 639     return 0;
 640 }
 641
 642 void display (void)
 643 {
 644     int i;
 645     if (storage_size == -1) {
 646         memory (DEFAULT_STORAGE_SIZE);
 647     }
 648     fprintf (stdout, "storage:");
 649     for (i = 0; i < storage_size; i++) {
 650         fprintf (stdout, " ");
 651         fprintf (stdout, minform, storage[i]);
 652     }
 653     fprintf (stdout, "\n");
 654 }
 655
 656 void clear ()
 657 {
 658     int i;
 659     for (i = 0; i < storage_size; i++) {
 660         storage[i] = 0;
 661     }
 662 }
 663
 664 /* While do function */
 665
 666 double while_do (element_t *cond, element_t *action)
 667 {
 668     double ret = 0;
 669     element_t *temp = NULL;
 670
 671     VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n"));
 672     while (1) {
 673         VERBOSE (DEBUG, fprintf (stdout, "loop...\n"));
 674
 675         temp = dupelement (cond);
 676         if (!evaluate_element (temp, 0)) {
 677             break;
 678         }
 679         if (action) {
 680             temp = dupelement (action);
 681             ret = evaluate_element (temp, 0);
 682         }
 683     }
 684
 685     VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n"));
 686
 687     return ret;
 688 }
 689
 690 /* program function */
 691
 692 double execute_code (element_t **prog, int nbcalls)
 693 {
 694     double ret = 0;
 695     int i;
 696     for (i = 0; i < nbcalls; i++) {
 697         ret = evaluate_element (prog[i], 0);
 698         prog[i] = NULL;
 699     }
 700     return ret;
 701 }
 702
 703 /* print function */
 704
 705 void set_format (char *prompt, int precision)
 706 {
 707     char buffer[128] = {0};
 708     free_format ();
 709     sprintf (buffer, "%s%%.%dg\n", prompt, precision);
 710     format = strdup (buffer);
 711     sprintf (buffer, "%%.%dg", precision);
 712     minform = strdup (buffer);
 713 }
 714
 715 void free_format ()
 716 {
 717     if (format) {
 718         free (format);
 719         format = NULL;
 720     }
 721     if (minform) {
 722         free (minform);
 723         minform = NULL;
 724     }
 725 }
 726
 727 double print (double value)
 728 {
 729     fprintf (stdout, format ? format : DEFAULT_FORMAT, value);
 730     fflush (stdout);
 731     return value;
 732 }
 733
 734 /* quit function */
 735
 736 void quit (void)
 737 {
 738     fprintf (stdout, "bye\n");
 739     exit (0);
 740 }
 741
 742 /* program function */
 743
 744 void prog (int id, int nbmems, element_t *root)
 745 {
 746     int i, n = -1;
 747
 748     if (programs == NULL) {
 749
 750         /* initial memory allocation */
 751         programs = (workspace_t *) callocordie (1, sizeof (workspace_t));
 752         nb_programs = 1;
 753         n = 0;
 754
 755     } else {
 756
 757         /* look for existing program */
 758         for (i = 0; i < nb_programs; i++) {
 759             if ((programs + i)->id == id) {
 760                 n = i;
 761                 break;
 762             }
 763         }
 764         if (n == -1) {
 765
 766             /* new program */
 767             n = nb_programs++;
 768             workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t));
 769             memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t));
 770             free (programs);
 771             programs = tmp;
 772         } else {
 773
 774             /* clean old program */
 775             if ((programs + n)->storage) {
 776                 free ((programs + n)->storage);
 777             }
 778             if ((programs + n)->root) {
 779                 delelement ((programs + n)->root);
 780             }
 781             if ((programs + n)->string) {
 782                 free ((programs + n)->string);
 783             }
 784         }
 785     }
 786
 787     /* set program */
 788     (programs + n)->id = id;
 789     (programs + n)->answer = 0;
 790     (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double));
 791     (programs + n)->storage_size = nbmems;
 792     (programs + n)->root = dupelement (root);
 793 }
 794
 795 double call (int id, int nbops, element_t **ops)
 796 {
 797     workspace_t tmp = {0};
 798     int i, n = -1;
 799     double ret = 0;
 800
 801     if (programs) {
 802
 803         /* look for program */
 804         for (i = 0; i < nb_programs; i++) {
 805             if ((programs + i)->id == id) {
 806                 n = i;
 807                 break;
 808             }
 809         }
 810     }
 811     if (n == -1) {
 812         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 813         return 0;
 814     }
 815
 816     /* store context */
 817     tmp.answer = answer;
 818     tmp.storage = storage;
 819     tmp.storage_size = storage_size;
 820
 821     /* change context */
 822     answer = 0;
 823     storage = (programs + n)->storage;
 824     storage_size = (programs + n)->storage_size;
 825     if (nbops > storage_size) {
 826         double *tmp = (double *) callocordie (nbops, sizeof (double));
 827         memcpy (tmp, storage, storage_size * sizeof (double));
 828         free (storage);
 829         storage = tmp;
 830         storage_size = nbops;
 831     }
 832     for (i = 0; i < nbops; i++) {
 833         double val = evaluate_element (ops[i], 0);
 834         store (i + 1, val);
 835     }
 836
 837     /* evaluate program */
 838     element_t *elements = dupelement ((programs + n)->root);
 839     ret = evaluate_element (elements, 0);
 840
 841     /* restore context */
 842     answer = tmp.answer;
 843     storage = tmp.storage;
 844     storage_size = tmp.storage_size;
 845
 846     return ret;
 847 }
 848
 849 void list ()
 850 {
 851     int i;
 852     fprintf (stdout, "programs:");
 853     for (i = 0; i < nb_programs; i++) {
 854         fprintf (stdout, " %d", (programs + i)->id);
 855     }
 856     fprintf (stdout, "\n");
 857 }
 858
 859 void edit (int id)
 860 {
 861     int i, n = -1;
 862
 863     if (programs) {
 864
 865         /* look for program */
 866         for (i = 0; i < nb_programs; i++) {
 867             if ((programs + i)->id == id) {
 868                 n = i;
 869                 break;
 870             }
 871         }
 872     }
 873     if (n == -1) {
 874         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 875         return;
 876     }
 877
 878     /* set string program */
 879     fprintf (stdout, "edit: %s\n", (programs + n)->string);
 880 }
 881
 882 void savestring (int id, char *string)
 883 {
 884     int i, n = -1;
 885
 886     if (programs) {
 887
 888         /* look for program */
 889         for (i = 0; i < nb_programs; i++) {
 890             if ((programs + i)->id == id) {
 891                 n = i;
 892                 break;
 893             }
 894         }
 895     }
 896     if (n == -1) {
 897         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 898         return;
 899     }
 900
 901     /* save program */
 902     if ((programs + n)->string) {
 903         free ((programs + n)->string);
 904     }
 905     (programs + n)->string = strdup (string);
 906 }
 907
 908 void del (int id)
 909 {
 910     int i, j, n = -1;
 911
 912     if (programs) {
 913
 914         /* look for program */
 915         for (i = 0; i < nb_programs; i++) {
 916             if ((programs + i)->id == id) {
 917                 n = i;
 918                 break;
 919             }
 920         }
 921     }
 922     if (n == -1) {
 923         VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
 924         return;
 925     }
 926
 927     /* clean program */
 928     if ((programs + n)->storage) {
 929         free ((programs + n)->storage);
 930     }
 931     if ((programs + n)->root) {
 932         delelement ((programs + n)->root);
 933     }
 934     if ((programs + n)->string) {
 935         free ((programs + n)->string);
 936     }
 937
 938     /* remove entry */
 939     workspace_t *tmp = (workspace_t *) callocordie (nb_programs - 1, sizeof (workspace_t));
 940     for (i = 0, j = 0; i < nb_programs; i++) {
 941         if (i != n) {
 942             memcpy (tmp + j, programs + i, sizeof (workspace_t));
 943             j++;
 944         }
 945     }
 946     free (programs);
 947     programs = tmp;
 948     nb_programs--;
 949 }
 950
 951 /* help message */
 952
 953 void help (void)
 954 {
 955     fprintf (stdout, "calc is a simple calculator\n\n");
 956     fprintf (stdout, "supported operators:");
 957     fprintf (stdout, " + - * / %% ^\n");
 958     fprintf (stdout, "camparison operators:");
 959     fprintf (stdout, " == != >= <= > <\n");
 960     fprintf (stdout, "logical operators:");
 961     fprintf (stdout, " & | !\n");
 962     fprintf (stdout, "mathematic functions:");
 963     fprintf (stdout, " pow sqrt log exp\n");
 964     fprintf (stdout, "trig. func.:");
 965     fprintf (stdout, " cos sin tan acos asin atan\n");
 966     fprintf (stdout, "supported functions:");
 967     fprintf (stdout, " abs ceil floor\n");
 968     fprintf (stdout, "storage functions:");
 969     fprintf (stdout, " mem sto rcl inc dec disp\n");
 970     fprintf (stdout, "prog. functions:");
 971     fprintf (stdout, " cond while print {} ;\n");
 972     fprintf (stdout, "misc. functions:");
 973     fprintf (stdout, " quit help\n");
 974     fprintf (stdout, "supported constants:");
 975     fprintf (stdout, " e pi\n");
 976 }
 977
 978 /* evaluate element tree */
 979
 980 #define MASK_SUB 0x1
 981 #define MASK_DIV 0x2
 982
 983 double evaluate_element (element_t *root, char mask)
 984 {
 985     double op0 = 0, op1 = 0;
 986     char nextmask = mask;
 987     int i, nb;
 988
 989     if ((root == NULL) || (root == ERROR_OP)) {
 990         VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
 991         return 0;
 992     }
 993
 994     /* mask to manage sub operator sub and div */
 995     switch (root->func) {
 996     case Add:
 997         nextmask &= ~MASK_SUB;
 998         nextmask &= ~MASK_DIV;
 999         break;
1000     case Sub:
1001         nextmask |= MASK_SUB;
1002         nextmask &= ~MASK_DIV;
1003         break;
1004     case Mul:
1005         nextmask &= ~MASK_DIV;
1006         break;
1007     case Div:
1008         nextmask |= MASK_DIV;
1009         break;
1010     default:
1011         nextmask = mask;
1012     }
1013
1014     switch (root->func) {
1015     case Val:
1016     case Sig:
1017         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value;
1018         break;
1019     case Add:
1020     case Sub:
1021     case Mul:
1022     case Div:
1023     case Mod:
1024     case Pow:
1025     case Store:
1026     case Equal:
1027     case Diff:
1028     case Ge:
1029     case Le:
1030     case Gt:
1031     case Lt:
1032     case And:
1033     case Or:
1034     case Prog:
1035         if (root->ops[1]) {
1036             op1 = evaluate_element (root->ops[1], nextmask);
1037         } else if (root->func != Store) {
1038             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
1039             return 0;
1040         }
1041         /* fallthrough */
1042     case Sqr:
1043     case Cos:
1044     case Sin:
1045     case Tan:
1046     case Acos:
1047     case Asin:
1048     case Atan:
1049     case Log:
1050     case Exp:
1051     case Abs:
1052     case Ceil:
1053     case Floor:
1054     case Recall:
1055     case Inc:
1056     case Dec:
1057     case Not:
1058     case Mem:
1059     case Cond:
1060     case Call:
1061     case Edit:
1062     case Del:
1063         if (root->ops[0]) {
1064             op0 = evaluate_element (root->ops[0], 0);
1065         } else {
1066             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1067             return 0;
1068         }
1069         break;
1070     case Disp:
1071     case Clear:
1072     case Quit:
1073     case Help:
1074     case Ans:
1075     case Pi:
1076     case E:
1077     case Code:
1078     case List:
1079         break;
1080     case While:
1081         if (root->ops[0] == NULL) {
1082             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
1083             return 0;
1084         }
1085         break;
1086     case Print:
1087         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer;
1088         break;
1089     }
1090
1091     switch (root->func) {
1092     case Val: return op0;
1093     case Sig: return -op0;
1094     case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1;
1095     case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1;
1096     case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1;
1097     case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1;
1098     case Mod: return fmod (op0, op1);
1099     case Pow: return pow (op0, op1);
1100     case Sqr: return sqrt (op0);
1101     case Cos: return cos (op0);
1102     case Sin: return sin (op0);
1103     case Tan: return tan (op0);
1104     case Acos: return acos (op0);
1105     case Asin: return asin (op0);
1106     case Atan: return atan (op0);
1107     case Log: return log (op0);
1108     case Exp: return exp (op0);
1109     case Abs: return fabs (op0);
1110     case Ceil: return ceil (op0);
1111     case Floor: return floor (op0);
1112     case Store: return store ((int)op0, (op1) ? op1 : answer);
1113     case Recall: return recall ((int)op0);
1114     case Inc: return increase ((int)op0);
1115     case Dec: return decrease ((int)op0);
1116     case Disp: display (); break;
1117     case Mem: memory ((int)op0); break;
1118     case Clear: clear (); break;
1119     case Quit: quit (); break;
1120     case Help: help (); break;
1121     case Ans: return answer;
1122     case Pi: return M_PI;
1123     case E: return M_E;
1124     case Equal: return op0 == op1;
1125     case Diff: return op0 != op1;
1126     case Ge: return op0 >= op1;
1127     case Le: return op0 <= op1;
1128     case Gt: return op0 > op1;
1129     case Lt: return op0 < op1;
1130     case And: return (op0 != 0) && (op1 != 0);
1131     case Or: return (op0 != 0) || (op1 != 0);
1132     case Not: return (op0 == 0);
1133     case Cond:
1134         if ((op0) && (root->ops[1])) {
1135             return evaluate_element (root->ops[1], 0);
1136         } else if ((!op0) && (root->ops[2])) {
1137             return evaluate_element (root->ops[2], 0);
1138         } else {
1139             return 0;
1140         }
1141     case While: return while_do (root->ops[0], root->ops[1]);
1142     case Code: return execute_code (root->ops, root->nbops);
1143     case Print: return print (op0);
1144     case Prog:
1145         prog ((int)op0, (int)op1, root->ops[2]);
1146         savestring ((int)op0, root->string);
1147         break;
1148     case Call:
1149         for (i = 1, nb =0; i < root->nbops; i++) {
1150             if (root->ops[i]) {
1151                 nb++;
1152             }
1153         }
1154         return call ((int)op0, nb, root->ops + 1);
1155     case List: list (); break;
1156     case Edit: edit ((int)op0); break;
1157     case Del: del ((int)op0); break;
1158     }
1159
1160     return 0;
1161 }
1162
1163 char **generate_completion_list ()
1164 {
1165     int i, j, l = 0;
1166     char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
1167
1168     for (i = 0; i < NB_OPERATORS; i++) {
1169         list[l] = strdup ((operators + i)->keyword);
1170         for (j = 0; j < (int)strlen (list[l]); j++) {
1171             if (list[i][j] == '\t') {
1172                 list[i][j] = '\0';
1173             }
1174         }
1175         if (list[l] != NULL) {
1176             l++;
1177         }
1178     }
1179
1180     for (i = 0; i < NB_FUNCTIONS; i++) {
1181         list[l] = strdup ((functions + i)->keyword);
1182         if (list[l] != NULL) {
1183             l++;
1184         }
1185     }
1186
1187     for (i = 0; i < NB_CONSTANTS; i++) {
1188         list[l] = strdup ((constants + i)->keyword);
1189         if (list[l] != NULL) {
1190             l++;
1191         }
1192     }
1193
1194     for (i = 0; i < NB_SYMBOLS; i++) {
1195         list[l] = strdup (symbols[i]);
1196         if (list[l] != NULL) {
1197             l++;
1198         }
1199     }
1200
1201     return (list);
1202 }
1203
1204 void free_completion_list (char **list)
1205 {
1206     int i;
1207
1208     if (list) {
1209         for (i = 0; i < NB_FUNCTIONS + NB_CONSTANTS; i++) {
1210             if (list[i] != NULL) {
1211                 free (list[i]);
1212             }
1213         }
1214         free (list);
1215     }
1216 }
1217
1218
1219 /* vim: set ts=4 sw=4 et: */