Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bear8642
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
151.
▲
by
bear8642
5y ago
> https://emojipedia.org/smiling-face-with-smiling-eyes/ Following link, I'm surprised there's so many platform specific :) variants
152.
▲
by
bear8642
5y ago
> but that is it. The python demo games that come pre-installed are quite fun. The list includes snake, 15-slide puzzle, and fun flood it clones
153.
▲
by
bear8642
5y ago
Know saying wrongish, but for multi-char-exclusion matching, can't you just do [^chars]? So to search for words without any vowels just 'grep [^aeiou]'?
154.
▲
by
bear8642
5y ago
> operator in regex. regex is not regular expressions - if using NFA to match then you're matching all alternates simultaneously. Russ Cox has good pictures explaining idea in 'Regular Expression Search Algorithms' section
155.
▲
by
bear8642
5y ago
>Lola hardware language Huh - hadn't come across this before but very nice HDL
156.
▲
by
bear8642
5y ago
> of course recursion is impossible. Thought PDP-8 was used extensively for lisp at various locations. Was recursion made possible by allocating memory elsewhere and using spare word as pointer?
157.
▲
by
bear8642
5y ago
> the Emacs info reader Feel Plan 9's Acme editor also an excellent interface - SEE ALSO section links via plumber (right click to view page) - Acme's Font command gives flexibility
158.
▲
by
bear8642
5y ago
What you mean? It extends til 2003
159.
▲
by
bear8642
5y ago
perhaps because you want LALR or other techniques? Can't remember why but my Compilers teacher (Adrian Johnstone, Royal Holloway) doesn't like PEGs - think due to parse forest not being generated?
160.
▲
by
bear8642
5y ago
> all sorts of old protocols, technologies, etc. Indeed - recently discovered the Transputer and Connection Machine and their attempts to build and code parallel machines! More modern examples of retro tech include Chuck Moore's GA1
161.
▲
by
bear8642
5y ago
Fun after the fact. type 1 is fun at the time
162.
▲
by
bear8642
5y ago
Although turing machine tape emulatable via 2 stacks
163.
▲
by
bear8642
5y ago
Could you expand this? Quite like Acme and wondered what you don't like about it
164.
▲
by
bear8642
5y ago
Seems cool - though feel way to hide welcome pane would be nice as seems unnecessary once started and no obvious way to hide
165.
▲
by
bear8642
5y ago
http://www.commandlinefanatic.com/cgi-bin/showpage.cgi?page=... is good deep dive into various topics. Enjoy the gzip explaination Matt might's 'blog' https://matt.might.net/articles/
166.
▲
by
bear8642
5y ago
Found walking through exercises of Clojure Koans useful
167.
▲
by
bear8642
5y ago
> Forth has almost no syntax Feel more Forth has no syntax - just space separated words defined either in assembly or other forth words
168.
▲
by
bear8642
5y ago
Feel some of the new ones you have to know what they are - the printer or the CD disc icon(3rd bottom row) both seem to hide the icon they're representing
169.
▲
by
bear8642
5y ago
Indeed! Very useful for shell wrote as part of OS course last year. Compiling with debug (-g in gcc) lets valgrind report which function's allocating lost memory
170.
▲
by
bear8642
5y ago
you joke, but ed is great if have tiny change to make given compiler output simply just to how fast it loads
171.
▲
by
bear8642
5y ago
Search replace in nano via "Where is" (^W), "Replace" (^R), "Regexp"(M-R).
172.
▲
by
bear8642
5y ago
the yacc and lex tutorial to build hoc is also excellent
173.
▲
by
bear8642
5y ago
Why do you need route? Can't you just use the roads you've got as the base case and then say road(X, Z) :- road(X,Y), road(Y,Z)
174.
▲
by
bear8642
5y ago
You're very welcome. For later exploration, JonesForth < https://github.com/phf/forth/tree/master/x86 > is excellent exploration of Forth's internals. There were quite a few Forth stories a
175.
▲
by
bear8642
5y ago
> a green book Available at site above or via: https://www-cdf.fnal.gov/offline/PostScript/GREENBK.PDF
176.
▲
by
bear8642
5y ago
Leo Brodie's book Starting Forth 's good tutorial
177.
▲
by
bear8642
5y ago
Indeed - and believe a green book existed documenting writing a PS printer driver. Can't find it now but it's not the GREENBK.PDF available in link above, though might peruse that version
178.
▲
by
bear8642
6y ago
Thanks for reminding me of this. It's very useful identifying known patterns and also discovering new patterns by entering random number strings
179.
▲
by
bear8642
6y ago
>lexicon This the text editor? >LISP, or manual garbage collect This Lisp Machine garbage collection = reboot?
180.
▲
by
bear8642
6y ago
why? The confusion?
More ›