2 ms·
It seems you've independently rediscovered extensible programming which had seen much research in the past and again a few years back. There have been a number
by forgotpwd16 8y ago
It seems you've independently rediscovered extensible programming which had seen much research in the past and again a few years back. There have been a number of languages that did same thing as in your tweet (e.g. [1]) but most aren't developed anymore.
[1]: http://seed7.sourceforge.net/examples/declstat.htm http://seed7.sourceforge.net/examples/declstat.htm
- ndh2 8y agoNeat, another one for my list. Seed7 allows the extension of the grammar [1]. The compiler understands a simple EBNF which doesn't distinguish between different non-terminals. The semantic checks and the transformation into a known AST are deferred to another stage. [1]: http://seed7.sourceforge.net/manual/syntax.htm http://seed7.sourceforge.net/manual/syntax.htm