We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 7d218fc + f386cda commit a52b01bCopy full SHA for a52b01b
src/libsyntax/ext/tt/macro_parser.rs
@@ -18,7 +18,7 @@
18
//! `NamedMatch`es at the very end. It'd be a pain, and require more memory to keep around old
19
//! items, but it would also save overhead)
20
//!
21
-//! 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.
22
//! The macro parser restricts itself to the features of finite state automata. Earley parsers
23
//! can be described as an extension of NFAs with completion rules, prediction rules, and recursion.
24
0 commit comments