1
1
Fork 0
mirror of https://github.com/azur1s/bobbylisp.git synced 2024-09-28 07:27:35 +00:00

call stmt in root

This commit is contained in:
Natapat Samutpong 2022-02-12 18:29:10 +07:00
parent b455c661a0
commit 826092c54b
4 changed files with 95 additions and 54 deletions

View file

@ -1,5 +1,4 @@
let foo :: String = "foo"; func join :: (a, b) = {
let bar :: String = "bar"; let result :: String = from(a, b);
func join :: (a , b) = {
let baz :: String = "yay";
}; };
let foo :: String = join("f", "oo");

View file

@ -102,6 +102,7 @@ pub type Program = Vec<Stmt>;
pub enum Stmt { pub enum Stmt {
Let(Ident, Ident, Expr), Let(Ident, Ident, Expr),
Func(Ident, Vec<Ident>, Vec<Stmt>), Func(Ident, Vec<Ident>, Vec<Stmt>),
Call(Ident, Vec<Expr>),
} }
#[derive(Clone, Debug, PartialEq)] #[derive(Clone, Debug, PartialEq)]

View file

@ -1,8 +1,12 @@
use nom::{ use nom::{
branch::alt,
bytes::complete::take, bytes::complete::take,
combinator::{verify, map}, combinator::{verify, map},
Err, Err,
IResult, sequence::{terminated, tuple, pair, preceded, delimited}, multi::many0, branch::alt, error::{Error, ErrorKind}, error::{Error, ErrorKind},
IResult,
multi::many0,
sequence::{terminated, tuple, pair, preceded, delimited},
}; };
use super::model::{Token, Tokens, Precedence, Infix, Program, Stmt, Expr, Ident, Literal}; use super::model::{Token, Tokens, Precedence, Infix, Program, Stmt, Expr, Ident, Literal};
@ -83,21 +87,6 @@ fn parse_ident_expr(input: Tokens) -> IResult<Tokens, Expr> {
map(parse_ident, Expr::Ident)(input) map(parse_ident, Expr::Ident)(input)
} }
fn parse_let_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
map(
tuple((
tag_let,
parse_ident,
tag_typehint,
parse_ident,
tag_assign,
parse_expr_lowest,
tag_semicolon,
)),
|(_, ident, _, typehint, _, expr, _)| Stmt::Let(ident, typehint, expr),
)(input)
}
fn parse_params(input: Tokens) -> IResult<Tokens, Vec<Ident>> { fn parse_params(input: Tokens) -> IResult<Tokens, Vec<Ident>> {
map( map(
pair(parse_ident, many0(preceded(tag_comma, parse_ident))), pair(parse_ident, many0(preceded(tag_comma, parse_ident))),
@ -107,6 +96,75 @@ fn parse_params(input: Tokens) -> IResult<Tokens, Vec<Ident>> {
fn empty_params(input: Tokens) -> IResult<Tokens, Vec<Ident>> { Ok((input, vec![])) } fn empty_params(input: Tokens) -> IResult<Tokens, Vec<Ident>> { Ok((input, vec![])) }
fn parse_call_expr(input: Tokens, func_handle: Expr) -> IResult<Tokens, Expr> {
map(
delimited(
tag_lparen,
parse_exprs,
tag_rparen,
),
|e| Expr::Call { func: Box::new(func_handle.clone()), args: e },
)(input)
}
fn parse_expr(input: Tokens, precedence: Precedence, left: Expr) -> IResult<Tokens, Expr> {
let (i1, t1) = take(1usize)(input)?;
if t1.tokens.is_empty() { Ok((i1, left)) }
else {
let p = infix_operator(&t1.tokens[0]);
match p {
(Precedence::Call, _) if precedence < Precedence::Call => {
let (i2, left2) = parse_call_expr(input, left)?;
parse_expr(i2, precedence, left2)
},
(ref peek, _) if precedence < *peek => {
// let (i2, left2) = parse_infix_expr(input, left)?;
// parse_expr(i2, precedence, left2)
todo!()
},
_ => Ok((input, left)),
}
}
}
fn parse_comma_exprs(input: Tokens) -> IResult<Tokens, Expr> {
preceded(tag_comma, parse_expr_lowest)(input)
}
fn parse_exprs(input: Tokens) -> IResult<Tokens, Vec<Expr>> {
map(
pair(parse_expr_lowest, many0(parse_comma_exprs)),
|(first, second)| [&vec![first][..], &second[..]].concat(),
)(input)
}
fn parse_expr_with(input: Tokens, precedence: Precedence) -> IResult<Tokens, Expr> {
let (i1, left) = parse_atom_expr(input)?;
parse_expr(i1, precedence, left)
}
fn parse_expr_lowest(input: Tokens) -> IResult<Tokens, Expr> {
parse_expr_with(input, Precedence::Lowest)
}
fn parse_call_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
map(
tuple((
parse_ident,
tag_lparen,
parse_exprs,
tag_rparen,
tag_semicolon,
)),
|(ident, _, args, _, _)| Stmt::Call(ident, args),
)(input)
}
fn parse_block_stmt(input: Tokens) -> IResult<Tokens, Program> {
delimited(tag_lbrace, many0(parse_stmt), tag_rbrace)(input)
}
fn parse_func_stmt(input: Tokens) -> IResult<Tokens, Stmt> { fn parse_func_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
map( map(
tuple(( tuple((
@ -124,45 +182,26 @@ fn parse_func_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
)(input) )(input)
} }
fn parse_expr(input: Tokens, precedence: Precedence, left: Expr) -> IResult<Tokens, Expr> { fn parse_let_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
let (i1, t1) = take(1usize)(input)?; map(
tuple((
if t1.tokens.is_empty() { Ok((i1, left)) } tag_let,
else { parse_ident,
let p = infix_operator(&t1.tokens[0]); tag_typehint,
match p { parse_ident,
(Precedence::Call, _) if precedence < Precedence::Call => { tag_assign,
// let (i2, left2) = parse_call_expr(input, left)?; parse_expr_lowest,
// parse_expr(i2, precedence, left2) tag_semicolon,
todo!() )),
}, |(_, ident, _, typehint, _, expr, _)| Stmt::Let(ident, typehint, expr),
(ref peek, _) if precedence < *peek => { )(input)
// let (i2, left2) = parse_infix_expr(input, left)?;
// parse_expr(i2, precedence, left2)
todo!()
},
_ => Ok((input, left)),
}
}
}
fn parse_expr_with(input: Tokens, precedence: Precedence) -> IResult<Tokens, Expr> {
let (i1, left) = parse_atom_expr(input)?;
parse_expr(i1, precedence, left)
}
fn parse_expr_lowest(input: Tokens) -> IResult<Tokens, Expr> {
parse_expr_with(input, Precedence::Lowest)
}
fn parse_block_stmt(input: Tokens) -> IResult<Tokens, Program> {
delimited(tag_lbrace, many0(parse_stmt), tag_rbrace)(input)
} }
fn parse_stmt(input: Tokens) -> IResult<Tokens, Stmt> { fn parse_stmt(input: Tokens) -> IResult<Tokens, Stmt> {
alt(( alt((
parse_let_stmt, parse_let_stmt,
parse_func_stmt, parse_func_stmt,
parse_call_stmt,
))(input) ))(input)
} }

View file

@ -6,6 +6,8 @@ use clap::Parser as ArgParser;
pub mod args; pub mod args;
use args::{Args, Options}; use args::{Args, Options};
/// Front-end of the language.
/// Contains lexer, parser and token types.
pub mod front; pub mod front;
use front::{lex::Lexer, parser::Parser, model::Tokens}; use front::{lex::Lexer, parser::Parser, model::Tokens};