acrolinx (#18573)

Author: gewarren

docs/core/tools/custom-templates.md

@@ -91,7 +91,7 @@ The *mytemplate* folder is an installable template pack. Once the pack is instal
 
 ## Packing a template into a NuGet package (nupkg file)
 
-A custom template is packed with the [dotnet pack](dotnet-pack.md) command and a *.csproj* file. Alternatively, [NuGet](https://docs.microsoft.com/nuget/tools/nuget-exe-cli-reference) can be used with the [nuget pack](https://docs.microsoft.com/nuget/tools/cli-ref-pack) command along with a *.nuspec* file. However, NuGet requires the .NET Framework on Windows and [Mono](https://www.mono-project.com/) on Linux and MacOS.
+A custom template is packed with the [dotnet pack](dotnet-pack.md) command and a *.csproj* file. Alternatively, [NuGet](https://docs.microsoft.com/nuget/tools/nuget-exe-cli-reference) can be used with the [nuget pack](https://docs.microsoft.com/nuget/tools/cli-ref-pack) command along with a *.nuspec* file. However, NuGet requires the .NET Framework on Windows and [Mono](https://www.mono-project.com/) on Linux and macOS.
 
 The *.csproj* file is slightly different from a traditional code-project *.csproj* file. Note the following settings:
 

docs/csharp/expression-trees-interpreting.md

@@ -24,7 +24,7 @@ child node, repeat the process used at the root node: determine the
 type, and if the type has children, visit each of the children.
 
 ## Examining an Expression with No Children
-Let's start by visiting each node in a very simple expression tree.
+Let's start by visiting each node in a simple expression tree.
 Here's the code that creates a constant expression and then
 examines its properties:
 
@@ -60,7 +60,7 @@ Expression<Func<int>> sum = () => 1 + 2;
 > because the right-hand side of the assignment is implicitly typed.
 
 The root node is a `LambdaExpression`. In order to get the interesting
-code on the right hand side of the `=>` operator, you need to find one
+code on the right-hand side of the `=>` operator, you need to find one
 of the children of the `LambdaExpression`. We'll do that with all the
 expressions in this section. The parent node does help us find the return
 type of the `LambdaExpression`.
@@ -231,7 +231,7 @@ public class ConstantVisitor : Visitor
 ```
 
 This algorithm is the basis of an algorithm that can visit
-any arbitrary `LambdaExpression`. There are a lot of holes,
+any arbitrary `LambdaExpression`. There are many holes,
 namely that the code I created only looks for a very small
 sample of the possible sets of expression tree nodes that
 it may encounter. However, you can still learn quite a bit
@@ -295,8 +295,7 @@ expressions. The second represent *left associative* expressions.
 The advantage of both of those two formats is that the format scales
 to any arbitrary number of addition expressions.
 
-If you do run this expression through the visitor, you will see this
-this output, verifying that the simple addition expression is
+If you do run this expression through the visitor, you will see this output, verifying that the simple addition expression is
 *left associative*.
 
 In order to run this sample, and see the full expression tree, I had to
@@ -410,7 +409,7 @@ to Expressions. First, statement lambdas are not allowed. That means I can't use
 loops, blocks, if / else statements, and other control structures common in C#. I'm
 limited to using expressions. Second, I can't recursively call the same expression.
 I could if it were already a delegate, but I can't call it in its expression tree
-form. In the section on [building expression trees](expression-trees-building.md)
+form. In the section on [building expression trees](expression-trees-building.md),
 you'll learn techniques to overcome these limitations.
 
 In this expression, you'll encounter nodes of all these types:
@@ -587,7 +586,7 @@ and can handle all the possible node types.
 
 Finally, the library I used in this article was built for demonstration
 and learning. It's not optimized. I wrote it to make the structures
-used very clear, and to highlight the techniques used to visit
+used clear, and to highlight the techniques used to visit
 the nodes and analyze what's there. A production implementation would
 pay more attention to performance than I have.
 

docs/framework/unmanaged-api/hosting/iclrruntimeinfo-isloadable-method.md

@@ -39,7 +39,7 @@ HRESULT IsLoadable(
 |E_POINTER|`pbLoadable` is null.|  
   
 ## Remarks  
- If another runtime is already loaded into the process and the runtime associated with this interface can be loaded for in-process side-by-side execution, `pbLoadable` returns `true`. If the two runtimes cannot run side-by-side in-process, `pbLoadable` returns `false`. For example, the common language runtime (CLR) version 4 can run side-by-side in the same process with CLR version 2.0 or CLR version 1.1. However, CLR version 1.1 and CLR version 2.0 cannot run side-by-side in-process.  
+ If another runtime is already loaded into the process, and the runtime associated with this interface can be loaded for in-process side-by-side execution, `pbLoadable` returns `true`. If the two runtimes cannot run side-by-side in-process, `pbLoadable` returns `false`. For example, the common language runtime (CLR) version 4 can run side-by-side in the same process with CLR version 2.0 or CLR version 1.1. However, CLR version 1.1 and CLR version 2.0 cannot run side-by-side in-process.  
   
  If no runtimes are loaded into the process, this method always returns `true`.