Resolves issue with parsing comments

src/Eval.hs

@@ -4,8 +4,9 @@ import Parser
 import Research
 
 import Data.Map (Map)
-import qualified Data.Map as Map
 import Data.List (foldl')
+
+import qualified Data.Map as Map
 import qualified Data.Set as Set
 
 evalSingle :: Map String T -> TricuAST -> Map String T
@@ -51,6 +52,7 @@ evalAST env term = case term of
     SStr str -> ofString str
     SInt num -> ofNumber num
     SList elems -> ofList (map (evalAST Map.empty) elems)
+    SEmpty -> Leaf
     SFunc name args body ->
         error $ "Unexpected function definition " ++ name
         ++ " in evalAST; define via evalSingle."
@@ -66,9 +68,8 @@ eliminateLambda (TFork l r) = TFork (eliminateLambda l) (eliminateLambda r)
 eliminateLambda (SList xs) = SList (map eliminateLambda xs)
 eliminateLambda other = other
 
--- This is my attempt to implement the lambda calculus elimination rules defined
--- in "Typed Program Analysis without Encodings" by Barry Jay.
 -- https://github.com/barry-jay-personal/typed_tree_calculus/blob/main/typed_program_analysis.pdf
+-- Chapter 4: Lambda-Abstraction
 lambdaToT :: String -> TricuAST -> TricuAST
 lambdaToT x (SVar y)
   | x == y = tI