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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
use std::rc::Rc;
use std::borrow::Cow;
use std::collections::{HashSet, VecDeque, LinkedList};
use std::iter::FromIterator;
use std::vec;
use itertools::Itertools;
use crate::frontend::data::*;
use crate::frontend::ast::*;
pub fn to_unnormalized_backend_ir<'a>(children: Vec<Node<'a>>) -> Vec<Node<'a>> {
let mut results: Vec<Node> = Default::default();
for child in children {
let last = {
let mut valid_left_pos = None;
for ix in (0..results.len()).rev() {
let leftward = results
.get(ix)
.filter(|x| !x.is_whitespace());
if valid_left_pos.is_none() && leftward.is_some() {
valid_left_pos = Some(ix);
break;
}
}
if let Some(ix) = valid_left_pos {
results.get_mut(ix)
} else {
None
}
};
let last_is_ident = last.as_ref().map(|x| x.is_ident()).unwrap_or(false);
let last_is_tag = last.as_ref().map(|x| x.is_tag()).unwrap_or(false);
let new_child = match child {
Node::Tag(..) => unimplemented!(),
Node::Enclosure(node) if last_is_ident && node.data.is_square_parens() => {
let last = last.unwrap();
let mut name = last
.unwrap_ident()
.unwrap()
.clone();
let parameters = to_unnormalized_backend_ir(node.data.children);
let new_node = Node::Tag(Tag {
name: name.clone(),
parameters: Some(parameters),
children: Vec::new(),
rewrite_rules: Vec::new(),
});
*last = new_node;
None
}
Node::Enclosure(node) if last_is_ident && node.data.is_curly_brace() => {
let last = last.unwrap();
let mut name = last
.unwrap_ident()
.unwrap()
.clone();
let children = to_unnormalized_backend_ir(node.data.children);
let new_node = Node::Tag(Tag {
name,
parameters: None,
children: vec![
Node::unannotated_enclosure(
EnclosureKind::CurlyBrace,
children,
)
],
rewrite_rules: Vec::new(),
});
*last = new_node;
None
}
Node::Enclosure(node) if last_is_tag && node.data.is_curly_brace() => {
let tag = last.unwrap();
let children = to_unnormalized_backend_ir(node.data.children);
tag.unwrap_tag_mut()
.unwrap()
.children
.push(Node::unannotated_enclosure(
EnclosureKind::CurlyBrace,
children,
));
None
}
Node::Enclosure(node) => {
let children = to_unnormalized_backend_ir(node.data.children);
let new_node = Node::unannotated_enclosure(
node.data.kind,
children,
);
Some(new_node)
}
Node::Ident(node) => {
let new_node = Node::Ident(node);
Some(new_node)
}
Node::InvalidToken(node) => {
let new_node = Node::String(node);
Some(new_node)
}
Node::String(node) => {
let mut is_token = false;
for sym in TOKEN_SET {
if *sym == &node.data {
is_token = true;
break;
}
}
if is_token {
Some(Node::String(node))
} else {
Some(Node::String(node))
}
}
};
if let Some(new_child) = new_child {
results.push(new_child);
}
}
results
}
fn into_rewrite_rules<'a>(
children: Vec<Node<'a>>
) -> Vec<RewriteRule<Node<'a>>> {
let mut results = Vec::new();
for ix in 0..children.len() {
if ix == 0 {
continue;
}
let left = children.get(ix - 1);
let current = children
.get(ix)
.and_then(|x| x.unwrap_string())
.filter(|x| &x.data == "=>");
let right = children.get(ix + 1);
match (left, current, right) {
(Some(left), Some(_), Some(right)) => {
results.push(RewriteRule {
from: left.clone(),
to: right.clone(),
})
}
_ => ()
}
}
results
}
pub fn block_level_normalize<'a>(children: Vec<Node<'a>>) -> Vec<Node<'a>> {
let mut results = Vec::new();
for child in children {
if child.is_named_block("!where") {
let child = child.into_tag().unwrap();
let last = results
.last_mut()
.and_then(Node::unwrap_tag_mut);
if let Some(last) = last {
let rewrite_rule = into_rewrite_rules(
child.children,
);
last.rewrite_rules.extend(rewrite_rule);
continue;
}
} else {
results.push(child);
}
}
results
}
pub fn parameter_level_normalize_pass(node: Node) -> Node {
fn go(parameters: Vec<Node>) -> Vec<Node> {
parameters
.iter()
.filter_map(Node::get_string)
.map(|x| x.data)
.collect::<Vec<_>>()
.join("")
.split_whitespace()
.map(ToOwned::to_owned)
.map(|x| Node::String(Ann::unannotated(Cow::Owned(x))))
.collect::<Vec<_>>()
}
match node {
Node::Tag(mut tag) => {
tag.parameters = tag.parameters.map(go);
Node::Tag(tag)
}
x => x
}
}
pub fn run_compiler_frontend<'a>(source: &'a str) -> Vec<Node<'a>> {
let children = crate::frontend::parser::parse_source(source);
let children = to_unnormalized_backend_ir(children);
let node = Node::new_fragment(children)
.transform_children(Rc::new(block_level_normalize))
.transform(
NodeEnvironment::default(),
Rc::new(|_, x| parameter_level_normalize_pass(x))
);
node.into_fragment()
}