Work in progres, please take a look and give early feedback if this is the way we want to structure…

src/vm/list.h

 // Copyright (c) 2014, the Fletch project authors. Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE.md file.
 
 #ifndef SRC_VM_LIST_H_
 #define SRC_VM_LIST_H_
 
 #include <stdlib.h>
 #include <string.h>
 #include "src/shared/assert.h"
 
 namespace fletch {
 
 // Lists are light-weight data structures that hold a sequence of
-// contiguous elements. List never take ownership of the data their
+// contiguous elements. List never take ownership of the data they
 // are passed in, so as long as the data is either in a zone or
 // static, lists can be safely passed by value.
 template<typename T>
 class List {
  public:
   List() : data_(NULL), length_(0) { }
 
   List(T* data, int length) : data_(data), length_(length) {
     ASSERT(length >= 0);
   }
@@ skipping 40 matching lines @@
   }
 
  private:
   T* data_;
   int length_;
 };
 
 }  // namespace fletch
 
 #endif  // SRC_VM_LIST_H_