Yeah, I’m thinking maybe the more interesting thing would be to just play around with an inform inspired language and reap the learning benefit.
I’m intrigued by the idea of a parser that can be trained on Universal Dependencies grammar trees to be able to parse arbitrary input text quickly to these structured trees:
I’m aware of my naïveté at this phase of investigation, but it could be really cool as a first step to an inform-like parser. It could potentially be much less rigid than the inform parser, though I’m not sure if that would prove an advantage, or contribute to confusion.
I think it depends a lot on how you build the next layer.
If I make any progress on the first step of that, then I’ll start a new thread.