From f386cdae19bdcee5a4f63468bb42d2a8b5759fec Mon Sep 17 00:00:00 2001 From: Takanori Ishibashi Date: Sun, 27 May 2018 09:47:04 +0900 Subject: [PATCH] innacurate -> inaccurate --- src/libsyntax/ext/tt/macro_parser.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/libsyntax/ext/tt/macro_parser.rs b/src/libsyntax/ext/tt/macro_parser.rs index 058317e05c7f7..b53d94db27eab 100644 --- a/src/libsyntax/ext/tt/macro_parser.rs +++ b/src/libsyntax/ext/tt/macro_parser.rs @@ -18,7 +18,7 @@ //! `NamedMatch`es at the very end. It'd be a pain, and require more memory to keep around old //! items, but it would also save overhead) //! -//! We don't say this parser uses the Earley algorithm, because it's unnecessarily innacurate. +//! We don't say this parser uses the Earley algorithm, because it's unnecessarily inaccurate. //! The macro parser restricts itself to the features of finite state automata. Earley parsers //! can be described as an extension of NFAs with completion rules, prediction rules, and recursion. //!