Re: Scanner takes a long time to build.

[Hans Aberg]

At 12:37 +0200 2002/07/26, Akim Demaille wrote:
>>>>>> "Hans" == Hans Aberg <address@hidden> writes:
>
>Hans> But loc.cit. also says that one can compute the DFA transitions
>Hans> on the fly, caching them. This will combine the NFA space
>Hans> complexity with the DFA time complexity, it says.
>
>In the case of Flex, which is a batch tool as opposed to Perl which
>aims at being ``interactive'', it doesn't make a lot of sense to
>continue the computation of the automaton at scanner runtime.

Oh, I thought you might volunteer to implement it into Flex as a new
option. :-)

Are you saying that Perl is using this algorithm, caching the states
dynamically of a DFA as the parsing goes along?

  Hans Aberg