|
| 1 | +// - i needed some help making the AST. i dont think i could've made ts by myself 😭 |
| 2 | + |
| 3 | +use std::iter::Peekable; |
| 4 | + |
| 5 | +use crate::{ |
| 6 | + errors::{ErrorReason, ParserError}, |
| 7 | + token::{Token, TokenKind, TokenValue}, |
| 8 | + traits::Round, |
| 9 | +}; |
| 10 | + |
| 11 | +#[allow(dead_code)] |
| 12 | +#[derive(Debug)] |
| 13 | +pub enum ASTNode { |
| 14 | + Number(f64), |
| 15 | + BinaryOp(Box<ASTNode>, TokenKind, Box<ASTNode>), |
| 16 | +} |
| 17 | + |
| 18 | +pub struct Parser<I: Iterator<Item = Token>> { |
| 19 | + tokens: Peekable<I>, |
| 20 | +} |
| 21 | + |
| 22 | +impl ASTNode { |
| 23 | + pub fn evaluate(&self) -> f64 { |
| 24 | + match self { |
| 25 | + ASTNode::Number(val) => *val, |
| 26 | + ASTNode::BinaryOp(left_node, op, right_node) => { |
| 27 | + let left = left_node.evaluate(); |
| 28 | + let right = right_node.evaluate(); |
| 29 | + match op { |
| 30 | + TokenKind::Plus => left + right, |
| 31 | + TokenKind::Minus => left - right, |
| 32 | + TokenKind::Multiply => left * right, |
| 33 | + TokenKind::Divide => left / right, |
| 34 | + TokenKind::Power => left.powf(right), |
| 35 | + _ => panic!("wrong operation i cbf making proper errors for this"), |
| 36 | + } |
| 37 | + .round_to(5) |
| 38 | + } |
| 39 | + } |
| 40 | + } |
| 41 | +} |
| 42 | + |
| 43 | +impl<I: Iterator<Item = Token>> Parser<I> { |
| 44 | + pub fn new(tokens: I) -> Self { |
| 45 | + Self { |
| 46 | + tokens: tokens.peekable(), |
| 47 | + } |
| 48 | + } |
| 49 | + |
| 50 | + fn advance(&mut self) -> Option<Token> { |
| 51 | + self.tokens.next() |
| 52 | + } |
| 53 | + |
| 54 | + fn peek(&mut self) -> Option<&Token> { |
| 55 | + self.tokens.peek() |
| 56 | + } |
| 57 | + |
| 58 | + pub fn parse_expr(&mut self) -> Result<ASTNode, ParserError> { |
| 59 | + let mut node = self.parse_term()?; |
| 60 | + |
| 61 | + while matches!( |
| 62 | + self.peek().map(|t| t.kind), |
| 63 | + Some(TokenKind::Plus) | Some(TokenKind::Minus) | Some(TokenKind::Power) |
| 64 | + ) { |
| 65 | + let operator = self.advance().unwrap().kind; |
| 66 | + let right = self.parse_term()?; |
| 67 | + node = ASTNode::BinaryOp(Box::new(node), operator, Box::new(right)); |
| 68 | + } |
| 69 | + |
| 70 | + Ok(node) |
| 71 | + } |
| 72 | + |
| 73 | + fn parse_term(&mut self) -> Result<ASTNode, ParserError> { |
| 74 | + let mut node = self.parse_factor()?; |
| 75 | + |
| 76 | + while matches!( |
| 77 | + self.peek().map(|t| t.kind), |
| 78 | + Some(TokenKind::Multiply) | Some(TokenKind::Divide) |
| 79 | + ) { |
| 80 | + let operator = self.advance().unwrap().kind; |
| 81 | + let right = self.parse_factor()?; |
| 82 | + node = ASTNode::BinaryOp(Box::new(node), operator, Box::new(right)); |
| 83 | + } |
| 84 | + |
| 85 | + Ok(node) |
| 86 | + } |
| 87 | + |
| 88 | + fn parse_factor(&mut self) -> Result<ASTNode, ParserError> { |
| 89 | + match self.peek().map(|t| t.kind) { |
| 90 | + Some(TokenKind::Number) => { |
| 91 | + let value = if let TokenValue::NumValue(val) = self.advance().unwrap().value { |
| 92 | + val |
| 93 | + } else { |
| 94 | + return Err(ParserError::new(ErrorReason::Error( |
| 95 | + "Expected a number".to_string(), |
| 96 | + ))); |
| 97 | + }; |
| 98 | + Ok(ASTNode::Number(value)) |
| 99 | + } |
| 100 | + Some(TokenKind::LParen) => { |
| 101 | + self.advance(); // Consume '(' |
| 102 | + let node = self.parse_expr()?; |
| 103 | + if self.peek().map(|t| t.kind) != Some(TokenKind::RParen) { |
| 104 | + return Err(ParserError::new(ErrorReason::Error( |
| 105 | + "Expected ')'".into(), |
| 106 | + ))); |
| 107 | + } |
| 108 | + self.advance(); // Consume ')' |
| 109 | + Ok(node) |
| 110 | + } |
| 111 | + _ => Err(ParserError::new(ErrorReason::Error(format!( |
| 112 | + "Unexpected token: {:?}", |
| 113 | + self.peek() |
| 114 | + )))), |
| 115 | + } |
| 116 | + } |
| 117 | +} |
0 commit comments