Rearranged wording to stay under 72 character limit

2 files changed, 6 insertions, 6 deletions

diff --git a/docs/draft-alakuijala-brotli-07.nroff b/docs/draft-alakuijala-brotli-07.nroff
index b4292bb..25e394e 100644
--- a/docs/draft-alakuijala-brotli-07.nroff
+++ b/docs/draft-alakuijala-brotli-07.nroff
@@ -1741,9 +1741,9 @@ The decoding algorithm that produces the uncompressed data is as follows:
          read distance context map, CMAPD[]
       else
          fill CMAPD[] with zeros
-      read array of prefix codes for literals, HTREEL[]
-      read array of prefix codes for insert-and-copy lengths, HTREEI[]
-      read array of prefix codes for distances, HTREED[]
+      read array of literals prefix codes, HTREEL[]
+      read array of insert-and-copy lengths prefix codes, HTREEI[]
+      read array of distances prefix codes, HTREED[]
       do
          if BLEN_I is zero
             read block type using HTREE_BTYPE_I and set BTYPE_I
diff --git a/docs/draft-alakuijala-brotli-07.txt b/docs/draft-alakuijala-brotli-07.txt
index cf4c09c..6ec8669 100644
--- a/docs/draft-alakuijala-brotli-07.txt
+++ b/docs/draft-alakuijala-brotli-07.txt
@@ -1854,9 +1854,9 @@ Internet-Draft                   Brotli                     October 2015
 
          else
             fill CMAPD[] with zeros
-         read array of prefix codes for literals, HTREEL[]
-         read array of prefix codes for insert-and-copy lengths, HTREEI[]
-         read array of prefix codes for distances, HTREED[]
+         read array of literals prefix codes, HTREEL[]
+         read array of insert-and-copy lengths prefix codes, HTREEI[]
+         read array of distances prefix codes, HTREED[]
          do
             if BLEN_I is zero
                read block type using HTREE_BTYPE_I and set BTYPE_I