Fix miscellaneous typos in documentation (JuliaLang#35413)

Author: binarygcd

NEWS.md

@@ -82,7 +82,7 @@ Build system changes
 
 New library functions
 ---------------------
-* The `@ccall` macro has been added added to Base. It is a near drop-in replacement for `ccall` with more Julia-like syntax. It also wraps the new `foreigncall` API for varargs of different types, though it lacks the the capability to specify an LLVM calling convention. ([#32748])
+* The `@ccall` macro has been added added to Base. It is a near drop-in replacement for `ccall` with more Julia-like syntax. It also wraps the new `foreigncall` API for varargs of different types, though it lacks the capability to specify an LLVM calling convention. ([#32748])
 * New functions `mergewith` and `mergewith!` supersede `merge` and `merge!` with `combine`
   argument.  They don't have the restriction for `combine` to be a `Function` and also
   provide one-argument method that returns a closure.  The old methods of `merge` and

base/compiler/abstractinterpretation.jl

@@ -464,7 +464,7 @@ function precise_container_type(@nospecialize(itft), @nospecialize(typ), vtypes:
     tti0 = widenconst(typ)
     tti = unwrap_unionall(tti0)
     if isa(tti, DataType) && tti.name === NamedTuple_typename
-        # A NamedTuple iteration is the the same as the iteration of its Tuple parameter:
+        # A NamedTuple iteration is the same as the iteration of its Tuple parameter:
         # compute a new `tti == unwrap_unionall(tti0)` based on that Tuple type
         tti = tti.parameters[2]
         while isa(tti, TypeVar)

base/compiler/ssair/domtree.jl

@@ -262,7 +262,7 @@ begin
     The main Semi-NCA algrithm. Matches Figure 2.8 in [LG05].
     Note that the pseudocode in [LG05] is not entirely accurate.
     The best way to understand what's happening is to read [LT79], then the
-    description of SLT in in [LG05] (warning: inconsistent notation), then
+    description of SLT in [LG05] (warning: inconsistent notation), then
     the description of Semi-NCA.
     """
     function SNCA(cfg::CFG)

base/intfuncs.jl

@@ -893,7 +893,7 @@ julia> binomial(-5, 3)
 * [`factorial`](@ref)
 
 # External links
-* [Binomial coeffient](https://en.wikipedia.org/wiki/Binomial_coefficient) on Wikipedia.
+* [Binomial coefficient](https://en.wikipedia.org/wiki/Binomial_coefficient) on Wikipedia.
 """
 function binomial(n::T, k::T) where T<:Integer
     n0, k0 = n, k

base/reflection.jl

@@ -787,7 +787,7 @@ implementations. An error is thrown if no fallback implementation exists.
 If `generated` is `true`, these `CodeInfo` instances will correspond to the method bodies
 yielded by expanding the generators.
 
-The keyword debuginfo controls the amount of code metadata present in the output.
+The keyword `debuginfo` controls the amount of code metadata present in the output.
 
 Note that an error will be thrown if `types` are not leaf types when `generated` is
 `true` and any of the corresponding methods are an `@generated` method.

doc/src/devdocs/debuggingtips.md

@@ -25,7 +25,7 @@ Julia's flisp interpreter uses `value_t` objects; these can be displayed with `c
 
 ## Useful Julia variables for Inspecting
 
-While the addresses of many variables, like singletons, can be be useful to print for many failures,
+While the addresses of many variables, like singletons, can be useful to print for many failures,
 there are a number of additional variables (see `julia.h` for a complete list) that are even more
 useful.
 

doc/src/devdocs/inference.md

@@ -18,7 +18,7 @@ running session by navigating to `base` and executing
 development than if you rebuild Julia for each change.
 
 Alternatively, you can use the [Revise.jl](https://github.com/timholy/Revise.jl)
-package to track the compiler changes by using the the command
+package to track the compiler changes by using the command
 `Revise.track(Core.Compiler)` at the beginning of your Julia session. As
 explained in the [Revise documentation](https://timholy.github.io/Revise.jl/stable/),
 the modifications to the compiler will be reflected when the modified files

doc/src/manual/parallel-computing.md

@@ -1574,7 +1574,7 @@ When using custom transports:
     the worker represented by the `IO` objects.
   * `init_worker(cookie, manager::FooManager)` *must* be called as part of worker process initialization.
   * Field `connect_at::Any` in `WorkerConfig` can be set by the cluster manager when [`launch`](@ref)
-    is called. The value of this field is passed in in all [`connect`](@ref) callbacks. Typically,
+    is called. The value of this field is passed in all [`connect`](@ref) callbacks. Typically,
     it carries information on *how to connect* to a worker. For example, the TCP/IP socket transport
     uses this field to specify the `(host, port)` tuple at which to connect to a worker.
 

doc/src/manual/profile.md

@@ -329,7 +329,7 @@ For example with `OProfile` you can try a simple recording :
 >opreport -l `which ./julia`
 ```
 
-Or similary with with `perf` :
+Or similary with `perf` :
 
 ```
 $ ENABLE_JITPROFILING=1 perf record -o /tmp/perf.data --call-graph dwarf ./julia /test/fastmath.jl

src/llvm-late-gc-lowering.cpp

@@ -1239,7 +1239,7 @@ void LateLowerGCFrame::FixUpRefinements(ArrayRef<int> PHINumbers, State &S)
     // we can also relax non-dominating (invalid) refinements to the refinements of those values
     // If all of those values dominate the phi node then the phi node can be refined to
     // those values instead.
-    // While we recursively relax the refinement, we need to keep track of the the values we've
+    // While we recursively relax the refinement, we need to keep track of the values we've
     // visited in order to not scan them again.
     BitVector visited(S.MaxPtrNumber + 1, false);
     for (auto Num: PHINumbers) {