From 9a317e56f8a6126583f7d0c431bf878d9b1fe7b1 Mon Sep 17 00:00:00 2001 From: JSDurand Date: Sat, 8 Jul 2023 12:30:21 +0800 Subject: Finished the Emacs binding. Now the binding part is finished. What remains is a bug encountered when planting a fragment to the forest which intersects a packed node, which would lead to invalid forests. This will also cause problem when planting a packed fragment, but until now my testing grammars do not produce packed fragments, so this problem is not encountered yet. I am still figuring out efficient ways to solve this problem. --- graph/src/labelled/binary.rs | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'graph/src/labelled/binary.rs') diff --git a/graph/src/labelled/binary.rs b/graph/src/labelled/binary.rs index 9f3afa8..ccbd5cb 100644 --- a/graph/src/labelled/binary.rs +++ b/graph/src/labelled/binary.rs @@ -214,9 +214,11 @@ impl Graph for PLGraph { let mut post = String::new(); - // FIXME: Find a way to print only used nodes. Maybe remove + // SOLVED: Find a way to print only used nodes. Maybe remove // unwanted edges from unwanted nodes, so that we can print // out only those used nodes. + // + // This is solved as we can extract the forest out. for node in self.nodes() { post.push_str(&format!( -- cgit v1.2.3-18-g5258