Nathan Braswell
|
ae82af6636
|
Bugfix & added an extra lambda wrapping around term/nterm so that their value can be made recursive with let-rec, and with that the parser works! On the other hand, it takes 38 seconds to parse 'a,a,a' with the grammer A='a'|'a' ',' A .... so that could be a lot better.
|
2021-08-05 00:39:56 -04:00 |
|
Nathan Braswell
|
c8c876e1bc
|
Gonna checkpoint here - got basic fungll working, did a mod to allow strings as terminals, working on getting recursion working.
|
2021-08-05 00:07:44 -04:00 |
|
Nathan Braswell
|
5a61d5f90c
|
Added destructuring lambda/rec-lambda, changed let to use the same [] array destructuring syntax, added basic multiset & set-foldl. Fixed a bunch of bugs in fungll, hopefully close to working, but just realized that < is only defined for ints, while it's how the RB-Tree set/map sort their values/keys, so I'll need to extend it like = for all types. Tomorrow!
|
2021-08-04 00:56:04 -04:00 |
|
Nathan Braswell
|
d38cd3e61e
|
Put in title of paper / authors / url
|
2021-08-03 01:10:10 -04:00 |
|
Nathan Braswell
|
c96f20c80e
|
Add lcompose to prelude, size to rb, and sketch out fungll. Still haven't figured out the exact datatype for grammer_slots and have decided to implement [] destrucuring in lambda params, and change let destructuring to use [].
|
2021-08-03 00:56:07 -04:00 |
|