//! AbleScript Parser //! //! Type of this parser is recursive descent use logos::{Lexer, Logos}; use crate::ast::*; use crate::error::{Error, ErrorKind}; use crate::lexer::Token; use crate::variables::Value; /// Parser structure which holds lexer and metadata /// /// Make one using [`Parser::new`] function pub struct Parser<'source> { lexer: Lexer<'source, Token>, tdark: bool, } impl<'source> Parser<'source> { /// Create a new parser from source code pub fn new(source: &'source str) -> Self { Self { lexer: Token::lexer(source), tdark: false, } } /// Start parsing tokens /// /// Loops trough lexer, parses statements, returns AST pub fn init(&mut self) -> Result, Error> { let mut ast = vec![]; while let Some(token) = self.lexer.next() { match token { // Ignore comments Token::Comment => continue, // T-Dark block (replace `lang` with `script`) Token::TDark => { self.tdark = true; let mut block = self.get_block()?; ast.append(&mut block.block); self.tdark = false; } token => ast.push(self.parse(token)?), } } Ok(ast) } /// Parse a token /// /// This function will route to corresponding flow functions /// which may advance the lexer iterator fn parse(&mut self, token: Token) -> Result { let start = self.lexer.span().start; match token { Token::If => Ok(Stmt::new(self.if_flow()?, start..self.lexer.span().end)), Token::Functio => Ok(Stmt::new( self.functio_flow()?, start..self.lexer.span().end, )), Token::Var => Ok(Stmt::new(self.var_flow()?, start..self.lexer.span().end)), Token::Melo => Ok(Stmt::new(self.melo_flow()?, start..self.lexer.span().end)), Token::Loop => Ok(Stmt::new(self.loop_flow()?, start..self.lexer.span().end)), Token::Break => Ok(Stmt::new( self.semi_terminated(StmtKind::Break)?, start..self.lexer.span().end, )), Token::HopBack => Ok(Stmt::new( self.semi_terminated(StmtKind::HopBack)?, start..self.lexer.span().end, )), Token::Rlyeh => Ok(Stmt::new( self.semi_terminated(StmtKind::HopBack)?, start..self.lexer.span().end, )), Token::Identifier(_) | Token::Char | Token::String(_) | Token::Integer(_) | Token::Abool(_) | Token::Bool(_) | Token::LeftParen => Ok(Stmt::new( self.value_flow(token)?, start..self.lexer.span().end, )), t => Err(Error { kind: ErrorKind::UnexpectedToken(t), span: start..self.lexer.span().end, }), } } /// Require statement to be semicolon terminated /// /// Utility function for short statements fn semi_terminated(&mut self, stmt_kind: StmtKind) -> Result { self.require(Token::Semicolon)?; Ok(stmt_kind) } /// Require next item to be equal with expected one fn require(&mut self, expected: Token) -> Result<(), Error> { match self.lexer.next() { Some(t) if t == expected => Ok(()), Some(t) => Err(Error::new(ErrorKind::UnexpectedToken(t), self.lexer.span())), None => Err(Error::unexpected_eof()), } } /// Get an Identifier fn get_iden(&mut self) -> Result { match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::Identifier(iden) => Ok(Iden { iden: if self.tdark { iden.replace("lang", "script") } else { iden }, span: self.lexer.span(), }), t => Err(Error::new(ErrorKind::UnexpectedToken(t), self.lexer.span())), } } /// Parse an expression /// /// AbleScript strongly separates expressions from statements. /// Expressions do not have any side effects and the are /// only mathematial and logical operations or values. fn parse_expr(&mut self, token: Token, buf: &mut Option) -> Result { let start = self.lexer.span().start; match token { // Values Token::Identifier(i) => Ok(Expr::new( ExprKind::Variable(if self.tdark { i.replace("lang", "script") } else { i }), start..self.lexer.span().end, )), Token::Abool(a) => Ok(Expr::new( ExprKind::Literal(Value::Abool(a)), start..self.lexer.span().end, )), Token::Bool(b) => Ok(Expr::new( ExprKind::Literal(Value::Bool(b)), start..self.lexer.span().end, )), Token::Integer(i) => Ok(Expr::new( ExprKind::Literal(Value::Int(i)), start..self.lexer.span().end, )), Token::String(s) => Ok(Expr::new( ExprKind::Literal(Value::Str(if self.tdark { s.replace("lang", "script") } else { s })), start..self.lexer.span().end, )), Token::Nul => Ok(Expr::new( ExprKind::Literal(Value::Nul), start..self.lexer.span().end, )), // Operations Token::Plus | Token::Minus | Token::Star | Token::FwdSlash | Token::EqualEqual | Token::NotEqual | Token::LessThan | Token::GreaterThan | Token::And | Token::Or => Ok(Expr::new( self.binop_flow( BinOpKind::from_token(token).map_err(|e| Error::new(e, self.lexer.span()))?, buf, )?, start..self.lexer.span().end, )), Token::Not => Ok(Expr::new( { let next = self.lexer.next().ok_or(Error::unexpected_eof())?; ExprKind::Not(Box::new(self.parse_expr(next, buf)?)) }, start..self.lexer.span().end, )), Token::LeftParen => self.expr_flow(Token::RightParen), t => Err(Error::new( ErrorKind::UnexpectedToken(t), start..self.lexer.span().end, )), } } /// Flow for operators /// /// Generates operation from LHS buffer and next expression as RHS /// /// This is unaware of precedence, as AbleScript do not have it fn binop_flow(&mut self, kind: BinOpKind, lhs: &mut Option) -> Result { Ok(ExprKind::BinOp { lhs: Box::new( lhs.take() .ok_or(Error::new(ErrorKind::MissingLhs, self.lexer.span()))?, ), rhs: { let next = self.lexer.next().ok_or(Error::unexpected_eof())?; Box::new(self.parse_expr(next, &mut None)?) }, kind, }) } /// Parse expressions until terminate token fn expr_flow(&mut self, terminate: Token) -> Result { let mut buf = None; Ok(loop { match self.lexer.next().ok_or(Error::unexpected_eof())? { t if t == terminate => { break buf .take() .ok_or(Error::new(ErrorKind::UnexpectedToken(t), self.lexer.span()))? } t => buf = Some(self.parse_expr(t, &mut buf)?), } }) } /// Parse a list of statements between curly braces fn get_block(&mut self) -> Result { self.require(Token::LeftCurly)?; let mut block = vec![]; loop { match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::RightCurly => break, t => block.push(self.parse(t)?), } } Ok(Block { block }) } /// If Statement parser gets any kind of value (Identifier or Literal) /// It cannot parse it as it do not parse expressions. Instead of it it /// will parse it to function call or print statement. fn value_flow(&mut self, init: Token) -> Result { let mut buf = Some(self.parse_expr(init, &mut None)?); let r = loop { match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::Print => { break StmtKind::Print(buf.take().ok_or(Error::new( ErrorKind::UnexpectedToken(Token::Print), self.lexer.span(), ))?) } Token::LeftParen => { if let Some(Expr { kind: ExprKind::Variable(iden), span, }) = buf { break self.functio_call_flow(Iden::new(iden, span))?; } } t => buf = Some(self.parse_expr(t, &mut buf)?), } }; self.require(Token::Semicolon)?; Ok(r) } /// Parse If flow /// /// Consists of condition and block, there is no else fn if_flow(&mut self) -> Result { self.require(Token::LeftParen)?; let cond = self.expr_flow(Token::RightParen)?; let body = self.get_block()?; Ok(StmtKind::If { cond, body }) } /// Parse functio flow /// /// functio $iden (a, b, c) { ... } fn functio_flow(&mut self) -> Result { let iden = self.get_iden()?; self.require(Token::LeftParen)?; let mut args = vec![]; loop { match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::RightParen => break, Token::Identifier(i) => { args.push(Iden::new(i, self.lexer.span())); // Require comma (next) or right paren (end) after identifier match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::Comma => continue, Token::RightParen => break, t => { return Err(Error::new( ErrorKind::UnexpectedToken(t), self.lexer.span(), )) } } } t => return Err(Error::new(ErrorKind::UnexpectedToken(t), self.lexer.span())), } } let body = self.get_block()?; Ok(StmtKind::Functio { iden, args, body }) } /// Parse functio call flow fn functio_call_flow(&mut self, iden: Iden) -> Result { let mut args = vec![]; let mut buf = None; loop { match self.lexer.next().ok_or(Error::unexpected_eof())? { // End of argument list Token::RightParen => { if let Some(expr) = buf.take() { args.push(expr) } break; } // Next argument Token::Comma => match buf.take() { Some(expr) => args.push(expr), // Comma alone None => { return Err(Error::new( ErrorKind::UnexpectedToken(Token::Comma), self.lexer.span(), )) } }, t => buf = Some(self.parse_expr(t, &mut buf)?), } } Ok(StmtKind::Call { iden, args }) } /// Parse variable declaration fn var_flow(&mut self) -> Result { let iden = self.get_iden()?; let init = match self.lexer.next().ok_or(Error::unexpected_eof())? { Token::Equal => Some(self.expr_flow(Token::Semicolon)?), Token::Semicolon => None, t => return Err(Error::new(ErrorKind::UnexpectedToken(t), self.lexer.span())), }; Ok(StmtKind::Var { iden, init }) } /// Parse Melo flow fn melo_flow(&mut self) -> Result { let iden = self.get_iden()?; self.semi_terminated(StmtKind::Melo(iden)) } /// Parse loop flow /// /// `loop` is an infinite loop, no condition, only body fn loop_flow(&mut self) -> Result { Ok(StmtKind::Loop { body: self.get_block()?, }) } }