Far easier is it for a camel to parse through the eye of a needle, than for ASN.1 to be parsed decideably.
-
-
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.
1 reply 0 retweets 1 like -
oh I mean I've seen it done correctly, just not in most languages
2 replies 0 retweets 0 likes
corollary: the sets of rich men and those in Heaven are not totally disjoint
9:13 AM - 10 May 2018
0 replies
0 retweets
3 likes
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.