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