X-Git-Url: https://secure.softndesign.org/git/?a=blobdiff_plain;f=parser.c;h=1e9b9861731ac2ccbc81f844afbd9c80f91859d6;hb=33b4877a64014cfb19d0ef6928b1ffefe6496903;hp=e7c91888f15cec4380aabf2d6b65537a06ca200a;hpb=efdfb5434d11a6a0feecf52e1aa97c7f82cb74f9;p=calc.git diff --git a/parser.c b/parser.c index e7c9188..1e9b986 100644 --- a/parser.c +++ b/parser.c @@ -1,11 +1,23 @@ -#include +#include +#include #include +#include +#include "alloc.h" +#include "argument.h" #include "debug.h" -#include "fdprintf.h" +#include "element.h" +#include "format.h" +#include "program.h" +#include "stack.h" +#include "storage.h" #include "parser.h" +/* global variables */ + +double answer = 0; + /* compare codes */ int codecmp (char *ref, char *str) @@ -13,69 +25,155 @@ int codecmp (char *ref, char *str) int sig; while (*ref != '\0') { - sig = *str++ - *ref++; + if (*ref == '\t') { + sig = (*str == '.') ? -1 : ((*str >= '0') && (*str <= '9')); + } else { + sig = *str - *ref; + } if (sig != 0) { return (sig > 0) ? 1 : -1; } + str++; + ref++; } return 0; } -/* allocate new element */ - -element_t *newelement (func_t function, int nbops) -{ - element_t *new = (element_t *) calloc (1, sizeof (element_t)); - if (new == NULL) { - VERBOSE (ERROR, fdprintf (stdfderr, "can't allocate memory\n")); - return NULL; - } - new->func = function; - new->nbops = nbops; - - return new; -} - /* functions */ -#define NB_OPERATORS 7 +#define MAX_ARGS 100 +#define NB_OPERATORS 14 keyword_t operators[NB_OPERATORS] = { - { "+ ", Add, 2, 1 }, - { "+\t", Add, 2, 1 }, - { "- ", Sub, 2, 1 }, - { "-\t", Sub, 2, 1 }, - { "*", Mul, 2, 1 }, - { "/", Div, 2, 1 }, - { "^", Pow, 2, 1 } + { "+\t", Add, 2, 1, 1}, + { "-\t", Sub, 2, 1, 1}, + { "*", Mul, 2, 1, 2}, + { "/", Div, 2, 1, 2}, + { "%", Mod, 2, 1, 3}, + { "^", Pow, 2, 1, 4}, + { "==", Equal, 2, 2, -1}, + { "!=", Diff, 2, 2, -1}, + { ">=", Ge, 2, 2, -1}, + { "<=", Le, 2, 2, -1}, + { ">", Gt, 2, 1, -1}, + { "<", Lt, 2, 1, -1}, + { "&", And, 2, 1, -2}, + { "|", Or, 2, 1, -2} }; -#define NB_FUNCTIONS 7 +#define NB_FUNCTIONS 50 keyword_t functions[NB_FUNCTIONS] = { - { "sqrt", Sqr, 1, 4 }, - { "pow", Pow, 2, 3 }, - { "cos", Cos, 1, 3 }, - { "sin", Sin, 1, 3 }, - { "atan", Atn, 1, 4 }, - { "exp", Exp, 1, 3 }, - { "log", Log, 1, 3 } + { "sqrt", Sqr, 1, 4, 5}, + { "pow", Pow, 2, 3, 5}, + { "cos", Cos, 1, 3, 5}, + { "sin", Sin, 1, 3, 5}, + { "tan", Tan, 1, 3, 5}, + { "acos", Acos, 1, 4, 5}, + { "asin", Asin, 1, 4, 5}, + { "atan", Atan, 1, 4, 5}, + { "ln", Ln, 1, 2, 5}, + { "log", Log, 1, 3, 5}, + { "exp", Exp, 1, 3, 5}, + { "erfc", Erfc, 1, 4, 5}, + { "erf", Erf, 1, 3, 5}, + { "abs", Abs, 1, 3, 5}, + { "floor", Floor, 1, 5, 5}, + { "ceil", Ceil, 1, 4, 5}, + { "sto", Store, 2, 3, 5}, + { "rcl", Recall, 1, 3, 5}, + { "inc", Inc, 1, 3, 5}, + { "dec", Dec, 1, 3, 5}, + { "disp", Disp, 0, 4, 9}, + { "mem", Mem, 1, 3, 5}, + { "clr", Clear, 0, 3, 9}, + { "quit", Quit, 0, 4, 9}, + { "help", Help, 0, 4, 9}, + { "!", Not, 1, 1, 6}, + { "cond", Cond, 3, 4, 5}, + { "while", While, 2, 5, 5}, + { "print", Print, 1, 5, 5}, + { "prog", Prog, 2, 4, 9}, + { "arg", Arg, 1, 3, 5}, + { "call", Call, MAX_ARGS, 4, 5}, + { "ls", List, 0, 2, 9}, + { "edit", Edit, 1, 4, 9}, + { "del", Del, 1, 3, 9}, + { "get", Get, 1, 3, 5}, + { "len", Length, 0, 3, 5}, + { "pop", Pop, 0, 3, 5}, + { "push", Push, 1, 4, 5}, + { "put", Put, 2, 3, 5}, + { "set", Set, MAX_ARGS, 3, 5}, + { "show", Show, 0, 4, 5}, + { "max", Max, 2, 3, 5}, + { "mean", Mean, 2, 4, 5}, + { "med", Median, 0, 3, 5}, + { "min", Min, 2, 3, 5}, + { "ord", Order, 0, 3, 5}, + { "prod", Prod, 0, 4, 5}, + { "sum", Sum, 0, 3, 5}, + { "var", Variance, 2, 3, 5}, }; +#define NB_CONSTANTS 3 +keyword_t constants[NB_CONSTANTS] = { + { "ans", Ans, 0, 3, 5}, + { "e", E, 0, 1, 5}, + { "pi", Pi, 0, 2, 5} +}; + +#define NB_SYMBOLS 4 +char *symbols[NB_SYMBOLS] = { + "(", ")", "{", "}" +}; + +/* subparser function */ + +element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio) +{ + element_t *new = newelement (func, nbops, prio); + new->ops[0] = *proot; + new->ops[1] = parser (*pstr, pstr, new->prio); + if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) { + delelement (new->ops[1]); + new->ops[1] = ERROR_OP; + } + if (new->ops[1] == ERROR_OP) { + delelement (new); + *proot = NULL; + return ERROR_OP; + } + *proot = newelement (Val, 1, 5); + (*proot)->ops[0] = new; + + return *proot; +} + /* parser function */ -element_t *parser (char *str, char **next) +element_t *parser (char *str, char **next, int prio) { element_t *root = NULL; - int i, j; + char *string = str; + int i; - VERBOSE (DEBUG, PRINTOUT ("Starting parsing\n")); + VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n")); /* main loop */ while (*str != '\0') { int found = 0; element_t *new = NULL; - VERBOSE (INFO, PRINTOUT ("Processing: %s\n", str)); + VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str)); + + /* end without printing */ + + if (*str == ';') { + if (root) { + root->hidden = 1; + } + break; + } /* skip spaces and tabs */ @@ -84,84 +182,106 @@ element_t *parser (char *str, char **next) continue; } - /* skip commas */ + /* check for open brace */ - if (*str == ',') { - VERBOSE (DEBUG, PRINTOUT ("start processing coma\n")); - str++; - if (root == NULL) { - return parser (str, &str); - } else if (root->func != Set) { - new = newelement (Set, MAX_OPERANDS); - if (new == NULL) { - return ERROR_OP; + if (*str == '{') { + VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n")); + if (root != NULL) { + delelement (root); + return ERROR_OP; + } + root = newelement (Code, 0, 5); + + do { + new = parser (str + 1, &str, 0); + if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { + delelement (new); + new = ERROR_OP; } - new->ops[0] = root; - root = new; - VERBOSE (DEBUG, PRINTOUT ("end processing first coma\n")); - } else /* if (root->func == Set) */ { - new = parser (str, &str); - if (!found){ + if (new == ERROR_OP) { + delelement (root); return ERROR_OP; } + element_t *newcode = newelement (Code, root->nbops + 1, 5); for (i = 0; i < root->nbops; i++) { - if (root->ops[i] == NULL) { - root->ops[i] = new; - found = 1; - } - } - if (!found){ - return ERROR_OP; + newcode->ops[i] = root->ops[i]; + root->ops[i] = NULL; } - VERBOSE (DEBUG, PRINTOUT ("end processing other coma\n")); + newcode->ops[root->nbops] = new; + delelement (root); + root = newcode; + } while (*str == ','); + + if (*str != '}') { + delelement (root); + return ERROR_OP; } + str++; + VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n")); continue; } - /* check for parent */ + /* check for open bracket */ if (*str == '(') { - VERBOSE (DEBUG, PRINTOUT ("start processing bracket\n")); - new = parser (str + 1, &str); - if (new == ERROR_OP) { - return ERROR_OP; - } + VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n")); if (root) { - for (i = 0, j = 0; i < root->nbops; i++) { - if (root->ops[i] == NULL) { - if (new->func == Set) { - root->ops[i] = new->ops[j++]; - if (new->ops[j] == NULL) { - found = 1; - break; - } - } else { + do { + found = 0; + new = parser (str + 1, &str, 0); + if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { + delelement (new); + new = ERROR_OP; + } + if ((new == NULL) || (new == ERROR_OP)) { + delelement (root); + return ERROR_OP; + } + for (i = 0; i < root->nbops; i++) { + if (root->ops[i] == NULL) { root->ops[i] = new; found = 1; break; } } - } - if (!found) { - return ERROR_OP; - } + if (!found) { + delelement (new); + delelement (root); + return ERROR_OP; + } + } while (*str == ','); } else { - if (new->func != Set) { - root = new; - } else { + root = newelement (Val, 1, 5); + new = parser (str + 1, &str, 0); + if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { + delelement (new); + new = ERROR_OP; + } + if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) { + delelement (new); + delelement (root); return ERROR_OP; } + root->ops[0] = new; + } + if (*str != ')') { + delelement (root); + return ERROR_OP; } - VERBOSE (DEBUG, PRINTOUT ("stop processing bracket\n")); - //if (next != NULL) { - // *next = str; - //} - //return root; + str++; + VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n")); continue; } - if (*str == ')') { + + /* check for closing bracket, closing brace or koma */ + + if ((*str == ')') || (*str == '}') || (*str == ',')) { + if (prio == -9) { + delelement (root); + return ERROR_OP; + } if (next != NULL) { - *next = str + 1; + *next = str; } return root; } @@ -171,26 +291,30 @@ element_t *parser (char *str, char **next) for (i = 0; i < NB_OPERATORS; i++) { keyword_t *operator = operators + i; if (codecmp (operator->keyword, str) == 0) { - VERBOSE (DEBUG, PRINTOUT ("start processing operator\n")); - str += operator->offset; - if ((root) && (root->func != Set)) { - VERBOSE (INFO, PRINTOUT ("Oper: %d\n", operator->func)); - new = newelement (operator->func, operator->nbops); - if (new == NULL) { - return ERROR_OP; + VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n")); + if ((root) && (root->prio == 9)) { + VERBOSE (DEBUG, fprintf (stdout, "terminal function (%d)\n", root->func)); + delelement (root); + return ERROR_OP; + } else if (root) { + if ((prio) && (prio > operator->prio)) { + VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); + *next = str; + return root; } - new->ops[0] = root; - root = new; - new = parser (str, &str); - if (new == ERROR_OP) { + str += operator->offset; + VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func)); + if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) { + delelement (root); return ERROR_OP; } - root->ops[1] = new; + } else if (*str == '-') { + root = newelement (Sig, 1, 6); } else { return ERROR_OP; } found = 1; - VERBOSE (DEBUG, PRINTOUT ("stop processing operator\n")); + VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n")); break; } } @@ -203,20 +327,17 @@ element_t *parser (char *str, char **next) for (i = 0; i < NB_FUNCTIONS; i++) { keyword_t *function = functions + i; if (codecmp (function->keyword, str) == 0) { - VERBOSE (DEBUG, PRINTOUT ("start processing function\n")); + VERBOSE (DEBUG, fprintf (stdout, "start processing function\n")); if (root == NULL) { - VERBOSE (INFO, PRINTOUT ("Func: %d\n", function->func)); - new = newelement (function->func, function->nbops); - if (new == NULL) { - return ERROR_OP; - } - root = new; - } else { + VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func)); + root = newelement (function->func, function->nbops, function->prio); + } else { + delelement (root); return ERROR_OP; } str += function->offset; found = 1; - VERBOSE (DEBUG, PRINTOUT ("stop processing function\n")); + VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n")); break; } } @@ -224,64 +345,81 @@ element_t *parser (char *str, char **next) continue; } - /* last attend to detect addition and substraction */ + /* look for constant */ - if (((*str == '-') || (*str == '+')) && - ((*(str + 1) >= '0') && (*(str + 1) <= '9')) && - ((root) && (root->func == Val))) { - VERBOSE (INFO, PRINTOUT ("Oper: %d\n", Add)); - new = newelement (Add, 2); - if (new == NULL) { - return ERROR_OP; + for (i = 0; i < NB_CONSTANTS; i++) { + keyword_t *constant = constants + i; + if (codecmp (constant->keyword, str) == 0) { + VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n")); + if (root == NULL) { + VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func)); + root = newelement (constant->func, constant->nbops, constant->prio); + } else { + delelement (root); + return ERROR_OP; + } + str += constant->offset; + found = 1; + VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n")); + break; } - new->ops[0] = root; - root = new; + } + if (found) { + continue; } /* look for number */ - if (((*str >= '0') && (*str <= '9')) || (*str == '.')) { - VERBOSE (DEBUG, PRINTOUT ("start processing value\n")); + if (((*str >= '0') && (*str <= '9')) || + (*str == '.') || (*str == '+') || (*str == '-')) { + VERBOSE (DEBUG, fprintf (stdout, "start processing value\n")); char *pt; - float value = strtof (str, &pt); - VERBOSE (INFO, PRINTOUT ("Value: %f\n", value)); + double value = strtod (str, &pt); + VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value)); if (str != pt) { - new = newelement (Val, 1); - if (new == NULL) { - return ERROR_OP; - } - new->value = value; - if (root == NULL) { - root = new; - } else { - if (root->func == Val) { - element_t *set = newelement (Set, MAX_OPERANDS); - if (set == NULL) { + if ((root == NULL) || (root->prio == 6)) { + new = newelement (Val, 1, 5); + new->value = value; + if (root == NULL) { + root = new; + } else { + for (i = 0; i < root->nbops; i++) { + if (root->ops[i] == NULL) { + root->ops[i] = new; + found = 1; + break; + } + } + if (!found) { + delelement (new); + delelement (root); return ERROR_OP; } - set->ops[0] = root; - root = set; } - for (i = 0; i < root->nbops; i++) { - if (root->ops[i] == NULL) { - root->ops[i] = new; - found = 1; - break; - } + str = pt; + } else if ((*str == '+') || (*str == '-')) { + if ((prio) && (prio > 1)) { + VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); + *next = str; + return root; } - if (!found) { + if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) { + delelement (root); return ERROR_OP; } + } else { + delelement (root); + return ERROR_OP; } - str = pt; found = 1; } - VERBOSE (DEBUG, PRINTOUT ("stop processing value\n")); + VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n")); } /* error */ if (!found) { + delelement (root); return ERROR_OP; } @@ -290,6 +428,12 @@ element_t *parser (char *str, char **next) if (next != NULL) { *next = str; } + + /* save string */ + if (root != NULL) { + root->string = string; + } + return root; } @@ -305,32 +449,88 @@ void print_element (element_t *root, int level) } for (i = 0; i < level; i++) { - PRINTOUT (" "); + fprintf (stdout, " "); } switch (root->func) { case Val: func = "Value"; break; - case Set: func = "Set"; break; + case Sig: func = "Sign"; break; case Add: func = "Addition"; break; case Sub: func = "Subtraction"; break; case Mul: func = "Multiplication"; break; case Div: func = "Division"; break; + case Mod: func = "Modulo"; break; case Pow: func = "Power"; break; case Sqr: func = "Square Root"; break; case Cos: func = "Cosine"; break; case Sin: func = "Sine"; break; - case Atn: func = "Arc Tangent"; break; - case Log: func = "Logarithm"; break; + case Tan: func = "Tangent"; break; + case Acos: func = "Arc Cosine"; break; + case Asin: func = "Arc Sine"; break; + case Atan: func = "Arc Tangent"; break; + case Ln: func = "Logarithm (natural)"; break; + case Log: func = "Logarithm (10 base)"; break; case Exp: func = "Exponantial"; break; + case Erfc: func = "Complementary Error Function"; break; + case Erf: func = "Error Function"; break; + case Abs: func = "Absolute value"; break; + case Ceil: func = "Ceil value"; break; + case Floor: func = "Floor value"; break; + case Store: func = "Store"; break; + case Recall: func = "Recall"; break; + case Inc: func = "Increase"; break; + case Dec: func = "Decrease"; break; + case Disp: func = "Display"; break; + case Mem: func = "Memory"; break; + case Clear: func = "Clear"; break; + case Quit: func = "Quit"; break; + case Help: func = "Help"; break; + case Ans: func = "Ans"; break; + case Pi: func = "Pi"; break; + case E: func = "E"; break; + case Equal: func = "Equal"; break; + case Diff: func = "Different"; break; + case Ge: func = "Greater or equal"; break; + case Le: func = "Lesser or equal"; break; + case Gt: func = "Greater"; break; + case Lt: func = "Lesser"; break; + case And: func = "And"; break; + case Or: func = "Or"; break; + case Not: func = "Not"; break; + case Cond: func = "Condition"; break; + case While: func = "While"; break; + case Code: func = "Code"; break; + case Print: func = "Print"; break; + case Prog: func = "Program"; break; + case Arg: func = "Argument"; break; + case Call: func = "Call"; break; + case List: func = "List"; break; + case Edit: func = "Edit"; break; + case Del: func = "Del"; break; + case Get: func = "Get"; break; + case Length: func = "Length"; break; + case Pop: func = "Pop"; break; + case Push: func = "Push"; break; + case Put: func = "Put"; break; + case Set: func = "Set"; break; + case Show: func = "Show"; break; + case Max: func = "Maximum"; break; + case Mean: func = "Mean"; break; + case Median: func = "Median"; break; + case Min: func = "Minimum"; break; + case Order: func = "Order"; break; + case Prod: func = "Product"; break; + case Sum: func = "Sum"; break; + case Variance: func = "Variance"; break; } - PRINTOUT ("Function: %s\n", func); + fprintf (stdout, "Function: %s\n", func); - if (root->func == Val) { + if ((root->func == Val) && (root->ops[0] == NULL)) { for (i = 0; i < level; i++) { - PRINTOUT (" "); + fprintf (stdout, " "); } - PRINTOUT ("value: %f\n", root->value); + fprintf (stdout, "value: %f\n", root->value); } else { for (i = 0; i < root->nbops; i++) { print_element (root->ops[i], level + 1); @@ -338,4 +538,403 @@ void print_element (element_t *root, int level) } } +/* While do function */ + +double while_do (element_t *cond, element_t *action) +{ + double ret = 0; + element_t *temp = NULL; + + VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n")); + while (1) { + VERBOSE (DEBUG, fprintf (stdout, "loop...\n")); + + temp = dupelement (cond); + double test = evaluate_element (temp, 0); + delelement (temp); + if (!test) { + break; + } + if (action) { + temp = dupelement (action); + ret = evaluate_element (temp, 0); + delelement (temp); + } + } + + VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n")); + + return ret; +} + +/* program function */ + +double execute_code (element_t **prog, int nbcalls) +{ + double ret = 0; + int i; + for (i = 0; i < nbcalls; i++) { + ret = evaluate_element (prog[i], 0); + } + return ret; +} + +/* quit function */ + +void quit (void) +{ + fprintf (stdout, "bye\n"); + exit (0); +} + +/* help message */ + +void help (void) +{ + fprintf (stdout, "calc is a simple calculator\n\n"); + fprintf (stdout, "arithmetic op.:"); + fprintf (stdout, " + - * / %% ^\n"); + fprintf (stdout, "comparison op.:"); + fprintf (stdout, " == != >= <= > <\n"); + fprintf (stdout, "logical op.:"); + fprintf (stdout, " & | !\n"); + fprintf (stdout, "mathematic func.:"); + fprintf (stdout, " exp ln log pow sqrt\n"); + fprintf (stdout, "trigonometric func.:"); + fprintf (stdout, " acos asin atan cos sin tan\n"); + fprintf (stdout, "error functions:"); + fprintf (stdout, " erf erfc\n"); + fprintf (stdout, "miscellaneous func.:"); + fprintf (stdout, " abs ceil floor\n"); + fprintf (stdout, "storage func.:"); + fprintf (stdout, " clear dec disp inc mem rcl sto\n"); + fprintf (stdout, "control flow prim.:"); + fprintf (stdout, " cond print while {} ;\n"); + fprintf (stdout, "program management:"); + fprintf (stdout, " arg call del edit ls prog\n"); + fprintf (stdout, "stack management:"); + fprintf (stdout, " get len pop push put set show\n"); + fprintf (stdout, "stack func.:"); + fprintf (stdout, " max mean med min ord prod sum var\n"); + fprintf (stdout, "control management:"); + fprintf (stdout, " help quit\n"); + fprintf (stdout, "constants:"); + fprintf (stdout, " ans e pi\n"); +} + +/* evaluate element tree */ + +#define MASK_SUB 0x1 +#define MASK_DIV 0x2 + +double evaluate_element (element_t *root, char mask) +{ + double op0 = 0, op1 = 0; + char nextmask = mask; + int i, nb; + + if ((root == NULL) || (root == ERROR_OP)) { + VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n")); + return 0; + } + + /* mask to manage sub operator sub and div */ + switch (root->func) { + case Add: + nextmask &= ~MASK_SUB; + nextmask &= ~MASK_DIV; + break; + case Sub: + nextmask |= MASK_SUB; + nextmask &= ~MASK_DIV; + break; + case Mul: + nextmask &= ~MASK_DIV; + break; + case Div: + nextmask |= MASK_DIV; + break; + default: + nextmask = mask; + } + + switch (root->func) { + case Val: + case Sig: + op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value; + break; + case Add: + case Sub: + case Mul: + case Div: + case Mod: + case Pow: + case Store: + case Equal: + case Diff: + case Ge: + case Le: + case Gt: + case Lt: + case And: + case Or: + if (root->ops[1]) { + op1 = evaluate_element (root->ops[1], nextmask); + } else if (root->func != Store) { + VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n")); + return 0; + } + /* fallthrough */ + case Sqr: + case Cos: + case Sin: + case Tan: + case Acos: + case Asin: + case Atan: + case Ln: + case Log: + case Exp: + case Erfc: + case Erf: + case Abs: + case Ceil: + case Floor: + case Recall: + case Inc: + case Dec: + case Not: + case Mem: + case Cond: + case Prog: + case Arg: + case Call: + case Edit: + case Del: + case Get: + if (root->ops[0]) { + op0 = evaluate_element (root->ops[0], 0); + } else { + VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); + return 0; + } + break; + case Disp: + case Clear: + case Quit: + case Help: + case Ans: + case Pi: + case E: + case Code: + case List: + case Length: + case Pop: + case Set: + case Show: + case Median: + case Order: + case Prod: + case Sum: + break; + case While: + if (root->ops[0] == NULL) { + VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); + return 0; + } + break; + case Push: + case Print: + op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer; + break; + case Put: + if (root->ops[0]) { + op0 = evaluate_element (root->ops[0], 0); + } else { + VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); + return 0; + } + op1 = (root->ops[1]) ? evaluate_element (root->ops[1], 0) : answer; + break; + case Max: + case Mean: + case Min: + case Variance: + if (root->ops[0]) { + op0 = evaluate_element (root->ops[0], 0); + op1 = (root->ops[1]) ? evaluate_element (root->ops[1], 0) : answer; + } + } + + switch (root->func) { + case Val: return op0; + case Sig: return -op0; + case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1; + case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1; + case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1; + case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1; + case Mod: return fmod (op0, op1); + case Pow: return pow (op0, op1); + case Sqr: return sqrt (op0); + case Cos: return cos (op0); + case Sin: return sin (op0); + case Tan: return tan (op0); + case Acos: return acos (op0); + case Asin: return asin (op0); + case Atan: return atan (op0); + case Ln: return log (op0); + case Log: return log10 (op0); + case Exp: return exp (op0); + case Erfc: return erfc (op0); + case Erf: return erf (op0); + case Abs: return fabs (op0); + case Ceil: return ceil (op0); + case Floor: return floor (op0); + case Store: return store ((int)op0, (op1) ? op1 : answer); + case Recall: return recall ((int)op0); + case Inc: return increase ((int)op0); + case Dec: return decrease ((int)op0); + case Disp: display (); break; + case Mem: memory ((int)op0); break; + case Clear: clear (); break; + case Quit: quit (); break; + case Help: help (); break; + case Ans: return answer; + case Pi: return M_PI; + case E: return M_E; + case Equal: return op0 == op1; + case Diff: return op0 != op1; + case Ge: return op0 >= op1; + case Le: return op0 <= op1; + case Gt: return op0 > op1; + case Lt: return op0 < op1; + case And: return (op0 != 0) && (op1 != 0); + case Or: return (op0 != 0) || (op1 != 0); + case Not: return (op0 == 0); + case Cond: + if ((op0) && (root->ops[1])) { + return evaluate_element (root->ops[1], 0); + } else if ((!op0) && (root->ops[2])) { + return evaluate_element (root->ops[2], 0); + } else { + return 0; + } + case While: return while_do (root->ops[0], root->ops[1]); + case Code: return execute_code (root->ops, root->nbops); + case Print: return print (op0); + case Prog: + prog ((int)op0, root->ops[1]); + savestring ((int)op0, root->string); + break; + case Arg: return arg ((int)op0); + case Call: + for (i = 1, nb =0; i < root->nbops; i++) { + if (root->ops[i]) { + nb++; + } + } + return call ((int)op0, nb, root->ops + 1); + case List: list (); break; + case Edit: edit ((int)op0); break; + case Del: del ((int)op0); break; + case Get: return get ((int)op0); + case Length: return length (); + case Pop: return pop (); + case Push: return push (op0); + case Put: return put ((int)op0, op1); + case Set: + for (i = 0, nb =0; i < root->nbops; i++) { + if (root->ops[i]) { + nb++; + } + } + return set (nb, root->ops); + case Show: show (); break; + case Max: + if (root->ops[0]) { + return op0 > op1 ? op0 : op1; + } + return max (); + case Mean: + if (root->ops[0]) { + return (op0 + op1) / 2; + } + return mean (); + case Median: return median (); + case Min: + if (root->ops[0]) { + return op0 < op1 ? op0 : op1; + } + return min (); + case Order: order (); break; + case Prod: return prod (); + case Sum: return sum (); + case Variance: + if (root->ops[0]) { + double m = (op0 + op1) / 2; + op0 -= m; + op1 -= m; + return op0 * op0 + op1 * op1; + } + return variance (); + } + + return 0; +} + +char **generate_completion_list () +{ + int i, j, l = 0; + char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *)); + + for (i = 0; i < NB_OPERATORS; i++) { + list[l] = strdup ((operators + i)->keyword); + for (j = 0; j < (int)strlen (list[l]); j++) { + if (list[i][j] == '\t') { + list[i][j] = '\0'; + } + } + if (list[l] != NULL) { + l++; + } + } + + for (i = 0; i < NB_FUNCTIONS; i++) { + list[l] = strdup ((functions + i)->keyword); + if (list[l] != NULL) { + l++; + } + } + + for (i = 0; i < NB_CONSTANTS; i++) { + list[l] = strdup ((constants + i)->keyword); + if (list[l] != NULL) { + l++; + } + } + + for (i = 0; i < NB_SYMBOLS; i++) { + list[l] = strdup (symbols[i]); + if (list[l] != NULL) { + l++; + } + } + + return (list); +} + +void free_completion_list (char **list) +{ + int i; + + if (list) { + for (i = 0; i < NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1; i++) { + if (list[i] != NULL) { + free (list[i]); + } + } + free (list); + } +} + /* vim: set ts=4 sw=4 et: */