Struct Parser 

pub struct Parser<'src> { /* private fields */ }

Recursive descent parser for mathematical expressions.

Uses operator precedence climbing for efficient binary operator parsing.

Examples

use expr_solver::Parser;

let mut parser = Parser::new("2 + 3 * 4");
let ast = parser.parse().unwrap();
assert!(ast.is_some());

Implementations

impl<'src> Parser<'src>

pub fn new(input: &'src str) -> Self

Creates a new parser from a string slice.

pub fn parse(&mut self) -> Result<Option<Expr<'src>>, ParseError>

Parses the source into an abstract syntax tree.

Returns None for empty input, or an expression AST on success.