6 ms·
Show HN: “Crafting Interpreters” chapter, control flow and Turing-completeness
- TekMol 9y agoThis is not a Show HN.
- dang 9y agoIt is because it's a substantial project (a book), posted by the author, and free for everyone to 'try out' (i.e. read). It's fair to have different standards for different categories of project. It's overdoing it a bit to post the same project every few weeks instead of every few months, but that's a separate issue.
- TekMol 9y agoIs the posting of a book chapter different from a blog post? The Show HN rules say blog posts can't be Show HNs. And the reason given is they "can't be tried out".
- dang 9y agoYes, it's different. A book (assuming it's a real book and not something slapdash) is a major piece of work. Obviously some of the finer distinctions (e.g. what counts as a book chapter vs. an article) can get pretty arbitrary. But the broader lines aren't. The intent of Show HN is for people to share what they're working on. If we applied the strictest definition, the only thing anyone could easily 'try out' would be web apps, and that's much too narrow.
- munificent 9y ago> A book (assuming it's a real book and not something slapdash) is a major piece of work. It is, I hope. But if you're prefer I post these without "Show HN", I'm happy to. I thought it was worth doing it to make it more obvious that I was self-posting, but I can not do that if that's what others would prefer.
- pvg 9y agoto make it more obvious that I was self-posting Not really what Show HN is for, though, so if you skip it for just chapter updates (rather than the whole book) you'll probably get less guff.
- analognoise 9y agoI like and appreciate it.
- dang 9y agoIt's fine. We always intended books to count as valid Show HNs.
- ASipos 9y agoA bit of nitpicking: "the function to compute the truth value of a given proof" should be "the function that returns the truth value of a given statement" (1st change because it is confusing to use the word compute in two different ways, 2nd change is simply an error correction) "equivalent in power" should not link to the Church-Turing thesis, as the former is a mathematical statement, proved in any introductory course on computability, and the latter is a philosophical one. w.r.t. the Neil Gaiman quote: https://www.goodreads.com/topic/show/1407558-misattributed-quote https://www.goodreads.com/topic/show/1407558-misattributed-q...
- justinpombrio 9y agoMore nitpicking: > You can prove that by writing a simulator for a Turing machine in your language. Since Turing proved his machine can compute any computable function, by induction, that means your language can too. That's not by induction, that's by composition or something. > We almost have the third too. You can create and concatenate strings of arbitrary size, so you can store unbounded memory. That's not true! Eventually you'll run out of memory & disk space. Turing machine tapes are infinite, you can't fit one in this puny universe. EDIT: > Syntactic sugar has a bad rap among the PL intelligentsia. Um, what? I presume the author isn't aware of the large PLT group at Northeastern that continuously writes papers about macros, i.e. user-defined syntactic sugar, and develops Racket, a language built almost entirely out of syntactic sugar. Or maybe they're defining "syntactic sugar" to not include macros: if so, they should be more clear about that. Also, I'm doing a PhD focusing on syntactic sugar, so I probably have authority to say: syntactic sugar has a very good rap among the PL intelligentsia. Languages with a needlessly complicated semantics have a bad rap, but that's different from having a large grammar. PL researchers are a lot more concerned about semantics than syntax.
- munificent 9y ago> That's not by induction, that's by composition or something. Good point. I'll fix that. > That's not true! Eventually you'll run out of memory & disk space. Turing machine tapes are infinite, you can't fit one in this puny universe. Sure, but in practice, most people loosen that requirement. Otherwise, no implemented language is Turing-complete. > Um, what? I presume the author isn't aware of the large PLT group at Northeastern that continuously writes papers about macros, i.e. user-defined syntactic sugar, and develops Racket, a language built almost entirely out of syntactic sugar. The mini-essay is about what syntactic sugar the language designer chooses to add to the language. Language features that let users extend the syntax are outside of the scope of that. I do note: > Lispers famously claim their language “has no syntax”, while Smalltalkers proudly show that you can fit the entire grammar on an index card. This tribe has the philosophy that the language doesn’t need syntactic sugar. Instead, the minimal syntax and semantics it provides are powerful enough to let library code be as expressive as if it were part of the language itself.
- pacaro 9y agoThe author asks why && and || need different precedence (Unless I misunderstood). This is because `a && (b || c)` has a different truth table than `(a && b) || c`
- oconnor0 9y agoThat doesn't explain why they would need a different precedence. `a + b - c` is not the same as `a - b + c` even through the precedence's of + and - are the same (in most syntaxes).
- pacaro 9y agoGranted, the intersection of precedence and associativity is a great source of confusion (and any number of annoying Facebook memes) I'm not a formally trained mathematician, but one way to rationalize + and - having the same precedence, is to consider them as inverses of each other, so your two examples can be written as a + -b + c And a + b + -c At which point precedence and associativity no longer matter. The same can be done with multiplication and division
- rspeele 9y ago&& having higher precedence than || makes sense because && is boolean multiplication and || is boolean addition.
- DonaldPShimoda 9y agoThis makes so much sense but I never thought of it this way before so explicitly. Neat!
- agumonkey 9y agoHas anyone ever found a link between boolean (F2) and "normal" base (F[n], or N) arithmetics ?
- DanPristupov 9y agoI just want to thank Bob for the amazing "Game Programming Patterns" book. I can't recommend it highly enough. And since I'm also interested in compilers, I will buy "Crafting Interpreters” without a hesitation.
- munificent 9y agoThank you!
- khedoros1 9y agoI'm reading it too, bit by bit! I've been writing file importers for an old game that I'd like to recreate, but I've never built a game engine before, and I'm getting to a place where I need to start tying things together to build the cohesive whole.
- EamonnMR 9y agoWhich game?
- khedoros1 9y agoUltima Underworld. About 5 birds with one stone: game dev, reverse engineering, real mode X86 assembly (covered a subset of ARM in college), technical details of DOS, OpenGL graphics, and a dip into writing software renderers too. I consider it a long-term hobby; it's not exactly a quick solo project. I'm also looking at another one called Solar Winds. It came out at a similar time, but the whole game is smaller than just UW's binary, with a lot more of the game's content encoded directly in the binary. UW tends toward deep call stacks, and significant portions are written in C. SW is pretty flat with very few function calls, and I think that about 1/3 of the code is made of Sound Blaster drivers linked into the binary. I took a look at Lemmings, but that was going to be kind of annoying. Most of the binary was encrypted and would be decrypted on the fly, sometimes in a 2-step operation, where it would be decrypted then copied backwards into a new location. There are already engine implementations for that, so it didn't seem worth the effort.
- deleted 9y ago[deleted]
- ejanus 9y agoSome typos : cook it down to a small number of primitives that the "back end" can do its magic on. backend. Most other syntax trees always evaluate their subtress. subtrees. Good read, thanks for sharing.
- munificent 9y agoThank you! I'll upload a fix for "subtress" when I get a chance. I believe "back end" as two words is still the most common formulation: https://books.google.com/ngrams/graph?content=backend%2Cback+end%2Cback-end&year_start=1800&year_end=2000&corpus=15&smoothing=3&direct_url=t1%3B%2Cbackend%3B%2Cc0%3B.t1%3B%2Cback%20end%3B%2Cc0%3B.t1%3B%2Cback%20-%20end%3B%2Cc0 https://books.google.com/ngrams/graph?content=backend%2Cback...