diff --git a/doc/webp-lossless-bitstream-spec.txt b/doc/webp-lossless-bitstream-spec.txt
index bfb870c2..c67f96e5 100644
--- a/doc/webp-lossless-bitstream-spec.txt
+++ b/doc/webp-lossless-bitstream-spec.txt
@@ -866,7 +866,7 @@ stream. This may be inefficient, but it is allowed by the format.
 \[AMENDED2\]
 
 This variant is used in the special case when only 1 or 2 Huffman symbols are
-in the range \[0, 255\] with code length `1`. All other Huffman code lengths
+in the range \[0..255\] with code length `1`. All other Huffman code lengths
 are implicitly zeros.
 
 The first bit indicates the number of symbols:
@@ -877,8 +877,8 @@ int num_symbols = ReadBits(1) + 1;
 
 Following are the symbol values.
 This first symbol is coded using 1 or 8 bits depending on the value of
-`is_first_8bits`. The range is \[0, 1\] or \[0, 255\], respectively.
-The second symbol, if present, is always assumed to be in the range \[0, 255\]
+`is_first_8bits`. The range is \[0..1\] or \[0..255\], respectively.
+The second symbol, if present, is always assumed to be in the range \[0..255\]
 and coded using 8 bits.
 
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@@ -920,7 +920,7 @@ int kCodeLengthCodes = 19;
 int kCodeLengthCodeOrder[kCodeLengthCodes] = {
   17, 18, 0, 1, 2, 3, 4, 5, 16, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
 };
-int code_lengths[kCodeLengthCodes] = { 0 };  // All zeros.
+int code_length_code_lengths[kCodeLengthCodes] = { 0 };  // All zeros.
 for (i = 0; i < num_code_lengths; ++i) {
   code_length_code_lengths[kCodeLengthCodeOrder[i]] = ReadBits(3);
 }