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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
use std::{collections::hash_map::HashMap, hash::Hash};
use cfgrammar::{yacc::YaccGrammar, Symbol, TIdx};
use num_traits::{AsPrimitive, PrimInt, Unsigned};
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};
use try_from::TryFrom;
use crate::{itemset::Itemset, StIdx, StIdxStorageT};
#[derive(Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct StateGraph<StorageT: Eq + Hash> {
states: Vec<(Itemset<StorageT>, Itemset<StorageT>)>,
edges: Vec<HashMap<Symbol<StorageT>, StIdx>>
}
impl<StorageT: 'static + Hash + PrimInt + Unsigned> StateGraph<StorageT>
where
usize: AsPrimitive<StorageT>
{
pub(crate) fn new(
states: Vec<(Itemset<StorageT>, Itemset<StorageT>)>,
edges: Vec<HashMap<Symbol<StorageT>, StIdx>>
) -> Self {
assert!(StIdxStorageT::try_from(states.len()).is_ok());
StateGraph { states, edges }
}
pub fn iter_stidxs(&self) -> Box<dyn Iterator<Item = StIdx>> {
Box::new((0..self.states.len()).map(|x| StIdx(x as StIdxStorageT)))
}
pub fn closed_state(&self, stidx: StIdx) -> &Itemset<StorageT> {
&self.states[usize::from(stidx)].1
}
pub fn iter_closed_states<'a>(
&'a self
) -> Box<dyn Iterator<Item = &'a Itemset<StorageT>> + 'a> {
Box::new(self.states.iter().map(|x| &x.1))
}
pub fn core_state(&self, stidx: StIdx) -> &Itemset<StorageT> {
&self.states[usize::from(stidx)].0
}
pub fn iter_core_states<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Itemset<StorageT>> + 'a> {
Box::new(self.states.iter().map(|x| &x.0))
}
pub fn all_states_len(&self) -> StIdx {
StIdx::from(self.states.len() as StIdxStorageT)
}
pub fn edge(&self, stidx: StIdx, sym: Symbol<StorageT>) -> Option<StIdx> {
self.edges
.get(usize::from(stidx))
.and_then(|x| x.get(&sym))
.cloned()
}
pub fn edges(&self, stidx: StIdx) -> &HashMap<Symbol<StorageT>, StIdx> {
&self.edges[usize::from(stidx)]
}
pub fn all_edges_len(&self) -> usize {
self.edges.iter().fold(0, |a, x| a + x.len())
}
pub fn pp(&self, grm: &YaccGrammar<StorageT>, core_states: bool) -> String {
fn num_digits(i: StIdx) -> usize {
if usize::from(i) == 0 {
1
} else {
((usize::from(i) as f64).log10() as usize) + 1
}
}
fn fmt_sym<StorageT: 'static + PrimInt + Unsigned>(
grm: &YaccGrammar<StorageT>,
sym: Symbol<StorageT>
) -> String
where
usize: AsPrimitive<StorageT>
{
match sym {
Symbol::Rule(ridx) => grm.rule_name(ridx).to_string(),
Symbol::Token(tidx) => format!("'{}'", grm.token_name(tidx).unwrap_or(""))
}
}
let mut o = String::new();
for (stidx, &(ref core_st, ref closed_st)) in self.iter_stidxs().zip(self.states.iter()) {
if StIdxStorageT::from(stidx) > 0 {
o.push_str(&"\n");
}
{
let padding = num_digits(self.all_states_len()) - num_digits(stidx);
o.push_str(&format!(
"{}:{}",
StIdxStorageT::from(stidx),
" ".repeat(padding)
));
}
let st = if core_states { core_st } else { closed_st };
for (i, (&(pidx, sidx), ref ctx)) in st.items.iter().enumerate() {
let padding = if i == 0 {
0
} else {
o.push_str("\n ");
num_digits(self.all_states_len())
};
o.push_str(&format!(
"{} [{} ->",
" ".repeat(padding),
grm.rule_name(grm.prod_to_rule(pidx))
));
for (i_sidx, i_ssym) in grm.prod(pidx).iter().enumerate() {
if i_sidx == usize::from(sidx) {
o.push_str(" .");
}
o.push_str(&format!(" {}", fmt_sym(&grm, *i_ssym)));
}
if usize::from(sidx) == grm.prod(pidx).len() {
o.push_str(" .");
}
o.push_str(", {");
let mut seen_b = false;
for bidx in ctx.iter_set_bits(..) {
if seen_b {
o.push_str(", ");
} else {
seen_b = true;
}
let tidx = TIdx(bidx.as_());
if tidx == grm.eof_token_idx() {
o.push_str("'$'");
} else {
o.push_str(&format!("'{}'", grm.token_name(tidx).unwrap()));
}
}
o.push_str("}]");
}
for (esym, e_stidx) in self.edges(stidx).iter() {
o.push_str(&format!(
"\n{}{} -> {}",
" ".repeat(num_digits(self.all_states_len()) + 2),
fmt_sym(&grm, *esym),
usize::from(*e_stidx)
));
}
}
o
}
pub fn pp_core_states(&self, grm: &YaccGrammar<StorageT>) -> String {
self.pp(grm, true)
}
pub fn pp_closed_states(&self, grm: &YaccGrammar<StorageT>) -> String {
self.pp(grm, false)
}
}
#[cfg(test)]
use cfgrammar::SIdx;
#[cfg(test)]
pub fn state_exists<StorageT: 'static + Hash + PrimInt + Unsigned>(
grm: &YaccGrammar<StorageT>,
is: &Itemset<StorageT>,
nt: &str,
prod_off: usize,
dot: SIdx<StorageT>,
la: Vec<&str>
) where
usize: AsPrimitive<StorageT>
{
let ab_prod_off = grm.rule_to_prods(grm.rule_idx(nt).unwrap())[prod_off];
let ctx = &is.items[&(ab_prod_off, dot)];
for tidx in grm.iter_tidxs() {
let bit = ctx[usize::from(tidx)];
let mut found = false;
for t in la.iter() {
let off = if t == &"$" {
grm.eof_token_idx()
} else {
grm.token_idx(t).unwrap()
};
if off == tidx {
if !bit {
panic!("bit for token {}, dot {} is not set in production {} of {} when it should be",
t, usize::from(dot), prod_off, nt);
}
found = true;
break;
}
}
if !found && bit {
panic!(
"bit for token {}, dot {} is set in production {} of {} when it shouldn't be",
grm.token_name(tidx).unwrap(),
usize::from(dot),
prod_off,
nt
);
}
}
}
#[cfg(test)]
mod test {
use crate::{pager::pager_stategraph, StIdx};
use cfgrammar::{
yacc::{YaccGrammar, YaccKind, YaccOriginalActionKind},
Symbol
};
#[test]
#[rustfmt::skip]
fn test_statetable_core() {
let grm = YaccGrammar::new(
YaccKind::Original(YaccOriginalActionKind::GenericParseTree),
&"
%start A
%%
A: 'OPEN_BRACKET' A 'CLOSE_BRACKET'
| 'a'
| 'b';
"
).unwrap();
let sg = pager_stategraph(&grm);
assert_eq!(sg.all_states_len(), StIdx(7));
assert_eq!(sg.states.iter().fold(0, |a, x| a + x.0.items.len()), 7);
assert_eq!(sg.all_edges_len(), 9);
let s0 = StIdx(0);
sg.edge(s0, Symbol::Rule(grm.rule_idx("A").unwrap())).unwrap();
let s2 = sg.edge(s0, Symbol::Token(grm.token_idx("a").unwrap())).unwrap();
let s3 = sg.edge(s0, Symbol::Token(grm.token_idx("b").unwrap())).unwrap();
let s5 = sg.edge(s0, Symbol::Token(grm.token_idx("OPEN_BRACKET").unwrap())).unwrap();
assert_eq!(s2, sg.edge(s5, Symbol::Token(grm.token_idx("a").unwrap())).unwrap());
assert_eq!(s3, sg.edge(s5, Symbol::Token(grm.token_idx("b").unwrap())).unwrap());
assert_eq!(s5, sg.edge(s5, Symbol::Token(grm.token_idx("OPEN_BRACKET").unwrap())).unwrap());
let s4 = sg.edge(s5, Symbol::Rule(grm.rule_idx("A").unwrap())).unwrap();
sg.edge(s4, Symbol::Token(grm.token_idx("CLOSE_BRACKET").unwrap())).unwrap();
}
}