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)
Lisp can be defined on a single page. A decent constraint satisfaction algorithm is going to be half a page of code. How does Racket come in here?
-
-
Ah right, I see what you mean, after I reread your original tweet :-) yes would be interesting to see.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Though finding a compact way to define a programming language can be done in racket, as it's a language designed to create programming languages, some might say a language oriented programming language.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.