X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FHistoricalNotes%2F2000-12-06-MeetingSummary.txt;h=01b644b3517f76bf5520a65dc26d89c83ae57d55;hb=1b0dc64919e947bb4f4677b138c734e33061f7c4;hp=b66e18556f5ecca3f488fcc296037880314e21ba;hpb=e2c3a49c8029ebd9ef530101cc24c66562e3dff5;p=oota-llvm.git

diff --git a/docs/HistoricalNotes/2000-12-06-MeetingSummary.txt b/docs/HistoricalNotes/2000-12-06-MeetingSummary.txt
index b66e18556f5..01b644b3517 100644
--- a/docs/HistoricalNotes/2000-12-06-MeetingSummary.txt
+++ b/docs/HistoricalNotes/2000-12-06-MeetingSummary.txt
@@ -40,7 +40,7 @@ IDEAS TO CONSIDER
    packaged with the bytecodes themselves.  As a conceptual implementation 
    idea, we could include an immediate dominator number for each basic block
    in the LLVM bytecode program.  Basic blocks could be numbered according
-   to the order of occurance in the bytecode representation.
+   to the order of occurrence in the bytecode representation.
 
 2. Including loop header and body information.  This would facilitate
    detection of intervals and natural loops.