expr-solver 1.0.6

Solves a mathematical expression while following precedence and associativity.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

## Expression Solver

Solves a mathematical expression while following precedence and associativity.

The crate provides one public api function.

```rs
fn resolve(input_string: String) -> Result<f64, String>
```

This takes mathematical expressions as String, and returns a Result enum with solved value or incase of an error, error string.

### Examples

```rs
use expr_solver::resolve;

// simple binary expression.
resolve("2+2".to_string()); // Ok(2.0)

// follows precendence, 2 + (2 _ 2) and NOT (2 + 2) _ 2
resolve("2+2*2".to_string()); // Ok(6.0);

// unary expression.
resolve("-2".to_string()); // Ok(-2.0)

// even chain them. -(-2)
resolve("--2".to_string()); // Ok(2.0)

// binary and unary in one expression.
resolve("2+-2".to_string()); // Ok(0.0)

// gives syntax error.
resolve("2)2".to_string()); // Err(String);
```

### Inner workings

There are three steps involved

#### 1. Lexical Analysis.

Breaks the input string into indiviual tokens.

#### 2. Parser

This uses a Pratt Parsing technique to parse the stream of tokens into Abstract Syntax Tree (AST).

#### 3. Interpreting

Uses a 'Tree-Walk' interpreter to evalute the AST.