cel-go VS expr

There's a simple repl implementation in the cel-go repo that you can use https://github.com/google/cel-go/tree/master/repl/main. But not sure about what you actually want to do though. Has a bit of on XY problem feel to be honest.

https://github.com/google/cel-go Didn't find much support for structs.

There’s also https://github.com/google/cel-go which is similar but different at the same time

Hello, thanks for sharing - looks awesome. I am currently experimenting with https://github.com/google/cel-go to add some dynamic boolean expressions to my project. Possibly you have heard about Cel and can tell how Expr compares to it?

Very cool! Any ideas how this compares with https://github.com/google/cel-go ?

Not diminishing the article at all, there's massive value I've gained from leveraging this runtime solution in multiple projects: https://github.com/antonmedv/expr

The language is easy enough for people to pick-up.

Uses the [expr](https://github.com/antonmedv/expr) language to achieve this and I've been super happy with the results.

I have been using expr (https://github.com/antonmedv/expr) to do something like this for a while. no complains so far.

If you wanted it to not require putting in the operation first and just accept string equations (without using something like https://github.com/antonmedv/expr) you could parse, tokenize and then process the input.