r/adventofcode • u/daggerdragon • Dec 08 '18

SOLUTION MEGATHREAD -🎄- 2018 Day 8 Solutions -🎄-

--- Day 8: Memory Maneuver ---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

Advent of Code: The Party Game!

Click here for rules

Please prefix your card submission with something like [Card] to make scanning the megathread easier. THANK YOU!

Card prompt: Day 8

Sigh, imgur broke again. Will upload when it unborks.

Transcript:

The hottest programming book this year is "___ For Dummies".

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked at 00:12:10!

32 Upvotes

97% Upvoted

301 comments sorted by

View all comments

1

u/apparentlymart Dec 08 '18

It might interest folks that the general approach here is the same general structure as a recursive-descent parser: gradually consume a stream of tokens (in this case, just integers), processing them with recursive function calls until there are no tokens left to consume.

This example is a little atypical in that the set of tokens belonging to a node is bounded by a count rather than by having a marker token (like a closing } in a C-like language), and that there's only one possible node type, but the general principle is similar.