aboutsummaryrefslogtreecommitdiff
path: root/gcc/stmt.c
diff options
context:
space:
mode:
authorRichard Stallman <rms@gnu.org>1992-05-07 06:41:23 +0000
committerRichard Stallman <rms@gnu.org>1992-05-07 06:41:23 +0000
commit6dc42e49d3dac756ec72e10f3bf7687f9c8542c2 (patch)
treed583d908c670671b25c202db24844f7db39d0ad1 /gcc/stmt.c
parentc5b7917eac14be1be0843853dd1f2a13679f25a7 (diff)
downloadgcc-6dc42e49d3dac756ec72e10f3bf7687f9c8542c2.zip
gcc-6dc42e49d3dac756ec72e10f3bf7687f9c8542c2.tar.gz
gcc-6dc42e49d3dac756ec72e10f3bf7687f9c8542c2.tar.bz2
*** empty log message ***
From-SVN: r930
Diffstat (limited to 'gcc/stmt.c')
-rw-r--r--gcc/stmt.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/stmt.c b/gcc/stmt.c
index e2c52bf..a1a2267 100644
--- 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