fst 0.9 → 0.9.0.1
raw patch · 5 files changed
+39/−42 lines, 5 filesdep −haskell98dep ~basenew-uploader
Dependencies removed: haskell98
Dependency ranges changed: base
Files
- FST/AutomatonInterface.hs +5/−5
- FST/LBFA.hs +8/−8
- FST/RRegTypes.hs +14/−14
- FST/TransducerInterface.hs +7/−7
- fst.cabal +5/−8
FST/AutomatonInterface.hs view
@@ -14,12 +14,12 @@ determinize, compile, Automaton,- states,- isFinal,+-- states,+-- isFinal, initial,- finals,- transitionList,- transitions,+-- finals,+-- transitionList,+-- transitions, showAutomaton, module FST.RegTypes, module FST.AutomatonTypes,
FST/LBFA.hs view
@@ -10,15 +10,15 @@ module FST.LBFA ( module FST.Automaton, LBFA, -- Data type for LBFA- states, -- get the states of a LBFA- finals, -- get the final states of a LBFA- isFinal, -- check if a state is a final state.- transitionTable,- transitionList, -- get the transitions of a state.- transitions, -- get the transitions of a state and a symbol- alphabet, -- get the alphabet of a LBFA.+-- states, -- get the states of a LBFA+-- finals, -- get the final states of a LBFA+-- isFinal, -- check if a state is a final state.+-- transitionTable,+-- transitionList, -- get the transitions of a state.+-- transitions, -- get the transitions of a state and a symbol+-- alphabet, -- get the alphabet of a LBFA. initial, -- get the initial state of a LBFA.- lastState, -- get the max state of a LBFA.+-- lastState, -- get the max state of a LBFA. compileToLBFA, compileToAutomaton ) where
FST/RRegTypes.hs view
@@ -10,16 +10,16 @@ module FST.RRegTypes ( module FST.RegTypes, RReg(..), -- data type for regular relations.- (<|>), -- union combinator for regular relations.- (|>), -- product combinator for regular relations.- star, -- Kleene's star for regular relations.- plus, -- Kleene's plus for regular relations.- empty, -- The empty set of regular relations.+-- (<|>), -- union combinator for regular relations.+-- (|>), -- product combinator for regular relations.+-- star, -- Kleene's star for regular relations.+-- plus, -- Kleene's plus for regular relations.+-- empty, -- The empty set of regular relations. (<*>), -- Cross product opertor. (<.>), -- Composition operator. idR, -- Identity relation. r, -- Relation.- symbols -- Collect the symbols in a regular relations.+-- symbols -- Collect the symbols in a regular relations. ) where import FST.RegTypes@@ -33,14 +33,14 @@ -} data RReg a- = Cross (Reg a) (Reg a) {- *** Cross product *** -}- | Comp (RReg a) (RReg a) {- *** Composition *** -}- | ProductR (RReg a) (RReg a) {- *** Concatenation *** -}- | UnionR (RReg a) (RReg a) {- *** Union *** -}- | StarR (RReg a) {- *** Kleene star *** -}- | Identity (Reg a) {- *** Identity relation *** -}- | Relation (Symbol a) (Symbol a) {- *** (a:b) *** -}- | EmptyR {- *** Empty language *** -}+ = Cross (Reg a) (Reg a) -- ^ Cross product + | Comp (RReg a) (RReg a) -- ^ Composition + | ProductR (RReg a) (RReg a) -- ^ Concatenation + | UnionR (RReg a) (RReg a) -- ^ Union + | StarR (RReg a) -- ^ Kleene star + | Identity (Reg a) -- ^ Identity relation + | Relation (Symbol a) (Symbol a) -- ^ (a:b) + | EmptyR -- ^ Empty language deriving (Eq) {- *************************************
FST/TransducerInterface.hs view
@@ -13,14 +13,14 @@ minimize, determinize, Transducer,- states,- isFinal,- initial,- finals,+-- states,+-- isFinal,+-- initial,+-- finals, transitions,- transitionList,- transitionsU,- transitionsD,+-- transitionList,+-- transitionsU,+-- transitionsD, showTransducer, module FST.RRegTypes, module FST.TransducerTypes,
fst.cabal view
@@ -1,5 +1,5 @@ name: fst-version: 0.9+version: 0.9.0.1 synopsis: Finite state transducers description: Fst is an application for construction and running of finite state transducers. The application was written@@ -9,28 +9,25 @@ license: BSD3 license-file: LICENSE author: Markus Forsberg-maintainer: Markus Forsberg <markus@cs.chalmers.se>-homepage: http://www.cs.chalmers.se/~markus/fstStudio/+homepage: http://www.cse.chalmers.se/alumni/markus/fstStudio/ build-type: Simple-build-depends: base, haskell98 Cabal-Version: >= 1.2 tested-with: GHC==6.8.2 data-files: doc/fstMan0.9.ps, doc/Interface0.9.ps Library- Build-Depends: base, haskell98, array+ Build-Depends: base>=3 && <5, array exposed-modules: FST.Alex, FST.Arguments, FST.Automaton, FST.AutomatonInterface, FST.AutomatonTypes, FST.Complete, FST.Deterministic, FST.DeterministicT, FST.EpsilonFreeT, FST.FileImport, FST.GetOpt, FST.Info, FST.LBFA, FST.LBFT, FST.Lexer, FST.MinimalBrzozowski, FST.MinimalTBrzozowski, FST.NReg, FST.Parse, FST.RegTypes, FST.Reversal, FST.ReversalT, FST.RRegTypes, FST.RunTransducer, FST.StateMonad, FST.Transducer, FST.TransducerInterface, FST.TransducerTypes, FST.Utils- ghc-options: -O2 -Wall -optl-Wl,-s+ ghc-options: -O2 ghc-prof-options: -prof -auto-all Executable fst- executable: fst main-is: FST/Main.hs- ghc-options: -O2 -Wall -optl-Wl,-s+ ghc-options: -O2 ghc-prof-options: -prof -auto-all