Apanatshka

9 ms·

31.
by Apanatshka 11y ago
This is the first serious blog post that I've ever published. I'd love to get feedback/tips/critique!
32.
Show HN: My first blog post – Finite Automata with a bit of Rust(apanatshka.github.io)
6 points by Apanatshka 11y ago|3 comments
33.
by Apanatshka 11y ago
That's also a really cool article. Thanks for sharing it!
34.
by Apanatshka 11y ago
Summary of the idea: Add implicit arguments with some extra syntax. Whenever the argument is unambiguous, you can just not mention it, whenever it's ambiguous you add the argument to a function call. Modules provide the structs of rela
35.
by Apanatshka 11y ago
Source: MS Paint. haha, that's clever ^^ EDIT: seriously though, those are some Paint skills, I didn't even notice until I saw the "source" text below it.
36.
by Apanatshka 11y ago
Heh, Randstad advocating candor, who could have guessed. It's a Dutch company, and straight-to-the-point, no-BS candor is one of those Dutch culture things. Of course you need to strike a careful balance, as Kim Scott aptly defines ac
37.
by Apanatshka 11y ago
Doesn't work for me. Does this trick require JavaScript execution or cookies?
38.
by Apanatshka 11y ago
There are also newer editions of this book: http://papl.cs.brown.edu/2015/
39.
by Apanatshka 11y ago
I've been meaning to read more of this book. The first chapters are great. Now of only I had time...
40.
by Apanatshka 11y ago
It took me a while, but I solved it without any guessing+backtracking.
41.
by Apanatshka 11y ago
It really depends on the kind of parsing that you're doing. Full context-free grammar are supported by "generalised parsing". The older stuff is GLR by Tomita, Early parsing, the CYK algorithm. The newer stuff based on Tomita
42.
by Apanatshka 11y ago
You could try applying The Elm Architecture [1]. It's developed for the Elm programming language [2], but I've seen more than one framework outside of the Elm ecosystem cite it as inspiration for their structure. [1] https:/
43.
by Apanatshka 11y ago
This sounds a lot like auto-completion in a good IDE.
44.
by Apanatshka 11y ago
I've only read a little bit in Optimizing Compilers for Modern Architectures, but it seems a pretty complete introduction: http://www.amazon.com/Optimizing-Compilers-Modern-Architectu... Another space you can look for
45.
by Apanatshka 11y ago
I'm not sure if it was [0] or [1].. [0]: https://groups.google.com/d/topic/elm-discuss/NJCZFIYxshE/di... [1]: https://groups.google.com/d/topic/elm-discuss/ZJ6lkfPimW8
46.
by Apanatshka 11y ago
hehe, I see this every time on an HN post about a new Elm release. At some point I'll have to look into that old email client, I'm curious what people are talking about.
47.
by Apanatshka 11y ago
I think there simply needs to be more exploration in the area. I only know of one person who tried something truly different than the Elm Architecture who wrote about it on the mailing list. Anyone interested and with time to spend should j
48.
by Apanatshka 11y ago
Long anticipated, and now finally here :) I <3 the type diffs, exhaustiveness checks and TCO. Not completely sure about the removed syntax, but it's not like I used it a lot, so I guess simpler is better.
49.
by Apanatshka 11y ago
No, Unsafe is not blacklisted from JIT afaik. Although be careful that a helper method using Unsafe usually doesn't get inlined. The problem in this case is the loop. It ranges over a long, and where int loops get a lot of optimisatio
50.
by Apanatshka 11y ago
For those who don't want to google it: http://elm-lang.org/
51.
by Apanatshka 11y ago
I agree. But don't forget that it took years of hard work to build up enough of "Java the platform". Things that help there is having traditional man-power, which costs money, and having a strong community, which takes lobbyi
52.
by Apanatshka 11y ago
Given that type inference can be expressed in the form of constraints, could this be used to speed up type inference on huge programs?
53.
by Apanatshka 11y ago
Hmm. Someone beat me to it. Interesting though, very cool.