diff -r a6a23aa7a546 -r d382dacfd73f rt/vm/src/main/java/org/apidesign/vm4brwsr/StringArray.java
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/rt/vm/src/main/java/org/apidesign/vm4brwsr/StringArray.java	Tue Feb 26 16:54:16 2013 +0100
@@ -0,0 +1,97 @@
+/**
+ * Back 2 Browser Bytecode Translator
+ * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, version 2 of the License.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. Look for COPYING file in the top folder.
+ * If not, see http://opensource.org/licenses/GPL-2.0.
+ */
+package org.apidesign.vm4brwsr;
+
+/**
+ *
+ * @author Jaroslav Tulach <jtulach@netbeans.org>
+ */
+class StringArray {
+    private String[] arr;
+
+    public StringArray() {
+    }
+
+    private StringArray(String[] arr) {
+        this.arr = arr;
+    }
+    
+    public void add(String s) {
+        if (arr == null) {
+            arr = new String[1];
+        } else {
+            String[] tmp = new String[arr.length + 1];
+            for (int i = 0; i < arr.length; i++) {
+                tmp[i] = arr[i];
+            }
+            arr = tmp;
+        }
+        arr[arr.length - 1] = s;
+    }
+    
+    public String[] toArray() {
+        return arr == null ? new String[0] : arr;
+    }
+    
+    static StringArray asList(String... names) {
+        return new StringArray(names);
+    }
+
+    void reverse() {
+        for (int i = 0, j = arr.length; i < j; i++) {
+            String s = arr[i];
+            arr[i] = arr[--j];
+            arr[j] = s;
+        }
+    }
+
+    boolean contains(String n) {
+        if (arr == null) {
+            return false;
+        }
+        for (int i = 0; i < arr.length; i++) {
+            if (n.equals(arr[i])) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    void delete(int indx) {
+        if (arr == null || indx < 0 || indx >= arr.length) {
+            return;
+        }
+        String[] tmp = new String[arr.length - 1];
+        for (int i = 0, j = 0; i < arr.length; i++) {
+            if (i != indx) {
+                tmp[j++] = arr[i];
+            }
+        }
+        arr = tmp;
+    }
+
+    int indexOf(String ic) {
+        for (int i = 0; i < arr.length; i++) {
+            if (ic.equals(arr[i])) {
+                return i;
+            }
+        }
+        return -1;
+    }
+    
+}