generated from mwc/lab_encoding
questions.md
This commit is contained in:
@@ -128,6 +128,9 @@ In a 1+7-bit sign-and-magnitude representation for integers, negative zero is re
|
|||||||
'a' after reading 8 bits but after reading the first 8 bits of 'ñ', the
|
'a' after reading 8 bits but after reading the first 8 bits of 'ñ', the
|
||||||
decoder realizes it needs to read 8 more bits.
|
decoder realizes it needs to read 8 more bits.
|
||||||
|
|
||||||
Make a hypothesis about how this could work.
|
Make a hypothesis about how this could work. There's a utf8 table to match bit patterns with, that the decoder invokes.
|
||||||
|
https://www.utf8-chartable.de/unicode-utf8-table.pl?number=1024&utf8=bin, represents such a table. When the table reaches the last
|
||||||
|
bit pattern of the first byte, without finding a match, there must be a control character that invokes the second byte,
|
||||||
|
and so forth. I believe this is an html function. <!--?xml version="1.0" encoding="utf-8"?--> is the first line for that webpage.
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user