fixed some comments.

QRCodeGenLib/src/QRCodeGen/QlpBitBuffer.pas

@@ -19,7 +19,7 @@ resourcestring
 type
 
   /// <summary>
-  /// An appendable sequence of bits (0s and 1s). Mainly used by <see cref="QlpIQrSegment">
+  /// An appendable sequence of bits (0s and 1s). Mainly used by <see cref="QlpQrSegment">
   /// TQrSegment</see>.
   /// </summary>
   TBitBuffer = record
@@ -33,10 +33,10 @@ type
     function GetBitLength: Int32; inline;
 
     /// <summary>
-    /// method to check if <c>BitBuffer</c> record is initialized or not.
+    /// method to check if <c>TBitBuffer</c> record is initialized or not.
     /// </summary>
     /// <exception cref="EInvalidOperationQRCodeGenLibException">
-    /// if <c>BitBuffer</c> is not initialized.
+    /// if <c>TBitBuffer</c> is not initialized.
     /// </exception>
     procedure CheckBitBufferState(); inline;
 

QRCodeGenLib/src/QRCodeGen/QlpQrTemplate.pas

@@ -44,7 +44,7 @@ type
       : Int32; inline;
 
     // Returns an ascending list of positions of alignment patterns for this version number.
-    // Each position is in the range [0,177), and are used on both the x and y axes.
+    // Each position is in the range [0,177], and are used on both the x and y axes.
     // This could be implemented as lookup table of 40 variable-length lists of unsigned bytes.
     function GetAlignmentPatternPositions(): TQRCodeGenLibInt32Array;
 

QRCodeGenLib/src/QRCodeGen/QlpReedSolomonGenerator.pas

@@ -34,7 +34,7 @@ type
     FPolynomialMultiply: TQRCodeGenLibMatrixByteArray;
 
     constructor Create(ADegree: Int32);
-    // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
+    // Returns the product of the two given field elements modulo GF(2^8/$11D). The arguments and result
     // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
     class function Multiply(Ax, Ay: Int32): Int32; static;
 
@@ -70,7 +70,7 @@ begin
 
   // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),
   // drop the highest term, and store the rest of the coefficients in order of descending powers.
-  // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D).
+  // Note that r = $02, which is a generator element of this field GF(2^8/$11D).
   LRoot := 1;
   LIIdx := 0;
   while LIIdx < ADegree do