Spelling fixes

3 files changed, 3 insertions, 3 deletions

diff --git a/doc/lispref/commands.texi b/doc/lispref/commands.texi
index 3425281febd..a9da6c75367 100644
--- a/doc/lispref/commands.texi
+++ b/doc/lispref/commands.texi
@@ -2354,7 +2354,7 @@ window within a frame can also switch the selected window.  @xref{Mouse
 Window Auto-selection}, which describes the behavior for different
 values.  When the mouse is moved over a new window, a focus event for
 switching windows is generated.  Focus events for windows are
-reperesented in Lisp as lists that look like this:
+represented in Lisp as lists that look like this:
 
 @example
 (select-window @var{new-window})
diff --git a/doc/lispref/parsing.texi b/doc/lispref/parsing.texi
index c8c2fe80c03..1e91100e0d4 100644
--- a/doc/lispref/parsing.texi
+++ b/doc/lispref/parsing.texi
@@ -1582,7 +1582,7 @@ Here's an example @var{treesit-thing-settings} for C and C++:
 @end example
 
 @noindent
-Note that this example is modified for didactical purposes, and isn't
+Note that this example is modified for didactic purposes, and isn't
 exactly how C and C@t{++} modes define things.
 @end defvar
 
diff --git a/doc/lispref/peg.texi b/doc/lispref/peg.texi
index b85d0de048d..e496e1cf817 100644
--- a/doc/lispref/peg.texi
+++ b/doc/lispref/peg.texi
@@ -14,7 +14,7 @@ from regular expressions (@pxref{Regular Expressions}) to full
 left-to-right (a.k.a.@: @acronym{LL}) grammar parsers (@pxref{Top,,
 Bovine parser development,bovine}).  @dfn{Parsing Expression Grammars}
 (@acronym{PEG}) are another approach to text parsing that offer more
-structure and composibility than regular expressions, but less
+structure and composability than regular expressions, but less
 complexity than context-free grammars.
 
 A Parsing Expression Grammar (@acronym{PEG}) describes a formal language