10 comments

[ 0.27 ms ] story [ 53.6 ms ] thread
(comment deleted)
> Way back in 1984 I was writing a Ph.D. thesis... My fellow grad student Tony DeRose felt the same need, and together we sketched out a simple Lisp program that would handle this as a preprocessor.

This is how to fail to become an academic and instead become a computer programmer.

Norvig's codes are very educational. Unfortunately :) Peter long since stopped updating them; in JScheme, he mentioned the wish to move to R5RS standard, but other, more important things intervened.

Are there similar codes for more recent Scheme's - with some more advanced capabilities, like hygienic macros and full continuations - demonstrated?

This is one of my favorite interview questions! I still vividly remember sitting at the airport on my way back home for the first time since arriving at Cal, jamming on this project in order to get a few bonus points for 61A. Good times!
This has been submitted a few times in the past. Here are some with comments (skipping ones with no or few comments):

Sept 30, 2010 - https://news.ycombinator.com/item?id=1745322 (39 comments)

Oct 1, 2010 - https://news.ycombinator.com/item?id=1746916 (11 comments)

May 31, 2014 - https://news.ycombinator.com/item?id=7825054 (41 comments)

Oct 24, 2016 - https://news.ycombinator.com/item?id=12777852 (28 comments)

Aug 2, 2019 - https://news.ycombinator.com/item?id=20590439 (29 comments)

10 days ago - https://news.ycombinator.com/item?id=30327437 (3 comments)

It would be good if the submit feature of HN listed the most recent entry for the same URL!
If you don't know how compilers work, then you don't know how computers work.
See also: easy syntactic translation of Scheme subset (from The Little Schemer) into JavaScript

https://www.crockford.com/little.html

Which (site-appropriately) notes:

> Pay particular attention to The Applicative Order Y Combinator, one of the most strange and wonderful artifacts of Computer Science.