From cc23474de0fc2d97190544bd0760d2fdbdb93050 Mon Sep 17 00:00:00 2001 From: Christian Egli Date: Thu, 12 Dec 2024 12:18:31 +0100 Subject: [PATCH] Add links to "real" graph libraries that we should probably use instead of hnd rolling the graph data structure and algorithm --- README.org | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/README.org b/README.org index 1b31935..990cf37 100644 --- a/README.org +++ b/README.org @@ -105,7 +105,7 @@ The parser is built from the grammar used in [[https://github.com/liblouis/tree- which is a port of the [[https://en.wikipedia.org/wiki/Extended_Backus%E2%80%93Naur_form][EBNF grammar]] in [[https://github.com/liblouis/rewrite-louis][rewrite-louis]], which in turn is a just port of the [[https://en.wikipedia.org/wiki/Parsing_expression_grammar][Parsing expression grammar]] from [[https://github.com/liblouis/louis-parser][louis-parser]]. -* Todo [6/14] +* Todo [6/15] - [ ] Parse with context - currently tables are parsed line by line. Opcodes have no idea whether a character or a class has been defined before @@ -146,6 +146,11 @@ a just port of the [[https://en.wikipedia.org/wiki/Parsing_expression_grammar][P - However normal translation has currently no way to specify a display table - [X] Handle undefined characters similarly to liblouis +- [ ] Use a well established FST or graph library as a bases + - currently regular expressions are implemented using a simple + directed acyclic graph. It would surely be better to use a well + established library for that task such as [[https://github.com/garvys-org/rustfst][rustfst]], [[https://crates.io/crates/petgraph][petgraph]] or + [[https://github.com/neo4j-labs/graph][graph]]. * License