diff options
Diffstat (limited to 'src/GF/Speech')
| -rw-r--r-- | src/GF/Speech/CFGToFiniteState.hs | 2 | ||||
| -rw-r--r-- | src/GF/Speech/TransformCFG.hs | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/src/GF/Speech/CFGToFiniteState.hs b/src/GF/Speech/CFGToFiniteState.hs index 2fe3dabb1..7876f637d 100644 --- a/src/GF/Speech/CFGToFiniteState.hs +++ b/src/GF/Speech/CFGToFiniteState.hs @@ -229,7 +229,7 @@ compileAutomata g = [(c, makeOneFA c) | c <- allCats g] -- | The make_fa algorithm from \"Regular approximation of CFLs: a grammatical view\", -- Mark-Jan Nederhof. International Workshop on Parsing Technologies, 1997, -- adapted to build a finite automaton for a single (mutually recursive) set only. --- Categories not in the set (fromJustMap.lookup c mrs)will result in category-labelled edges. +-- Categories not in the set will result in category-labelled edges. make_fa1 :: MutRecSet -- ^ The set of (mutually recursive) categories for which -- we are building the automaton. -> State -- ^ State to come from diff --git a/src/GF/Speech/TransformCFG.hs b/src/GF/Speech/TransformCFG.hs index f2a3a2fba..08aae8897 100644 --- a/src/GF/Speech/TransformCFG.hs +++ b/src/GF/Speech/TransformCFG.hs @@ -36,7 +36,7 @@ import GF.Speech.FiniteState import Control.Monad import Data.FiniteMap import Data.List -import Data.Maybe (fromJust, fromMaybe) +import Data.Maybe (fromMaybe) import Data.Set (Set) import qualified Data.Set as Set |