int evaluateExpression(char *expression){
Token *token;
Stack *numberStack=createStack();
Stack *operatorStack=createStack();
if(expression ==NULL){
Throw(ERR_NO_ARGUMENT);
}
Text *newText=textNew(expression);
String *tokenizer = stringNew(newText);
token=getToken(tokenizer);
if(token->type == IDENTIFIER_TOKEN){
Throw(ERR_NOT_ACCEPT_IDENTIFIER);
}else{
while(token!=NULL){
if(isOperator(token)){
if(((Operator*)token)->info->affix!=PREFIX)
tryConvertToPrefix((Operator*)token);
stackPush(token,operatorStack);
}else if(isNumber(token)){
stackPush(token,numberStack);
break;
}else
Throw(ERR_INVALID_IDENTIFIER);
token=getToken(tokenizer);
if(token==NULL)
break;
}
}
while((token=getToken(tokenizer))!=NULL ){
evaluatePostfixesPrefixesAndInfixes(expression,token,numberStack,operatorStack);
}
evaluateAllOperatorOnStack(numberStack,operatorStack);
Number *result=(Number*)stackPop(numberStack);
destroyStack(numberStack);
if(operatorStack !=NULL){
destroyStack(operatorStack);
}
return result->value;
}
int evaluate(char *expression,Stack *dataStack,Stack *operatorStack){
Tokenizer *tokenizer;
Token *token;
Token *ansToken;
ErrorCode e;
int i;
int counter =0;
NumberToken *result;
dataStack=stackNew();
operatorStack=stackNew();
tokenizer = tokenizerNew(expression);
if(expression ==NULL){
Throw(ERR_NO_EXPRESSION);
}
while((token=nextToken(tokenizer))!=NULL){
if(counter%2==0&&token->type==OPERATOR_TOKEN){
Throw(ERR_NOT_DATA);
}
else if(counter%2==1&&token->type==NUMBER_TOKEN){
Throw(ERR_NOT_OPERATOR);
}
if(isNumber(token)){
push(token,dataStack);
}
else if(isOperator(token))
{
tryEvaluateOperatorOnStackThenPush((OperatorToken*)token,dataStack,operatorStack);
}
counter ++;
}
evaluateAllOperatorOnStack(dataStack,operatorStack);
result=(NumberToken*)pop(dataStack);
printf("counter needed for each expression : %d \n",counter);
return result->value;
}
/*******************************************************************************************
* This function is to evaluate the expression which contains numbers and operators and
* return the results in number form.
* This function is a prototype function which use as reference to
* improve in the evaluateExpression(char*expression) function.
* Thus, this function could not evaluate expression like -2,*2,(((2))), +-+-2... *
* input : expression
* output : none
* return : ((Number*)token)->value
*
********************************************************************************************/
int evaluate(char *expression){
Token *token;
Number *result;
Stack *numberStack=createStack();
Stack *operatorStack=createStack();
if(expression ==NULL){
Throw(ERR_NO_ARGUMENT);
}
Text *newText=textNew(expression);
String *tokenizer = stringNew(newText);
while((token=getToken(tokenizer))!=NULL ){
if(isNumber(token)){
stackPush(token,numberStack);
} else if(isOperator(token)) {
if(((Operator*)token)->info->id==OPENING_BRACKET_OP || ((Operator*)token)->info->id==CLOSING_BRACKET_OP) {
tryEvaluatePrefixOperatorOnStackThenPush((Operator*)token,numberStack,operatorStack);
} else{
tryEvaluateOperatorOnStackThenPush((Operator*)token,numberStack,operatorStack);
}
}
}
if(operatorStack == NULL){
operatorPrefixEvaluate(numberStack ,(Operator*)token);
}else{
evaluateAllOperatorOnStack(numberStack,operatorStack);
}
result=(Number*)stackPop(numberStack);
destroyStack(numberStack);
if(operatorStack !=NULL){
destroyStack(operatorStack);
}
return result->value;
}
