Fix typos across the tree (#1133)

linkmauve · web-flow · commit 79fbb67e84ed · 2025-11-01T09:18:51.000+08:00
* Fix typos across the tree They were found thanks to the typos[1] tool. [1] https://github.com/crate-ci/typos * Add a typos.toml file This one instructs typos to ignore the false positives found in this repository.
diff --git a/generator/src/docs.rs b/generator/src/docs.rs
@@ -4,7 +4,7 @@ use pest::iterators::Pairs;
 use pest_meta::parser::Rule;
 use std::collections::HashMap;
 
-/// Abstraction for the grammer and rule doc.
+/// Abstraction for the grammar and rule doc.
 #[derive(Debug)]
 pub struct DocComment {
     /// The grammar documentation is defined at the beginning of a file with //!.
diff --git a/grammars/src/lib.rs b/grammars/src/lib.rs
@@ -294,7 +294,7 @@ mod tests {
                 )),
                 sql::Rule::CreateUser => Some(String::from("Expected user creation.")),
                 sql::Rule::SingleQuotedString => {
-                    Some(String::from("Add a string in single qoutes."))
+                    Some(String::from("Add a string in single quotes."))
                 }
                 sql::Rule::Query => Some(String::from("DML query expected.")),
                 sql::Rule::Expr => Some(String::from("Expected expression.")),
@@ -334,10 +334,10 @@ mod tests {
             .join("\n")
         );
 
-        let user_creation_password_without_single_qoutes = r#"create user
+        let user_creation_password_without_single_quotes = r#"create user
                                                                    Bob password "wrong""#;
         assert_eq!(
-            retrieve_parse_attempts_error_string(user_creation_password_without_single_qoutes),
+            retrieve_parse_attempts_error_string(user_creation_password_without_single_quotes),
             [
                 " --> 2:81",
                 "  |",
@@ -347,7 +347,7 @@ mod tests {
                 "  = error: parsing error occurred.",
                 "    note: expected one of tokens: WHITESPACE, `''`, `'`",
                 "    help: Expected user creation.",
-                "          - Add a string in single qoutes.",
+                "          - Add a string in single quotes.",
             ]
                 .join("\n")
         );
diff --git a/meta/src/ast.rs b/meta/src/ast.rs
@@ -54,7 +54,7 @@ pub enum RuleType {
 /// There may be non-breaking changes to the meta-grammar
 /// between minor versions. Those non-breaking changes, however,
 /// may translate into semver-breaking changes due to the additional variants
-/// propaged from the `Rule` enum. This is a known issue and will be fixed in the
+/// propagated from the `Rule` enum. This is a known issue and will be fixed in the
 /// future (e.g. by increasing MSRV and non_exhaustive annotations).
 #[derive(Clone, Debug, Eq, PartialEq)]
 pub enum Expr {
diff --git a/meta/src/optimizer/mod.rs b/meta/src/optimizer/mod.rs
@@ -24,7 +24,7 @@ mod concatenator;
 mod factorizer;
 mod lister;
 mod restorer;
-mod rotater;
+mod rotator;
 mod skipper;
 mod unroller;
 
@@ -33,7 +33,7 @@ pub fn optimize(rules: Vec<Rule>) -> Vec<OptimizedRule> {
     let map = to_hash_map(&rules);
     let optimized: Vec<OptimizedRule> = rules
         .into_iter()
-        .map(rotater::rotate)
+        .map(rotator::rotate)
         .map(|rule| skipper::skip(rule, &map))
         .map(unroller::unroll)
         .map(concatenator::concatenate)
@@ -120,7 +120,7 @@ pub struct OptimizedRule {
 /// There may be non-breaking changes to the meta-grammar
 /// between minor versions. Those non-breaking changes, however,
 /// may translate into semver-breaking changes due to the additional variants
-/// propaged from the `Rule` enum. This is a known issue and will be fixed in the
+/// propagated from the `Rule` enum. This is a known issue and will be fixed in the
 /// future (e.g. by increasing MSRV and non_exhaustive annotations).
 #[derive(Clone, Debug, Eq, PartialEq)]
 pub enum OptimizedExpr {
diff --git a/meta/src/optimizer/rotator.rs b/meta/src/optimizer/rotator.rs
diff --git a/meta/src/validator.rs b/meta/src/validator.rs
@@ -325,7 +325,7 @@ fn validate_tag_silent_rules<'a, 'i: 'a>(rules: &'a [ParserRule<'i>]) -> Vec<Err
 ///
 /// # Assumptions
 /// - In `ParserExpr::RepMinMax(inner,min,max)`, `min<=max`
-/// - All rules identiers have a matching definition
+/// - All rules identifiers have a matching definition
 /// - There is no left-recursion (if only this one is broken returns false)
 /// - Every expression is being checked
 fn is_non_progressing<'i>(
@@ -421,7 +421,7 @@ fn is_non_progressing<'i>(
 /// # Assumptions
 /// - In `ParserExpr::RepMinMax(inner,min,max)`, `min<=max`
 /// - In `ParserExpr::PeekSlice(max,Some(min))`, `max>=min`
-/// - All rules identiers have a matching definition
+/// - All rules identifiers have a matching definition
 /// - There is no left-recursion
 /// - All rules are being checked
 fn is_non_failing<'i>(
@@ -459,7 +459,7 @@ fn is_non_failing<'i>(
             } else {
                 // referring to another rule R that was already seen
                 // WARNING: this might mean there is a circular non-failing path
-                //   it's not obvious wether this can happen without left-recursion
+                //   it's not obvious whether this can happen without left-recursion
                 //   and thus breaking the assumption. Until there is answer to
                 //   this, to avoid changing behaviour we return:
                 false
diff --git a/pest/src/parser_state.rs b/pest/src/parser_state.rs
@@ -428,7 +428,7 @@ impl<R: RuleType> ParseAttempts<R> {
     }
 
     /// Reset state in case we've successfully parsed some token in
-    /// `match_string` or `match_insensetive`.
+    /// `match_string` or `match_insensitive`.
     fn nullify_expected_tokens(&mut self, new_max_position: usize) {
         self.call_stacks.clear();
         self.expected_tokens.clear();
@@ -701,7 +701,7 @@ impl<'i, R: RuleType> ParserState<'i, R> {
 
         let mut try_add_rule_to_stack = |new_state: &mut Box<ParserState<'_, R>>| {
             if new_state.parse_attempts.max_position > remember_max_position {
-                // It means that one of `match_string` or e.g. `match_insensetive` function calls
+                // It means that one of `match_string` or e.g. `match_insensitive` function calls
                 // have already erased `self.parse_attempts.call_stacks` and that previously
                 // remembered values are not valid anymore.
                 remember_call_stacks_number = 0;
@@ -1016,7 +1016,7 @@ impl<'i, R: RuleType> ParserState<'i, R> {
         token: ParsingToken,
         parse_succeeded: bool,
     ) {
-        // New position after tracked parsed element for case of `parse_succeded` is true.
+        // New position after tracked parsed element for case of `parse_succeeded` is true.
         // Position of parsing failure otherwise.
         let current_pos = self.position.pos();
 
diff --git a/typos.toml b/typos.toml
@@ -0,0 +1,7 @@
+[files]
+extend-exclude = ["grammars/benches/requests.http", "grammars/benches/main.i18n.json"]
+
+[default.extend-words]
+ba = "ba"
+tham = "tham"
+vai = "vai"
