Re: Practicalities of Ada for app development

[quiet_lad <gavcomedy@gmail.com>]

On Jun 13, 5:57 am, Maciej Sobczak <see.my.homep...@gmail.com> wrote:
> On 13 Cze, 12:31, quiet_lad <gavcom...@gmail.com> wrote:
>
> > How handle the strings without regex?
>
> I see you insist very much on having support for regexps, but there is
> something that bothers me about the way they are typically
> implemented.
> Programs that use regexps *usually* have them coded statically. The
> run-time loading of regexp patterns is very rare. The problem with
> static patterns is that they are anyway processed at run-time (they
> are somehow analyzed at runtime and some internal representation is
> *dynamically* created in memory that later helps in processing the
> subject strings), meaning that every time the program is run, the same
> "statically" coded pattern has to be analyzed and the structure has to
> be constructed from scratch. That is, there is some conceptual
> mismatch and potentially lost optimization opportunity, due to the
> fact that we go from something that is known statically to something
> that has a run-time nature. This is just counterproductive.
>
> I would rather ask about an external tool that can take my regexp
> pattern and generate the *static* code structure that processes input
> strings accordingly. Such a generated code can be then included in the
> final application just like IDL-generated serializers are used. The
> advanta of such approach is that there is no tradeoff between regexp
> analysis speed vs. string processing speed and there is no time wasted
> on analyzing the same pattern many times.
>
> In short: in a typical application (whether this is web service or
> something else) you don't need regexp support in the language; you
> need regexp processor code generator.
>
> --
> Maciej Sobczak *http://www.msobczak.com*http://www.inspirel.com

I do not insist.  I just see regex used and am amazed there is
alternative.  I am also glad there is one.