EBNF for any given code of a character encoding that I am designing:
(10|11)(({(00|01)}(0000|0001|0010|0011|0100|0101|0110|0111|1010|1011|1110|1111){(10|11)}(1000|1001|1000|1101))|({(10|11)}(0000|0001|0100|0101|1000|1001|1010|1011|1100|1101|1110|1111){(00|01)}(0010|0011|0110|0111)))
possible number of values per number of bits = [number of bits - 4] [2 ^
(number of bits ÷ 2)]
possible number of values per number of bits and codes with fewer bits
than it = 64 + [number of bits - 6] [2 ^ (number of bits ÷ 2 + 1)]
note: circumflex accent sign expresses exponentiation
decode:
1.
