Apply suggestions from code review

Co-authored-by: varkor <github@varkor.com>

Author: Nadrieril

compiler/rustc_mir_build/src/thir/pattern/_match.rs

@@ -1588,7 +1588,7 @@ fn all_constructors<'p, 'tcx>(pcx: PatCtxt<'_, 'p, 'tcx>) -> Vec<Constructor<'tc
             let is_declared_nonexhaustive = cx.is_foreign_non_exhaustive_enum(pcx.ty);
 
             // If `exhaustive_patterns` is disabled and our scrutinee is an empty enum, we treat it
-            // as though it had an "unknown" constructor to avoid exposing its emptyness. The
+            // as though it had an "unknown" constructor to avoid exposing its emptiness. The
             // exception is if the pattern is at the top level, because we want empty matches to be
             // considered exhaustive.
             let is_secretly_empty = def.variants.is_empty()
@@ -1640,7 +1640,7 @@ fn all_constructors<'p, 'tcx>(pcx: PatCtxt<'_, 'p, 'tcx>) -> Vec<Constructor<'tc
             vec![make_range(0, max)]
         }
         // If `exhaustive_patterns` is disabled and our scrutinee is the never type, we cannot
-        // expose its emptyness. The exception is if the pattern is at the top level, because we
+        // expose its emptiness. The exception is if the pattern is at the top level, because we
         // want empty matches to be considered exhaustive.
         ty::Never if !cx.tcx.features().exhaustive_patterns && !pcx.is_top_level => {
             vec![NonExhaustive]

src/test/ui/rfc-2008-non-exhaustive/enum_same_crate_empty_match.rs

@@ -25,7 +25,7 @@ pub enum EmptyNonExhaustiveEnum {}
 fn empty_non_exhaustive(x: EmptyNonExhaustiveEnum) {
     match x {}
     match x {
-        _ => {}, //~ ERROR unreachable pattern
+        _ => {} //~ ERROR unreachable pattern
     }
 }
 

src/test/ui/rfc-2008-non-exhaustive/enum_same_crate_empty_match.stderr

@@ -1,7 +1,7 @@
 error: unreachable pattern
   --> $DIR/enum_same_crate_empty_match.rs:28:9
    |
-LL |         _ => {},
+LL |         _ => {}
    |         ^
    |
 note: the lint level is defined here