diff --git a/Source/CParse/parser.y b/Source/CParse/parser.y
index 816264de6..d9c00809b 100644
--- a/Source/CParse/parser.y
+++ b/Source/CParse/parser.y
@@ -6854,11 +6854,11 @@ exprcompound   : expr PLUS expr {
 	       }
 	       | expr LESSEQUALGREATER expr {
 		 $$.val = NewStringf("%s <=> %s", COMPOUND_EXPR_VAL($1), COMPOUND_EXPR_VAL($3));
-		 // Really `<=>` returns one of `std::strong_ordering`,
-		 // `std::partial_ordering` or `std::weak_ordering`, but we
-		 // fake it by treating the return value as `int`.  The main
-		 // thing to do with the return value in this context is to
-		 // compare it with 0, for which `int` does the job.
+		 /* Really `<=>` returns one of `std::strong_ordering`,
+		  * `std::partial_ordering` or `std::weak_ordering`, but we
+		  * fake it by treating the return value as `int`.  The main
+		  * thing to do with the return value in this context is to
+		  * compare it with 0, for which `int` does the job. */
 		 $$.type = T_INT;
 	       }
 	       | expr QUESTIONMARK expr COLON expr %prec QUESTIONMARK {
diff --git a/Source/Preprocessor/expr.c b/Source/Preprocessor/expr.c
index 557e0e752..2fc1eafeb 100644
--- a/Source/Preprocessor/expr.c
+++ b/Source/Preprocessor/expr.c
@@ -324,7 +324,7 @@ int Preprocessor_expr(DOH *s, int *error) {
 	/* A number.  Reduce EXPR_TOP to an EXPR_VALUE */
 	char *c = Char(Scanner_text(scan));
 	if (c[0] == '0' && (c[1] == 'b' || c[1] == 'B')) {
-	  // strtol() doesn't handle binary constants.
+	  /* strtol() doesn't handle binary constants */
 	  stack[sp].value = (long) strtol(c + 2, 0, 2);
 	} else {
 	  stack[sp].value = (long) strtol(c, 0, 0);