I knew @borkdude was accomplishing magic with by using GraalVM, but I finally got around to actually looking up what Graal is. I had no idea it was specifically an holy graail on the JVM, emphasizing polyglot languages! https://www.graalvm.org/docs/introduction/
More top-shelf work from @borkdude ! Checking it out now to see if it explains the miracle of graal. Wait... they have a page for that... enlightenment.... thanks for leading the way, borkdude!
---
RT @borkdude
Made a project which uses #clojure http://tools.build and #babashka together. It has shared code for both runtimes and prevent unnecessary rebuilds.
E.g. bb jar or bb uber immediately quit within milliseconds if there is nothing to…
https://twitter.com/borkdude/status/1436270849850581000
@DeveloperMemes This hits me so hard...
RT @Endless_WebDev
@AlexandriasTech I've never thought that regular expressions were special to Linux. That said, I use them about every hour. They are part of how I navigate around my system and my files, not to mention find and replace goodness. Having a good editor helps, though, so you aren't regexing blind.
@icedquinn How is Julia? That's one of those languages where I wouldn't even recognize its code of it was before me. Still the best for numerics, or are Go or Rust in the running? Or possibly even Python?
RT @threadreaderapp
@Endless_WebDev Hello, you can read it here: ⚡ Every Web Developer should know and use WebP images The WebP image… https://threadreaderapp.com/thread/1435908800989601792.html See you soon. 🤖
@alcinnz
My memory suggested that context-sensitive grammars don't quite require the full powers of a Turing machine, so I thought I'd check your claim that they require a "full computer".
I was right: context-sensitive grammars require only a linear bounded automaton, which has only a finite tape, in contrast to a Turing machine's infinite tape.
But you were right, too! As Wikipedia points out, real-world computers do, in fact, have finite memory, so a linear bounded automaton is a better model of a real computer than a Turing machine is!
RT @Anita_ihuman
Random person: if you are not paid for contributing to open Source, why do you keep doing it.
Me:
- the experience is life changing
- the network I have built is long lasting
- Self satisfaction of being a part of something big 😌
#opensource #community #FOSS
@icedquinn Oh, I understand that. So much learning that probably will have 0 value after this project... that's web scraping for you.
There's multiple tiers with which to classify how much computational power is required to parse a given language/format/protocol. Whether it's binary or textual doesn't make a significant difference.
A "regular" grammar can be expressed as a state machine (a "finite automaton"), where parsing involves treating the input text as a path though the labelled graph.
A "pushdown automaton" adds a callstack.
Context-dependant grammers require a full computer.
1/?
@hans_w as in, the datastructure underlying code representations in the machine?
@icedquinn They must really not want you scraping them!
As a software engineer I frequently encounter things that make me say, "Nice! I can tell a lot of work went in to that." Or other times, "what a clever use of that technique!" But on occasion there is something that just works like magic and I am left with no clue how that was even possible.
For me this includes
- exwm
- git diff
- email
- web sockets
How about you? What is some Magic Tech software in your book?
@icedquinn sounds like you are trying to scrape stuff, if you need automation tools?
@icedquinn web apps should use javascript; that's what it is for, and it is a decent language. But the VAST majority of websites are not web apps, and shouldn't try to be.
RT @jasonbosco
Even more content:
@iantien from @Mattermost
@MarkoSaric @ukutaht from @plausible
@sebastienlorber from @docusaurus
@kohsukekawa from @jenkinsci
@saturn4me from @cap_rover
@nicolas_hrd from @QuestDb
@sqs from @sourcegraph
Full Stack Clojure web app engineer