Hacker Newsnew | past | comments | ask | show | jobs | submit | xnacly's commentslogin

Hi, no it doesnt, this example of course breaks using temporary registers used after the optimisation. But thats why peephole is a fallback to ir optimisation, since they are only local.

I honestly didnt think of this possibility while building the optimisation. Since constant folding is done as an ir pass i will remove the peephole pass, thanks for noticing :)


Im sorry i forgot to highlight the braces around (2+3)*(4-1);

Either way the parser isnt implemented yet and all ast examples for the compiler are hardcoded


xnacly.me


Your site is the second one I've seen using the JetBrains Mono typeface -really easy on the eyes, even when set light grey #eff1f5 on a very dark #07080d background.


I love jetbrains mono, together with go mono my favourite fonts


Assembly requires way more work than compiling to, say C. Clang and gcc do a lot of the heavy lifting regarding optimisation, spilling values to the stack, etc


Then you're stuck with the C stack, though, and no way to collect garbage.


I have a couple interpreters I've been poking at and one uses 'musttail' while the other uses a trampoline to get around blowing up the C stack when dispatching the operators. As for the GC, the trampoline VM has a full-blown one (with bells-and-whistles like an arena for short lived intermediate results which get pushed/popped by the compiled instructions) while the other (a peg parser VM) just uses an arena as the 'evaluation' is short lived and the output is the only thing really needing tracking so uses reference counting to be (easily) compatible with the Python C-API. No worries about the C stack at all.

I mean, I could have used the C stack as the VM's stack but then you have to worry about blowing up the stack, not having access (without a bunch of hackery, looking at you scheme people) to the values on the stack for GC and whatnot and, I imagine, all the other things you have issues with but it's not needed at all, just make your own (or, you know, tail call) and pretend the C one doesn't exist.

And I've started on another VM which does the traditional stack thing but it's constrained (by the spec) to have a maximum stack depth so isn't too much trouble.


really? you cant track and count your pointers in C? why not?


what a weird and mean comment, do better


> do better

Can you write replies without turning to the big book of HRisms?


No clue what that is, I dont talk to hr


the rust example is so far off being useful and file io seems completly dumb in this context


Real programs have to do IO and the C and C++ code runs faster while also doing IO.

What do you think they could have done better assuming that the IO is a necessary part of the benchmark?

Also good job to the Rust devs for making the benchmark so much faster in nightly. I wonder what they did.


> Assuming that the IO is a necessary part of the benchmark …

So make it significant, move giga like benchmarks game reverse-complement & fasta & …

https://benchmarksgame-team.pages.debian.net/benchmarksgame/...


The file I/O is probably irrelevant, but the startup time is not.

The differences among the really fast languages are probably in different startup times if I had to guess.


What if we try to measure rather than guess :-)

https://benchmarksgame-team.pages.debian.net/benchmarksgame/...


> differences among the really fast languages are probably in different startup times

Startup times matter a great deal.


This, lisp is perfect for representing arbitrary data, nesting is just another sexpr, easy to produce, easy to parse and easy to debug / reason about


When I did my degree, the years prior to mine had some flexibility choosing the implementation language for compilers class.

Lisp and Prolog were forbidden due to how easy the whole exercise would be.


I think rust macros could shine for this usecase, definitely on my TODO list


The snowflakes do vanish once you scroll down even a single pixel


They stop spawning but the flakes already on the screen continue to fall until they reach the bottom. It's cute but very annoying IMO and there should be a user control to instantly turn it off.


Its winter, it takes a literal second to fade out


They do not fade out in a second and continue to fall for 10+ seconds until they fade at the bottom of the page. It is also not winter everywhere.


It is on that page


Well it does, thats why i didnt include it


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: