Typos and basic grammar error fixing (#1280)

Author: Fourchaux

Changes

@@ -179,6 +179,10 @@ Working version
 
 - GPR#1187: Minimal documentation for compiler plugins
   (Florian Angeletti)
+  
+- GPR#1202: Fix Typos in comments as well as basic grammar errors.
+  (JP Rodi, review and suggestions by David Allsopp, Max Mouratov, 
+  Florian Angeletti, Xavier Leroy, Mark Shinwell and Damien Doligez)
 
 - GPR#1220: Fix "-keep-docs" option in ocamlopt manpage
   (Etienne Millon)

asmcomp/amd64/arch.ml

@@ -39,7 +39,7 @@ type specific_operation =
   | Ioffset_loc of int * addressing_mode (* Add a constant to a location *)
   | Ifloatarithmem of float_operation * addressing_mode
                                        (* Float arith operation with memory *)
-  | Ibswap of int                      (* endiannes conversion *)
+  | Ibswap of int                      (* endianness conversion *)
   | Isqrtf                             (* Float square root *)
   | Ifloatsqrtf of addressing_mode     (* Float square root from memory *)
 and float_operation =

asmcomp/arm/arch.ml

@@ -122,7 +122,7 @@ type specific_operation =
   | Imulsubf      (* floating-point multiply and subtract *)
   | Inegmulsubf   (* floating-point negate, multiply and subtract *)
   | Isqrtf        (* floating-point square root *)
-  | Ibswap of int (* endianess conversion *)
+  | Ibswap of int (* endianness conversion *)
 
 and arith_operation =
     Ishiftadd

asmcomp/arm/proc.ml

@@ -42,7 +42,7 @@ let word_addressed = false
    Floating-point register map (VFPv{2,3}):
     d0 - d7               general purpose (not preserved)
     d8 - d15              general purpose (preserved)
-    d16 - d31             generat purpose (not preserved), VFPv3 only
+    d16 - d31             general purpose (not preserved), VFPv3 only
 *)
 
 let int_reg_name =

asmcomp/arm64/arch.ml

@@ -54,7 +54,7 @@ type specific_operation =
   | Imulsubf      (* floating-point multiply and subtract *)
   | Inegmulsubf   (* floating-point negate, multiply and subtract *)
   | Isqrtf        (* floating-point square root *)
-  | Ibswap of int (* endianess conversion *)
+  | Ibswap of int (* endianness conversion *)
 
 and arith_operation =
     Ishiftadd

asmcomp/arm64/proc.ml

@@ -43,7 +43,7 @@ let word_addressed = false
    Floating-point register map:
     d0 - d7               general purpose (caller-save)
     d8 - d15              general purpose (callee-save)
-    d16 - d31             generat purpose (caller-save)
+    d16 - d31             general purpose (caller-save)
 *)
 
 let int_reg_name =

asmcomp/emitaux.ml

@@ -273,7 +273,7 @@ let reset_debug_info () =
   file_pos_nums := [];
   file_pos_num_cnt := 1
 
