uniphil/expression-parser

parse math expressions into a syntax tree

JavaScript

MIT License

This project parses mathematical expressions into an Abstract Syntax Tree (AST) and provides optional compilers to safely execute them or evaluate individual nodes. It's designed for developers who need to securely process user-provided math expressions, such as in calculators, educational tools, or data analysis applications, without relying on risky `eval

Total donated

Undistributed

Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of uniphil/expression-parser

ramda/ramda

A practical functional library for JavaScript programmers.

chaijs/chai

BDD/TDD assertion library for node.js and the browser. Test framework agnostic.

nickmerwin/node-coveralls

takes json-cov output into stdin and POSTs to coveralls.io

spalger/gulp-jshint

JSHint plugin for gulp

gotwarlost/istanbul

Yet another JS code coverage tool that computes statement, line, function and branch coverage with module loader hooks to transparently add coverage when running tests. Supports all JS coverage use cases including unit tests, server side functional tests and browser tests. Built for scale