We all know Rust's trait system is Turing complete, so tell me, why aren't we exploiting this???
-
Updated
Jan 31, 2021 - Rust
We all know Rust's trait system is Turing complete, so tell me, why aren't we exploiting this???
Math parser and evaluator in Rust, capable of partial differentiation, allows the use of custom operators.
Simple and fast arithmetic expression parser
🧮 Boolean expression evaluation engine. A Rust port of boolrule.
A evaluation engine library for Rust.
A quasi-Thue interpreter written in Rust
A maths expression parser/evaluator, in Rust.
A simple program that evaluates porpositional logic expressions
A simple Lisp like expression evaluator. Only support primitive (void, integer, bool) and caling foreign function from Rust.
A small REPL with a simple syntax to experiment with Rust.
A simple rust programm to interpret boolean algebra expressions using a Tokenizer & Recursive Decent AST building
Add a description, image, and links to the evaluator topic page so that developers can more easily learn about it.
To associate your repository with the evaluator topic, visit your repo's landing page and select "manage topics."