From f3e26d092a7edfdb42eb440e4125f32193df26c8 Mon Sep 17 00:00:00 2001
From: Hannes Voigt <30618026+hvub@users.noreply.github.com>
Date: Tue, 9 May 2023 12:21:53 +0200
Subject: [PATCH] Fix some typos

---
 cip/1.accepted/CIP2021-08-10-Operator-precedence.adoc | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/cip/1.accepted/CIP2021-08-10-Operator-precedence.adoc b/cip/1.accepted/CIP2021-08-10-Operator-precedence.adoc
index 6fabca6c5f..c64c6829e7 100644
--- a/cip/1.accepted/CIP2021-08-10-Operator-precedence.adoc
+++ b/cip/1.accepted/CIP2021-08-10-Operator-precedence.adoc
@@ -392,13 +392,13 @@ Example expressions are:
 [IMPORTANT]
 .Chains of binary operators
 ====
-In chains of binary operators, the operator have left-to-right associativity, i.e. for every two operators, the operator appearing earlier (more left) in the query string takes precedence and the operator tree is left-deep.
+In chains of binary operators, the operators have left-to-right associativity, i.e. for every two operators, the operator appearing earlier (more left) in the query string takes precedence and the operator tree is left-deep.
 ====
 
 [NOTE]
 .Associative binary operators
 ====
-Where the semantics of operator is associative (e.g. addition), a right-deep operator tree produces the same result as a left-deep operator tree.
+Where the semantics of an operator is associative (e.g. addition), a right-deep operator tree produces the same result as a left-deep operator tree.
 ====
 
 Consequently, the examples evaluate as follows: