-
-
Notifications
You must be signed in to change notification settings - Fork 505
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
294 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
WHITESPACE = _{ " " | "\t" | "\\left" | "\\right" | NEWLINE } | ||
|
||
program = _{ SOI ~ expr ~ EOI } | ||
expr = { atom ~ (infix ~ atom)* } | ||
atom = _{ prefix? ~ primary ~ postfix?} | ||
infix = _{ add | sub | mul | div | pow | paren } | ||
add = { "+" } // Addition | ||
sub = { "-" } // Subtraction | ||
mul = { "*" } // Multiplication | ||
div = { "/" } // Division | ||
pow = { "^" } // Exponantiation | ||
paren = { "" } // Nothing operator, useally Multiplication | ||
prefix = _{ neg | sqrt | sin | cos | tan | csc | sec | cot | invsin | invcos | invtan | invcsc | invsec| invcot } | ||
neg = { "-" } // Negation | ||
sqrt = {"sqrt"} | ||
sin = {"sin"} | ||
cos = {"cos"} | ||
tan = {"tan"} | ||
csc = {"csc"} | ||
sec = {"sec"} | ||
cot = {"cot"} | ||
invsin = {"asin"} | ||
invcos = {"cos"} | ||
invtan = {"tan"} | ||
invcsc = {"csc"} | ||
invsec = {"sec"} | ||
invcot = {"cot"} | ||
postfix = _{ fac } | ||
fac = { "!" } // Factorial | ||
primary = _{( "(" ~ expr ~ ")" ) | lit | var | global_var} | ||
var = @{ (ASCII_ALPHA | "_") ~ (ASCII_ALPHANUMERIC | "_")* } | ||
global_var= @{ "$" ~ var } | ||
lit = _{ float | int } | ||
float = @{ int ~ "." ~ int? ~ exp? | int ~ exp } | ||
exp = _{ ^"e" ~ ("+" | "-")? ~ int } | ||
int = @{ ASCII_DIGIT+ } | ||
constant = {pi | inf} | ||
pi = { "pi" | "PI" | "π" } | ||
i = {"i" | "I" } | ||
inf = { "inf" | "INF" | "infinity" | "INFINITY" | "∞" } | ||
tau = { "tau" | "TAU" | "τ"} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
mod parser; | ||
|
||
fn main() { | ||
println!("h"); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,248 @@ | ||
use std::{ | ||
iter, | ||
num::{ParseFloatError, ParseIntError}, | ||
}; | ||
|
||
use lazy_static::lazy_static; | ||
use pest::{ | ||
iterators::Pairs, | ||
pratt_parser::{Assoc, Op, PrattParser}, | ||
Parser, | ||
}; | ||
use pest_derive::Parser; | ||
use thiserror::Error; | ||
|
||
#[derive(Parser)] | ||
#[grammar = "./grammer.pest"] // Point to the grammar file | ||
struct ExprParser; | ||
|
||
lazy_static! { | ||
static ref PRATT_PARSER: PrattParser<Rule> = { | ||
PrattParser::new() | ||
.op(Op::infix(Rule::add, Assoc::Left) | Op::infix(Rule::sub, Assoc::Left)) | ||
.op(Op::infix(Rule::mul, Assoc::Left) | Op::infix(Rule::div, Assoc::Left) | Op::infix(Rule::paren, Assoc::Left) | Op::infix(Rule::pow, Assoc::Right)) | ||
.op(Op::postfix(Rule::fac)) | ||
.op(Op::prefix(Rule::neg) | ||
| Op::prefix(Rule::sqrt) | ||
| Op::prefix(Rule::sin) | ||
| Op::prefix(Rule::cos) | ||
| Op::prefix(Rule::tan) | ||
| Op::prefix(Rule::csc) | ||
| Op::prefix(Rule::sec) | ||
| Op::prefix(Rule::cot) | ||
| Op::prefix(Rule::invsin) | ||
| Op::prefix(Rule::invcos) | ||
| Op::prefix(Rule::invtan) | ||
| Op::prefix(Rule::invcsc) | ||
| Op::prefix(Rule::invsec) | ||
| Op::prefix(Rule::invcot)) | ||
}; | ||
} | ||
|
||
#[derive(Debug, PartialEq)] | ||
pub enum Literal { | ||
Int(u64), | ||
Float(f64), | ||
} | ||
|
||
#[derive(Debug, Clone, Copy, PartialEq)] | ||
pub enum BinaryOp { | ||
Add, | ||
Sub, | ||
Mul, | ||
Div, | ||
Pow, | ||
} | ||
|
||
#[derive(Debug, PartialEq)] | ||
pub enum UnaryOp { | ||
Neg, | ||
Sqrt, | ||
Sin, | ||
Cos, | ||
Tan, | ||
Csc, | ||
Sec, | ||
Cot, | ||
InvSin, | ||
InvCos, | ||
InvTan, | ||
InvCsc, | ||
InvSec, | ||
InvCot, | ||
Fac, | ||
} | ||
|
||
#[derive(Debug, PartialEq)] | ||
pub enum Node { | ||
Lit(Literal), | ||
Var(String), | ||
GlobalVar(String), | ||
BinOp { lhs: Box<Node>, op: BinaryOp, rhs: Box<Node> }, | ||
UnaryOp { val: Box<Node>, op: UnaryOp }, | ||
} | ||
|
||
#[derive(Error, Debug)] | ||
pub enum ParseError { | ||
#[error("ParseIntError: {0}")] | ||
ParseIntError(#[from] ParseIntError), | ||
#[error("ParseFloatError: {0}")] | ||
ParseFloatError(#[from] ParseFloatError), | ||
|
||
#[error("PestError: {0}")] | ||
PestError(#[from] pest::error::Error<Rule>), | ||
} | ||
|
||
impl Node { | ||
pub fn from_str(s: &str) -> Result<Node, ParseError> { | ||
let pairs = ExprParser::parse(Rule::program, s)?.next().expect("program should have atleast one child").into_inner(); | ||
parse_expr(pairs) | ||
} | ||
} | ||
|
||
fn parse_expr(pairs: Pairs<Rule>) -> Result<Node, ParseError> { | ||
PRATT_PARSER | ||
.map_primary(|primary| { | ||
Ok(match primary.as_rule() { | ||
Rule::int => Node::Lit(Literal::Int(primary.as_str().parse::<u64>()?)), | ||
Rule::var => { | ||
let name = primary.as_str().to_string(); | ||
|
||
Node::Var(name) | ||
} | ||
Rule::global_var => { | ||
let name = primary.as_str().split_at(1).1.to_string(); | ||
|
||
Node::GlobalVar(name) | ||
} | ||
Rule::expr => parse_expr(primary.into_inner())?, | ||
Rule::float => Node::Lit(Literal::Float(primary.as_str().parse::<f64>()?)), | ||
|
||
rule => unreachable!("Expr::parse expected int, expr, ident, found {:?}", rule), | ||
}) | ||
}) | ||
.map_prefix(|op, rhs| { | ||
Ok(Node::UnaryOp { | ||
val: Box::new(rhs?), | ||
op: match op.as_rule() { | ||
Rule::neg => UnaryOp::Neg, | ||
Rule::sqrt => UnaryOp::Sqrt, | ||
Rule::sin => UnaryOp::Sin, | ||
Rule::cos => UnaryOp::Cos, | ||
Rule::tan => UnaryOp::Tan, | ||
Rule::csc => UnaryOp::Csc, | ||
Rule::sec => UnaryOp::Sec, | ||
Rule::cot => UnaryOp::Cot, | ||
Rule::invsin => UnaryOp::InvSin, | ||
Rule::invcos => UnaryOp::InvCos, | ||
Rule::invtan => UnaryOp::InvTan, | ||
Rule::invcsc => UnaryOp::InvCsc, | ||
Rule::invsec => UnaryOp::InvSec, | ||
Rule::invcot => UnaryOp::InvCot, | ||
_ => unreachable!(), | ||
}, | ||
}) | ||
}) | ||
.map_postfix(|lhs, op| { | ||
Ok(Node::UnaryOp { | ||
val: Box::new(lhs?), | ||
op: match op.as_rule() { | ||
Rule::fac => UnaryOp::Fac, | ||
_ => unreachable!(), | ||
}, | ||
}) | ||
}) | ||
.map_infix(|lhs, op, rhs| { | ||
Ok(match op.as_rule() { | ||
_ => Node::BinOp { | ||
lhs: Box::new(lhs?), | ||
op: match op.as_rule() { | ||
Rule::add => BinaryOp::Add, | ||
Rule::sub => BinaryOp::Sub, | ||
Rule::mul => BinaryOp::Mul, | ||
Rule::div => BinaryOp::Div, | ||
Rule::pow => BinaryOp::Pow, | ||
Rule::paren => BinaryOp::Mul, | ||
|
||
_ => unreachable!(), | ||
}, | ||
rhs: Box::new(rhs?), | ||
}, | ||
}) | ||
}) | ||
.parse(pairs) | ||
} | ||
|
||
#[cfg(test)] | ||
mod tests { | ||
use super::*; | ||
macro_rules! test_parser { | ||
($($name:ident: $input:expr => $expected:expr),* $(,)?) => { | ||
$( | ||
#[test] | ||
fn $name() { | ||
let result = Node::from_str($input).unwrap(); | ||
assert_eq!(result, $expected); | ||
} | ||
)* | ||
}; | ||
} | ||
|
||
test_parser! { | ||
test_parse_int_literal: "42" => Node::Lit(Literal::Int(42)), | ||
test_parse_float_literal: "3.14" => Node::Lit(Literal::Float(3.14)), | ||
test_parse_ident: "x" => Node::Var("x".to_string()), | ||
test_parse_unary_neg: "-42" => Node::UnaryOp { | ||
val: Box::new(Node::Lit(Literal::Int(42))), | ||
op: UnaryOp::Neg, | ||
}, | ||
test_parse_binary_add: "1 + 2" => Node::BinOp { | ||
lhs: Box::new(Node::Lit(Literal::Int(1))), | ||
op: BinaryOp::Add, | ||
rhs: Box::new(Node::Lit(Literal::Int(2))), | ||
}, | ||
test_parse_binary_mul: "3 * 4" => Node::BinOp { | ||
lhs: Box::new(Node::Lit(Literal::Int(3))), | ||
op: BinaryOp::Mul, | ||
rhs: Box::new(Node::Lit(Literal::Int(4))), | ||
}, | ||
test_parse_binary_pow: "2 ^ 3" => Node::BinOp { | ||
lhs: Box::new(Node::Lit(Literal::Int(2))), | ||
op: BinaryOp::Pow, | ||
rhs: Box::new(Node::Lit(Literal::Int(3))), | ||
}, | ||
test_parse_unary_sqrt: "sqrt(16)" => Node::UnaryOp { | ||
val: Box::new(Node::Lit(Literal::Int(16))), | ||
op: UnaryOp::Sqrt, | ||
}, | ||
test_parse_sqr_ident: "sqr(16)" => Node::BinOp { | ||
|
||
lhs: Box::new(Node::Var("sqr".to_string())), | ||
op: BinaryOp::Mul, | ||
rhs: Box::new(Node::Lit(Literal::Int(16)) ) | ||
}, | ||
test_parse_global_var: "$variable_one1 - 11" => Node::BinOp { | ||
|
||
lhs: Box::new(Node::GlobalVar("variable_one1".to_string())), | ||
op: BinaryOp::Sub, | ||
rhs: Box::new(Node::Lit(Literal::Int(11)) ) | ||
}, | ||
test_parse_complex_expr: "(1 + 2) 3 - 4 ^ 2" => Node::BinOp { | ||
lhs: Box::new(Node::BinOp { | ||
lhs: Box::new(Node::BinOp { | ||
lhs: Box::new(Node::Lit(Literal::Int(1))), | ||
op: BinaryOp::Add, | ||
rhs: Box::new(Node::Lit(Literal::Int(2))), | ||
}), | ||
op: BinaryOp::Mul, | ||
rhs: Box::new(Node::Lit(Literal::Int(3))), | ||
}), | ||
op: BinaryOp::Sub, | ||
rhs: Box::new(Node::BinOp { | ||
lhs: Box::new(Node::Lit(Literal::Int(4))), | ||
op: BinaryOp::Pow, | ||
rhs: Box::new(Node::Lit(Literal::Int(2))), | ||
}), | ||
} | ||
} | ||
} |