Show HN: The Blots Programming Language(blots-lang.org)
blots-lang.org
Show HN: The Blots Programming Language
https://blots-lang.org/
14 comments
For contrast, here's how I'd handle the example given on the front page in Lil[0]:
The biggest difference here is how Lil handles indexing: The ".." in that second line can be read as "for every index"; a wildcard. I can follow the mapping that occurs in Blots' "via" expression, but I find it less clear in this example.
It can also be nice to treat lists-of-objects as proper SQL-like tables:
[0] http://beyondloom.com/tools/trylil.html
i:"%j" parse shell["curl -s https://api.weather.gov/gridpoints/BOU/63,62/forecast"].out
t:i.properties.periods..temperature
o.average:(sum t)/count t
o.minimum:min t
o.maximum:max t
show[o]
The biggest difference here is how Lil handles indexing: The ".." in that second line can be read as "for every index"; a wildcard. I can follow the mapping that occurs in Blots' "via" expression, but I find it less clear in this example.
It can also be nice to treat lists-of-objects as proper SQL-like tables:
select number name temperature windSpeed from table i.properties.periods
+--------+-------------------+-------------+---------------+
| number | name | temperature | windSpeed |
+--------+-------------------+-------------+---------------+
| 1 | "This Afternoon" | 54 | "14 mph" |
| 2 | "Tonight" | 46 | "3 to 12 mph" |
| 3 | "Wednesday" | 69 | "5 mph" |
| 4 | "Wednesday Night" | 45 | "3 mph" |
| 5 | "Thursday" | 79 | "5 mph" |
| 6 | "Thursday Night" | 49 | "5 mph" |
| 7 | "Friday" | 83 | "2 to 6 mph" |
| 8 | "Friday Night" | 52 | "6 mph" |
| 9 | "Saturday" | 81 | "3 to 8 mph" |
| 10 | "Saturday Night" | 53 | "3 to 8 mph" |
| 11 | "Sunday" | 81 | "3 to 7 mph" |
| 12 | "Sunday Night" | 54 | "3 to 7 mph" |
| 13 | "Monday" | 77 | "3 to 7 mph" |
| 14 | "Monday Night" | 53 | "3 to 7 mph" |
+--------+-------------------+-------------+---------------+
[0] http://beyondloom.com/tools/trylil.html
This is the sort of thing I use Nushell for, brilliant data focus shell!
Now I'm on the computer this is the Nushell variant, you could probably do something with reduce too:
~> http get https://api.weather.gov/gridpoints/BOU/63,62/forecast
| from json
| get properties.periods.temperature
| {average: ($in | math avg) minimum: ($in | math min) maximum: ($in | math max)}
╭─────────┬───────╮
│ average │ 66.36 │
│ minimum │ 52 │
│ maximum │ 81 │
╰─────────┴───────╯
~>wow that sql like code is really impressive
Lil is such a beautiful language. It’s so much fun for little data tasks like this.
From the readme:
[1, 2, 3] * 10 // [10, 20, 30] (because [1 * 10 = 10, 2 * 10 = 20, 3 * 10 = 30])
[4, 5, 6] > 3 // true (because [4 > 3 = true, 5 > 3 = true, 6 > 3 = true], so the condition is true for all elements)
[true, true, true]
Hey! I've received this feedback from a few different people, and I agree with it. The latest version of Blots (0.8.0) changes the behavior of broadcast comparisons. Now, comparisons are applied to each element in the list, producing a new list of booleans. As you pointed out, this better matches the broadcasting behavior of arithmetic operators:
``` [1, 2, 3] * 10 // [10, 20, 30] [10, 20, 30] + 2 // [12, 22, 32] [4, 5, 6] > 3 // [true, true, true] [1, 2] == [2, 2] // [false, true] ```
In addition, I’ve added both `all` and `any` as built-in functions. These can be used to achieve the same result as the previous broadcasting behavior:
``` [4, 5, 6] > 4 into all // false [4, 5, 6] > 4 into any // true
// alternatively: all([4, 5, 6] > 4) // false any([4, 5, 6] > 4) // true ```
Thanks for the feedback!
``` [1, 2, 3] * 10 // [10, 20, 30] [10, 20, 30] + 2 // [12, 22, 32] [4, 5, 6] > 3 // [true, true, true] [1, 2] == [2, 2] // [false, true] ```
In addition, I’ve added both `all` and `any` as built-in functions. These can be used to achieve the same result as the previous broadcasting behavior:
``` [4, 5, 6] > 4 into all // false [4, 5, 6] > 4 into any // true
// alternatively: all([4, 5, 6] > 4) // false any([4, 5, 6] > 4) // true ```
Thanks for the feedback!
What would you say is a benefit of using this over using jq?
Good question! Personally, I don't often reach for jq as I've never really taken the time to get comfortable with its syntax. Obviously I can now have an LLM generate me a jq command that'll do what I want, but I'd prefer to be able to at least visually scan the suggested implementation to make sure it actually does the thing I want before I go and run it.
More broadly, a lot of other command line utils for transforming input have such an emphasis on terseness that I sort of bounce off of them. awk and sed and jq are all super powerful tools, but I wanted a tool that had a more balanced trade-off of characters vs. clarity.
More broadly, a lot of other command line utils for transforming input have such an emphasis on terseness that I sort of bounce off of them. awk and sed and jq are all super powerful tools, but I wanted a tool that had a more balanced trade-off of characters vs. clarity.
Super cool! I’ve always wanted to make my own lil language and I’ve always been too intimidated to try.
Start with writing a custom cpu emulator -> machine code -> assembler -> compiler
Sounds hard but it's quite easy with stack architecture :) Easier than learning JS for sure
Sounds hard but it's quite easy with stack architecture :) Easier than learning JS for sure
nowadays it is somewhat easier to make your own programming language, than it was 10 to 20 or 30 years ago, because there are a lot of resources such as tutorials and open source projects available on the internet, in both text and video formats, to learn from. there are also many online forums where you can ask questions and get answers and advice.
I’m curious, what was the hardest part about making Blots? And what was the most fun part?
Blot on the landscape was a brilliant subversive comedy British TV series from the 80s.
Would really appreciate any feedback about the syntax, docs, features that are glaringly missing, etc. Before anybody mentions it: I know the performance is pretty lousy when dealing with a lot of data. If you can believe it, the runtime is about 100x faster than it used to be! Long term I'd like to switch to a proper bytecode interpreter, but so far performance has been Good Enough for my use cases.
Thanks for taking a look!