Birbla

Join the discussion

Write your take first — we'll ask for email only when you're ready to publish.

Sign in
  • Hacker News
  • Why the fuck make a tech web page unreadable with CRT effects? Thank god, there is reader mode in Firefox.
    by froh42
  • “everyone has reader mode” is I guess freeing?
    by QuadmasterXLII
  • I actually find it quite readable - YMMV.
    by arethuza
  • It's not that bad... But it is bad. It looks cool, and I managed to read the first few paragraphs. But when the code scrolled into view, it stopped looking cool and became an eye-destroying disaster.

    YMMV, but OP, if you read this, please consider disabling the text-shadow for code snippets... or disabling syntax highlighting in code snippets. These two things are not a good thing together.

    by klibertp
  • Everyone says they want the weird more personal internet back, then this is what we get when someone does a weird internet thing!
    by ubercore
  • That is a whole lot of unsafe blocks.
    by rootnod3
  • Made my day that it references an article I wrote! :-D

    Another thing that is kinda neat: there is a duality (a bidirectional transform) between the AST for a tree walking interpreter and the AST for a stack machine. To create the stack machine AST, all you do is remove any occurrence of the expression type in the tree-walking AST; these values are now found on the stack. Obvious when you think about it, but useful nonetheless. I don't think there is a simple equivalent for a register machine as, unless you have an infinite number of registers, you need to do register allocation.

    (If the author reads this, my name changed from Noel to Neal at some point. I don't really mind though; my name is a bit unusual and I've been called all sorts of things.)

    by noelwelsh
  • Hmm, what's a stack machine AST? I can't follow your description of the transform, what does "remove" mean here? I can remove all of the internal nodes of a tree, which leaves me with a soup of leaf nodes, but how is that an AST for a stack machine?
    by derdi
  • > (If the author reads this, my name changed from Noel to Neal at some point. I don't really mind though; my name is a bit unusual and I've been called all sorts of things.)

    I think it'd be good to update the about page with that info: https://noelwelsh.com/landing/about/

    by Thom2000
  • Just read your blog post[0], thanks for it!

    If I may leave some feedback here...

    It'd be cool if you could add some syntax highlighting, because being at it is, it's hard to distinguish comments from code paths. The code snippets are just Scala anyway, aren't they?

    Why, in the switch dispatch- and the subroutine threading-variants, is the recursive call in the dispatch function done with a call to loop(...)? Is that some Scala specific thing for recursion?

    [0]: https://noelwelsh.com/posts/understanding-vm-dispatch/

    by whilenot-dev
  • Ctrl-Shift-C, click on a paragraph, search for "text-shadow" on the right pane of the inspector, untick the checkbox.

    There is a time and place for text and retro-CRT effects, this isn't one.

    by sph
  • A personal blog isn't the time or place for playing around with things?
    by Sparkle-san
  • Thank you. I was about to get eye cancer
    by narinciye
  • Reminder about Firefox's built in reader mode, which is great for working around annoying styling or mobile rendering issues.
    by goda90