summaryrefslogtreecommitdiff
path: root/curtail.txt
diff options
context:
space:
mode:
authorJed Barber <jjbarber@y7mail.com>2020-12-25 22:13:59 +1100
committerJed Barber <jjbarber@y7mail.com>2020-12-25 22:13:59 +1100
commitdd9121ec8d91784e6cea4e71cd1fe5c3735d81d8 (patch)
treeb8447cdadc2adc5026a78a4240e3e111f9423999 /curtail.txt
parent9d5eccf7d6662e897eaa1b6b5f16fba0aa5a5f38 (diff)
Parser tests, left recursion test
Diffstat (limited to 'curtail.txt')
-rw-r--r--curtail.txt9
1 files changed, 5 insertions, 4 deletions
diff --git a/curtail.txt b/curtail.txt
index ff418ec..38fd238 100644
--- a/curtail.txt
+++ b/curtail.txt
@@ -1,14 +1,11 @@
-Scratch space for notes about curtailment
-
-
-
all results must track curtails
- done
when merging two results that have curtails for the same combinator, use the smaller curtail
- done
+ - actually, shouldn't this be the opposite, given that curtails stand for the highest level that a result is valid at?
when updating a result, replace the curtails with the leftrec level for the current context
- done
@@ -19,5 +16,9 @@ ignore a previous result when the current leftrec level is less than the previou
the function to check if reusable needs to take into account a +1 for the combinator being currently memoized
- done
+when depth of a curtail is less than or equal to remaining tokens of input after the furthest finish of a result, that curtail can be deleted?
+
+when depth of curtail plus remaining tokens after furthest finish of a result is less than or equal to total input tokens plus one, curtail can be deleted from a result
+