@@ -116,7 +116,7 @@ production. See [tokens](#tokens) for more information.
116
116
117
117
## Input format
118
118
119
- Rust input is interpreted in as a sequence of Unicode codepoints encoded in
119
+ Rust input is interpreted as a sequence of Unicode codepoints encoded in
120
120
UTF-8. No normalization is performed during input processing. Most Rust
121
121
grammar rules are defined in terms of printable ASCII-range codepoints, but
122
122
a small number are defined in terms of Unicode properties or explicit
@@ -180,7 +180,7 @@ of the following Unicode characters: `U+0020` (space, `' '`), `U+0009` (tab,
180
180
` '\t' ` ), ` U+000A ` (LF, ` '\n' ` ), ` U+000D ` (CR, ` '\r' ` ).
181
181
182
182
Rust is a "free-form" language, meaning that all forms of whitespace serve
183
- only to separate _ tokens_ in the grammar, and have no semantic meaning .
183
+ only to separate _ tokens_ in the grammar, and have no semantic significance .
184
184
185
185
A Rust program has identical meaning if each whitespace element is replaced
186
186
with any other legal whitespace element, such as a single space character.
@@ -244,7 +244,7 @@ f80 f16 f128
244
244
class trait
245
245
~~~~~~~~
246
246
247
- Any of these may have special meaning in future versions of the language, do
247
+ Any of these may have special meaning in future versions of the language, so
248
248
are excluded from the ` ident ` rule.
249
249
250
250
### Literals
@@ -334,7 +334,7 @@ dec_lit : [ dec_digit | '_' ] + ;
334
334
~~~~~~~~
335
335
336
336
A _ number literal_ is either an _ integer literal_ or a _ floating-point
337
- literal_ . The grammar for recognizing the two kinds of literals is mixed
337
+ literal_ . The grammar for recognizing the two kinds of literals is mixed,
338
338
as they are differentiated by suffixes.
339
339
340
340
##### Integer literals
@@ -416,7 +416,7 @@ symbol : "::" "->"
416
416
417
417
Symbols are a general class of printable [ token] ( #tokens ) that play structural
418
418
roles in a variety of grammar productions. They are catalogued here for
419
- completeness as the set of remaining miscellaneous printable token that do not
419
+ completeness as the set of remaining miscellaneous printable tokens that do not
420
420
otherwise appear as [ unary operators] ( #unary-operator-expressions ) , [ binary
421
421
operators] ( #binary-operator-expressions ) , [ keywords] ( #keywords ) or [ reserved
422
422
words] ( #reserved-words ) .
@@ -438,7 +438,7 @@ type_path_tail : '<' type_expr [ ',' type_expr ] + '>'
438
438
439
439
A _ path_ is a sequence of one or more path components _ logically_ separated by
440
440
a namespace qualifier (` :: ` ). If a path consists of only one component, it
441
- may refer to either an [ item] ( #items ) or a (variable) [ #variables) in a local
441
+ may refer to either an [ item] ( #items ) or a [ variable ] ( #variables ) in a local
442
442
control scope. If a path has multiple components, it refers to an item.
443
443
444
444
Every item has a _ canonical path_ within its [ crate] ( #crates ) , but the path
@@ -454,7 +454,7 @@ x::y::z;
454
454
~~~~
455
455
456
456
Path components are usually [ identifiers] ( #identifiers ) , but the trailing
457
- component of a path may be an angle-bracket enclosed list of [ type
457
+ component of a path may be an angle-bracket- enclosed list of [ type
458
458
arguments] ( type-arguments ) . In [ expression] ( #expressions ) context, the type
459
459
argument list is given after a final (` :: ` ) namespace qualifier in order to
460
460
disambiguate it from a relational expression involving the less-than symbol
0 commit comments