mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-10 05:29:30 -06:00
49 lines
1.7 KiB
Haskell
49 lines
1.7 KiB
Haskell
----------------------------------------------------------------------
|
|
-- |
|
|
-- Module : VisualizeTree
|
|
-- Maintainer : AR
|
|
-- Stability : (stable)
|
|
-- Portability : (portable)
|
|
--
|
|
-- > CVS $Date:
|
|
-- > CVS $Author:
|
|
-- > CVS $Revision:
|
|
--
|
|
-- Print a graph of an abstract syntax tree in Graphviz DOT format
|
|
-- Based on BB's VisualizeGrammar
|
|
-- FIXME: change this to use GF.Visualization.Graphviz,
|
|
-- instead of rolling its own.
|
|
-----------------------------------------------------------------------------
|
|
|
|
module PGF.VisualizeTree ( visualizeTrees
|
|
) where
|
|
|
|
import PGF.CId (prCId)
|
|
import PGF.Data
|
|
import PGF.Macros (lookValCat)
|
|
|
|
visualizeTrees :: PGF -> (Bool,Bool) -> [Tree] -> String
|
|
visualizeTrees pgf funscats = unlines . map (prGraph False . tree2graph pgf funscats)
|
|
|
|
tree2graph :: PGF -> (Bool,Bool) -> Tree -> [String]
|
|
tree2graph pgf (funs,cats) = prf [] where
|
|
prf ps t = case t of
|
|
Fun cid trees ->
|
|
let (nod,lab) = prn ps cid in
|
|
(nod ++ " [label = " ++ lab ++ ", style = \"solid\", shape = \"plaintext\"] ;") :
|
|
[ pra (j:ps) nod t | (j,t) <- zip [0..] trees] ++
|
|
concat [prf (j:ps) t | (j,t) <- zip [0..] trees]
|
|
prn ps cid =
|
|
let
|
|
fun = if funs then prCId cid else ""
|
|
cat = if cats then prCat cid else ""
|
|
colon = if funs && cats then " : " else ""
|
|
lab = "\"" ++ fun ++ colon ++ cat ++ "\""
|
|
in (show(show (ps :: [Int])),lab)
|
|
pra i nod t@(Fun cid _) = nod ++ arr ++ fst (prn i cid) ++ " [style = \"solid\"];"
|
|
arr = " -- " -- if digr then " -> " else " -- "
|
|
prCat = prCId . lookValCat pgf
|
|
|
|
prGraph digr ns = concat $ map (++"\n") $ [graph ++ "{\n"] ++ ns ++ ["}"] where
|
|
graph = if digr then "digraph" else "graph"
|