1#[cfg(any())]
4use std::collections::HashMap;
5use crate::{NameFixer, indent_source};
6use crate::fixed_sym_table::{FixedSymTable, SymInfoTable};
7use crate::{TokenId, VarId};
8use crate::parser::Symbol;
9#[cfg(test)]
10use lexigram_core::CollectJoin;
11
12#[derive(Clone, Debug)]
59pub struct SymbolTable {
60 t: Vec<(String, Option<String>)>, fixer_t: NameFixer, nt: Vec<String>, #[cfg(any())]
64 names: HashMap<String, VarId>, fixer_nt: NameFixer, }
67
68impl SymbolTable {
69 pub fn new() -> Self {
70 SymbolTable {
71 t: Vec::new(),
72 fixer_t: NameFixer::new_empty(),
73 nt: Vec::new(),
74 #[cfg(any())]
75 names: HashMap::new(),
76 fixer_nt: NameFixer::new_empty(),
77 }
78 }
79
80 pub fn to_fixed_sym_table(self) -> FixedSymTable {
81 FixedSymTable::new(self.t, self.nt)
82 }
83
84 pub fn add_terminal<T: Into<String>>(&mut self, name: T, value_maybe: Option<T>) -> TokenId {
87 let token = self.t.len();
88 assert!(token < TokenId::MAX as usize);
89 let unique_name = self.fixer_t.get_unique_name(name.into());
90 self.t.push((unique_name, value_maybe.map(|n| n.into())));
91 token as TokenId
92 }
93
94 pub fn extend_terminals<I: IntoIterator<Item=(T, Option<T>)>, T: Into<String>>(&mut self, terminals: I) {
95 for (s, maybe) in terminals {
96 self.add_terminal(s, maybe);
97 }
98 }
99
100 pub fn get_terminals(&self) -> impl Iterator<Item = &(String, Option<String>)> {
101 self.t.iter()
102 }
103
104 pub fn get_num_t(&self) -> usize {
105 self.t.len()
106 }
107
108 pub fn set_t_value(&mut self, token: TokenId, name_maybe: Option<String>) {
109 self.t[token as usize].1 = name_maybe
110 }
111
112 pub fn downsize_num_t(&mut self, num_t: usize) {
113 if num_t < self.t.len() {
114 for (name, _) in &mut self.t[num_t..] {
115 self.fixer_t.remove(name);
116 }
117 self.t.resize(num_t, (String::new(), None));
118 }
119 }
120
121 fn add_nt(&mut self, unique_name: String) -> VarId {
124 let var = self.nt.len();
125 assert!(var < VarId::MAX as usize);
126 #[cfg(any())]
127 self.names.insert(unique_name.clone(), var as VarId);
128 self.nt.push(unique_name);
129 var as VarId
130 }
131
132 pub fn add_nonterminal<T: Into<String>>(&mut self, name: T) -> VarId {
133 let unique_name = self.fixer_nt.get_unique_name(name.into());
134 self.add_nt(unique_name)
135 }
136
137 pub fn add_child_nonterminal(&mut self, var: VarId) -> VarId {
138 let unique_name = self.fixer_nt.get_unique_name_unum(self.nt[var as usize].clone());
139 self.add_nt(unique_name)
140 }
141
142 pub fn extend_nonterminals<I: IntoIterator<Item=T>, T: Into<String>>(&mut self, nonterminals: I) {
143 for s in nonterminals {
144 self.add_nonterminal(s);
145 }
146 }
147
148 #[cfg(any())]
149 pub fn find_nonterminal(&self, name: &str) -> Option<VarId> {
150 self.names.get(name).cloned()
151 }
152
153 pub fn get_nonterminals(&self) -> impl Iterator<Item = &String> {
154 self.nt.iter()
155 }
156
157 pub fn get_num_nt(&self) -> usize {
158 self.nt.len()
159 }
160
161 pub fn remove_nonterminal(&mut self, v: VarId) {
162 let name = self.nt.remove(v as usize);
163 #[cfg(any())]
164 {
165 for old_v in self.names.values_mut() {
166 if *old_v >= v { *old_v -= 1; }
167 }
168 self.names.remove(&name);
169 }
170 self.fixer_nt.remove(&name);
171 }
172
173 pub fn set_nt_name(&mut self, var: VarId, name: String) {
174 self.nt[var as usize] = name;
175 }
176
177 pub fn remove_nt_name(&mut self, var: VarId) -> String {
180 let mut removed = self.fixer_nt.get_unique_name_num(format!("{var}_removed"));
181 std::mem::swap(&mut self.nt[var as usize], &mut removed);
182 #[cfg(any())]
183 self.names.remove(&removed);
184 self.fixer_nt.remove(&removed);
185 removed
186 }
187
188 pub fn gen_source_code_t(&self, indent: usize, has_enum: bool, has_array: bool) -> String {
189 let mut source = Vec::<String>::new();
190 let (max_n, max_option) = self.get_terminals().fold((0, 0), |(n, option), t| {
191 (n.max(t.0.len()), option.max(t.1.as_ref().map_or(0, |o| o.len())))
192 });
193 if has_enum {
194 source.push("#[repr(u16)]".to_string());
197 source.push("enum T {".to_string());
198 for (i, (n, _option)) in self.get_terminals().enumerate() {
199 source.push(format!(" {n:max_n$}{} // {i}", if i == 0 { " = 0," } else { ", " }));
200 }
201 source.push("}".to_string());
202 }
203 if has_enum && has_array {
204 source.push(String::new());
205 }
206 if has_array {
207 source.push(format!("static TERMINALS: [(&str, Option<&str>); {}] = [", self.get_num_t()));
210 for (i, (n, option)) in self.get_terminals().enumerate() {
211 source.push(format!(" (\"{n}\",{:w1$}{}),{:w2$} // {i}",
212 "",
213 if let Some(o) = option { format!("Some(\"{o}\")") } else { "None".to_string() },
214 "",
215 w1 = max_n - n.len(), w2 = max_option + 4 - option.as_ref().map_or(0, |o| o.len() + 4)));
216 }
217 source.push("];".to_string());
218 }
219 indent_source(vec![source], indent)
220 }
221
222 #[cfg(test)]
225 pub fn dump(&self, title: &str) {
226 if !title.is_empty() {
227 println!("{title}");
228 }
229 println!(
230 "- nonterminals:\n{}",
231 self.get_nonterminals().enumerate().map(|(v, s)| format!(" - NT[{v}]: {s}")).join("\n"));
232 println!(
233 "- terminals:\n{}",
234 self.get_terminals().enumerate()
235 .map(|(t, (n, v_maybe))| format!(" - T[{t}]: {n}{}", if let Some(v) = v_maybe { format!(" = {v:?}") } else { String::new() }))
236 .join("\n"));
237
238 }
239}
240
241impl SymInfoTable for SymbolTable {
242 fn is_token_data(&self, token: TokenId) -> bool {
243 self.t.get(token as usize).map(|t| t.1.is_none()).unwrap_or(false)
244 }
245
246 fn is_symbol_t_data(&self, symbol: &Symbol) -> bool {
247 if let Symbol::T(token) = symbol {
248 self.t.get(*token as usize).map(|t| t.1.is_none()).unwrap_or(false)
249 } else {
250 false
251 }
252 }
253
254 fn is_symbol_t_fixed(&self, symbol: &Symbol) -> bool {
255 if let Symbol::T(token) = symbol {
256 if (*token as usize) < self.t.len() {
257 self.t.get(*token as usize).map(|t| t.1.is_some()).unwrap_or(false)
258 } else {
259 false
260 }
261 } else {
262 false
263 }
264 }
265
266 fn get_t_str(&self, token: TokenId) -> String {
267 match token {
268 _ if (token as usize) < self.t.len() => {
269 let (name, literal) = &self.t[token as usize];
270 literal.as_ref().unwrap_or(name).clone()
271 }
272 TokenId::MAX => "<bad character>".to_string(),
273 _ => format!("T({token}?)")
274 }
275 }
276
277 fn get_t_name(&self, token: TokenId) -> String {
278 if token as usize >= self.t.len() {
279 format!("T({token}?)")
280 } else {
281 self.t[token as usize].0.clone()
282 }
283 }
284
285 fn get_nt_name(&self, var: VarId) -> String {
286 if var as usize >= self.nt.len() { return format!("NT({var}?)") }
287 self.nt[var as usize].clone()
288 }
289
290 fn get_name(&self, symbol: &Symbol) -> String {
291 match symbol {
292 Symbol::Empty | Symbol::End => symbol.to_string(),
293 Symbol::T(token) => self.get_t_name(*token),
294 Symbol::NT(var) => self.get_nt_name(*var),
295 }
296 }
297
298 fn get_str(&self, symbol: &Symbol) -> String {
299 match symbol {
300 Symbol::Empty | Symbol::End => symbol.to_string(),
301 Symbol::T(token) => self.get_t_str(*token),
302 Symbol::NT(var) => self.get_nt_name(*var),
303 }
304 }
305
306 fn get_name_quote(&self, symbol: &Symbol) -> String {
307 match symbol {
308 Symbol::Empty | Symbol::End => symbol.to_string(),
309 Symbol::T(token) => if self.is_symbol_t_fixed(symbol) { format!("{:?}", self.get_t_str(*token)) } else { self.get_t_str(*token) },
310 Symbol::NT(var) => self.get_nt_name(*var),
311 }
312 }
313}
314
315impl Default for SymbolTable {
316 fn default() -> Self {
317 SymbolTable::new()
318 }
319}
320
321#[cfg(test)]
322mod tests {
323 use super::*;
324
325 #[test]
326 fn general() {
327 let mut st = SymbolTable::new();
328 st.extend_nonterminals(["A".to_string(), "NOT_USED".to_string(), "E".to_string()]);
329 assert_eq!(st.add_child_nonterminal(0), 3);
330 assert_eq!(st.get_str(&Symbol::NT(3)), "A_1");
331 assert_eq!(st.add_child_nonterminal(0), 4);
332 assert_eq!(st.get_str(&Symbol::NT(4)), "A_2");
333 assert_eq!(st.add_child_nonterminal(2), 5);
334 assert_eq!(st.get_str(&Symbol::NT(5)), "E_1");
335 assert_eq!(st.add_child_nonterminal(1), 6);
336 st.remove_nonterminal(1);
337 assert_eq!(st.get_str(&Symbol::NT(2)), "A_1");
338 assert_eq!(st.get_str(&Symbol::NT(3)), "A_2");
339 assert_eq!(st.get_str(&Symbol::NT(4)), "E_1");
340 #[cfg(any())]
341 assert_eq!(st.find_nonterminal("A_1"), Some(2));
342 assert!(st.nt.contains(&"A_2".to_string()));
343 #[cfg(any())]
344 assert!(st.names.contains_key("A_2"));
345 assert!(st.fixer_nt.contains("A_2"));
346 st.remove_nt_name(3);
347 assert!(!st.nt.contains(&"A_2".to_string()));
348 #[cfg(any())]
349 assert!(!st.names.contains_key("A_2"));
350 assert!(!st.fixer_nt.contains("A_2"));
351 }
352
353 #[test]
354 fn terminals() {
355 let mut st = SymbolTable::new();
356 let tnames = vec![("a", Some("aa")), ("b", Some("bb")), ("a", Some("A")), ("c", None), ("d", None)];
357 st.extend_terminals(tnames);
358 assert_eq!(st.get_num_t(), 5);
359 let result = st.get_terminals().map(|(s, v)| (s.as_str(), v.as_ref().map(|s| s.as_str()))).to_vec();
360 assert_eq!(result, vec![("a", Some("aa")), ("b", Some("bb")), ("a1", Some("A")), ("c", None), ("d", None)]);
361 for name in vec!["a1", "c", "d"] {
362 assert_eq!(st.fixer_t.contains(name), true);
363 }
364 st.downsize_num_t(2);
365 let result = st.get_terminals().map(|(s, v)| (s.as_str(), v.as_ref().map(|s| s.as_str()))).to_vec();
366 assert_eq!(result, vec![("a", Some("aa")), ("b", Some("bb"))]);
367 assert_eq!(st.get_num_t(), 2);
368 for name in vec!["a1", "c", "d"] {
369 assert_eq!(st.fixer_t.contains(name), false);
370 }
371 let extra_tnames = vec![("a", Some("A")), ("c", None), ("d", None)];
372 st.extend_terminals(extra_tnames);
373 let result = st.get_terminals().map(|(s, v)| (s.as_str(), v.as_ref().map(|s| s.as_str()))).to_vec();
374 assert_eq!(result, vec![("a", Some("aa")), ("b", Some("bb")), ("a1", Some("A")), ("c", None), ("d", None)]);
375 }
376}