From bdfc265df205844c64d69c20fd94b8fe6efe8d2d Mon Sep 17 00:00:00 2001 From: maxtaran2010 Date: Fri, 10 Jul 2026 00:47:43 +0300 Subject: [PATCH] Fix typos in comments and documentation Co-Authored-By: Claude Sonnet 4.6 --- nom-language/src/lib.rs | 2 +- nom-language/src/precedence/mod.rs | 8 ++++---- src/combinator/mod.rs | 2 +- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/nom-language/src/lib.rs b/nom-language/src/lib.rs index c018f3198..36e88ca68 100644 --- a/nom-language/src/lib.rs +++ b/nom-language/src/lib.rs @@ -1,4 +1,4 @@ -//! # Langage parsing combinators for the nom parser combinators library +//! # Language parsing combinators for the nom parser combinators library //! //! nom is a parser combinator library with a focus on safe parsing, //! streaming patterns, and zero copy. diff --git a/nom-language/src/precedence/mod.rs b/nom-language/src/precedence/mod.rs index 2330fd531..9b4b7c355 100644 --- a/nom-language/src/precedence/mod.rs +++ b/nom-language/src/precedence/mod.rs @@ -183,9 +183,9 @@ where /// /// # Evaluation order /// This parser reads expressions from left to right and folds operations as soon as possible. This -/// behaviour is only important when using an operator grammar that allows for ambigious expressions. +/// behaviour is only important when using an operator grammar that allows for ambiguous expressions. /// -/// For example, the expression `-a++**b` is ambigious with the following precedence. +/// For example, the expression `-a++**b` is ambiguous with the following precedence. /// /// | Operator | Position | Precedence | Associativity | /// |----------|----------|------------|---------------| @@ -376,8 +376,8 @@ where /// In a LALR grammar a left recursive operator is usually built with a rule syntax such as: /// * A := A op B | B /// -/// If you try to parse that wth [`alt`][nom::branch::alt] it will fail with a stack overflow -/// because the recusion is unlimited. This function solves this problem by converting the recusion +/// If you try to parse that with [`alt`][nom::branch::alt] it will fail with a stack overflow +/// because the recursion is unlimited. This function solves this problem by converting the recursion /// into an iteration. /// /// Compare with a right recursive operator, that in LALR would be: diff --git a/src/combinator/mod.rs b/src/combinator/mod.rs index fe6655b98..eb77b9784 100644 --- a/src/combinator/mod.rs +++ b/src/combinator/mod.rs @@ -509,7 +509,7 @@ where } } -/// Parser iplementation for verify +/// Parser implementation for verify pub struct Verify { first: F, second: G,