Re: Pattern recognition Programming language

Re: Pattern recognition Programming language

[tmoran]

> a=b+c;
> some stuff...
> func(a);
 recognized by
> Name_=Name1_ + Name2_
> func(Name_)
  What about:  func(a-c)
How general do you want this tool?  Is it a general data flow analyzer,
or a simple check for special cases in restricted circumstances?

Pattern recognition Programming language

[Patricia R Benjamin]

I have a problem:

Given a stream of tokens representing a program in some programming
language,  I would like to extract and process calls to specific
procedures.  Processing includes recognizing and processing the
statements that develop the arguments that are passed to these
procedures.  The token stream also embodies scoping information which
influences the processing.

The tool I am looking for is closer to a filter generator than a
parser generator. (The token stream is generated by an actual parser).

The tool will recognize families of patterns of tokens, where
individual statements from which these patterns are generated are not
necessarily adjacent in the program being analyzed.

For example, a smipped of program to be analyzed moght look like:

  a=b+c;
  some stuff...
  func(a);

The pattern that extracts this construct could be expressed as:

Name_=Name1_ + Name2_
...
func(Name_)

This pattern should also recognize the following program:

cat=mouse+catch;
mystuff=0;
func(cat)

Mathematica's pattern matching capability seems like a candidate, but
I don't think it is general enough.

Any Ideas anyone

Thanks

Milt Benjamin
Milton.K.Benjamin@lmco.com
856-787-3202

______________________________________________________________________________
Posted Via Binaries.net = SPEED+RETENTION+COMPLETION = http://www.binaries.net

Re: Pattern recognition Programming language

[M. A. Alves]

On Wed, 23 Jan 2002, Patricia R Benjamin wrote:
> . . . Given a stream of tokens representing a program in some
> programming
> language,  I would like to extract and process calls to specific
> procedures.  Processing includes recognizing and processing the
> statements that develop the arguments that are passed to these
> procedures.  The token stream also embodies scoping information which
> influences the processing.
> . . .
> For example, a smipped of program to be analyzed moght look like:
>
>   a=b+c;
>   some stuff...
>   func(a);
>
> The pattern that extracts this construct could be expressed as:
>
> Name_=Name1_ + Name2_
> ...
> func(Name_)
>
> This pattern should also recognize the following program:
>
> cat=mouse+catch;
> mystuff=0;
> func(cat)

Seems like a job for GNAT.Spitbol.Patterns to me :-)

-- 
   ,
 M A R I O   data miner, LIACC, room 221   tel 351+226078830, ext 121
 A M A D O   Rua Campo Alegre, 823         fax 351+226003654
 A L V E S   P-4150-180 PORTO, Portugal    mob 351+939354002

Re: Pattern recognition Programming language

[Robert A Duff]

patbenjamin@home.com (Patricia R Benjamin) writes:

> The tool I am looking for is closer to a filter generator than a
> parser generator. (The token stream is generated by an actual parser).
> 
> The tool will recognize families of patterns of tokens, where
> individual statements from which these patterns are generated are not
> necessarily adjacent in the program being analyzed.

I suggest you ask this question on comp.compilers.

- Bob

Re: Pattern recognition Programming language

[Nick Roberts]

To my knowledge, the 'classic' pattern recognition language is Prolog.

There are many, many other possible languages, but I think it is fair to say
that none of them is as specific to pattern matching but also as
general-purpose and powerful as Prolog. Of course Prolog itself has many
variants available.

Prolog's biggest problem tends to be speed (but only for some applications).
There are compilers (e.g. Mercury), but these have limitations and
complications.

If you do not already know Prolog, get a copy and have a play. It might turn
out to be one of your favourite tools.

--
Best wishes,
Nick Roberts