msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

option pt -funs to show all fun's in a tree

Browse Source
This commit is contained in:
aarne
2013-03-29 11:45:42 +00:00
parent d71d5ae25b
commit ca73f4554c
1 changed files with 10 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
src/compiler/GF/Command/TreeOperations.hs
View File

@@ -27,7 +27,9 @@ allTreeOps pgf = [
("smallest",("sort trees from smallest to largest, in number of nodes", ("smallest",("sort trees from smallest to largest, in number of nodes",
Left $ smallest)), Left $ smallest)),
("subtrees",("return all fully applied subtrees (stopping at abstractions), by default sorted from the largest", ("subtrees",("return all fully applied subtrees (stopping at abstractions), by default sorted from the largest",
Left $ concatMap subtrees)) Left $ concatMap subtrees)),
("funs",("return all fun functions appearing in the tree, with duplications",
Left $ concatMap funNodes))
] ]
largest :: [Expr] -> [Expr] largest :: [Expr] -> [Expr]
@@ -45,6 +47,13 @@ subtrees t = t : case unApp t of
Just (f,ts) -> concatMap subtrees ts Just (f,ts) -> concatMap subtrees ts
_ -> [] -- don't go under abstractions _ -> [] -- don't go under abstractions
funNodes :: Expr -> [Expr]
funNodes t = case t of
EAbs _ _ e -> funNodes e
EApp e1 e2 -> funNodes e1 ++ funNodes e2
EFun _ -> [t]
_ -> [] -- not literals, metas, etc
--- simple-minded transfer; should use PGF.Expr.match --- simple-minded transfer; should use PGF.Expr.match
transfer :: PGF -> CId -> Expr -> Expr transfer :: PGF -> CId -> Expr -> Expr