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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
mod identifier_parselet;
mod literal_parselet;
mod assignment_parselet;
mod binop_parselet;
mod paren_parselet;
mod matrix_parselet;
mod func_parselet;
use std::collections::HashMap;
use crate::{
Expression,
Token,
TokenClass,
Tokenizer,
};
use identifier_parselet::IdentifierParselet;
use literal_parselet::LiteralParselet;
use assignment_parselet::AssignmentParselet;
use binop_parselet::BinOpParselet;
use paren_parselet::ParenParselet;
use matrix_parselet::MatrixParselet;
use func_parselet::FuncParselet;
impl From<TokenClass> for u8 {
fn from(t: TokenClass) -> u8 {
match t {
TokenClass::Assignment => 1,
TokenClass::Plus => 3,
TokenClass::Minus => 3,
TokenClass::Multiply => 4,
TokenClass::Divide => 4,
TokenClass::OpenParen => 5,
TokenClass::OpenBracket => 6,
_ => 0,
}
}
}
pub trait PrefixParselet {
fn parse(&self, parser: &Parser, tokenizer: &mut Tokenizer, token: Token) -> Expression;
}
pub trait InfixParselet {
fn parse(&self, parser: &Parser, tokenizer: &mut Tokenizer, token: Token, left: Expression) -> Expression;
}
pub struct Parser {
prefix_parselets: HashMap<TokenClass, Box<dyn PrefixParselet>>,
infix_parselets: HashMap<TokenClass, Box<dyn InfixParselet>>,
}
impl Parser {
pub fn new() -> Self {
let mut prefix_parselets: HashMap<TokenClass, Box<dyn PrefixParselet>> = HashMap::new();
let mut infix_parselets: HashMap<TokenClass, Box<dyn InfixParselet>> = HashMap::new();
prefix_parselets.insert(TokenClass::Identifier, Box::new(IdentifierParselet {}));
prefix_parselets.insert(TokenClass::Int, Box::new(LiteralParselet {}));
prefix_parselets.insert(TokenClass::Float, Box::new(LiteralParselet {}));
prefix_parselets.insert(TokenClass::OpenParen, Box::new(ParenParselet {}));
prefix_parselets.insert(TokenClass::OpenBracket, Box::new(MatrixParselet {}));
infix_parselets.insert(TokenClass::Assignment, Box::new(AssignmentParselet {}));
infix_parselets.insert(TokenClass::Plus, Box::new(BinOpParselet {}));
infix_parselets.insert(TokenClass::Minus, Box::new(BinOpParselet {}));
infix_parselets.insert(TokenClass::Multiply, Box::new(BinOpParselet {}));
infix_parselets.insert(TokenClass::Divide, Box::new(BinOpParselet {}));
infix_parselets.insert(TokenClass::OpenParen, Box::new(FuncParselet {}));
Self {
prefix_parselets,
infix_parselets,
}
}
pub fn parse(&self, tokenizer: &mut Tokenizer, precedence: u8) -> Expression {
let token = match tokenizer.next() {
Some(t) => t,
None => return Expression::Nil,
};
let parselet: &Box<dyn PrefixParselet> = match self.prefix_parselets.get(&token.get_class()) {
Some(p) => p,
None => return Expression::Nil,
};
let mut left = parselet.parse(self, tokenizer, token);
while precedence < tokenizer.get_next_precedence() {
let next = match tokenizer.peek() {
Some(t) => t,
None => break,
};
let parselet: &Box<dyn InfixParselet> = match self.infix_parselets.get(&next.get_class()) {
Some(p) => p,
None => break,
};
tokenizer.next();
left = parselet.parse(self, tokenizer, next, left);
}
left
}
}