Skip to content

Commit f83e8d4

Browse files
committed
typo fix in reader
1 parent a2d1624 commit f83e8d4

1 file changed

Lines changed: 3 additions & 3 deletions

File tree

TypeAnalysis.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -16,11 +16,11 @@ In both languages, after the first round of *pessimistic* constant propagation
1616
(and extensive peephole optimizations) completes, every program point (node in
1717
the IR) has a type - and if there are no error types, then the program is
1818
type-safe. No separate typing pass is needed, and this is typically done
19-
partially as the program parses, and immediately thereafter. Optionally, an
20-
*optimistic* constant propagation (an extended SCCP) can be run to type more
19+
partially as the program parses, and shortly thereafter. Optionally, an
20+
*optimistic* constant propagation (SCCP) can be run to type more
2121
programs than the *pessimistic* approach alone.
2222

23-
These discussion relies on the program being in SSA form, which I assume the
23+
This discussion relies on the program being in SSA form, which I assume the
2424
reader is familiar with, and is commonly used in *constant propagation* because
2525
it allows the algorithm to be *sparse* without effort. Also, all three
2626
compilers use the Sea-of-Nodes representation which is only relevant here

0 commit comments

Comments
 (0)