njmason22/lab_encoding
1
0
Fork 0
generated from mwc/lab_encoding
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

questions.md

Browse Source
This commit is contained in:
njmason22
2026-03-09 09:40:55 -04:00
parent ba4fb7e214
commit 2ce36c1248
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
questions.md
View File

@@ -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
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.