• mXparser in French,
• mXparser in German,
• mXparser in Italian,
• mXparser in Polish,
• mXparser in Portuguese,
• mXparser in Spanish,
• #303 #304 #305 #306 #307 #308

• Bitwise NAND, Bitwise NOR, Bitwise XOR
• #152

• Central & Eastern Europe ":", Integer division (quotient) "\"
• #318 #285

• Improvement and standardization of built-in elements description, click to see usage example
• Improvement and standardization of error messages, click to see usage example
• Definition of your own translations, click to see usage example
• Help content in the CSV format, click to see usage example
• Help content in the HTML format, click to see usage example
• Help content in the Markdown format, click to see usage example
• Help content in the JSON format, click to see usage example
• Clones for thread safe, click to see usage example
• Performance improvement for calculations in the loop, click to see usage example
• Bug fixed #291 Euler polynomial function producing wrong results
• Bug fixed #292 Implied Multiplication bug when blank character separates
• Bug fixed #283 Unnecessary newline at the end in getErrorMessage()
• Bug fixed #284 Unnecessary space in function expression string returned by getErrorMessage()
• Bug fixed #297 Claculation Steps Register fix - commas / parenthesis / missing parts related to user arguments

• Implied Multiplication, click to see usage example
• Unicode Math Symbols, click to see usage example
• Calculation Steps Register, click to see usage example
• Serialization Support, click to see usage example
• An Attempt To Fix Expression String
• Student's t-distribution: Probabilisty Density Function, Cumulative Distribution Function, Quantile Function
• Chi-Squared Distribution: Probabilisty Density Function, Cumulative Distribution Function, Quantile Function
• F-Snedecor Distribution: Probabilisty Density Function, Cumulative Distribution Function, Quantile Function
• Minor Bug fixing: 259, 258, 252, 261, 262, 263, 271, 269, 268, 266, 265
• Regression tests refactoring

Install-Package MathParser.org-mXparser -Version 6.0.0

dotnet add package MathParser.org-mXparser --version 6.0.0

<PackageReference Include="MathParser.org-mXparser" Version="6.0.0"/>

<dependency>
    <groupId>org.mariuszgromada.math</groupId>
    <artifactId>MathParser.org-mXparser</artifactId>
    <version>6.0.0</version>
</dependency>

implementation 'org.mariuszgromada.math:MathParser.org-mXparser:6.0.0'

implementation("org.mariuszgromada.math:MathParser.org-mXparser:6.0.0")

$ npm i mathparser.org-mxparser

• or consider donation: DONATION

mXparser is a highly flexible parser of mathematical expressions provided as text. Software delivers easy to use API for JAVA, C# .NET, TypeScript and JavaScript.

• JAVA: 6+
• Android - tested with mxparser compiled using jdk 1.7
• .NET Framework (2+) / MONO CLS, .NET Core: 1+, .NET Standard: 1+, .NET PCL
• Xamarin
• TypeScript, JavaScript
• Chrome, Firefox, MS Edge, Safari
• nodeJS

The tutorial consists of c.a. 180 live examples from c.a. 40 sections. Each of the examples can be copied and run on your own environment. In addition, mXparser provides an extensive collection of over 500 built-in math functions, expressions and symbols. Familiarize yourself with the scope and the syntax. Live testing is the best way to learn. Good luck!

• Full help content
• In-line help searching

• Simple calculation
• Changing expression string
• Using operators
• Power function
• Using numbers in scientific notation
• Percent sign
• Leading zeros

• Numbers and parenthesis
• Numbers and constants / arguments
• Numbers and constants / arguments and parenthesis
• Numbers and constants / arguments and parenthesis and functions
• Implied multiplication and possible ambiguity
• Implied multiplication and list of tokens
• Enable / disable implied multiplication

• Binary relation “=”
• Binary relation “<“
• Boolean operator “OR”
• Boolean operator “AND”

• Unary function
• Binary function
• Function with 3 arguments
• Function with n-arguments
• Function with even number of arguments

• Defining constant – various options

• Dealing with free arguments
• Defining dependent arguments
• Implementing your own Argument Extension
• Getting list of missing user defined arguments
• Possible conflict between Implied Multiplication and getting list of missing user defined arguments + recommended solutions

• Fast function definition (performance of creation)
• Handy function constructor, but slower proces of function creation (performance of creation slower, but calculation the same)
• Function with more parameters
• Function in function
• Implementing your own Function Extension
• Getting list of missing user defined functions
• Possible conflict between Implied Multiplication and getting list of missing user defined functions + recommended solutions

• What is pre-compilation?
• When is pre-compilation done?
• When is pre-compilation done again?
• An example of bad practice in computing the value of an expression for a changing argument value
• An example of good practice in computing the value of an expression for a changing argument value

