[llvm] Fix Typos in Kaleidoscope MCJIT Examples

llvm/examples/Kaleidoscope/MCJIT/cached/toy-jit.cpp

@@ -564,7 +564,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }
@@ -670,7 +670,7 @@ Value *BinaryExprAST::Codegen() {
   if (Op == '=') {
     // Assignment requires the LHS to be an identifier.
     // For now, I'm building without RTTI because LLVM builds that way by
-    // default and so we need to build that way to use the command line supprt.
+    // default and so we need to build that way to use the command line support.
     // If you build LLVM with RTTI this can be changed back to a dynamic_cast.
     VariableExprAST *LHSE = static_cast<VariableExprAST*>(LHS);
     if (!LHSE)

llvm/examples/Kaleidoscope/MCJIT/cached/toy.cpp

@@ -571,7 +571,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }
@@ -647,7 +647,7 @@ std::string MakeLegalFunctionName(std::string Name)
   // Start with what we have
   NewName = Name;
 
-  // Look for a numberic first character
+  // Look for a numeric first character
   if (NewName.find_first_of("0123456789") == 0) {
     NewName.insert(0, 1, 'n');
   }

llvm/examples/Kaleidoscope/MCJIT/complete/toy.cpp

@@ -590,7 +590,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }
@@ -666,7 +666,7 @@ std::string MakeLegalFunctionName(std::string Name)
   // Start with what we have
   NewName = Name;
 
-  // Look for a numberic first character
+  // Look for a numeric first character
   if (NewName.find_first_of("0123456789") == 0) {
     NewName.insert(0, 1, 'n');
   }

llvm/examples/Kaleidoscope/MCJIT/initial/toy.cpp

@@ -548,7 +548,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }
@@ -624,7 +624,7 @@ std::string MakeLegalFunctionName(std::string Name)
   // Start with what we have
   NewName = Name;
 
-  // Look for a numberic first character
+  // Look for a numeric first character
   if (NewName.find_first_of("0123456789") == 0) {
     NewName.insert(0, 1, 'n');
   }

llvm/examples/Kaleidoscope/MCJIT/lazy/toy-jit.cpp

@@ -549,7 +549,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }

llvm/examples/Kaleidoscope/MCJIT/lazy/toy.cpp

@@ -550,7 +550,7 @@ static PrototypeAST *ParsePrototype() {
     // Read the precedence if present.
     if (CurTok == tok_number) {
       if (NumVal < 1 || NumVal > 100)
-        return ErrorP("Invalid precedecnce: must be 1..100");
+        return ErrorP("Invalid precedence: must be 1..100");
       BinaryPrecedence = (unsigned)NumVal;
       getNextToken();
     }
@@ -626,7 +626,7 @@ std::string MakeLegalFunctionName(std::string Name)
   // Start with what we have
   NewName = Name;
 
-  // Look for a numberic first character
+  // Look for a numeric first character
   if (NewName.find_first_of("0123456789") == 0) {
     NewName.insert(0, 1, 'n');
   }