asrp

11 ms·

61.
by asrp 9y ago
I have a number of projects that make use of self-reference. Although not using the particular method in this article and instead of passing code through an interpreter, it passes some first-thing into a second-thing which gives another fir
62.
The chicken or the egg problem in bootstrapping(asrp.github.io)
1 points by asrp 9y ago|0 comments
63.
by asrp 9y ago
I just read a good chunk of your article. Could you give an idea of what the graph and interface would look like if the language we want to write in is Lisp? It is indeed very string that we've settled on character based editors for ma
64.
by asrp 9y ago
Maybe I should have used a different title. This is half about making a GUI toolkit and half about a GUI toolkit maker.
65.
Making a GUI toolkit(asrp.github.io)
1 points by asrp 9y ago|1 comments
66.
by asrp 9y ago
I switched to fish a bit more than a year ago. I used to have a script with shorthands of frequently used long commands because I just couldn't get to them easily enough with bash's ctrl+r. Now with fish, I don't need that an
67.
by asrp 9y ago
Yeah, I was also thinking along those lines when writing my comment. That there trade-offs are like those in a Huffman tree. So one easily accessible/expresible feature means many more distant ones. Has someone thought and wrote about
68.
by asrp 9y ago
Same here about finding resources for language design. I wish there was some course that could teach me language design so that I can (better) predict how my decisions will affect the final result. Plus how much can reasonably I "pack&
69.
by asrp 9y ago
How would Google Calendar know the event is at 4pm in California ? Is the location field filled with enough information? If not, that seems like almost as much work as entering the timezone. This did happen to me with daylight saving a whi
70.
by asrp 9y ago
Well, you can already have half of a split unicode character at the beginning and end of a substring in the rope. If that doesn't happen (like in the "parens" or "other" description), to use CYK, I think you could m
71.
by asrp 9y ago
This write up is really good! Are there similar write-ups for things other than text editors? I wonder if only wanted a printable character ASCII editor would simplify things a lot or only a little. And I guess no tabs. > Part 2 Line bre
72.
by asrp 9y ago
This reminds me a bit of auto-sklearn[1] for automatically select the machine learning algorithm to use and its parameters (and so isn't quite doing it at code level like this one). [1] https://github.com/automl/au
73.
by asrp 9y ago
I think the biggest difference is the funding went from unrestricted to being very specific. A lot of questions are asked before money is given. But the answers for an interesting project may involve concepts and vocabulary that do not yet
74.
by asrp 10y ago
I think Inkscape uses Cairo for rendering. So eventually Cairo. P.S., thanks for answering some of the questions in here! Guess I should reformulate that last part.
75.
by asrp 10y ago
I, um, recorded my screen while a loop was running to change values. Its a bit of a hack.
76.
by asrp 10y ago
How come there are so many posts of this within a short period? https://news.ycombinator.com/item?id=14058502 (2 days ago) https://news.ycombinator.com/item?id=14074622 (2 days ago)
77.
by asrp 10y ago
Which greedy algorithm do you mean? I meant that bipartite matching was enough for getting the answer, not that the two are equivalent.
78.
by asrp 10y ago
This wasn't my intention. I hope the feeling subsides! I did try to keep it short although some parts still (fortunately) shows how to come to those conclusion. That might give it the impression of being smart but the presentation is d
79.
Visual explanation of the last Google Codejam 2017 question(asrp.github.io)
73 points by asrp 10y ago|31 comments
80.
by asrp 10y ago
Hi! So right now, I can write the grammar G1 for a language L1 in Ohm and parse strings written in L1 by putting them in examples. If L1 is a language for describing grammars (such as a Ohm with a slightly different syntax), one of the &quo
81.
by asrp 10y ago
I wish the Ohm editor allowed custom grammars for describing the grammar. In fact, I wish more projects based on Ometa and Ohm allowed this so there's a better chance they can bootstrap each other. Of course, some semantics might still
82.
by asrp 10y ago
Is there no audio for any of the videos or is that just my browser?
83.
by asrp 10y ago
This reminds me of "Latency Numbers Every Programmer Should Know" https://gist.github.com/jboner/2841832 Edit: Just realized halfway through that there's already a link to this from their page!
84.
by asrp 10y ago
There's the Ohm editor now. https://ohmlang.github.io/editor/ Ohm is the successor of Ometa. The editor shows which portion of the string are matched by each rule.
85.
by asrp 10y ago
By going to the other extreme, you can use only precedence climbing (with just a grammar) by using Floyd's algorithm, which will treat all tokens as operators. It uses two precedences functions instead of one, a left and right preced
86.
by asrp 10y ago
I've found parser expression grammars (PEG) to be a good solution to avoiding the ambiguity stated at the very beginning. This is done by making all choices (|) into ordered choices . I've recently used PEGs to write a Python par
87.
by asrp 10y ago
This release is a bit early but it does run just fine, at least for the tests I did. I thought I'd make it available today because of recent interest in similar topics [1, 2]. I didn't think it was possible to get the whole thing
88.
Show HN: Build python ASTs in 502 lines of python without using modules(github.com)
2 points by asrp 10y ago|1 comments
89.
by asrp 10y ago
This project is related to a "life hack" of sorts where you get to process more information by listening to it read aloud. In this case its by a computer using the espeak speech synthesizer. One way is to skim text by setting the
90.
Show HN: Espeakui – a text-to-speech interface with mplayer-like bindings(github.com)
4 points by asrp 10y ago|1 comments

More ›