zen_expression/parser/
mod.rs

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
//! Parses Tokens into AST
//!
//! The Parser module processes tokens from the Lexer, constructing an Abstract Syntax Tree (AST).
//!
//! It's available in two specialized variants:
//! - Standard, designed for comprehensive expression evaluation yielding any result
//! - Unary, specifically created for truthy tests with exclusive boolean outcomes
mod ast;
mod builtin;
mod constants;
mod error;
mod parser;
mod result;
mod standard;
mod unary;

pub(crate) use builtin::Arity;

pub use ast::Node;
pub use builtin::BuiltInFunction;
pub use error::ParserError;
pub use parser::Parser;
pub use result::{NodeMetadata, ParserResult};
pub use standard::Standard;
pub use unary::Unary;