to compute formulas there are many possibilities.

what can be made with the accumulator concept? eax register holds the accumalator, instructions are processed by default on eax

and after this stage, do a sort of serialisation:

and then execute it!
exemple:


it is just an idea, not a working concept.

edfed this is silly. You want a "HLL compiler/interpreter" inside of your ASM program? What would be utility / benefit of this?

why the hell use parantheses? Use Reverse Polish Notation and get rid of them, at the very least...

ok, for polish notation
but after, i want to do a math interpreter
like a command line
hit enter, it gives the result
like in a TI82

and use it as a feature for my shell.
i stil have an interpreter for my own command line functions (paused), and an interpreter for rudimental html, i just want to add an interpret for math formulas.
something callable easy.


math must do the interpretation of variables transparentlly.

for example, if A is not assigned, it gets the value of "null" and all operation with will be ignored.
if A is assigned, all operations with it will be made.

SIMD is the wave of the future.
Ride the wave

Polish notation is more efficient, but parenthesis are easier to use.

@edfed - you need to...

1 - break the formula down into a TREE structure where every leaf node is a variable or constant and every junction is an operation.


2 - Create a function for each binary operation (two parameters), don't forget unary operations (one parameter) if you want to support them like NOT, NEG, SQRT.

3 - Iterate through your tree in ?breadth first? perform the necessary operation and replace the leaf node(s) and operation node with the operation function's return value.

4 - Once you have the basic system working you can optimize it if you'd like. Using multiple threads to evaluate operations that are on the same TREE LEVEL (i.e. they are not dependent on eachother). Trying to optimize the TREE by simplifying the formula etc etc.