Re: Re (2): Can awk easily simulate an AFSM

problems@[EMAIL PROTECTED]
 wrote:

> OK, apparently "Encode" is the code generation.
> Since I haven't worked with my stuff for many years,
> I only now realise that awk would give me a program
> driven implementation, rather than a data-driven AFSM,
> which is what I want.

AWK can do both. The example I gave was
an implementation similar to C style.
If you really want it data-driven, you
can have it in AWK (few users prefer this
style).

> Apparently I need first to get familiar with *nix regex to
> clean-up my fetched texts ?

It helps, but you can also get along without
too much regexp if you want.

> Apparently my ideas of an AFSM compiler is closer to the 
> table-driven compilers ?

I wouldnt say it this way. I was only surprised
that you would prefer the data-driven style.
A data-driven implementation in canonic AWK may
look like this:

BEGIN { state = "" }

state == ""   && /IF/     { state = "IF"   ; Encode(...) }
state == "IF" && /ELSE/   { state = "ELSE" ; Encode(...) }