in reply to Finite State Automata / Transducers

Parse::RecDescent?

T I M T O W T D I
  • Comment on Re: Finite State Automata / Transducers

Replies are listed 'Best First'.
Re: Re: Finite State Automata / Transducers
by demerphq (Chancellor) on Jul 17, 2002 at 12:59 UTC
    Im curious but why do you suggest P::RD? It isnt a FSA in the slightest. In fact it isnt a LR parser at all. (Which are usually implemented as FSM's).

    UPDATE:

    While downvoting is certainly a monks right, id like to register the fact that I see no reason at all for downvoting cine's nodes in this thread. Yeah he was bit abrubt but if you read the advice for downvoting I can see no good reason there why these nodes should be --'d. Downvoting should be reserved for trolls and absolute garbage posts. These nodes while hardly exemplary are neither.

    /rant off

    Yves / DeMerphq
    ---
    Writing a good benchmark isnt as easy as it might look.

      Because I thought she/he is going to use it to parse something and knows about FSA/LR parsers from the standard literature and therefore searched for that.

      T I M T O W T D I

        actualy, i am trying to swig/perl5 openfst 1.8.1-rc1, and have difficulties to find a good root class for it!

        cpython gives ''pywrapfst'', what could we use ?!

        is it an algorithm, a converter, a parser, a data bayes, an AI , or a finite state transducer, etc... ?

        anyway, any work in progress to share is welcomed...thx.