The nice thing about this is that you can make this task as simple or
as complex as you like (for example, the empty string is a perfectly
valid quine) and it's also interesting from a mathematical point of
view, for those of us who like fix points. As usual, completely
optional and partial solutions or follow up questions are encouraged.
For next month's tools (in two days), I have some potential topics
that I wanted some votes for or against:
- Pre-processor hacks (I've picked up quite a repertoire of handy
ones in the last month)
- Cscope
- GNU Screen or Tmux
Sorry they're all quite low-level and C-ish, but it's what I'm doing
at the moment. If anyone has another topic they'd like to talk about
(or something they'd like me to talk about) please let me know.
Failing that, you'll get topic number 1, which I'm guessing will be of
no interest to many people, so it's in your best interests to vote :)
Tom, nice work coping with the extraneous line endings as well!
Meanwhile, this month's exercise was inspired by Ken Thompson's
Reflections on Trusting Trust
(http://cm.bell-labs.com/who/ken/trust.html). If you haven't seen this
before, I highly recommend it. Be warned: it may make you doubt
everything you are sure about in computing.