-
Notifications
You must be signed in to change notification settings - Fork 2
/
math.rs
152 lines (125 loc) · 3.54 KB
/
math.rs
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
//! Example converted from https://github.com/rust-analyzer/rowan/blob/master/examples/math.rs
use anyhow::Result;
use std::iter::Peekable;
use syntree::{print, Builder, Error, Tree};
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
#[allow(non_camel_case_types)]
enum Syntax {
Add,
Sub,
Mul,
Div,
Whitespace,
Number,
Error,
Operation,
Root,
}
use Syntax::*;
struct Parser<Iter>
where
Iter: Iterator<Item = (Syntax, usize)>,
{
builder: Builder<Syntax, u32, usize>,
iter: Peekable<Iter>,
}
impl<Iter> Parser<Iter>
where
Iter: Iterator<Item = (Syntax, usize)>,
{
fn peek(&mut self) -> Result<Option<Syntax>, Error> {
while self.iter.peek().map_or(false, |&(t, _)| t == Whitespace) {
self.bump()?;
}
Ok(self.iter.peek().map(|&(t, _)| t))
}
fn bump(&mut self) -> Result<(), Error> {
if let Some((token, len)) = self.iter.next() {
self.builder.token(token, len)?;
}
Ok(())
}
fn parse_val(&mut self) -> Result<(), Error> {
match self.peek()? {
Some(Number) => {
self.bump()?;
}
_ => {
self.builder.open(Error)?;
self.bump()?;
self.builder.close()?;
}
}
Ok(())
}
fn handle_operation(
&mut self,
tokens: &[Syntax],
next: fn(&mut Self) -> Result<(), Error>,
) -> Result<(), Error> {
let c = self.builder.checkpoint()?;
next(self)?;
while self.peek()?.map_or(false, |t| tokens.contains(&t)) {
self.bump()?;
next(self)?;
self.builder.close_at(&c, Operation)?;
}
Ok(())
}
fn parse_mul(&mut self) -> Result<(), Error> {
self.handle_operation(&[Mul, Div], Self::parse_val)
}
fn parse_add(&mut self) -> Result<(), Error> {
self.handle_operation(&[Add, Sub], Self::parse_mul)
}
fn parse(mut self) -> Result<Tree<Syntax, u32, usize>, Error> {
self.builder.open(Root)?;
self.parse_add()?;
self.builder.close()?;
self.builder.build()
}
}
fn lexer(source: &str) -> impl Iterator<Item = (Syntax, usize)> + '_ {
let mut it = source.char_indices().peekable();
let len = source.len();
return std::iter::from_fn(move || {
let (start, c) = it.next()?;
let syntax = match c {
c if c.is_whitespace() => {
eat(&mut it, char::is_whitespace);
Whitespace
}
'+' => Add,
'-' => Sub,
'/' => Div,
'*' => Mul,
'0'..='9' => {
eat(&mut it, |c| matches!(c, '0'..='9' | '.'));
Number
}
_ => {
eat(&mut it, |c| !c.is_whitespace());
Error
}
};
let end = it.peek().map_or(len, |(n, _)| *n);
Some((syntax, end.saturating_sub(start)))
});
/// Consume all available whitespace.
fn eat(it: &mut Peekable<impl Iterator<Item = (usize, char)>>, cond: fn(char) -> bool) {
while it.peek().filter(|&(_, c)| cond(*c)).is_some() {
it.next();
}
}
}
fn main() -> Result<()> {
let source = std::env::args().skip(1).collect::<String>();
let iter = lexer(&source);
let parser = Parser {
builder: Builder::new(),
iter: iter.peekable(),
};
let tree = parser.parse()?;
print::print_with_source(std::io::stdout(), &tree, &source)?;
Ok(())
}