BRbreck·Feb 9, 2021Submission
Licenses are for losers. The public domain game is the only game that matters
1 points · Open discussionbreck7
scrollsdk
JavaScript2017–2021
breck7 / scrollsdk
scrollsdk
The code for Particles and Parsers, which Scroll is built on.
5Distinct people
25Mentions
0Explicit recommenders
387GitHub stars
What to know before exploring
What it is
The code for Particles and Parsers, which Scroll is built on.
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by year25 dated mentions
Observed mentions: 2017-06-21 16:57:05 UTC to 2021-02-09 14:39:45 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| 2017 | 2017-01-01 00:00:00 UTC | 2018-01-01 00:00:00 UTC | 4 | 0 | 4 |
| 2018 | 2018-01-01 00:00:00 UTC | 2019-01-01 00:00:00 UTC | 0 | 0 | 0 |
| 2019 | 2019-01-01 00:00:00 UTC | 2020-01-01 00:00:00 UTC | 18 | 3 | 15 |
| 2020 | 2020-01-01 00:00:00 UTC | 2021-01-01 00:00:00 UTC | 1 | 0 | 1 |
| 2021 | 2021-01-01 00:00:00 UTC | 2022-01-01 00:00:00 UTC | 2 | 2 | 0 |
What Hacker News says
25 sourcesShow HN: Stamp turns a folder into a plain text file and a file into a folder
195 points · Open discussion> Today, if I want to store data for my application, I have a choice between good support for rich object types and connections (e.g., Postgres), or good support for history and merging (e.g., Git). There's no one system that provides both.
I like the way you put this. In case anyone's interested in brainstorming I'm dabbling in this problem with a thing called TreeBase (https://jtree.treenotation.org/treeBase/). It's still a toy at this point, but it stores richly typed data as plain text files to leverage git for history and merging and then can use SQLite (or others) for querying and analysis. A very simple database in the wild looks like this: https://github.com/treenotation/jtree/tree/master/treeBase/p...
In Is Git Irreplaceable? (2019)> It seems like a tool for creating a new DSL (or language)
Yes.
> But I am not quite understand how to do it (even though I watched the YouTube video).
I'm sorry for the poor documentation. This is helpful feedback, thanks.
Any suggestions on how to improve? I'm thinking about doing a live 1 hour office hours each week on YouTube or Twitch, where I'd be available to help people create new Tree languages, and then could record those sessions, and learn what the common problems are. Do you think that might be helpful? I do that in person a lot, and seems to be very helpful, so perhaps could scale that.
> Could you write some document for how to create a DSL using the Tree Notation?
I started a document here: https://github.com/treenotation/jtree/blob/master/languageCh...
It looks a tiny bit out of date (the older version of Grammar allowed
Read the rest
you to not specify the "keyword" that matched a word, so you now need to specify that). The bulk of it is correct. In general, I like to start by writing sample programs, and then working on the Grammar file after that.
In the Tree Language Designer (https://jtree.treenotation.org/designer/), you type a sample program in the right box, and then click "Infer Prefix Grammar" for that class of grammars, and it will generate the start of a Grammar for you. That currently only works (partially) for prefix grammars. If you want to design a postfix language, or omnifix language, or something more esoteric, then it probably won't be so helpful.
Can you share some more about the language you want to create? I could help you get it started.
> Who said they aren't needed?
The first good implementation I'm aware of is Egil Möller's from 2003 (https://srfi.schemers.org/srfi-49/srfi-49.html). My independently researched prediction in 2017 was that no one will ever discover a place where parens or other visible syntax is needed. That sets up an easy proof by contradiction (and I've built a database of over 10k languages so far, looking for a single scenario where you would need them, and haven't found one yet). Here are 19 demo languages covering lots of scenarios demonstrating utility without parens (https://github.com/treenotation/jtree/tree/master/langs). A glaring hole though, now that I think about it, is that I don't have a good Lisp-like Tree Language. I think a Bel Tree Language would be an excellent example project (and I'm happy to assist anyone who wants to make an att
Read the rest
empt, and if no one has the bandwidth and it's not done by next year perhaps I'll find the time to give it a go).
> They are the structure that supports Lisp's simplicity and consistency, which is what all the good things come from.
I agree with this, but would say they are "one" structure, not "the", and that there are other options (I have one idea in tree notation, but not ruling out that there are more, perhaps better ones).
> If you take them out, it gets complicated and isn't worth it.
I agree with this, but think there is a future tipping point related to tooling. Tree Notation was quite terrible 2 years ago, but now with type checking, syntax highlighting, autocomplete, I hate to use Lisp and other languages (everything feels unfinished, because I know the syntax characters can be removed).
I think we'll hit a tipping point where the tooling for Lisp without parens is good enough that the benefits of dropping them make dropping them a no-brainer. Could I be wrong? Sure, it's a forecast/prediction. But I want to encourage people to invent new alternatives, to try everything under the sun, and not to settle that they are somehow needed. We can make it better.
Hmm, I still can't reproduce (screenshot added here: https://github.com/treenotation/jtree/issues/88)
Do you mind sharing your OS/Browser/Device? Any errors in dev tools console? Possible to send a screenshot?
In Show HN: SweeperCraft – design your own Minesweeper boardOh no! I'm unable to reproduce. Could you share the game url you played?
https://github.com/treenotation/jtree/issues/88
In Show HN: SweeperCraft – design your own Minesweeper boardThis is a sample app for a new type of web framework we are working on: https://github.com/treenotation/jtree/tree/master/treeCompon...
The long term vision is 1 syntax for web components, html, css, javascript, etc. All state should be viewable/dumpable via a simple toString() method.
Feedback on either is welcome!
In Show HN: SweeperCraft – design your own Minesweeper boardIt’s a good question. This paper hints at the reason: https://github.com/treenotation/jtree/blob/master/papers/pap...
First, jtree is a bit orthogonal as that’s just an implementation. The github issue is there for convenience, it’s arbitrary.
The reason for tree notation is that it’s a level up from binary. Binary notation does not give you the ability to define new symbols. Tree notation is a 2d binary. You can define new abstractions. It is a bridge between human and machine languages.
Take any concept in mathematics, such as “derivative”. How would you define such a concept, starting only from 1s and 0s? Tree notation gives you a method to do that, in a way that’s not only efficient (noiseless), but also gives you practical tools, like complexity counting.
In Number theorist fears many proofs widely considered to be true are wrongAnyone interested in this topic, I have a prediction that the time is right for a new math, that starts from just 1 and 0, and builds every symbol up in a rigorous way.
We're working on the infrastructure to make such a thing easier, but the project does not currently have a leader: https://github.com/treenotation/jtree/issues/83
In Number theorist fears many proofs widely considered to be true are wrong> A 'minor' is a societal construct that varies over cultures and time.
Agreed. And if a war, plague, or comet wipes out 80% of the population tomorrow, suddenly "minors" will be 13, and no one of these people so adamant here will bat an eye.
Here's a chance to have a reasoned debate about an important issue, where constructive conversations and solutions could be devised. But instead, the conversation devolves into a flame war.
If anyone is interested in spitballing some type of new novel restrictive grammar to enable having constructive conversations about hot-button issues, I'd love to help: https://github.com/treenotation/jtree/issues/52
In Richard M. Stallman resignsWhoops! Thanks for the reminder. We can get this fixed. https://github.com/treenotation/jtree/issues/63
In A hierarchy of software engineering discourseYou might be interested in our project (https://treenotation.org). Gone are all syntax characters like {}[](), which turn a 1D stream of tokens into an AST. Instead you simply write your source in 2-dimensional notation.
Makes it far easier to build new DSLs. (Evidence: see all the DSLs in GitHub.com/treenotation/jtree/langs)
In A hierarchy of software engineering discourseProgramming Option for Overtired Parents
2 points · Open discussion> Is there a document like this for your tree notation?
I wish. We have a lot of ongoing threads about it. Someone has one somewhere for logic gates, IIRC.
Here's a snippet from 1 from a conversation the other day on how to build up to an if statement.
0
1
2 10
...
i 01101001
...
f 01100110
...
if 1
2
Obviously that's not ideal but hopefully some more data on what we are talking about with that.
The idea is we'd like to be able to compare 2 systems objectively and decide which is the simpler one.
Here's a rough paper from 2017 (before I had any experience in academia):
https://github.com/treenotation/jtree/blob/master/papers/pap...
In The Human Brain Can Create Structures in Up to 11 DimensionsShowing the 15 most recent of 25 sources. Enable JavaScript to search and browse every indexed mention.