MathParser | |
Exceptions | Exceptions thrown by the MathParser library |
DivisionByZeroException | Exception thrown when evaluating expressions containing a division by zero |
MathParserException | Base class for the exceptions thrown by the MathParser library |
ParenthesisMismatchException | Exception thrown when parsing expressions having non-matching left and right parentheses |
SyntaxErrorException | Exception thrown when parsing expressions that are not well-formed |
UnknownConstantException | Exception thrown when parsing or evaluating expressions containing an unknown constant |
UnknownFunctionException | Exception thrown when parsing or evaluating expressions containing an unknown function symbol |
UnknownOperatorException | Exception thrown when parsing or evaluating expressions containing an unknown oprator |
UnknownTokenException | Exception thrown when tokenizing expressions containing illegal characters |
UnknownVariableException | Exception thrown when parsing or evaluating expressions containing an unknown or undefined variable |
Extensions | |
Complex | Implementation of complex number arithmetic with the standard transcendental functions |
Math | |
Rational | Implementation of rational number arithmetic |
Interpreting | Namepace for the AST transformers implementing the Visitor interface |
Visitors | Interfaces required to implement the visitor design pattern |
Visitable | Visitable interface, |
Visitor | Visitor interface |
ASCIIPrinter | Create LaTeX code for prettyprinting a mathematical expression (for example via MathJax) |
ComplexEvaluator | Evalutate a parsed mathematical expression |
Differentiator | Differentiate an abstract syntax tree (AST) |
Evaluator | Evalutate a parsed mathematical expression |
LaTeXPrinter | Create LaTeX code for prettyprinting a mathematical expression (for example via MathJax) |
RationalEvaluator | Evalutate a parsed mathematical expression |
TreePrinter | Simple string representation of an AST |
Lexing | Lexer and Token related classes |
ComplexLexer | Lexer capable of recognizing all standard complex mathematical expressions |
Lexer | Generic very simple lexer, capable of matching tokens defined by regular expressions |
StdMathLexer | Lexer capable of recognizing all standard mathematical expressions |
Token | Token class |
TokenDefinition | Token definitions using regular expressions to match input |
TokenType | Token type values |
Parsing | Parser related classes |
Nodes | Node classes for use in the generated abstract syntax trees (AST) |
Factories | Classes implementing the ExpressionNodeFactory interfaces, and related functionality |
AdditionNodeFactory | Factory for creating an ExpressionNode representing '+' |
DivisionNodeFactory | Factory for creating an ExpressionNode representing '/' |
ExponentiationNodeFactory | Factory for creating an ExpressionNode representing '^' |
MultiplicationNodeFactory | Factory for creating an ExpressionNode representing '*' |
NodeFactory | Helper class for creating ExpressionNodes |
SubtractionNodeFactory | Factory for creating an ExpressionNode representing '-' |
Interfaces | Interfaces for Nodes, in particular Node factories |
ExpressionNodeFactory | Interface for construction of ExpressionNode, the implementations of the interface, usually involves some simplification of the operands |
Traits | Traits for Nodes |
ConstantNode | AST node representing a known constant (e.g |
ExpressionNode | AST node representing a binary operator |
FunctionNode | AST node representing a function applications (e.g |
IntegerNode | AST node representing a number (int or float) |
Node | Abstract base class for nodes in the abstract syntax tree generated by the Parser (and some AST transformers) |
NumberNode | AST node representing a number (int or float) |
PostfixOperatorNode | AST node representing a postfix operator |
RationalNode | AST node representing a number (int or float) |
SubExpressionNode | AST node representing a subexpression |
VariableNode | AST node representing a variable |
Parser | Mathematical expression parser, based on the shunting yard algorithm |
Stack | Utility class, implementing a simple FIFO stack |
ComplexMathParser | |
RationalMathParser | Convenience class for using the MathParser library |
StdMathParser | Convenience class for using the MathParser library |