anchor.diff:            end;
            BRACES, BRACESNG: begin //###0.940
              opnd := scan + REOpSz + RENextOffSz + REBracesArgSz * 2;
  -           min_cnt := PREBracesArg (scan + REOpSz + RENextOffSz)^; // BRACES
  +           min_cnt := PREBracesArg (AlignToPtr(scan + REOpSz + RENextOffSz))^; // BRACES
              FillFirstCharSet (opnd);
              if min_cnt > 0
               then EXIT;
  
positive.code: {$ENDIF}
  {$DEFINE ComplexBraces} // support braces in complex cases
  {$IFNDEF UniCode} // the option applicable only for non-UniCode mode
   {$DEFINE UseSetOfChar} // Significant optimization by using set of char
  {$ENDIF}
  {$IFDEF UseSetOfChar}
   {$DEFINE UseFirstCharSet} // Fast skip between matches for r.e. that starts with determined set of chars
  
negative.code:    if regcode <> @regdummy then begin
        off := (Result + REOpSz + RENextOffSz)
         - (regcode - REOpSz - RENextOffSz); // back to Atom after LOOPENTRY
        PREBracesArg (AlignToInt(regcode))^ := ABracesMin;
        inc (regcode, REBracesArgSz);
        PREBracesArg (AlignToInt(regcode))^ := ABracesMax;
        inc (regcode, REBracesArgSz);
        PRENextOff (AlignToPtr(regcode))^ := off;
        inc (regcode, RENextOffSz);
        {$IFDEF DebugSynRegExpr}
        if regcode-programm>regsize then
  