It's strange that printing is so amenable to composable overloading in most programming languages, yet parsing is not. They are inverses.
-
-
Simple example: f(a,b) {((a==0) <=> (b==1)) && ((a==1)<=>(b==0))}
-
Perhaps the overhead of something like this could be acceptable in mainstream programming, versus costly full-program backtracking.
End of conversation
New conversation -
-
-
Indeed, it's possible to write reversible parsers in Prolog, e.g. http://packs.ndrix.com/bencode/index.html …
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.