Fixed some bugs in Parser::firstSet and added a bit of caching. It still doesn't work quite right, though, there's some problem with nullable left recursion. However, it's better than it was, and I need to go to bed. More work later.

stdlib/mem.krak

@@ -50,6 +50,12 @@ template <T> T* new() {
 	return new<T>(1);
 }
 
+template <T> void delete(T* toDelete, int itemDestructCount) {
+    for (int i = 0; i < itemDestructCount; i++)
+        toDelete[i].destruct();
+    delete(toDelete);
+}
+
 template <T> void delete(T* toDelete) {
 	free<T>(toDelete);
 }