Factor out lists of child nodes.

Author: robrix

semantic-analysis/src/Analysis/Syntax.hs

@@ -162,9 +162,10 @@ parseNode o = do
         "false"  -> pure (const (bool False))
         "throw"  -> fmap throw <$> resolve (head edges)
         "if"     -> liftA3 iff <$> findEdgeNamed "condition" <*> findEdgeNamed "consequence" <*> findEdgeNamed "alternative" <|> pure (const noop)
-        "block"  -> fmap (foldr (\ (i, v) r -> let_ (nameI i) v (const r)) noop . zip [0..]) . sequenceA <$> traverse resolve edges
-        "module" -> fmap (foldr (\ (i, v) r -> let_ (nameI i) v (const r)) noop . zip [0..]) . sequenceA <$> traverse resolve edges
+        "block"  -> children
+        "module" -> children
         t        -> A.parseFail ("unrecognized type: " <> t)
+      children = fmap (foldr (\ (i, v) r -> let_ (nameI i) v (const r)) noop . zip [0..]) . sequenceA <$> traverse resolve edges
       resolve = resolveWith (const (pure ()))
       resolveWith :: (A.Object -> A.Parser ()) -> A.Value -> A.Parser (IntMap.IntMap rep -> rep)
       resolveWith f = A.withObject "edge" (\ edge -> do