Added lexer tests

examples/Fib.lx

@@ -0,0 +1,15 @@
+int fib(int num)
+{
+	# Base cases #
+	if (n == 0) { return 0 }
+	if (n == 1) { return 1 }
+
+	# RECURSION BABYYYY #
+	return fib(n - 1) + fib(n - 2)
+}
+
+int main(void)
+{
+	int res = fib(8)
+	return res == 21
+}