[Mlir-commits] [mlir] 79c1733 - [mlir] Fix comma+typo in MLIR toy tutorial chapter 3.

[River Riddle]

Author: Matthias Kramm
Date: 2020-02-27T17:51:06-08:00
New Revision: 79c17330d35995d689ecec11dda0dfdb19f33428

URL: https://github.com/llvm/llvm-project/commit/79c17330d35995d689ecec11dda0dfdb19f33428
DIFF: https://github.com/llvm/llvm-project/commit/79c17330d35995d689ecec11dda0dfdb19f33428.diff

LOG: [mlir] Fix comma+typo in MLIR toy tutorial chapter 3.

Differential Revision: https://reviews.llvm.org/D75258

Added: 
    

Modified: 
    mlir/docs/Tutorials/Toy/Ch-3.md

Removed: 
    


################################################################################
diff  --git a/mlir/docs/Tutorials/Toy/Ch-3.md b/mlir/docs/Tutorials/Toy/Ch-3.md
index 6e7ced2576d8..c32818242503 100644
--- a/mlir/docs/Tutorials/Toy/Ch-3.md
+++ b/mlir/docs/Tutorials/Toy/Ch-3.md
@@ -25,7 +25,7 @@ use of DRR requires that the operations be defined using ODS, as described in
 ## Optimize Transpose using C++ style pattern-match and rewrite
 
 Let's start with a simple pattern and try to eliminate a sequence of two
-transpose that cancel out: `transpose(transpose(X)) -> X`. Here is the
+transposes that cancel out: `transpose(transpose(X)) -> X`. Here is the
 corresponding Toy example:
 
 ```toy
@@ -70,7 +70,7 @@ void double_transpose(int A[N][M]) {
 }
 ```
 
-For a simple C++ approach to rewrite involving matching a tree-like pattern in
+For a simple C++ approach to rewrite, involving matching a tree-like pattern in
 the IR and replacing it with a 
diff erent set of operations, we can plug into the
 MLIR `Canonicalizer` pass by implementing a `RewritePattern`: