3 -- These bindings are highly experimental and subject to change
4 -- without notice. You've been warned.
6 module SBP(Tree(Tree),Location(Location),Region(Region),parseFile,prettyPrintTree,coalesceFlatHeadlessNodes)
9 #if defined(java_HOST_OS)
12 import Text.PrettyPrint.HughesPJ
13 #define CONCAT(x,y) x/**/y
14 #define DEFINE_OBJECT(s,name) \
15 data CONCAT(name,_); \
16 type name = Object CONCAT(name,_); \
17 foreign import jvm s CONCAT(_,name) :: JClass; \
18 instance JType_ CONCAT(name,_) where jClass_ _ = CONCAT(_,name);
21 import Class_edu_berkeley_sbp_misc_HaskellHelper;
22 import Class_java_lang_Object;
23 import Class_java_lang_Class;
24 import Class_java_lang_String;
25 import Class_edu_berkeley_sbp_Tree;
26 import Header_edu_berkeley_sbp_Tree;
27 import JVM_edu_berkeley_sbp_misc_HaskellHelper;
28 import Header_edu_berkeley_sbp_misc_HaskellHelper;
35 import Text.PrettyPrint.HughesPJ
38 data Location = Location Int Int
39 data Region = Region Location Location
41 data Tree = Tree String [Tree] Region
44 show t@(Tree _ _ _) = show $ prettyPrintTree $ t
46 coalesceFlatHeadlessNodes t@(Tree s children r)
47 | s==[], flat t = Tree (concat $ map (\(Tree s _ _) -> s) children) [] r
48 | otherwise = Tree s (map coalesceFlatHeadlessNodes children) r
50 flat (Tree _ children _) = not (any id $ map notFlatComponent children)
51 notFlatComponent (Tree _ [] _) = False
52 notFlatComponent (Tree _ _ _) = True
54 prettyPrintTree (Tree "" [] _) = empty
55 prettyPrintTree (Tree s [] _) = text s
56 prettyPrintTree (Tree [] children _) = prettyPrintTreeList children
57 prettyPrintTree (Tree s children _) = (text (s++":")) <+> (nest 4 $ prettyPrintTreeList children)
58 prettyPrintTreeList [] = text "{}"
59 prettyPrintTreeList children = (text "{") <+> ((fsep $ map prettyPrintTree children) <+> (text "}"))
61 nullRegion = (Region (Location 0 0) (Location 0 0))
65 ------------------------------------------------------------------------------
66 #if defined(java_HOST_OS)
67 foreign import jvm type "edu.berkeley.sbp.Tree" JTree#
68 data JTree = JTree JTree#
69 foreign import jvm safe "edu.berkeley.sbp.misc.RegressionTests.main" regressionTests :: IO ()
70 foreign import jvm safe "edu.berkeley.sbp.misc.HaskellHelper.help0" haskellHelper :: JString -> JString -> IO JTree
71 foreign import jvm safe "edu.berkeley.sbp.misc.HaskellHelper.isNull" isNull :: (Object a) -> IO Bool
72 foreign import jvm safe "getHead" getHead :: JTree -> IO (Object a)
73 foreign import jvm safe "child" getChild :: JTree -> Int32 -> IO JTree
74 foreign import jvm safe "size" size :: JTree -> IO Int32
75 foreign import jvm safe "toString" jtoString :: (Object a) -> IO JString
77 toString o = do isn <- isNull o
79 else do str <- jtoString o
80 return (unpackJString str)
83 haskify :: JTree -> IO Tree
88 children <- if numChildren == 0
90 else do children <- mapM (\i -> getChild t i)
91 $ take (fromIntegral numChildren)
93 h <- mapM haskify children
95 return $ Tree str children nullRegion
98 String -> -- grammar *.g file
99 String -> -- file to be parsed
102 parseFile g f = do g' <- packJString g
104 tree <- haskellHelper g' f'
108 ------------------------------------------------------------------------------
110 -- Why do I need this?
111 instance SubJavaClassMarker
112 Header_edu_berkeley_sbp_Tree.Class_Jedu_berkeley_sbp_Tree
113 Header_edu_berkeley_sbp_misc_HaskellHelper.Class_Jedu_berkeley_sbp_Tree
116 [String] -> -- class path
117 String -> -- grammar *.g file
118 String -> -- file to be parsed
121 parseFile classPath grammarFile inputFile =
123 ((do class_JHaskellHelper
124 s1 <- new_JString_ArrayJchar $ toJavaString grammarFile
125 s2 <- new_JString_ArrayJchar $ toJavaString inputFile
126 tree <- main_JHaskellHelper_JString_JString (s1, s2)
127 t <- haskifyTree tree
132 ((do class_JHaskellHelper
134 head <- getHead_JTree t ()
135 isNull <- getIsNothing head
136 str <- if isNull then (return "") else (toString_JObject ((castTLRef head) :: Jjava_lang_Object) () >>= getStringUTF >>= \x -> return (showUTF8 x))
137 numChildren <- size_JTree t()
138 children <- if numChildren == 0
140 else do children <- mapM (\i -> child_JTree_Jint t ((fromIntegral i)::Int32))
141 $ take (fromIntegral numChildren)
143 h <- mapM (\c -> haskifyTree (castTLRef c)) children
145 return $ Tree str children nullRegion