diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-01-20 13:48:26 +0800 |
| commit | 18d7955b7d84c00467ede38baae53f4ce1fb6908 (patch) | |
| tree | 97d0746b82816a21d980636e50f8cdbeb804b518 /forest/src/design.org | |
| parent | 8f8d3d1a3c276be4be2e5d2e767ada564c47279a (diff) | |
chain: a prototype is added.
I have an ostensibly working prototype now.
Further tests are needed to make sure that the algorithm meets the
time complexity requirement, though.
Diffstat (limited to 'forest/src/design.org')
| -rw-r--r-- | forest/src/design.org | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/forest/src/design.org b/forest/src/design.org index 09db113..c32b1c9 100644 --- a/forest/src/design.org +++ b/forest/src/design.org @@ -112,7 +112,8 @@ The chain-rule operation can be described as follows: 2. Prepare a new forest fragment as follows. 1) For every child \(g\) of \(e\) in the atomic language, if \(g\) is the terminal that appears as the current input \(t\), let the - new fragment be defined as the node moved by \(g\), alone. + new fragment be defined as the node moved by \(g\), followed by + a terminal node, as a single edge. 2) If \(g\) is a non-terminal and its first-set contains \(t\), then for every left-linearly closed child of \(g\) that is labelled \(t\), denoted as \(h\), then let the fragment be |