VSEP is able to parse expressions like:

(foo + bar + quz)
(foo + bar(1, 2 (foo + bar)))
foo('some_string',bar, 1.001e1)

It can then "solve" these expression, getting any variables or function return values from various callbacks supplied to it. For the & and | operators (logical and and or, respectively) it supports lazy evaluation. VSEP can also be passed a callback returning the "difficulty" of getting a certain variable or function, which it can use to simplify the expression as lazily as possible.

VSEP is written in C; it strives for efficiency, readable and thoroughly documented code, a high degree of configurabilty and lack of global variables.

Project Activity

See All Activity >

Follow vsep

vsep Web Site

Other Useful Business Software
Try Google Cloud Risk-Free With $300 in Credit Icon
Try Google Cloud Risk-Free With $300 in Credit

No hidden charges. No surprise bills. Cancel anytime.

Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of vsep!

Additional Project Details

Registered

2012-12-04