4 ms·
You can write a perfectly isomorphic escaping printer/parser
by quickthrower2 5y ago
You can write a perfectly isomorphic escaping printer/parser
- th0ma5 5y agoObligatory https://xkcd.com/927/ https://xkcd.com/927/ but also all systems would have to be proven correct or else it wouldn't work. "Forgiving" parsers are the norm and you can't rely on what they do deterministically.