diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
| commit | 18d7955b7d84c00467ede38baae53f4ce1fb6908 (patch) | |
| tree | 97d0746b82816a21d980636e50f8cdbeb804b518 /grammar/src/left_closure.rs | |
| parent | 8f8d3d1a3c276be4be2e5d2e767ada564c47279a (diff) | |
chain: a prototype is added.
I have an ostensibly working prototype now.
Further tests are needed to make sure that the algorithm meets the
time complexity requirement, though.
Diffstat (limited to 'grammar/src/left_closure.rs')
| -rw-r--r-- | grammar/src/left_closure.rs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/grammar/src/left_closure.rs b/grammar/src/left_closure.rs index 1630881..39461f0 100644 --- a/grammar/src/left_closure.rs +++ b/grammar/src/left_closure.rs @@ -114,10 +114,10 @@ impl Grammar { local_result.push(Or); builder.add_vertex(); - local_result.push(Lit(Ter(self.pack_tnt(Non(n)).unwrap()))); - let non_lit_index = builder.add_vertex(); + // local_result.push(Lit(Ter(self.pack_tnt(Non(n)).unwrap()))); + // let non_lit_index = builder.add_vertex(); - builder.add_edge(0, non_lit_index, ()).unwrap(); + // builder.add_edge(0, non_lit_index, ()).unwrap(); // If this non-terminal is nullable, add an empty variant. if self.is_nullable(n)? { |