Sujet : Re: Command Languages Versus Programming Languages
De : janis_papanagnou+ng (at) *nospam* hotmail.com (Janis Papanagnou)
Groupes : comp.lang.miscDate : 19. Nov 2024, 06:14:27
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vhh6rk$1mn6o$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11
User-Agent : Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.8.0
On 12.11.2024 17:50, Wolfgang Agnes wrote:
Janis Papanagnou <janis_papanagnou+ng@hotmail.com> writes:
[...]
By Chomsky-3 you mean a grammar of type 3 in the Chomsky hierarchy? And
that would be ``regular'' language, recognizable by a finite-state
automaton? If not, could you elaborate on the terminology?
Yes. I hoped the term was clear enough. If I had used too sloppy
wording in my ad hoc writing I apologize for the inconvenience.
My point was about runtime guarantees and complexities (O(N)) of
Regexp processing, which are also reflected by the FSA model.
Janis