« first day (194 days earlier)      last day (527 days later) » 

2:55 PM
i have a big brain idea for unparsable nilads
take 1 2+2 3 4+1 2 3 4
it has a bunch of unparseable nilads
now the program goes "hey i have a bunch of unparseable nilads at the end of the program"
then it converts those into a list like:
1 2+2 3 4+[1,2,3,4]
then it sees a 0,2 rule
but then it sees an unparseable nilad
to be clear this happens before actual evaluation
now it keeps on eating nilads until it finds something else
so now it becomes:
1 2+[2,3,4]+[1,2,3,4]
next the same thing happens to finally become
[1,2]+[2,3,4]+[1,2,3,4]
then it evaluates that
now i don't know what to do in this case:
F 2 3 4 F 5
where unparseable nilads are surrounded by monads
@UnrelatedString @lyxal do y'all have any ideas?
so it basically stops 2,0 rule from occuring in cases like: +2 0 2+ but it evaluates this as 2,0 0,2 +2 2+
the first one is 2 0,2
 
3:55 PM
good question
 

« first day (194 days earlier)      last day (527 days later) »