diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-01-13 14:26:28 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-01-13 14:26:28 +0800 |
| commit | 8f8d3d1a3c276be4be2e5d2e767ada564c47279a (patch) | |
| tree | daba317c8d381f7159f9a34d957291472bad2873 /chain | |
| parent | 3c6511f69c7639abff60ac9999a08ce2daa24a7d (diff) | |
forest seems to be completed
I seem to have finished the implementation of forests. Now it remains
the implementation of the chain-rule machine, of which I have a rough
plan now.
Diffstat (limited to 'chain')
| -rw-r--r-- | chain/src/plan.org | 19 |
1 files changed, 10 insertions, 9 deletions
diff --git a/chain/src/plan.org b/chain/src/plan.org index b708413..84192f0 100644 --- a/chain/src/plan.org +++ b/chain/src/plan.org @@ -2,7 +2,7 @@ #+AUTHOR: Durand #+DATE: <2022-11-18 Ven 19:57> -* Things to do [6/10] +* Things to do [7/10] - [X] Implement builders for graphs - [X] Find sets of the first terminals for each non-terminal, in the @@ -79,6 +79,15 @@ lack of this step might be the root cause of the failure of the previous version of this project. + [X] Test atoms +- [X] Implement forests [4/4] + + [X] Design a format of forests. This should be the most crucial + thing to do, in order to have a better understanding of the whole + picture. I need to have a clear understanding of the details of + the binarised shared packed parsed forests, that reflects the + regular expressions in the grammar equations. + + [X] Define a trait with the expected behaviours. + + [X] Implement them as parents-knowing graphs. + + [X] Test - [-] Implement languages. [1/4] + [X] First define a trait with the expected behaviours. + [ ] Then implement them as doubly labelled graphs. @@ -86,14 +95,6 @@ + [ ] Each edge in the chain-rule machine needs to be labelled also with a position in the forest. This perfectly solves the problem of those "plugs"! -- [-] Implement forests [2/3] - + [X] Design a format of forests. This should be the most crucial - thing to do, in order to have a better understanding of the whole - picture. I need to have a clear understanding of the details of - the binarised shared packed parsed forests, that reflects the - regular expressions in the grammar equations. - + [X] Define a trait with the expected behaviours. - + [-] Implement them as parents-knowing graphs. - [ ] Implement semiring. [0/5] + [ ] Define the trait. + [ ] Implement the boolean semiring. |