parsington
A mathematical expression parser for infix expression strings
Parsington is an infix-to-postfix and infix-to-syntax-tree expression parser for mathematical expressions written in Java. It is simple yet fancy, handling (customizable) operators, functions, variables and constants in a similar way to what the Java language itself supports.
homepage ↗ github: scijava/parsington
Available in
| Overlay | Newest | Ebuilds | Last activity | |
|---|---|---|---|---|
| science gitweb ↗ | 3.1.0 | 2 | 4 d | details › |
Versions & arches
Use flags of 3.1.0
- doc Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally
- source Zip the sources and install them
- test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)