[elpa] externals/peg ad531e43d6: ; Fix typos

[Stefan Kangas]

branch: externals/peg
commit ad531e43d6fbc0ce874f82fcc500f7292a2edd17
Author: Stefan Kangas <stefankangas@gmail.com>
Commit: Stefan Kangas <stefankangas@gmail.com>

    ; Fix typos
---
 peg-tests.el | 6 +++---
 peg.el       | 2 +-
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/peg-tests.el b/peg-tests.el
index 96faf2a3d4..518721c105 100644
--- a/peg-tests.el
+++ b/peg-tests.el
@@ -29,7 +29,7 @@
 (defmacro peg-parse-string (pex string &optional noerror)
   "Parse STRING according to PEX.
 If NOERROR is non-nil, push nil resp. t if the parse failed
-resp. succeded instead of signaling an error."
+resp. succeeded instead of signaling an error."
   (let ((oldstyle (consp (car-safe pex)))) ;PEX is really a list of rules.
     `(with-temp-buffer
        (insert ,string)
@@ -179,7 +179,7 @@ resp. succeded instead of signaling an error."
     (peg-run (peg number))))
 
 ;; peg-ex-parse-int recognizes integers and computes the corresponding
-;; value.  The grammer is the same as for `peg-ex-recognize-int'
+;; value.  The grammar is the same as for `peg-ex-recognize-int'
 ;; augmented with parsing actions.  Unfortunaletly, the actions add
 ;; quite a bit of clutter.
 ;;
@@ -335,7 +335,7 @@ resp. succeded instead of signaling an error."
                                (action (foo))))))
         t))
 
-;; Some efficency problems:
+;; Some efficiency problems:
 
 ;; Find the last digit in a string.
 ;; Recursive definition with excessive stack usage.
diff --git a/peg.el b/peg.el
index 367aef468c..572d9324c0 100644
--- a/peg.el
+++ b/peg.el
@@ -810,7 +810,7 @@ rulesets defined previously with `define-peg-ruleset'."
     (or peg--stack t)))
 
 ;; Left recursion is presumably a common mistake when using PEGs.
-;; Here we try to detect such mistakes.  Essentailly we traverse the
+;; Here we try to detect such mistakes.  Essentially we traverse the
 ;; graph as long as we can without consuming input.  When we find a
 ;; recursive call we signal an error.