On Oct 15, 2007, at 9:46 AM, Chris Lattner wrote: > @@ -328,7 +328,7 @@ > // Okay, we know that this node is new. Recursively walk all of > its operands > // to see if they are new also. The depth of this walk is > bounded by the size > // of the new tree that was constructed (usually 2-3 nodes), so > we don't worry > - // about revisitation of nodes. > + // about revisitating of nodes. > // > // As we walk the operands, keep track of the number of nodes > that are > // processed. If non-zero, this will become the new nodeid of > this node.
Actually 'revisitation' is a perfectly good word; but 'revisitating' is not. _______________________________________________ llvm-commits mailing list [email protected] http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
