Did anyone build a programming language parser by automatically solving a constraint satisfaction problem that maps a handful of exhaustive examples of the desired language to a small Lisp? (I am looking for the a compact way to define a programming language)
-
-
Replying to @Plinz
A EBNF generator would be that. You could expand the generated EBNF to lambda expressions. But EBNF-by-example is difficult. Smells like it will require some machine learning ingredients.
1 reply 0 retweets 1 like
Replying to @0rb1t3r
There is only going to be a single consistent solution (but many possible implementations), so gradient descent may not work.
4:57 AM - 13 Jul 2018
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.