It should be easy to prove or disprove that. Use a language description plus an SMT solver. It will either give you a solution (i.e. an ANS.1 that can be parsed in 2 ways) or give a proof of impossibility.
-
-
-
oh I mean I've seen it done correctly, just not in most languages
-
corollary: the sets of rich men and those in Heaven are not totally disjoint
End of conversation
New conversation -
-
-
ASN.1 - keeping debuggers and attackers in business for decades.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Can I haz Earley parser instead?
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.