small misspelling fixes.

test/mjsunit/unicode-test.js

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 5346 matching lines @@
 "  Bins\n" +
 "\n" +
 "    An array of bin headers for free chunks. Each bin is doubly\n" +
 "    linked.  The bins are approximately proportionally (log) spaced.\n" +
 "    There are a lot of these bins (128). This may look excessive, but\n" +
 "    works very well in practice.  Most bins hold sizes that are\n" +
 "    unusual as malloc request sizes, but are more usual for fragments\n" +
 "    and consolidated sets of chunks, which is what these bins hold, so\n" +
 "    they can be found quickly.  All procedures maintain the invariant\n" +
 "    that no consolidated chunk physically borders another one, so each\n" +
-"    chunk in a list is known to be preceeded and followed by either\n" +
+"    chunk in a list is known to be preceded and followed by either\n" +
 "    inuse chunks or the ends of memory.\n" +
 "\n" +
 "    Chunks in bins are kept in size order, with ties going to the\n" +
 "    approximately least recently used chunk. Ordering isn't needed\n" +
 "    for the small bins, which all contain the same-sized chunks, but\n" +
 "    facilitates best-fit allocation for larger chunks. These lists\n" +
 "    are just sequential. Keeping them in order almost never requires\n" +
 "    enough traversal to warrant using fancier ordered data\n" +
 "    structures.\n" +
 "\n" +
@@ skipping 3782 matching lines @@
   print ("re = " + out);
 }
 
 var thai_l_thingy = "\u0e44";
 var thai_l_regexp = new RegExp(thai_l_thingy);
 var thai_l_regexp2 = new RegExp("[" + thai_l_thingy + "]");
 assertTrue(thai_l_regexp.test(thai_l_thingy));
 assertTrue(thai_l_regexp2.test(thai_l_thingy));