From fcc36536d491f4dcbb7e9fc1f1e1ba343608c26a Mon Sep 17 00:00:00 2001
From: ashish kumar <34642693+ashishkujoy@users.noreply.github.com>
Date: Sun, 25 Nov 2018 11:02:48 +0530
Subject: [PATCH] Fix grammatical mistake in reflection docs

---
 _overviews/reflection/symbols-trees-types.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/_overviews/reflection/symbols-trees-types.md b/_overviews/reflection/symbols-trees-types.md
index 5702e04eb3..e42ec946be 100644
--- a/_overviews/reflection/symbols-trees-types.md
+++ b/_overviews/reflection/symbols-trees-types.md
@@ -573,7 +573,7 @@ nodes that match the pattern `Apply(fun, args)`, where `fun` is some function
 (represented by a `Tree`) and `args` is a list of arguments (represented by a
 list of `Tree`s).
 
-When a the tree matches the pattern (_i.e.,_ when we have an `Apply` node), we
+When a tree matches the pattern (_i.e.,_ when we have an `Apply` node), we
 simply add it to our `List[Apply]`, `applies`, and continue our traversal.
 
 Note that, in our match, we call `super.traverse` on the function `fun`