Re: Ada bench : count words

[Marius Amado Alves <amado.alves@netcabo.pt>]

>>           for I in S'Range loop
>>              if S (I) = EOL then Lines := Lines + 1; end if;
>>              if Is_Separator (S (I)) then
>>                 if In_Word then Finish_Word; end if;
>>              else
>>                 if not In_Word then Start_Word; end if;
>>              end if;
>>           end loop;
>>
>> I have not tried with string matching (if that's what you mean with
>> "FSM")....
>
> No, I meant a finite state machine:

Of course. Well, there is already the little FSM above for the word 
count. I didn't extend the FSM to the whole process because the other 
counts (lines, characters) don't need it (they don't depend on any 
state). And I doubt it would increase speed. But someone should try.

> ... FSM is one of that rare cases where gotos are natural. What a pity 
> that Ada
> does not have arrays of labels! (:-))

Indeed. Usually I use an enumeration for states, and a case statement 
on the state, inside a loop.