UTF-8 decoder capability and stress test----------------------------------------Markus Kuhn <mkuhn@acm.org> - 1999-04-28This test text examines, how UTF-8 decoders handle various types ofcorrupted or otherwise interesting UTF-8 sequences. According to ISO10646-1, sections R.7 and 2.3c, a device receiving UTF-8 shallinterpret a "malformed sequence in the same way that it interprets acharacter that is outside the adopted subset".Test sequences (all enclosed in ""):Correct UTF-8 text (Greek word 'kosme'): "+|b+|-a+++|"Correct 2-byte sequence (U+00000080): "-C"Correct 3-byte sequence (U+00000800): "aaC"Correct 4-byte sequence (U+00010000): "EECC"Correct 5-byte sequence (U+00200000): "oeCCC"Correct 6-byte sequence (U+04000000): "naCCCC"Correct 2-byte sequence (U+000007ff): "#+"Correct 3-byte sequence (U+0000ffff): "N++"Correct 4-byte sequence (U+001fffff): "=+++"Correct 5-byte sequence (U+03ffffff): "+++++"Correct 6-byte sequence (U+7fffffff): "2+++++"Correct 2-byte sequence (U+0000): "+C"Correct 3-byte sequence (U+0000): "aCC"Correct 4-byte sequence (U+0000): "ECCC"Correct 5-byte sequence (U+0000): "oCCCC"Correct 6-byte sequence (U+0000): "nCCCCC"Unexpected continuation byte (10000000): "C"Another lonely continuation byte (10111111): "+"Sequence of 2 unexpected continuation bytes: "C+"Sequence of 3 unexpected continuation bytes: "C+C"Sequence of 4 unexpected continuation bytes: "C+C+"Sequence of 5 unexpected continuation bytes: "C+C+C"Sequence of 6 unexpected continuation bytes: "C+C+C+"Sequence of 7 unexpected continuation bytes: "C+C+C+C"Sequence of all 64 possible continuation bytes (10000000-10111111):"CUeaaaaceeeiiiAA EaAooouuyOUcLYRf aiounNao?--24!<> ###||||++||+++++"Sequence of all 32 first bytes of 2-byte sequences (11000000-11011111),each followed by a space character:"+ - - | - + | | + + - - | - + - - - - + + + + + + + + # # [ ] # "Sequence of all 16 first bytes of 3-byte sequences (11100000-11101111),each followed by a space character: "a b r p E o u t * o n o % 0 E N "Sequence of all 8 first bytes of 4-byte sequences (11110000-11110111),each followed by a space character: "E + > < r j % = "Sequence of all 4 first bytes of 5-byte sequences (11111000-11111011),each followed by a space character: "o * . + "Sequence of all 2 first bytes of 6-byte sequences (11111100-11111101),each followed by a space character: "n 2 "Impossible byte (11111110): "*"Impossible byte (11111111): " "2-byte sequence with last byte missing: "+"3-byte sequence with last byte missing: "aC"4-byte sequence with last byte missing: "ECC"5-byte sequence with last byte missing: "oCCC"6-byte sequence with last byte missing: "nCCCC"All these 5 sequences with last byte missing concatenated:"+aCECCoCCCnCCCC"
digital man

This Is Spinal Tap quote #17:
David St. Hubbins: It's such a fine line between stupid, and uh... and clever. Norco, CA WX: 79.0oF, 54.0% humidity, 14 mph ESE wind, 0.00 inches rain/24hrs --- SBBSecho 3.07-Linux
* Origin: Vertrauen - [vert/cvs/bbs].synchro.net (1:103/705)