diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-01-05 10:24:39 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-01-05 10:24:39 +0800 |
| commit | 7dd4935230e303aef8d295d992239d59d95b32d7 (patch) | |
| tree | 486104820b5f3701518c1030a0393a5cef428cb9 /grammar/src/lib.rs | |
| parent | bdbd4b4dc21af09711c97d3f903877443199af06 (diff) | |
singly labelled graphs
Now I have a new type of labelled graphs, which can index vertices by
labels, but not index edges by labels. The biggest difference is that
I do not have to keep a hashmap of edge targets by labels, and I do
not have to guard against the duplication of nodes with the same set
of edges. I guard against nodes with the same label, though.
Also, in this graph, both vertices and edges have one label at a time,
whereas in the previous labelled graph there can be a multitude of
edges between the same source and target nodes, but with different
labels.
Now it remains to test this type of graphs, and to think through how
we attach forest fragments to nondeterministic finite automata edges,
and how to join forest fragments together while skipping nullable
edges, in order to finish the "compilation" part.
Diffstat (limited to 'grammar/src/lib.rs')
| -rw-r--r-- | grammar/src/lib.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/grammar/src/lib.rs b/grammar/src/lib.rs index 55adc9a..4e544c9 100644 --- a/grammar/src/lib.rs +++ b/grammar/src/lib.rs @@ -8,7 +8,7 @@ // words, the current focus is not on the optimisations, whereas // scanners are for optimisations only, so to speak. -// TODO: Separate contents into modules. +// REVIEW: Separate contents into modules. use nfa::{ default::{ |