• Function returning number of parameters provided
• Function returning sum of first and last parameter provided
• Function returning parameter at position defined by the first parameter
• Function returning sum of all parameters squared
• Implementing your own Variadic Function Extension

• Mechanics of the if function
• “if” function and arguments
• “if” function in user defined function
• Mechanics of the “iff” function
• iff function is not limited in number of cases

• SIGMA summation operator
• PI product operator
• SIGMA summation operator – Approximating sin(x) by Taylor series
• SIGMA summation operator – Approximating pi value by integrating sqrt(1-x^2)

• General derivative
• Left / right derivative
• Derivative from more complex function
• Derivative – alternative syntax
• Integrals – calculating pi by integration sqrt(1-x^2)

• Solve 2x-4 = 0 for x in [0, 10]
• Solve cos(x) = 0 for x in [0, pi]
• Solve cos(x) = 0 for x in [pi, pi] (root not bracketed)
• Solve x-y = 0 for x in [0, 10] and y = 4
• Solve sin'(x) = 0 for x in [0, pi]

• Primality test function
• Primes counting function
• Using built-in primes cache to accelerate calculations
• Estimating number of primes using Offset logarithmic integral function
• Prime factorization

• Using built-in constants
• Estimating Moon gravitational acceleration
• Getting list of constants

• Units of length / distance
• Units of time
• Units of information
• Units of volume
• Express 4 feet in inches
• Express in square kilometers the area of a rectangle measuring 100 meters by 2 kilometers
• List of supported units

• Example: 10 Millions / Kilo
• List of supported metric prefixes

• Expected value estimation using Probability Distribution Function
• Probability estimation using Cumulative Distribution Function – the law of 3*SIGMA
• Calculating quantiles using Inverse Cumulative Distribution Function – males height example assuming males height distribution N(170, 15)

• Random number from uniform continuous distribution
• Random number from uniform discrete distribution
• Random number from normal distribution
• Random number from a given list
• Estimating mean of Normal distribution
• Estimating standard deviation of Normal distribution
• Estimating variance of Normal distribution

• Random integer
• Random integer N: -10^k <= N <= 10^k for k = 1, 2, …,9
• Random natural number
• Random natural number N <= 10^k for k = 1, 2, …,9
• Uniform continuous distribution U(0,1)
• Normal distribution N(0,1)

• Dependent argument as user defined random variable
• User defined function as user defined random variable – random walk example

• Bitwise unary complement
• Bitwise AND
• Bitwise exclusive OR
• Bitwise inclusive OR
• Signed left / right shift

• Fraction (proper) as Number Literal
• Improper Fraction as Number Literal
• Fraction (Mixed Number) as Number Literal
• Fraction (Mixed Numer) and Improper Fraction in one Number Literal
• Operations on Fractions
• Represent double as Fraction

• Binary number
• Octal number
• Hexadecimal number
• Unary number
• Unary zero
• Base 1 – 36 number literals
• Base N numeral system

• Fibonacci numbers using fast recursion

• Fibonacci numbers using user defined recursive function
• Number of recursive parameters is not limited – binomial coefficient definition using user defined recursive function
• Mixing function parameters – part causing recursive calls, other part as ‘typical’ parameter. Below example is presenting definition of Chebyshev polynomial using recursive function.
• Indirect recursion – approximating sin(x) and cos(x)

• The square root √
• The square root of the square root √√
• The square root and parenthesis √()
• The roots of various orders ∜ ∛ √
• SIGMA summation operator ∑
• Unicode name of a user defined argument
• Show all Unicode built-in keywords
• Enable / disable Unicode built-in keywords
• List of Unicode symbols that grammar accepts

• NaN in condition
• NaN symbol
• First non-NaN value

• Basic trigonometric function
• Inverse trigonometric function
• Using units of angle being in radians mode

• Simple Expression
• Dependent User Argument
• User Function
• Expression referencing User Argument and User Function

• Setting the verbose mode
• Syntax checking
• Lexical syntax checking
• Getting computing time

• Printing expression tokens
• Using tokens to print expression in a fancy way
• Playing with invalid tokens

• Removing built-in tokens
• Modifying built-in tokens
• Overriding built-in tokens

• A few words on Floating Point Math
• Why mXparser is based on the double data type?
• Smart rounding options available in mXparser
• Check which rounding settings are currently active
• Example - Only Canonical Rounding option is active
• Example - Only Unit In The Last Place Rounding option is active
• Example - Only Almost Integer Rounding option is active
• Example - None of the rounding options are active