-(* We only diplay .file if the file has not been seen before. We
+(* We only display .file if the file has not been seen before. We
    display .loc for every instruction. *)
 let emit_debug_info_gen dbg file_emitter loc_emitter =
   if is_cfi_enabled () &&

asmcomp/s390x/proc.ml

@@ -33,7 +33,7 @@ let word_addressed = false
     0                   temporary, null register for some operations (volatile)
     1                   temporary (volatile)
     2 - 5               function arguments and results (volatile)
-    6                   function arguments and results (persevered by C)
+    6                   function arguments and results (preserved by C)
     7 - 9               general purpose, preserved by C
     10                  allocation limit (preserved by C)
     11                  allocation pointer (preserved by C)

asmcomp/schedgen.ml

@@ -114,7 +114,7 @@ let rec longest_path critical_outputs node =
       [] ->
         node.length <-
           if is_critical critical_outputs node.instr.res
-          || node.instr.desc = Lreloadretaddr (* alway critical *)
+          || node.instr.desc = Lreloadretaddr (* always critical *)
           then node.delay
           else 0
     | sons ->
@@ -337,7 +337,7 @@ method private reschedule ready_queue date cont =
         (* Remove node from queue *)
         let new_queue = ref (remove_instr node ready_queue) in
         (* Update the start date and number of ancestors emitted of
-           all descendents of this node. Enter those that become ready
+           all descendants of this node. Enter those that become ready
            in the queue. *)
         let issue_cycles = self#instr_issue_cycles node.instr in
         List.iter

asmcomp/strmatch.ml

@@ -334,7 +334,7 @@ module Make(I:I) = struct
 (*
   Switch according to pattern size
   Argument from_ind is the starting index, it can be zero
-  or one (when the swicth on the cell 0 has already been performed.
+  or one (when the switch on the cell 0 has already been performed.
   In that latter case pattern len is string length-1 and is corrected.
  *)
 

asmcomp/un_anf.ml

@@ -622,7 +622,7 @@ let rec un_anf_and_moveable ident_info env (clam : Clambda.ulambda)
       un_anf_and_moveable ident_info env body
     | Constant, _, true, false
     (* A constant expression bound to an unassigned identifier can replace any
-         occurances of the identifier. *)
+         occurrences of the identifier. *)
     | Moveable, true, true, false  ->
       (* A moveable expression bound to a linear unassigned [Ident.t]
          may replace the single occurrence of the identifier. *)

bytecomp/bytegen.ml

@@ -679,7 +679,7 @@ let rec comp_expr env exp sz cont =
       comp_expr env (Lprim (Pccall prim_obj_dup, [arg], loc)) sz cont
   | Lprim (Pduparray _, _, _) ->
       Misc.fatal_error "Bytegen.comp_expr: Pduparray takes exactly one arg"
-(* Integer first for enabling futher optimization (cf. emitcode.ml)  *)
+(* Integer first for enabling further optimization (cf. emitcode.ml)  *)
   | Lprim (Pintcomp c, [arg ; (Lconst _ as k)], _) ->
       let p = Pintcomp (commute_comparison c)
       and args = [k ; arg] in

bytecomp/instruct.mli

@@ -29,7 +29,7 @@ type compilation_env =
    stack frame.
    The ce_heap component gives the positions of variables residing in the
    heap-allocated environment.
-   The ce_rec component associate offsets to identifiers for functions
+   The ce_rec component associates offsets to identifiers for functions
    bound by the same let rec as the current function.  The offsets
    are used by the OFFSETCLOSURE instruction to recover the closure
    pointer of the desired function from the env register (which

bytecomp/matching.ml

@@ -450,7 +450,7 @@ let pretty_precompiled_res first nexts =
 
 
 
-(* Identifing some semantically equivalent lambda-expressions,
+(* Identifying some semantically equivalent lambda-expressions,
    Our goal here is also to
    find alpha-equivalent (simple) terms *)
 
@@ -571,7 +571,7 @@ let up_ok (ps,act_p) l =
 
 
 (*
-   Simplify fonction normalize the first column of the match
+   The simplify function normalizes the first column of the match
      - records are expanded so that they possess all fields
      - aliases are removed and replaced by bindings in actions.
    However or-patterns are simplified differently,
@@ -1835,7 +1835,7 @@ let share_actions_tree sw d =
   let sw =
     List.map  (fun (cst,act) -> cst,store.Switch.act_store act) sw in
 
-(* Retrieve all actions, including potentiel default *)
+(* Retrieve all actions, including potential default *)
   let acts = store.Switch.act_get_shared () in
 
 (* Array of actual actions *)
@@ -2106,7 +2106,7 @@ let as_interval_nofail l =
   | (i,act)::rem ->
       let act_index =
         (* In case there is some hole and that a switch is emitted,
-           action 0 will be used as the action of unreacheable
+           action 0 will be used as the action of unreachable
            cases (cf. switch.ml, make_switch).
            Hence, this action will be shared *)
         if some_hole rem then
@@ -2813,7 +2813,7 @@ and compile_no_test divide up_ctx repr partial ctx to_match =
    or lazy pattern execute arbitrary code that may perform side effects
    and change the subject values.
 LM:
-   Lazy pattern was PR #5992, initial patch by lwp25.
+   Lazy pattern was PR#5992, initial patch by lpw25.
    I have  generalized the patch, so as to also find mutable fields.
 *)
 
@@ -3100,7 +3100,7 @@ let rec flatten_pat_line size p k = match p.pat_desc with
 | Tpat_tuple args -> args::k
 | Tpat_or (p1,p2,_) ->  flatten_pat_line size p1 (flatten_pat_line size p2 k)
 | Tpat_alias (p,_,_) -> (* Note: if this 'as' pat is here, then this is a
-                           useless binding, solves PR #3780 *)
+                           useless binding, solves PR#3780 *)
     flatten_pat_line size p k
 | _ -> fatal_error "Matching.flatten_pat_line"
 
@@ -3207,7 +3207,7 @@ let do_for_multiple_match loc paraml pat_act_list partial =
   with Unused ->
     assert false (* ; partial_function loc () *)
 
-(* #PR4828: Believe it or not, the 'paraml' argument below
+(* PR#4828: Believe it or not, the 'paraml' argument below
    may not be side effect free. *)
 
 let param_to_var param = match param with

bytecomp/simplif.ml

@@ -135,7 +135,7 @@ let simplify_exits lam =
       end
   | Lstaticraise (i,ls) -> incr_exit i ; List.iter count ls
   | Lstaticcatch (l1,(i,[]),Lstaticraise (j,[])) ->
-      (* i will be replaced by j in l1, so each occurence of i in l1
+      (* i will be replaced by j in l1, so each occurrence of i in l1
          increases j's ref count *)
       count l1 ;
       let ic = count_exit i in

bytecomp/switch.ml

@@ -359,7 +359,7 @@ let make_key  cases =
 
 
 (*
-  Intervall test x in [l,h] works by checking x-l in [0,h-l]
+  Interval test x in [l,h] works by checking x-l in [0,h-l]
    * This may be false for arithmetic modulo 2^31
    * Subtracting l may change the relative ordering of values
      and invalid the invariant that matched values are given in
@@ -659,7 +659,7 @@ and enum top cases =
 (* Minimal density of switches *)
 let theta = ref 0.33333
 
-(* Minmal number of tests to make a switch *)
+(* Minimal number of tests to make a switch *)
 let switch_min = ref 3
 
 (* Particular case 0, 1, 2 *)
@@ -699,7 +699,7 @@ let dense {cases} i j =
    Adaptation of the correction to Bernstein
    ``Correction to `Producing Good Code for the Case Statement' ''
    S.K. Kannan and T.A. Proebsting
-   Software Practice and Exprience Vol. 24(2) 233 (Feb 1994)
+   Software Practice and Experience Vol. 24(2) 233 (Feb 1994)
 *)
 
 let comp_clusters s =

bytecomp/switch.mli

@@ -95,7 +95,7 @@ module type S =
     - actions is an array of actions.
 
   All these arguments specify a switch construct and zyva
-  returns an action that performs the switch,
+  returns an action that performs the switch.
 *)
 module Make :
   functor (Arg : S) ->

bytecomp/translattribute.ml

@@ -201,7 +201,7 @@ let get_and_remove_specialised_attribute e =
   let specialised = parse_specialise_attribute attr in
   specialised, { e with exp_attributes }
 
-(* It also remove the attribute from the expression, like
+(* It also removes the attribute from the expression, like
    get_inlined_attribute *)
 let get_tailcall_attribute e =
   let is_tailcall_attribute = function

bytecomp/translclass.ml

@@ -625,7 +625,7 @@ open M
     env_init: parameterisation by the local environment
       (env -> params -> obj_init)
       (one for each combination of inherited class_init )
-    env: environnement local
+    env: local environment
    If ids=0 (immediate object), then only env_init is conserved.
 *)
 
@@ -779,7 +779,7 @@ let transl_class ids cl_id pub_meths cl vflag =
   if top && concrete then lclass lbody else
   if top then llets (lbody_virt lambda_unit) else
 
-  (* Now for the hard stuff: prepare for table cacheing *)
+  (* Now for the hard stuff: prepare for table caching *)
   let envs = Ident.create "envs"
   and cached = Ident.create "cached" in
   let lenvs =

bytecomp/translmod.ml

@@ -171,7 +171,7 @@ let compose_coercions c1 c2 =
   c3
 *)
 
-(* Record the primitive declarations occuring in the module compiled *)
+(* Record the primitive declarations occurring in the module compiled *)
 
 let primitive_declarations = ref ([] : Primitive.description list)
 let record_primitive = function

bytecomp/translobj.ml

@@ -114,7 +114,7 @@ let transl_label_init_flambda f =
   assert(Config.flambda);
   let method_cache_id = Ident.create "method_cache" in
   method_cache := Lvar method_cache_id;
-  (* Calling f (usualy Translmod.transl_struct) requires the
+  (* Calling f (usually Translmod.transl_struct) requires the
      method_cache variable to be initialised to be able to generate
      method accesses. *)
   let expr, size = f () in

debugger/breakpoints.ml

@@ -103,7 +103,7 @@ let set_breakpoints pos =
        set_breakpoint pos)
     pos
 
-(* Ensure the current version in installed in current checkpoint. *)
+(* Ensure the current version is installed in current checkpoint. *)
 let update_breakpoints () =
   if !debug_breakpoints then begin
     prerr_string "Updating breakpoints... ";

debugger/breakpoints.mli

@@ -36,7 +36,7 @@ val breakpoints_at_pc : int -> int list
 
 (*** Set and remove breakpoints ***)
 
-(* Ensure the current version in installed in current checkpoint. *)
+(* Ensure the current version is installed in current checkpoint. *)
 val update_breakpoints : unit -> unit
 
 (* Execute given function with no breakpoint in current checkpoint. *)

debugger/debugger_config.ml

@@ -82,6 +82,6 @@ let make_checkpoints = ref
     "Win32" -> false
   | _ -> true)
 
-(*** Environment variables for debugee. ***)
+(*** Environment variables for debuggee. ***)
 
 let environment = ref []

debugger/int64ops.ml

@@ -2,7 +2,7 @@
 (*                                                                        *)
 (*                                 OCaml                                  *)
 (*                                                                        *)
-(*           Damien Doligez, projet Moscova, INRIA Rocqencourt            *)
+(*           Damien Doligez, projet Moscova, INRIA Rocquencourt           *)
 (*                                                                        *)
 (*   Copyright 2002 Institut National de Recherche en Informatique et     *)
 (*     en Automatique.                                                    *)

debugger/int64ops.mli

@@ -2,7 +2,7 @@
 (*                                                                        *)
 (*                                 OCaml                                  *)
 (*                                                                        *)
-(*           Damien Doligez, projet Moscova, INRIA Rocqencourt            *)
+(*           Damien Doligez, projet Moscova, INRIA Rocquencourt           *)
 (*                                                                        *)
 (*   Copyright 2002 Institut National de Recherche en Informatique et     *)
 (*     en Automatique.                                                    *)

debugger/loadprinter.ml

@@ -105,7 +105,7 @@ let eval_path path =
 (* Install, remove a printer (as in toplevel/topdirs) *)
 
 (* since 4.00, "topdirs.cmi" is not in the same directory as the standard
-  libray, so we load it beforehand as it cannot be found in the search path. *)
+  library, so we load it beforehand as it cannot be found in the search path. *)
 let () =
   let compiler_libs =
     Filename.concat Config.standard_library "compiler-libs" in

debugger/program_loading.ml

@@ -140,7 +140,7 @@ let exec_with_runtime =
                      (Filename.quote !program_name)
                      !arguments)
 
-(* Excute the program directly *)
+(* Execute the program directly *)
 let exec_direct =
   generic_exec
     (function () ->

debugger/time_travel.ml

@@ -147,7 +147,7 @@ let cut2 t0 t l =
     let (after, before) = cut (t0 -- _1) l in
       after::(cut2_t0 t before)
 
-(* Separate first elements and last element of a list of checkpoint. *)
+(* Separate first elements and last element of a list of checkpoints. *)
 let chk_merge2 cont =
   let rec chk_merge2_cont =
     function
@@ -216,7 +216,7 @@ let find_checkpoint_before time =
   in find !checkpoints
 
 (* Make a copy of the current checkpoint and clean the checkpoint list. *)
-(* --- The new checkpoint in not put in the list. *)
+(* --- The new checkpoint is not put in the list. *)
 let duplicate_current_checkpoint () =
   let checkpoint = !current_checkpoint in
     if not checkpoint.c_valid then
@@ -499,14 +499,14 @@ let rec run () =
   if not !interrupted then
     run ()
 
-(* Run backward the program form current time. *)
+(* Run the program backward from current time. *)
 (* Stop at the first breakpoint, or at the beginning of the program. *)
 let back_run () =
   if current_time () > _0 then
     back_to _0 (current_time ())
 
 (* Step in any direction. *)
-(* Stop at the first brakpoint, or after `duration' steps. *)
+(* Stop at the first breakpoint, or after `duration' steps. *)
 let step duration =
   if duration >= _0 then
     step_forward duration