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
#![deny(warnings)]
use crate::grammar::{Rule, Grammar};
use crate::items::Item;
use std::collections::HashSet;
use std::rc::Rc;
use std::fmt::Debug;
pub struct EarleyParser {
pub grammar: Grammar,
}
#[derive(Debug)]
pub struct ParseTrees(pub Vec<Rc<Item>>);
impl EarleyParser {
pub fn new(grammar: Grammar) -> EarleyParser {
EarleyParser{grammar}
}
fn predictions<'r>(
rules: impl Iterator<Item=&'r Rc<Rule>> + 'r,
next_terminal: &'r str,
start_pos: usize,
) -> Box<dyn Iterator<Item=Item> + 'r>
{
Box::new(rules.filter(move |rule| rule.head == next_terminal)
.map(move |rule| Item::predict_new(&rule, start_pos)))
}
fn completions<'r>(
starting_stateset: impl Iterator<Item=&'r Rc<Item>> + 'r,
trigger: &'r Rc<Item>,
complete_pos: usize,
) -> Box<dyn Iterator<Item=Item> + 'r>
{
assert!(trigger.complete(), "Incomplete `trigger` used for completions");
Box::new(starting_stateset.filter(move |item| {
item.next_symbol().and_then(
|s| s.nonterm()) == Some(trigger.rule.head.as_ref())
}).map(move |item| Item::complete_new(item, trigger, complete_pos)))
}
fn scans<'r>(
current_stateset: impl Iterator<Item=&'r Rc<Item>> + 'r,
lexeme: &'r str,
end: usize,
) -> impl Iterator<Item=Rc<Item>> + 'r
{
current_stateset.filter(move |item| {
let next_sym_term = item.next_symbol().and_then(|s| s.terminal());
next_sym_term.map(|(_, matcher)| matcher(lexeme)) == Some(true)
}).map(move |item| Rc::new(Item::scan_new(item, end, lexeme)))
}
pub fn parse<T>(&self, mut tokenizer: T) -> Result<ParseTrees, String>
where T: Iterator, T::Item: Debug + AsRef<str> {
let s0: HashSet<_> = self.grammar.rules.iter()
.filter(|rule| rule.head == self.grammar.start)
.map(|rule| Rc::new(Item::predict_new(&rule, 0)))
.collect();
let mut statesets = vec![s0];
for idx in 0.. {
loop {
let new_items: Vec<_> = statesets[idx].iter().flat_map(|trigger| {
let next_sym = trigger.next_symbol();
if let Some(next_terminal) = next_sym.and_then(|s| s.nonterm()) {
EarleyParser::predictions(self.grammar.rules.iter(), next_terminal, idx)
} else if trigger.complete() {
assert!(next_sym.is_none(), "Expected next symbol to be None");
EarleyParser::completions(statesets[trigger.start].iter(), trigger, idx)
} else {
assert!(next_sym.and_then(|s| s.terminal()).is_some());
Box::new(std::iter::empty())
}
}).collect();
let stateset = statesets.get_mut(idx).unwrap();
let prev_len = stateset.len();
for new_item in new_items {
if let Some(existent) = stateset.get(&new_item) {
existent.merge_sources(new_item);
} else {
stateset.insert(Rc::new(new_item));
}
}
if prev_len == stateset.len() {
break;
}
}
if let Some(lexeme) = tokenizer.next() {
statesets.push(EarleyParser::scans(
statesets[idx].iter(), lexeme.as_ref(), idx + 1).collect());
} else {
break;
}
}
if cfg!(feature="debug") {
for (idx, stateset) in statesets.iter().enumerate() {
eprintln!("=== StateSet {} ===", idx);
stateset.iter().inspect(|item| {
let src = item.sources().iter()
.map(|(s, t)| format!("Src({:?}) + {:?}", s, t))
.collect::<Vec<_>>().join(", ");
eprintln!("{:?} -- SRC: {}", item, src);
}).count();
}
}
let parse_trees: Vec<_> = statesets.pop()
.expect("No Statesets (even s0)")
.iter()
.filter(|item| item.start == 0 && item.complete() &&
item.rule.head == self.grammar.start)
.cloned()
.collect();
if parse_trees.is_empty() {
return Err("Parse Error: No Rule completes".to_string());
}
Ok(ParseTrees(parse_trees))
}
}