• User expression in the loop + output
• User function in the loop + output
• User argument (dependent) in the loop + output
• User expression in the loop – Performance
• User function in the loop – Performance
• User argument (dependent) in the loop – Performance

• Degrees / Radians Mode
• Attempt To Fix Expression String Mode
• Primes Cache
• Epsilon Comparison / Exact Comparison Mode
• Canonical Rounding Mode
• ULP (Unit In The Last Place) Rounding Mode
• Almost Integers Rounding Mode
• Implied Multiplication Mode
• Unicode Builtin Key Words Mode
• Verbose / Silent Mode
• Override Builtin Tokens Mode
• Modify Builtin Tokens Mode
• Remove Builtin Tokens Mode
• Current Calculation Cancellation
• Setting Console Prefix
• Reaching Console Output String
• Maximum Allowed Recursion Depth
• Double to Fraction Conversion
• Random Generator Selection
• Maximum Threads Number
• Default Settings

• SerializationUtils class
• Binary serialization SECURITY WARNING
• Enabling / Disabling binary serialization
• Expression serialization / deserialization from / to byte[]
• Expression serialization / deserialization from / to String
• Expression serialization / deserialization from / to File
• Serialization / Deserialization of complex objects

mXparser provides a rich collection of built-in math functions, math expressions, and math symbols. Familiarize yourself with the scope and the syntax. Math collection internal help is also available directly from the software – see the tutorial and the API documentation for all the details.

• please consider donation
• purchase the commercial license from here or from here

• basic operators, i.e.: +, -, *, ^, !
• Boolean logic operators i.e.: or, and, xor
• binary relations i.e.: =, <, >
• math functions (large library of 1-arg, 2-arg, 3-arg - functions) i.e.: sin, cos, Stirling numbers, log, inverse functions
• constants (large library), i.e.: pi, e, golden ratio
• n-args functions, i.e.: greatest common divisor
• iterated summation and product operators
• differentiation and integration

• user defined constants and arguments, both free - and dependent on other arguments + possibility of use in functions
• user defined functions (both free and depended)
• user defined recursive arguments + simple (controlled) recursion (1 recursive argument)
• user defined recursive functions / expressions (any) - complex, many arguments, no limitation
• internal syntax checking
• internal help
• other useful functionalities, i.e.: computing time, expression description.

Expression e = new Expression("2+3");
e.calculate();

👍

Expression e = new Expression("2+(3-5)^2");
e.calculate();

👍

Expression e = new Expression("2*pi");
e.calculate();

👍

Constant tau = new Constant("tau = 2*pi");
Expression e = new Expression("3*tau", tau);
e.calculate();

👍

Expression e = new Expression("sin(2*pi)");
e.calculate();

👍

Expression e = new Expression("gcd(2,5,10,30)");
e.calculate();

👍

Argument x = new Argument("x = 5");
Expression e = new Expression("sin(x)", x);
e.calculate();

👍

Argument x = new Argument("x = 5");
Argument y = new Argument("y = 2*x", x);
Expression e = new Expression("sin(y)", y);
e.calculate();

👍

Argument x = new Argument("x = 5");
Expression e = new Expression("if(sin(x) > 5, 1, 0)", x);
e.calculate();

👍

Expression e = new Expression("5=6");
e.calculate();

👍

Expression e = new Expression("5 <= 6");
e.calculate();

👍

Expression e = new Expression("sum(i, 1, 10, 2*i^2 + pi)");
e.calculate();

👍

Expression e = new Expression("prod(i, 1, 5, i, 0.5)");
e.calculate();

👍

Argument x = new Argument("x = pi/2");
Expression e20 = new Expression("sum(n,0,10,(-1)^n*(x^(2*n+1))/(2*n+1)!)", x);
e.calculate();

👍

Argument x = new Argument("x = pi/2");
Expression e = new Expression("cos(x)-der(sin(x), x)", x);
e.calculate();

👍

Expression e = new Expression("2*int(sqrt(1-x^2), x, -1, 1)");
e.calculate();

👍

Function f = new Function("f(x,y) = sin(x) + cos(y)");
f.calculate(1,2);
Expression e = new Expression("f(1,2) - 10", f);
e.calculate();

👍

Function f = new Function("f(n) = if( n>0, n*f(n-1), 1)");
f.calculate()

👍

Function Cnk = new Function("Cnk(n,k) = if(k>0, if(k<n, Cnk(n-1,k-1)+Cnk(n-1,k), 1), 1)");
Cnk.calculate()

👍

Expression e = new Expression("2+1/a");
e.checkSyntax();
mXparser.consolePrintln(e.getErrorMessage());

• please consider donation: DONATION
• or purchase the license via ORDER Page or INFIMA Online Store

Best regards, Mariusz Gromada