For valuate arithmetic expression I use the Donal Knuth algorithm, which convert the expression to postfix and the use the postfix stack to resolve the expression. I’m wondering, there is something similar for complex number expressions?
Something which can do for example: ((2+8i)*(12+3i)^(1/2))/34+21i
The same techniques. You just define the operations you can perform and you store the operand type information together with a value on the stack.