Skip to content

Commit

Permalink
Add links to "real" graph libraries that we should probably use
Browse files Browse the repository at this point in the history
instead of hnd rolling the graph data structure and algorithm
  • Loading branch information
egli committed Dec 12, 2024
1 parent b6be5c3 commit cc23474
Showing 1 changed file with 6 additions and 1 deletion.
7 changes: 6 additions & 1 deletion README.org
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down Expand Up @@ -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

Expand Down

0 comments on commit cc23474

Please sign in to comment.