*** empty log message ***

[gcc.git] / gcc / stmt.c

diff --git a/gcc/stmt.c b/gcc/stmt.c
index e2c52bfed17ed3dd5e9f35d026b1c3ac4464c155..a1a2267c5e36b6a9309e55e6cb2b0dc4da564566 100644 (file)
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -3966,7 +3966,7 @@ group_case_nodes (head)
 
 /* Take an ordered list of case nodes
    and transform them into a near optimal binary tree,
-   on the assumtion that any target code selection value is as
+   on the assumption that any target code selection value is as
    likely as any other.
 
    The transformation is performed by splitting the ordered