I like how Loreline transpiles to multiple languages. I wonder why a transpire to Inform 6 or Inform 7 has not already been done as it seems an easy conceptual leap. Perhaps I don’t fully understand the use cases here.

This was written in 2008. Has Ur-Scheme received any love since then ?

Does ghostty support single duplex ? I couldn’t find out.

Also, does it support visible control characters ? EXACT EMULATION ? 3270 ? VT-105 ? VT-220 ? VT-320 ? VT-420 ? SIXEL ? NAPLPS ?

I know this a nice square grid, but how do you make a hex grid, (not the hex in the drop down) or even a page of some other tessellating shape ?

What is the Oxford flowers dataset ? Where is it available ?

Does the SMILE (or Simplified Molecular Input Line Entry System) code have an EBNF definition ? https://en.wikipedia.org/wiki/Simplified_Molecular_Input_Lin... Claims there is a context free grammar.

That's "SMILES".

Yes. Here is the yacc grammar for the SMILES parser in the RDKit. https://github.com/rdkit/rdkit/blob/master/Code/GraphMol/Smi...

There's also one from OpenSMILES at http://opensmiles.org/opensmiles.html#_grammar . It has a shift/reduce error (as I recall) that I was not competent enough to fix.

I prefer to parser almost completely in the lexer, with a small amount of lexer state to handle balanced parens, bracket atoms, and matching ring closures. See https://hg.sr.ht/~dalke/opensmiles-ragel and more specifically https://hg.sr.ht/~dalke/opensmiles-ragel/browse/opensmiles.r... .

Oh, I should have pointed out my Python lexer-driven parser at https://hg.sr.ht/~dalke/smiview/browse/smiview.py

The lexer: https://hg.sr.ht/~dalke/smiview/browse/smiview.py?rev=tip#L3...

The lexer state transitions: https://hg.sr.ht/~dalke/smiview/browse/smiview.py?rev=tip#L3...

I wrote a very simple SMILES parser using pyparsing https://github.com/dakoner/smilesparser/tree/master I wouldn't say it's intended for production work, but it has been useful in situations where I didn't want to pull in rdkit.

I see you include the dot disconnect "." as part of the Bond definition.

You also define Chain as:

  Chain <<= pp.Group(pp.Optional(Bond) + pp.Or([Atom, RingClosure]))

I believe this means your grammar allows the invalid SMILES C=.N

To quote from the page: id: flags type: u1

This seems to say flags is a sort of unsigned integer.

Is there a way to break the flags into big endiaN bits where the first two bits are either 01 or 10 but not 00 or 11 with 01 meaning DATA and 01 meaning POINTER with the next five bits as a counter of segments and the next bit is 1 if the default is BLACK and 1 if the default is WHITE ?

Appears so: https://doc.kaitai.io/user_guide.html#_bit_sized_integers

So if the vibes are wild, I’m not a hippie but an AI ? Cool. Is that an upgrade or &endash; or not ?

What tool do you use to make such a video ?

On macOS it's built in. The screenshot tool can do it. For more professional work I use ScreenFlow.

I think the fact that the line protocol for DEC VT terminals is as the ANSI X3.64 standard is why the issue hasn’t been addressed or modernized

See https://en.m.wikipedia.org/wiki/ANSI_escape_code