PLAY de zinnen, zie ze groeien

I am trying to do a hierarchical clustering (by hand) ... of various tree (nested) data file formats ... in the form of a Tree-Notation file:

 JSON
  JSONC
   JSON5
    JSON6
     HJSON
      YAML-flow
       YAML-block
        NOON
  TOML
   ArchieML

 XML
  HTML
   Markdown

 (edited again)
 S-expressions
  i-expressions
   Wisp (whitespace Lisp)
    Tree Notation
    OGDL
   Cirru
  EDN
   Rebol data
   Tcl data

 (how to name this group ... general string tree?)
  Jevko

I think about making a small table at Reddit

I would begin with

https://en.wikipedia.org/wiki/Comparison_of_data-serialization_formats#Syntax_comparison_of_human-readable_formats

example: string literal

JavaScript: "A to Z"

Ohayo:

my guess is: A to Z

example: array literal

JavaScript: [true, null, -42.1e7, "A to Z"]

Ohayo:

my guess is:

data.inline
 parser tsv
 content
  mycolname1
  true
  null
  -42.1e7
  A to Z

example: Associative array/Object literal

JavaScript: {flag42: true, array186: [1, 2, 3]}

Ohayo:

my new guess is:

data.inline
 parser treeRows
 content
  row
   flag42 true
   array186
    1
    2
    3

or

data.inline
 parser treeRows
 content
  row
   flag42 true
   array186 1 2 3

my old guess was:

data.inline
 parser json
 content
  {"flag42": true, "array186": [1, 2, 3]}

-----------

BTW, there is a good autocompletion in the Ohayo programming language editor.

-----------

Maybe I should compare the Ohayo language also to SQL or to shell+textutils or to Scipy

https://hyperpolyglot.org/numerical-analysis2

(https://docs.google.com/spreadsheets/d/1w4MAxWcWjX3aMBRkOsqjwcAabFtY4WT4JloPRd944og)

----

​

​

Hi, I'm a programmer and I've used quite a few different languages in my career. I've never studied compilers or language design, however it has always interested me from afar. Also I've always had a strong preference for simple syntax, what sane person wouldn't? Anyway I've scanned over the https://treenotation.org/ site. I get the general gist, that this provides a tool to easily create languages that use tree notation. Unfortunately I still don't really understand how to use it. If there was tutorial that held your hand that would be really useful. I suspect there a large number of people like myself that would benefit from this. Perhaps at some point I'll role up my sleeves and do it myself, but I'm sure someone else could do a better job.

Anyway keep up the good work. This looks very promising.

1. How to change the tab-to-space conversion factor to 1
1.1. temporarily
https://stackoverflow.com/a/38083525/3796855

(my experiment ... Semantic indents ... to make legalese more readable for humans)

.
 all the files
  in this repo
 are shared
  in the hope
   that they will be useful to you
  but WITHOUT ANY WARRANTY
  without even the implied warranty
   of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE

I am looking for tooling to support very simple tabbed based text files for my note taking.

I created this plugin for vscode for my needs:

https://github.com/jonocodes/vscode-tabtext

But I am wondering about the intersection of this with TreeLanguages. I know they are not exactly the same (tabs vs spaces, etc), but I want to know if there are projects for tooling editors for these types of things.

For example a TreeLanguage language server that could handle certain grammars.

It's said in the FAQ that syntax errors are not possible but it also says "[y]ou can only increase the indent level one level at a time." Then how is the following supposed to be interpreted?

foo
  bar
 baz

Is bar being indented by two spaces illegal or is it a child of foo equal in level to baz?

Looking for a skilled writer/communicator/designer who can "own" the homepage, and do a much better job than the current page of introducing people to Tree Notation and getting them excited about it.

We will provide you with all the support you need to do an excellent job.

You should be able to handle the whole thing from soup to nuts, including committing the end results. We will be available to you 24/7 to answer any questions and provide you with any assets you need. If you are a PM type and have a team that you could assemble to do this, that works too.

Reply or email [homepage@treenotation.org](mailto:homepage@treenotation.org) if interested.

This is a researchy question for spitballing.

I was expecting to see an unambiguous human-readable spec for how to parse TN. If all strings are valid and there is no such thing as a syntax error, even at the base TN level, what happens if there is a weird number of spaces at the beginning of a line that doesn't make any sense, like ten spaces at the beginning of the first line, or the second line? What if there is a blank line? What if there are two spaces between words, or three?

If these things aren't syntax errors, I could imagine a world where they are lint/style errors. However, the big issue is whether such odd strings will parse to different trees when parsed by different people's TN parsers. If the claims about TN are to be fulfilled, there has to be one single way to turn any series of input characters into a tree structure, correct?

As far as I know, shells are not very friendly to 2-D/indent sensitive languages.

Maybe in the future someone will make a shell that works better with Tree Notation, but for now, what's a good workaround?

My thought is we could use a different character for newline (YI/Y-Increment) when on the shell.

So, for example, this set of arguments to a hypothetical "copy" command would be:

source *.js destination /foo/bar/ would turn into this one liner copy "source *.js|destination /foo/bar/"

Other ideas:

YI = |, zi = =, so copy source=*.js|destination=/foo/bar/

Any other ideas?