AOC/2020, branch masterMy solutions to Advent of Code
https://git.tomsmeding.com/AOC/atom?h=master2020-12-27T13:09:22ZDay 202020-12-27T13:09:22ZTom Smedingtom.smeding@gmail.com2020-12-27T13:09:22Zurn:sha1:833fcf24d661ef600d00c017ce7796b2fc938a17Day 192020-12-25T09:04:49ZTom Smedingtom.smeding@gmail.com2020-12-25T09:04:49Zurn:sha1:a03c0ce5608b23a351886efbbeaa30cef19c284f
The second part was supposed to be more difficult than the first part;
the problem statement hinted that you might need to memoise the set of
sentences matched by non-recursive rules, "especially rules 42 and 31".
Why the hell then did my utterly naive matcher from part 1 work without
changes in ~60ms total?
Day 182020-12-23T21:40:16ZTom Smedingtom.smeding@gmail.com2020-12-23T21:40:16Zurn:sha1:7653d2f33c0716ff2234587cfd00cf6c729cefd9
Yay parsec
Day 172020-12-23T21:20:55ZTom Smedingtom.smeding@gmail.com2020-12-23T21:18:24Zurn:sha1:e84dd297d997ad33d5de45d032419dc3740c0306Day 162020-12-19T20:47:58ZTom Smedingtom.smeding@gmail.com2020-12-19T20:47:58Zurn:sha1:66fa992cf7ec10553c00c196ad0259443e27e37aDay 15 (slow)2020-12-16T21:20:04ZTom Smedingtom.smeding@gmail.com2020-12-16T21:20:04Zurn:sha1:a5fd247a5e66ea63fc0826a884dd78e37888878bDay 142020-12-16T21:00:50ZTom Smedingtom.smeding@gmail.com2020-12-16T21:00:50Zurn:sha1:9b0b5326ff4a5bfc20e24d44aaf967fb48db8eb8Day 132020-12-16T20:26:58ZTom Smedingtom.smeding@gmail.com2020-12-16T20:26:58Zurn:sha1:2d324ad69e72e56ff99ce53c55e248661a363b82Day 122020-12-16T17:45:47ZTom Smedingtom.smeding@gmail.com2020-12-16T17:45:47Zurn:sha1:ac45449f8882a76612dcca699f84f54f08edcff4Day 12 part 12020-12-14T21:45:22ZTom Smedingtom.smeding@gmail.com2020-12-14T21:45:22Zurn:sha1:b524b905c29a01660663223b24a1ece82ebd48b6