Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
aufreak2
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
aufreak2
16y ago
I'm still laughing hard! These guys deserve to graduate right now ... or maybe a perpetual grant to stay in school and write such assignments :D Excellente! Edit: Just noticed 2001
2.
▲
by
aufreak2
16y ago
I downloaded Safari 5 more or less as a routine update, but I must say I'm very pleasantly surprised by its speed and Reader. S5 rocks on Snow Leopard. That said, S5 is still plagued by some of the problems I had with earlier versions - suc
3.
▲
by
aufreak2
17y ago
My mom - yes that's right - my MOM runs Ubuntu on her laptop for email and watching videos off the net. As long as she sees Firefox, she's happy. I recently wiped her machine clean of Windows XP and installed Ubuntu 'cos the virus scanner w
4.
▲
by
aufreak2
17y ago
I think the observation that conditionals are difficult to work with is valid, however the suggestion that "proper use of object oriented principles" is the solution to that problem is totally mistaken. To understand why I say that, watch J
5.
▲
by
aufreak2
17y ago
My comment wasn't JSON specific. After all, the JSON spec was designed to support simple parsing logic from the start. My comment was more oriented towards generalization.
6.
▲
by
aufreak2
17y ago
Indeed. Parsec is a monadic combinator library.
7.
▲
by
aufreak2
17y ago
Each element of the returned list represents one way that the parser can "succeed". For example, if your parser is for the regexp "a+" and you give the string "aaabc", then the parser can return (("a" . "aabc") ("aa" . "abc") ("aaa" . "bc")
8.
▲
by
aufreak2
17y ago
A well documented effort, definitely!
9.
▲
by
aufreak2
17y ago
It looks like modeling your parser as fn(str) -> (list-of (pair-of value remaining-str)) might work out as a more compact (in terms of code) and powerful representation. I did something similar when writing a combinator library for quer