parser.c

   1 #include <malloc.h>
   2 #include <math.h>
   3 #include <stdio.h>
   4 #include <stdlib.h>
   5
   6 #include "debug.h"
   7
   8 #include "parser.h"
   9
  10 /* global variables */
  11
  12 double answer = 0;
  13
  14 #define STORAGE_SIZE 10
  15 double storage[STORAGE_SIZE] = {0};
  16
  17 /* compare codes */
  18
  19 int codecmp (char *ref, char *str)
  20 {
  21     int sig;
  22
  23     while (*ref != '\0') {
  24         if (*ref == '\t') {
  25              sig = (*str == '.') ? -1 : ((*str >= '0') && (*str <= '9'));
  26         } else {
  27             sig = *str - *ref;
  28         }
  29         if (sig != 0) {
  30             return (sig > 0) ? 1 : -1;
  31         }
  32         str++;
  33         ref++;
  34     }
  35
  36     return 0;
  37 }
  38
  39 /* allocate new element */
  40
  41 element_t *newelement (func_t function, int nbops, int prio)
  42 {
  43     element_t *new = (element_t *) calloc (1, sizeof (element_t));
  44     if (new == NULL) {
  45         VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
  46         return NULL;
  47     }
  48     new->func = function;
  49     new->nbops = nbops;
  50     new->prio = prio;
  51
  52     return new;
  53 }
  54
  55 /* desallocate element */
  56
  57 void delelement (element_t *root)
  58 {
  59     int i;
  60     if ((root != NULL) && (root != ERROR_OP)) {
  61         for (i = 0; i < root->nbops; i++) {
  62             if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) {
  63                 delelement (root->ops[i]);
  64             }
  65         }
  66         free (root);
  67     }
  68 }
  69
  70 /* functions */
  71
  72 #define NB_OPERATORS 14
  73 keyword_t operators[NB_OPERATORS] = {
  74     { "+\t", Add, 2, 1, 1},
  75     { "-\t", Sub, 2, 1, 1},
  76     { "*",   Mul, 2, 1, 2},
  77     { "/",   Div, 2, 1, 2},
  78     { "%",   Mod, 2, 1, 3},
  79     { "^",   Pow, 2, 1, 4},
  80     { "==",  Equal, 2, 2, -1},
  81     { "!=",  Diff, 2, 2, -1},
  82     { ">=",  Ge, 2, 2, -1},
  83     { "<=",  Le, 2, 2, -1},
  84     { ">",   Gt, 2, 1, -1},
  85     { "<",   Lt, 2, 1, -1},
  86     { "&",   And, 2, 1, -2},
  87     { "|",   Or, 2, 1, -2}
  88 };
  89
  90 #define NB_FUNCTIONS 13
  91 keyword_t functions[NB_FUNCTIONS] = {
  92     { "sqrt", Sqr, 1, 4, 5},
  93     { "pow",  Pow, 2, 3, 5},
  94     { "cos",  Cos, 1, 3, 5},
  95     { "sin",  Sin, 1, 3, 5},
  96     { "atan", Atan, 1, 4, 5},
  97     { "exp",  Exp, 1, 3, 5},
  98     { "log",  Log, 1, 3, 5},
  99     { "sto",  Store, 2, 3, 9},
 100     { "rcl",  Recall, 1, 3, 5},
 101     { "disp", Disp, 0, 4, 9},
 102     { "quit", Quit, 0, 4, 9},
 103     { "help", Help, 0, 4, 9},
 104     { "!",    Not, 1, 1, 6}
 105 };
 106
 107 #define NB_CONSTANTS 3
 108 keyword_t constants[NB_CONSTANTS] = {
 109     { "ans", Ans, 0, 3, 5},
 110     { "e",   E, 0, 1, 5},
 111     { "pi",  Pi, 0, 2, 5}
 112 };
 113
 114 /* subparser function */
 115
 116 element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio)
 117 {
 118     element_t *new = newelement (func, nbops, prio);
 119     if (new == NULL) {
 120         return ERROR_OP;
 121     }
 122     new->ops[0] = *proot;
 123     new->ops[1] = parser (*pstr, pstr, new->prio);
 124     if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) {
 125         delelement (new->ops[1]);
 126         new->ops[1] = ERROR_OP;
 127     }
 128     if (new->ops[1] == ERROR_OP) {
 129         delelement (new);
 130         *proot = NULL;
 131         return ERROR_OP;
 132     }
 133     *proot = newelement (Val, 1, 5);
 134     if (*proot == NULL) {
 135         delelement (new);
 136         return ERROR_OP;
 137     }
 138     (*proot)->ops[0] = new;
 139
 140     return *proot;
 141 }
 142
 143 /* parser function */
 144
 145 element_t *parser (char *str, char **next, int prio)
 146 {
 147     element_t *root = NULL;
 148     int i;
 149
 150     VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n"));
 151
 152     /* main loop */
 153     while (*str != '\0') {
 154         int found = 0;
 155         element_t *new = NULL;
 156         VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str));
 157
 158         /* skip spaces and tabs */
 159
 160         if ((*str == ' ') || (*str == '\t')) {
 161             str++;
 162             continue;
 163         }
 164
 165         /* check for open bracket */
 166
 167         if (*str == '(') {
 168             VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n"));
 169             if (root) {
 170                 do {
 171                     found = 0;
 172                     new = parser (str + 1, &str, 0);
 173                     if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 174                         delelement (new);
 175                         new = ERROR_OP;
 176                     }
 177                     if ((new == NULL) || (new == ERROR_OP)) {
 178                         delelement (root);
 179                         return ERROR_OP;
 180                     }
 181                     for (i = 0; i < root->nbops; i++) {
 182                         if (root->ops[i] == NULL) {
 183                             root->ops[i] = new;
 184                             found = 1;
 185                             break;
 186                         }
 187                     }
 188                     if (!found) {
 189                         delelement (new);
 190                         delelement (root);
 191                         return ERROR_OP;
 192                     }
 193                 } while (*str == ',');
 194             } else {
 195                 root = newelement (Val, 1, 5);
 196                 if (root == NULL) {
 197                     return ERROR_OP;
 198                 }
 199                 new = parser (str + 1, &str, 0);
 200                 if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) {
 201                     delelement (new);
 202                     new = ERROR_OP;
 203                 }
 204                 if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) {
 205                     delelement (new);
 206                     delelement (root);
 207                     return ERROR_OP;
 208                 }
 209                 root->ops[0] = new;
 210             }
 211             if (*str != ')') {
 212                 delelement (root);
 213                 return ERROR_OP;
 214             }
 215             str++;
 216             VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n"));
 217             continue;
 218         }
 219
 220         /* check for closing bracket or koma */
 221
 222         if ((*str == ')') || (*str == ',')) {
 223             if (next != NULL) {
 224                 *next = str;
 225             }
 226             return root;
 227         }
 228
 229         /* look for operators */
 230
 231         for (i = 0; i < NB_OPERATORS; i++) {
 232             keyword_t *operator = operators + i;
 233             if (codecmp (operator->keyword, str) == 0) {
 234                 VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n"));
 235                 if (root) {
 236                     if ((prio) && (prio > operator->prio)) {
 237                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 238                         *next = str;
 239                         return root;
 240                     }
 241                     str += operator->offset;
 242                     VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func));
 243                     if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) {
 244                         delelement (root);
 245                         return ERROR_OP;
 246                     }
 247                 } else if (*str == '-') {
 248                     new = newelement (Sig, 1, 9);
 249                     if (new == NULL) {
 250                         return ERROR_OP;
 251                     }
 252                     root = new;
 253                 } else {
 254                     return ERROR_OP;
 255                 }
 256                 found = 1;
 257                 VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n"));
 258                 break;
 259             }
 260         }
 261         if (found) {
 262             continue;
 263         }
 264
 265         /* look for functions */
 266
 267         for (i = 0; i < NB_FUNCTIONS; i++) {
 268             keyword_t *function = functions + i;
 269             if (codecmp (function->keyword, str) == 0) {
 270                 VERBOSE (DEBUG, fprintf (stdout, "start processing function\n"));
 271                 if (root == NULL) {
 272                     VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func));
 273                     new = newelement (function->func, function->nbops, function->prio);
 274                     if (new == NULL) {
 275                         return ERROR_OP;
 276                     }
 277                     root = new;
 278                 } else {
 279                     delelement (root);
 280                     return ERROR_OP;
 281                 }
 282                 str += function->offset;
 283                 found = 1;
 284                 VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n"));
 285                 break;
 286             }
 287         }
 288         if (found) {
 289             continue;
 290         }
 291
 292         /* look for constant */
 293
 294         for (i = 0; i < NB_CONSTANTS; i++) {
 295             keyword_t *constant = constants + i;
 296             if (codecmp (constant->keyword, str) == 0) {
 297                 VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n"));
 298                 if (root == NULL) {
 299                     VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func));
 300                     new = newelement (constant->func, constant->nbops, constant->prio);
 301                     if (new == NULL) {
 302                         return ERROR_OP;
 303                     }
 304                     root = new;
 305                 } else {
 306                     delelement (root);
 307                     return ERROR_OP;
 308                 }
 309                 str += constant->offset;
 310                 found = 1;
 311                 VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n"));
 312                 break;
 313             }
 314         }
 315         if (found) {
 316             continue;
 317         }
 318
 319         /* look for number */
 320
 321         if (((*str >= '0') && (*str <= '9')) ||
 322             (*str == '.') || (*str == '+') || (*str == '-')) {
 323             VERBOSE (DEBUG, fprintf (stdout, "start processing value\n"));
 324             char *pt;
 325             double value = strtod (str, &pt);
 326             VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value));
 327             if (str != pt) {
 328                 if ((root == NULL) || (root->prio == 6)) {
 329                     new = newelement (Val, 1, 5);
 330                     if (new == NULL) {
 331                         return ERROR_OP;
 332                     }
 333                     new->value = value;
 334                     if (root == NULL) {
 335                         root = new;
 336                     } else {
 337                         for (i = 0; i < root->nbops; i++) {
 338                             if (root->ops[i] == NULL) {
 339                                 root->ops[i] = new;
 340                                 found = 1;
 341                                 break;
 342                             }
 343                         }
 344                         if (!found) {
 345                             delelement (new);
 346                             delelement (root);
 347                             return ERROR_OP;
 348                         }
 349                     }
 350                     str = pt;
 351                 } else if ((*str == '+') || (*str == '-')) {
 352                     if ((prio) && (prio > 1)) {
 353                         VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
 354                         *next = str;
 355                         return root;
 356                     }
 357                     if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) {
 358                         delelement (root);
 359                         return ERROR_OP;
 360                     }
 361                 } else {
 362 printf("coucou\n"); fflush (stdout);
 363                     delelement (root);
 364                     return ERROR_OP;
 365                 }
 366                 found = 1;
 367             }
 368             VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n"));
 369         }
 370
 371         /* error */
 372
 373         if (!found) {
 374             delelement (root);
 375             return ERROR_OP;
 376         }
 377
 378     }
 379
 380     if (next != NULL) {
 381         *next = str;
 382     }
 383
 384     return root;
 385 }
 386
 387 /* print element tree */
 388
 389 void print_element (element_t *root, int level)
 390 {
 391     char *func = NULL;
 392     int i;
 393
 394     if ((root == NULL) || (root == ERROR_OP)) {
 395         return;
 396     }
 397
 398     for (i = 0; i < level; i++) {
 399         fprintf (stdout, " ");
 400     }
 401
 402     switch (root->func) {
 403     case Val: func = "Value"; break;
 404     case Sig: func = "Sign"; break;
 405     case Add: func = "Addition"; break;
 406     case Sub: func = "Subtraction"; break;
 407     case Mul: func = "Multiplication"; break;
 408     case Div: func = "Division"; break;
 409     case Mod: func = "Modulo"; break;
 410     case Pow: func = "Power"; break;
 411     case Sqr: func = "Square Root"; break;
 412     case Cos: func = "Cosine"; break;
 413     case Sin: func = "Sine"; break;
 414     case Atan: func = "Arc Tangent"; break;
 415     case Log: func = "Logarithm"; break;
 416     case Exp: func = "Exponantial"; break;
 417     case Store: func = "Store"; break;
 418     case Recall: func = "Recall"; break;
 419     case Disp: func = "Display"; break;
 420     case Quit: func = "Quit"; break;
 421     case Help: func = "Help"; break;
 422     case Ans: func = "Ans"; break;
 423     case Pi: func = "Pi"; break;
 424     case E: func = "E"; break;
 425     case Equal: func = "Equal"; break;
 426     case Diff: func = "Different"; break;
 427     case Ge: func = "Greater or equal"; break;
 428     case Le: func = "Lesser or equal"; break;
 429     case Gt: func = "Greater"; break;
 430     case Lt: func = "Lesser"; break;
 431     case And: func = "And"; break;
 432     case Or: func = "Or"; break;
 433     case Not: func = "Not"; break;
 434     }
 435
 436     fprintf (stdout, "Function: %s\n", func);
 437
 438     if ((root->func == Val) && (root->ops[0] == NULL)) {
 439         for (i = 0; i < level; i++) {
 440             fprintf (stdout, " ");
 441         }
 442         fprintf (stdout, "value: %f\n", root->value);
 443     } else {
 444         for (i = 0; i < root->nbops; i++) {
 445             print_element (root->ops[i], level + 1);
 446         }
 447     }
 448 }
 449
 450 /* storage functions */
 451
 452 double store (int index, double value)
 453 {
 454     if ((index > 0) && (index <= STORAGE_SIZE)) {
 455         storage[index - 1] = value;
 456     } else {
 457         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [1, %d]\n", index, STORAGE_SIZE));
 458     }
 459     return value;
 460 }
 461
 462 double recall (int index)
 463 {
 464     if ((index > 0) && (index <= STORAGE_SIZE)) {
 465         return storage[index - 1];
 466     } else {
 467         VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [1, %d]\n", index, STORAGE_SIZE));
 468     }
 469     return 0;
 470 }
 471
 472 void display (void)
 473 {
 474     int i;
 475     fprintf (stdout, "storage:");
 476     for (i = 0; i < STORAGE_SIZE; i++) {
 477         fprintf (stdout, " %g", storage[i]);
 478     }
 479     fprintf (stdout, "\n");
 480 }
 481
 482 /* quit function */
 483
 484 void quit (void)
 485 {
 486     fprintf (stdout, "bye\n");
 487     exit (0);
 488 }
 489
 490 /* help message */
 491
 492 void help (void)
 493 {
 494     fprintf (stdout, "calc is a simple calculator\n\n");
 495     fprintf (stdout, "supported operators:\n");
 496     fprintf (stdout, " + - * / %% ^\n\n");
 497     fprintf (stdout, "camparison operators:\n");
 498     fprintf (stdout, " == != >= <= > <\n\n");
 499     fprintf (stdout, "supported functions:\n");
 500     fprintf (stdout, " pow sqrt cos sin atan log exp\n\n");
 501     fprintf (stdout, "storage functions:\n");
 502     fprintf (stdout, " sto rcl\n\n");
 503     fprintf (stdout, "miscellaneous functions:\n");
 504     fprintf (stdout, " quit help\n\n");
 505     fprintf (stdout, "supported constants:\n");
 506     fprintf (stdout, " e pi\n");
 507 }
 508
 509 /* evaluate element tree */
 510
 511 #define MASK_SUB 0x1
 512 #define MASK_DIV 0x2
 513
 514 double evaluate_element (element_t *root, char mask)
 515 {
 516     double op0 = 0, op1 = 0;
 517     char nextmask = mask;
 518
 519     if ((root == NULL) || (root == ERROR_OP)) {
 520         VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
 521         return 0;
 522     }
 523
 524     /* mask to manage sub operator sub and div */
 525     switch (root->func) {
 526     case Add:
 527         nextmask &= ~MASK_SUB;
 528         nextmask &= ~MASK_DIV;
 529         break;
 530     case Sub:
 531         nextmask |= MASK_SUB;
 532         nextmask &= ~MASK_DIV;
 533         break;
 534     case Mul:
 535         nextmask &= ~MASK_DIV;
 536         break;
 537     case Div:
 538         nextmask |= MASK_DIV;
 539         break;
 540     default:
 541         nextmask = mask;
 542     }
 543
 544     switch (root->func) {
 545     case Val:
 546     case Sig:
 547         op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value;
 548         break;
 549     case Add:
 550     case Sub:
 551     case Mul:
 552     case Div:
 553     case Mod:
 554     case Pow:
 555     case Store:
 556     case Equal:
 557     case Diff:
 558     case Ge:
 559     case Le:
 560     case Gt:
 561     case Lt:
 562     case And:
 563     case Or:
 564         if (root->ops[1]) {
 565             op1 = evaluate_element (root->ops[1], nextmask);
 566         } else if (root->func != Store) {
 567             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
 568             return 0;
 569         }
 570         /* fallthrough */
 571     case Sqr:
 572     case Cos:
 573     case Sin:
 574     case Atan:
 575     case Log:
 576     case Exp:
 577     case Recall:
 578     case Not:
 579         if (root->ops[0]) {
 580             op0 = evaluate_element (root->ops[0], 0);
 581         } else {
 582             VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
 583             return 0;
 584         }
 585         break;
 586     case Disp:
 587     case Quit:
 588     case Help:
 589     case Ans:
 590     case Pi:
 591     case E:
 592         break;
 593     }
 594
 595     switch (root->func) {
 596     case Val: return op0;
 597     case Sig: return -op0;
 598     case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1;
 599     case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1;
 600     case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1;
 601     case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1;
 602     case Mod: return fmod (op0, op1);
 603     case Pow: return pow (op0, op1);
 604     case Sqr: return sqrt (op0);
 605     case Cos: return cos (op0);
 606     case Sin: return sin (op0);
 607     case Atan: return atan (op0);
 608     case Log: return log (op0);
 609     case Exp: return exp (op0);
 610     case Store: return store ((int)op0, (op1) ? op1 : answer);
 611     case Recall: return recall ((int)op0);
 612     case Disp: display (); break;
 613     case Quit: quit (); break;
 614     case Help: help (); break;
 615     case Ans: return answer;
 616     case Pi: return M_PI;
 617     case E: return M_E;
 618     case Equal: return op0 == op1;
 619     case Diff: return op0 != op1;
 620     case Ge: return op0 >= op1;
 621     case Le: return op0 <= op1;
 622     case Gt: return op0 > op1;
 623     case Lt: return op0 < op1;
 624     case And: return (op0 != 0) && (op1 != 0);
 625     case Or: return (op0 != 0) || (op1 != 0);
 626     case Not: return (op0 == 0);
 627     }
 628
 629     return 0;
 630 }
 631
 632 /* vim: set ts=4 sw=4 et: */