Typoes.

src/racket/src/eval.c

@@ -98,10 +98,10 @@
    lifting (of procedures that close over nothing or only globals).
    Beware that the resulting bytecode object is a graph, not a tree,
    due to sharing (potentially cyclic) of closures that are "empty"
-   but actually refer to other "empty" closures. See "resove.c".
+   but actually refer to other "empty" closures. See "resolve.c".
 
    The fourth pass, "sfs", performs another liveness analysis on stack
-   slows and inserts operations to clear stack slots as necessary to
+   slots and inserts operations to clear stack slots as necessary to
    make execution safe for space. In particular, dead slots need to be
    cleared before a non-tail call into arbitrary Scheme code. This pass
    can mutate the result of the "resolve" pass. See "sfs.c".

src/racket/src/optimize.c

@@ -5052,7 +5052,7 @@ Scheme_Object *scheme_optimize_expr(Scheme_Object *expr, Optimize_Info *info, in
 }
 
 Scheme_Object *scheme_optimize_clone(int dup_ok, Scheme_Object *expr, Optimize_Info *info, int delta, int closure_depth)
-/* Past closure_depth, need to reverse optimize to unoptimzed with respect to info;
+/* Past closure_depth, need to reverse optimize to unoptimized with respect to info;
    delta is the amount to skip in info to get to the frame that bound the code.
    If dup_ok is 1, then the old copy will be dropped, so it's ok to "duplicate"
    any constant. */