How would you create an expression parser in c#?

Question

I am just curious. Like in interpreted languages or even statement calculators how do people convert the strings given by input or files to actual expressions? e.g \"Ent

Answer 1

Google "parse tree". One can be written in any Turing-complete language.