fst: Finite state transducers

[ bsd3, compilers-interpreters, library, program ] [ Propose Tags ]

Fst is an application for construction and running of finite state transducers. The application was written purely in Haskell, and is intended to be a tool for the Haskell programmer, especially for ones that develop language applications.

Modules

[Last Documentation]

  • FST
    • 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.RRegTypes
    • FST.RegTypes
    • FST.Reversal
    • FST.ReversalT
    • FST.RunTransducer
    • FST.StateMonad
    • FST.Transducer
    • FST.TransducerInterface
    • FST.TransducerTypes
    • FST.Utils

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.9, 0.9.0.1, 0.10.0.0, 0.10.0.1
Dependencies array, base, haskell98 [details]
License BSD-3-Clause
Author Markus Forsberg
Maintainer Markus Forsberg <markus@cs.chalmers.se>
Category Compilers/Interpreters
Home page http://www.cs.chalmers.se/~markus/fstStudio/
Uploaded by GwernBranwen at 2008-02-13T20:40:32Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Executables fst
Downloads 4134 total (15 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2017-01-03 [all 7 reports]