#include <malloc.h>
#include <math.h>
+#include <stdio.h>
#include <stdlib.h>
#include "debug.h"
#include "parser.h"
+/* global variables */
+
+double answer = 0;
+
+#define STORAGE_SIZE 10
+double storage[STORAGE_SIZE] = {0};
+
/* compare codes */
int codecmp (char *ref, char *str)
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;
+
+ 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;
+}
-#define NB_OPERATORS 6
+/* functions */
+#define NB_OPERATORS 14
keyword_t operators[NB_OPERATORS] = {
{ "+\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}
+ { "^", 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 9
+#define NB_FUNCTIONS 17
keyword_t functions[NB_FUNCTIONS] = {
{ "sqrt", Sqr, 1, 4, 5},
{ "pow", Pow, 2, 3, 5},
{ "cos", Cos, 1, 3, 5},
{ "sin", Sin, 1, 3, 5},
- { "atan", Atn, 1, 4, 5},
+ { "atan", Atan, 1, 4, 5},
{ "exp", Exp, 1, 3, 5},
{ "log", Log, 1, 3, 5},
- { "quit", Qui, 0, 4, 5},
- { "help", Hel, 0, 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},
+ { "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
+keyword_t constants[NB_CONSTANTS] = {
+ { "ans", Ans, 0, 3, 5},
+ { "e", E, 0, 1, 5},
+ { "pi", Pi, 0, 2, 5}
};
/* subparser function */
}
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;
continue;
}
+ /* check for open brace */
+
+ if (*str == '{') {
+ VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n"));
+ element_t *prog = newelement (Prog, 0, 5);
+ if (prog == NULL) {
+ delelement (root);
+ return ERROR_OP;
+ }
+ if (root == NULL) {
+ root = prog;
+ } else {
+ for (i = 0; i < root->nbops; i++) {
+ if (root->ops[i] == NULL) {
+ root->ops[i] = prog;
+ found = 1;
+ }
+ }
+ if (!found) {
+ delelement (prog);
+ delelement (root);
+ return ERROR_OP;
+ }
+ }
+
+ 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;
+ }
+ element_t *prognew = newelement (Prog, prog->nbops + 1, 5);
+ for (i = 0; i < prog->nbops; i++) {
+ prognew->ops[i] = prog->ops[i];
+ }
+ prog->ops[prog->nbops] = new;
+ delelement (prog);
+ prog = prognew;
+ } while (*str == ',');
+
+ if (*str != '}') {
+ delelement (root);
+ return ERROR_OP;
+ }
+ str++;
+ VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n"));
+ continue;
+ }
+
/* check for open bracket */
if (*str == '(') {
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;
}
- /* check for closing bracket or koma */
+ /* check for closing bracket, closing brace or koma */
- if ((*str == ')') || (*str == ',')) {
+ if ((*str == ')') || (*str == '}') || (*str == ',')) {
if (next != NULL) {
*next = str;
}
continue;
}
+ /* look for constant */
+
+ 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));
+ new = newelement (constant->func, constant->nbops, constant->prio);
+ if (new == NULL) {
+ return ERROR_OP;
+ }
+ root = new;
+ } else {
+ delelement (root);
+ return ERROR_OP;
+ }
+ str += constant->offset;
+ found = 1;
+ VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n"));
+ break;
+ }
+ }
+ if (found) {
+ continue;
+ }
+
/* look for number */
if (((*str >= '0') && (*str <= '9')) ||
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;
- str = pt;
- } else if (root->func == Val) {
- if ((*str == '+') || (*str == '-')) {
- if ((prio) && (prio > 1)) {
- VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
- *next = str;
- return root;
+ 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 (subparser (&root, &str, Add, 2, 1) == ERROR_OP) {
+ if (!found) {
+ delelement (new);
delelement (root);
return ERROR_OP;
}
- } else {
+ }
+ str = pt;
+ } else if ((*str == '+') || (*str == '-')) {
+ if ((prio) && (prio > 1)) {
+ VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n"));
+ *next = str;
+ return root;
+ }
+ if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) {
delelement (root);
return ERROR_OP;
}
case Sqr: func = "Square Root"; break;
case Cos: func = "Cosine"; break;
case Sin: func = "Sine"; break;
- case Atn: func = "Arc Tangent"; break;
+ case Atan: func = "Arc Tangent"; break;
case Log: func = "Logarithm"; break;
case Exp: func = "Exponantial"; break;
- case Qui: func = "Quit"; break;
- case Hel: func = "Help"; 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 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 Prog: func = "Program"; break;
}
fprintf (stdout, "Function: %s\n", func);
}
}
+/* storage functions */
+
+double store (int index, double value)
+{
+ if ((index > 0) && (index <= STORAGE_SIZE)) {
+ storage[index - 1] = value;
+ } else {
+ VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [1, %d]\n", index, STORAGE_SIZE));
+ }
+ return value;
+}
+
+double recall (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 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, "storage:");
+ for (i = 0; i < STORAGE_SIZE; i++) {
+ fprintf (stdout, " %g", storage[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;
+}
+
+/* program function */
+
+double program_do (element_t **prog, int nbcalls)
+{
+ double ret = 0;
+ int i;
+ for (i = 0; i < nbcalls; i++) {
+ ret = evaluate_element (prog[i], 0);
+ prog[i] = NULL;
+ }
+ 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, "supported functions:\n");
- fprintf (stdout, " pow sqrt cos sin atan log exp\n\n");
- fprintf (stdout, "miscellaneous functions:\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");
}
/* evaluate element tree */
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 {
+ } else if (root->func != Store) {
VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n"));
return 0;
}
case Sqr:
case Cos:
case Sin:
- case Atn:
+ case Atan:
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 {
return 0;
}
break;
- case Qui:
- case Hel:
+ case Disp:
+ case Quit:
+ case Help:
+ case Ans:
+ case Pi:
+ case E:
+ case Prog:
+ break;
+ case While:
+ if (root->ops[0] == NULL) {
+ VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n"));
+ return 0;
+ }
break;
}
case Sqr: return sqrt (op0);
case Cos: return cos (op0);
case Sin: return sin (op0);
- case Atn: return atan (op0);
+ case Atan: return atan (op0);
case Log: return log (op0);
case Exp: return exp (op0);
- case Qui: quit (); break;
- case Hel: help (); break;
+ 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 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 Prog: return program_do (root->ops, root->nbops);
}
return 0;
Soft'N'Design Software / projects / calc.git / blobdiff