Hacker News

yes!

Thanks for the suggestion! I wouldn't mind having such articles in PO! tbh - let me think what can we do about it (or rather: let me pass this to the rest of the team so they think about it too).

like Mondo 2000 :)

Sadly I don't know if that kind of 80s/90s irreverence would go well with today's sensitivities.

It is a double edged sword of the single page layout that you really have to make one point briefly and get out of there. I had to pare down many details to fit the layout.

If you want to learn more about query based compilers as a concept, I highly recommend ollef's aritcle: https://ollef.github.io/blog/posts/query-based-compilers.htm...

If you want to learn how to implement a query based compiler, I have a tutorial on that here: https://thunderseethe.dev/posts/lsp-base/ (which I also highly recommend but that might be more obvious since I wrote it)

Finding this one-page was great! It gave me a new term I didn't have before that leads to all sorts of new materials to go rifling through.

Old discussion: https://news.ycombinator.com/item?id=23644391

2600 is still being published!

https://www.2600.com/Magazine/DigitalEditions

There's also Proof Of Concept Or GTFO edited by Pastor Manuel LaPhroaig https://github.com/angea/pocorgtfo

Still would like a straight html version for reading on a phone. One with resizable text and proper reflow.

The article I submitted has an HTML tag in the title, and seems to have broken the web viewer :(

Note that you can link to pages in a PDF with a hash like #page=64 (for example) in the URL.

https://pagedout.institute/download/PagedOut_008.pdf#page=64

Initial impressions says no about being that file a polyglot.

If you like polyglot files, see https://www.alchemistowl.org/pocorgtfo/

Ah, no, sorry, no polyglots there yet. We'll get there one day, but so far our tooling doesn't allow for it yt.

https://learn.microsoft.com/en-us/shows/seth-juarez/anders-h...

https://news.ycombinator.com/item?id=11685317

https://lobste.rs/s/dwf2yn/sixten_s_query_based_compiler

https://ericlippert.com/2012/06/08/red-green-trees/

Rust's salsa, etc.

Related search terms are incremental compilation and red-green trees. It's primarily an ide driven workflow (well, the original use case was driven by ides), but the principles behind it are very interesting.

You can grok the difference by thinking through, for example, the difference between invoking `g++` on the command line - include all headers, then compile object files via includes, re-do all template deduction, etc. and one where editing a single line in a single file doesn't change the entire data structure much and force entire recompilation (this doesn't need full ownership of editing either by hooking UI events or keylogging: have a directory watcher treat the file diff as a patch, and then send it to the server in patch form; the observation being that compiling an O(n) size file is often way more expensive than a program that goes through the entire file a few times and generates a patch)

AST's are similar to these kinds of trees only insofar as the underlying data structure to understand programming languages are syntax trees.

I've always wanted to get into this stuff but it's hard!

You're right.

In general when selecting articles we assume that the reader is an expert in some field(s), but not necessarily in the field covered by this article. As such, things which are simple for an expert in the specific domain, can still be surprisingly to learn for folks who aren't experts in that domain.

What I'm saying is, that we don't try to be a cutting edge scientific journal — rather than that, we publish even the smallest trick that we decide someone may not know about and find it fun/interesting to learn.

The consequence of that is that, yeah, some article have a bit clickbaity titles for some of the readers.

On the flip side, as we know from meme-t-shirts, there are only 2 things hard in computer science, and naming is first on the list ;)

P.S. Sounds like you should write some cool article btw :)

I noticed that as well. Also misleading titles like “Eliminating Serialization Cost using B-trees” where the cost savings are actually for deserialization (from a custom format), and neither the self-balancing nature of B-trees isn’t actually relevant, as no insertion/deletion of nodes occurs in the (de)serialization scenario, so a single tree level is sufficient. It’s a stretch to refer to it as a B-tree.

They have both, see the bottom of the home page: https://pagedout.institute/