diff options
| author | bors <bors@rust-lang.org> | 2018-05-27 11:43:26 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2018-05-27 11:43:26 +0000 |
| commit | a52b01bc67068fbd30206db53f2a3461f65e629e (patch) | |
| tree | 009effde36136e05ebfc1112ec7b1595fd806cb9 | |
| parent | 7d218fc72fc68a8ef75c5b5f8bc651e18d83f23e (diff) | |
| parent | f386cdae19bdcee5a4f63468bb42d2a8b5759fec (diff) | |
Auto merge of #51101 - 11Takanori:fix-typo, r=frewsxcv
Fix typo in macro_parser.rs innacurate -> inaccurate
| -rw-r--r-- | src/libsyntax/ext/tt/macro_parser.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libsyntax/ext/tt/macro_parser.rs b/src/libsyntax/ext/tt/macro_parser.rs index 058317e05c7..b53d94db27e 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. //! |