Home/ Questions/Q 814951
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T01:36:16+00:00

(in c90) (linux) input: sqrt(2 – sin(3*A/B)^2.5) + 0.5*(C*~(D) + 3.11 +B) a b

  • 0

(in c90) (linux)

input:

sqrt(2 - sin(3*A/B)^2.5) + 0.5*(C*~(D) + 3.11 +B)
a
b   /*there are values for a,b,c,d */
c
d

input:

cos(2 - asin(3*A/B)^2.5) +cos(0.5*(C*~(D)) + 3.11 +B)
a
b   /*there are values for a,b,c,d */
c
d

input:

sqrt(2 - sin(3*A/B)^2.5)/(0.5*(C*~(D)) + sin(3.11) +ln(B))
 /*max lenght of formula is 250 characters*/
a
b   /*there are values for a,b,c,d */
c   /*each variable with set of floating numbers*/
d

As you can see infix formula in the input depends on user.
My program will take a formula and n-tuples value.
Then it calculate the results for each value of a,b,c and d.
If you wonder I am saying ;outcome of program is graph.
/sometimes,I think i will take input and store in string.
then another idea is arise ” I should store formula in the struct”
but ı don’t know how I can construct
the code on the base of structure./

really, I don’t know way how to store the formula in program code so that
I can do my job.
can you show me?

/* a,b,c,d is letters
 cos,sin,sqrt,ln is function*/
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You need to write a lexical analyzer to tokenize the input (break it into its component parts–operators, punctuators, identifiers, etc.). Inevitably, you’ll end up with some sequence of tokens.

    After that, there are a number of ways to evaluate the input. One of the easiest ways to do this is to convert the expression to postfix using the shunting yard algorithm (evaluation of a postfix expression is Easy with a capital E).

    • 0