ref: ff88594df5c5df6fb8f227ab8e5df3529ba6e72f
parent: b3526b5e8cc2f28b17096115524731afc254e02b
author: Ori Bernstein <[email protected]>
date: Sat May 7 14:50:21 EDT 2022
parse: fix typos (thanks ed)
--- a/parse/dump.c
+++ b/parse/dump.c
@@ -146,7 +146,7 @@
}
-/* Outputs a node in indented tree form. This i
+/* Outputs a node in indented tree form. This is
* not a full serialization, but mainly an aid for
* understanding and debugging. */
static void
--- a/parse/infer.c
+++ b/parse/infer.c
@@ -2290,7 +2290,7 @@
static void
checkcast(Node *n, Postcheck ***pc, size_t *npc)
{
- /* FIXME: actually verify the casts. Right now, it's ok to leave thi
+ /* FIXME: actually verify the casts. Right now, it's ok to leave this
* unimplemented because bad casts get caught by the backend. */
}
--- a/parse/specialize.c
+++ b/parse/specialize.c
@@ -183,7 +183,7 @@
return ret;
}
-/* Checks if the type 't' is generic, and if it i
+/* Checks if the type 't' is generic, and if it is
* substitutes the types. This is here for efficiency,
* so we don't gratuitously duplicate types */
static Type *
--- a/parse/stab.c
+++ b/parse/stab.c
@@ -231,7 +231,7 @@
* not resolve namespaces -- that is the job
* of the caller of this function.
*
- * If a resoved name is not global, and i
+ * If a resoved name is not global, and is
* not in the current scope, it is recorded
* in the scope's closure.
*/
--- a/parse/use.c
+++ b/parse/use.c
@@ -787,8 +787,8 @@
/*
* merge duplicate definitions.
* This allows us to compare named types by id, instead
- * of doing a deep walk through the type. This ability I
- * depend on when we do type inference.
+ * of doing a deep walk through the type. This ability
+ * depends on when we do type inference.
*/
for (i = 0; i < ntypefix; i++) {
t = htget(tidmap, itop(typefix[i].id));
@@ -827,7 +827,7 @@
/*
* merge duplicate definitions.
* This allows us to compare named types by id, instead
- * of doing a deep walk through the type. This ability i
+ * of doing a deep walk through the type. This ability is
* depended on when we do type inference.
*/
for (i = 0; i < ntraitfix; i++) {