@@ -231,15 +231,15 @@ devtree2abstrees = map atiAbsTree . devAbsTrees . root
231231
232232-- to be applied to a DevTree with just one tree at each node
233233addBackups :: Opts -> DevTree -> DevTree
234- addBackups opts | isOpt opts " no-backup " = addBackups0 ---- TODO: this must be improved
235- | otherwise = id
234+ addBackups opts | isOpt opts " no-backups " = id
235+ | otherwise = addBackups0 ---- TODO: this must be improved
236236
237237addBackups0 :: DevTree -> DevTree
238238addBackups0 tr@ (RTree dn trs) = case map collectBackup (tr: trs) of -- backups from the tree itself and every subtree
239239 btrs -> RTree
240240 (dn {devAbsTrees = [
241- replaceInfo [(t,ai) | (_,(t,Just ai)) <- btrs] --
242- (theAbsTreeInfo tr)] -- the only abstree that there is
241+ replaceInfo [(t,ai) | (_,(t,Just ai)) <- btrs] --
242+ (theAbsTreeInfo tr)] -- the only abstree that there is
243243 }
244244 )
245245 (map fst (tail btrs))
@@ -356,7 +356,7 @@ combineTrees env =
356356 where
357357 -- The head only contains new trees that were created in the previous iteration
358358 onlyNewTree = tr {root = nd { devAbsTrees = map funInfoToAbsTreeInfo fis}}
359- -- Add the new trees to the old ones. There shouldn't really be any duplicates now, so there's
359+ -- Add the new trees to the old ones. There shouldn't really be any duplicates now, so there's
360360 -- a bit of redundant checking going on here.
361361 nextTr = combineUnduplicated fis tr
362362
@@ -480,7 +480,7 @@ analyseWords env = mapRTree lemma2fun
480480
481481 auxWords = [(lemma,cat) | ((fun_,lemma),(cat,labels_)) <- M. assocs (lemmaLabels (cncLabels env))]
482482
483- -- auxiliaries
483+ -- auxiliaries
484484newWordTree w c = RTree (mkCId (w ++ " _" ++ showCId c)) [] ---
485485isNewWordFun f = isInfixOf " __x__" (showCId f)
486486unknownCat = mkCId " Adv" --- treat unknown words as adverbs ---- TODO: from config
0 commit comments