VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
return NULL;
}
+ new->ops = (element_t **) calloc (1, sizeof (element_t *));
+ if (new->ops == NULL) {
+ free (new);
+ VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
+ return NULL;
+ }
new->func = function;
new->nbops = nbops;
new->prio = prio;
void delelement (element_t *root)
{
- int i;
if ((root != NULL) && (root != ERROR_OP)) {
+ int i;
for (i = 0; i < root->nbops; i++) {
if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) {
delelement (root->ops[i]);
}
}
+ if (root->nbops) {
+ free (root->ops);
+ }
free (root);
}
}
-/* functions */
+/* duplicate element */
+
+element_t *dupelement (element_t *root)
+{
+ element_t *tmp = NULL;
+ int i;
-#define NB_OPERATORS 12
+ if ((root == NULL) || (root == ERROR_OP)) {
+ return root;
+ }
+ tmp = newelement (root->func, root->nbops, root->prio);
+ if (tmp == NULL) {
+ return ERROR_OP;
+ }
+ tmp->value = root->value;
+ for (i = 0; i < root->nbops; i++) {
+ tmp->ops[i] = dupelement (root->ops[i]);
+ if (tmp->ops[i] == ERROR_OP) {
+ delelement (tmp);
+ return ERROR_OP;
+ }
+ }
+ return tmp;
+}
+/* functions */
+
+#define NB_OPERATORS 14
keyword_t operators[NB_OPERATORS] = {
{ "+\t", Add, 2, 1, 1},
{ "-\t", Sub, 2, 1, 1},
{ "/", Div, 2, 1, 2},
{ "%", Mod, 2, 1, 3},
{ "^", Pow, 2, 1, 4},
- { "==", Equal, 2, 2, 6},
- { "!=", Diff, 2, 2, 6},
- { ">=", Ge, 2, 2, 6},
- { "<=", Le, 2, 2, 6},
- { ">", Gt, 2, 1, 6},
- { "<", Lt, 2, 1, 6}
+ { "==", 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 12
+#define NB_FUNCTIONS 17
keyword_t functions[NB_FUNCTIONS] = {
{ "sqrt", Sqr, 1, 4, 5},
{ "pow", Pow, 2, 3, 5},
{ "log", Log, 1, 3, 5},
{ "sto", Store, 2, 3, 5},
{ "rcl", Recall, 1, 3, 5},
- { "disp", Disp, 0, 4, 5},
- { "quit", Quit, 0, 4, 5},
- { "help", Help, 0, 4, 5}
+ { "inc", Inc, 1, 3, 5},
+ { "dec", Dec, 1, 3, 5},
+ { "disp", Disp, 0, 4, 9},
+ { "quit", Quit, 0, 4, 9},
+ { "help", Help, 0, 4, 9},
+ { "!", Not, 1, 1, 6},
+ { "cond", Cond, 3, 4, 5},
+ { "whl", While, 2, 3, 5}
};
#define NB_CONSTANTS 3
}
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;
do {
found = 0;
new = parser (str + 1, &str, 0);
- if (new == ERROR_OP) {
+ 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;
}
return ERROR_OP;
}
new = parser (str + 1, &str, 0);
- if ((new == ERROR_OP) || (*str == ',')) {
+ 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;
+ }
str++;
VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n"));
continue;
double value = strtod (str, &pt);
VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value));
if (str != pt) {
- if (root == NULL) {
+ if ((root == NULL) || (root->prio == 6)) {
new = newelement (Val, 1, 5);
if (new == NULL) {
return ERROR_OP;
}
new->value = value;
- root = new;
+ 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;
+ }
+ }
str = pt;
} else if ((*str == '+') || (*str == '-')) {
if ((prio) && (prio > 1)) {
case Exp: func = "Exponantial"; 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 Quit: func = "Quit"; break;
case Help: func = "Help"; 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;
}
fprintf (stdout, "Function: %s\n", func);
return 0;
}
+double increase (int index)
+{
+ if ((index > 0) && (index <= STORAGE_SIZE)) {
+ return storage[index - 1]++;
+ } else {
+ VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [1, %d]\n", index, STORAGE_SIZE));
+ }
+ return 0;
+}
+
+double decrease (int index)
+{
+ if ((index > 0) && (index <= STORAGE_SIZE)) {
+ return storage[index - 1]--;
+ } else {
+ VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [1, %d]\n", index, STORAGE_SIZE));
+ }
+ return 0;
+}
+
void display (void)
{
int i;
fprintf (stdout, "\n");
}
+/* 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"));
+ if (cond == NULL) {
+ return ret;
+ }
+ while (1) {
+ VERBOSE (DEBUG, fprintf (stdout, "loop...\n"));
+
+ temp = dupelement (cond);
+ if (!evaluate_element (temp, 0)) {
+ break;
+ }
+ if (action) {
+ temp = dupelement (action);
+ ret = evaluate_element (temp, 0);
+ }
+ }
+
+ VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n"));
+
+ return ret;
+}
+
/* quit function */
void quit (void)
void help (void)
{
fprintf (stdout, "calc is a simple calculator\n\n");
- fprintf (stdout, "supported operators:\n");
- fprintf (stdout, " + - * / %% ^\n\n");
- fprintf (stdout, "camparison operators:\n");
- fprintf (stdout, " == != >= <= > <\n\n");
- fprintf (stdout, "supported functions:\n");
- fprintf (stdout, " pow sqrt cos sin atan log exp\n\n");
- fprintf (stdout, "storage functions:\n");
- fprintf (stdout, " sto rcl\n\n");
- fprintf (stdout, "miscellaneous functions:\n");
- fprintf (stdout, " quit help\n\n");
- fprintf (stdout, "supported constants:\n");
+ fprintf (stdout, "supported operators:");
+ fprintf (stdout, " + - * / %% ^\n");
+ fprintf (stdout, "camparison operators:");
+ fprintf (stdout, " == != >= <= > <\n");
+ fprintf (stdout, "logical operators:");
+ fprintf (stdout, " & | !\n");
+ fprintf (stdout, "supported functions:");
+ fprintf (stdout, " pow sqrt cos sin atan log exp\n");
+ fprintf (stdout, "storage functions:");
+ fprintf (stdout, " sto rcl inc dec\n");
+ fprintf (stdout, "conditional functions:");
+ fprintf (stdout, " cond\n");
+ fprintf (stdout, "miscellaneous functions:");
+ fprintf (stdout, " quit help\n");
+ fprintf (stdout, "supported constants:");
fprintf (stdout, " e pi\n");
}
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) {
case Log:
case Exp:
case Recall:
+ case Inc:
+ case Dec:
+ case Not:
+ case Cond:
if (root->ops[0]) {
op0 = evaluate_element (root->ops[0], 0);
} else {
case Pi:
case E:
break;
+ case While:
+ if (root->ops[0] == NULL) {
+ VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
+ return 0;
+ }
+ break;
}
switch (root->func) {
case Exp: return exp (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 Quit: quit (); break;
case Help: help (); break;
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]);
}
return 0;
Soft'N'Design Software / projects / calc.git / blobdiff