R
Ron Bullman
Jonas,
You have at least three alternatives to proceed:
A) Create your own parser to parse the expressions to some intermediate
representation and then compile and execute (or interpret) that. (keywords
for google, recursive descent parser, abstract stack machine).
B) If the expressions are valid C# (VB) you could utilize the inbuild
features of .NET. Create CodeDom compile unit from the expression, compile
it to assembly and execute that. (namespaces to study System,
System.CodeDom, System.CodeDom.Compiler, System.Reflection).
C) Incorporate scripting capabilities to your application via VSA (Visual
Studio for Applications). (namespace to study Microsoft.Vsa and newsgroup
....dotnet.vsa).
You might wanna specify more detailed manner your requirements inorder to
have better advice which route to take.
Ron
You have at least three alternatives to proceed:
A) Create your own parser to parse the expressions to some intermediate
representation and then compile and execute (or interpret) that. (keywords
for google, recursive descent parser, abstract stack machine).
B) If the expressions are valid C# (VB) you could utilize the inbuild
features of .NET. Create CodeDom compile unit from the expression, compile
it to assembly and execute that. (namespaces to study System,
System.CodeDom, System.CodeDom.Compiler, System.Reflection).
C) Incorporate scripting capabilities to your application via VSA (Visual
Studio for Applications). (namespace to study Microsoft.Vsa and newsgroup
....dotnet.vsa).
You might wanna specify more detailed manner your requirements inorder to
have better advice which route to take.
Ron