diff options
| author | aarne <aarne@cs.chalmers.se> | 2008-06-25 16:43:48 +0000 |
|---|---|---|
| committer | aarne <aarne@cs.chalmers.se> | 2008-06-25 16:43:48 +0000 |
| commit | b96b36f43de3e2f8b58d5f539daa6f6d47f25870 (patch) | |
| tree | 0992334be13cec6538a1dea22fbbf26ad6bdf224 /src/GF/Parsing/CFG/General.hs | |
| parent | fe367412e0aeb4ad5c02de68e6eca382e0f96984 (diff) | |
removed src for 2.9
Diffstat (limited to 'src/GF/Parsing/CFG/General.hs')
| -rw-r--r-- | src/GF/Parsing/CFG/General.hs | 103 |
1 files changed, 0 insertions, 103 deletions
diff --git a/src/GF/Parsing/CFG/General.hs b/src/GF/Parsing/CFG/General.hs deleted file mode 100644 index 4f5959a85..000000000 --- a/src/GF/Parsing/CFG/General.hs +++ /dev/null @@ -1,103 +0,0 @@ ----------------------------------------------------------------------- --- | --- Maintainer : PL --- Stability : (stable) --- Portability : (portable) --- --- > CVS $Date: 2005/04/21 16:23:08 $ --- > CVS $Author: bringert $ --- > CVS $Revision: 1.4 $ --- --- CFG parsing with a general chart ------------------------------------------------------------------------------ - -module GF.Parsing.CFG.General - (parse, Strategy) where - -import GF.System.Tracing -import GF.Infra.Print - -import GF.Formalism.Utilities -import GF.Formalism.CFG -import GF.Parsing.CFG.PInfo -import GF.Data.GeneralDeduction -import GF.Data.Assoc -import Control.Monad - -parse :: (Ord n, Ord c, Ord t) => Strategy -> CFParser c n t -parse strategy grammar start = extract . - tracePrt "Parsing.CFG.General - size internal of chart" - (prt . length . chartList) . - process strategy grammar start - --- | parsing strategy: (isBottomup, isTopdown) -type Strategy = (Bool, Bool) - -extract :: (Ord n, Ord c, Ord t) => - IChart n (Symbol c t) -> CFChart c n t -extract chart = [ CFRule (Edge j k cat) daughters name | - Edge j k (Cat cat, found, [], Just name) <- chartList chart, - daughters <- path j k (reverse found) ] - where path i k [] = [ [] | i==k ] - path i k (Tok tok : found) - = [ Tok tok : daughters | - daughters <- path (i+1) k found ] - path i k (Cat cat : found) - = [ Cat (Edge i j cat) : daughters | - Edge _i j _cat <- chartLookup chart (Passive (Cat cat) i), - daughters <- path j k found ] - - -process :: (Ord n, Ord c, Ord t) => - Strategy -- ^ (isBottomup, isTopdown) :: (Bool, Bool) - -> CFPInfo c n t -- ^ parser information (= grammar) - -> [c] -- ^ list of starting categories - -> Input t -- ^ input string - -> IChart n (Symbol c t) -process (isBottomup, isTopdown) grammar start - = trace2 "Parsing.CFG.General - strategy" ((if isBottomup then " BU" else "") ++ - (if isTopdown then " TD" else "")) $ - buildChart keyof [predict, combine] . axioms - where axioms input = initial ++ scan input - - scan input = map (fmap mkEdge) (inputEdges input) - mkEdge tok = (Tok tok, [], [], Nothing) - - -- the combine rule - combine chart (Edge j k (next, _, [], _)) - = [ edge `forwardTo` k | edge <- chartLookup chart (Active next j) ] - combine chart edge@(Edge _ j (_, _, next:_, _)) - = [ edge `forwardTo` k | Edge _ k _ <- chartLookup chart (Passive next j) ] - - -- initial predictions - initial = [ loopingEdge 0 rule | cat <- start, rule <- tdRuleLookup ? cat ] - - -- predictions - predict chart (Edge j k (next, _, [], _)) | isBottomup - = [ loopingEdge j rule `forwardTo` k | rule <- bottomupRules grammar ? next ] - -- - - - - - - - - - ^^^^^^^^^^^^^ Kilbury prediction: move dot forward - predict chart (Edge _ k (_, _, Cat cat:_, _)) - = [ loopingEdge k rule | rule <- tdRuleLookup ? cat ] - predict _ _ = [] - - tdRuleLookup | isTopdown = topdownRules grammar - | isBottomup = emptyLeftcornerRules grammar - --- internal representation of parse items - -type Item n s = Edge (s, [s], [s], Maybe n) -type IChart n s = ParseChart (Item n s) (IKey s) -data IKey s = Active s Int - | Passive s Int - deriving (Eq, Ord, Show) - -keyof (Edge _ j (_, _, next:_, _)) = Active next j -keyof (Edge j _ (cat, _, [], _)) = Passive cat j - -forwardTo (Edge i j (cat, found, next:tofind, name)) k - = Edge i k (cat, next:found, tofind, name) - -loopingEdge k (CFRule cat tofind name) = Edge k k (Cat cat, [], tofind, Just name) - - - |
