On Tue, Oct 17, 2000 at 01:18:39PM -0400, Ken Fox wrote:
> Those are hard to understand because so much extra work has to be done to
> compensate for lack of top-down state when doing a bottom-up match.

I haven't found this to be true.

> Since Perl is much more difficult than C++ to parse...

Perl is essentially a natural language processing problem, and so I'd think
twice before hitting it with a pure computer science solution.

Come on, guys, take a look at toke.c; there's a *probabilistic* part-of-speech
tagger in there. This is NLP, and we do things differently.

Have you read this?
ftp://ftp.cs.titech.ac.jp/pub/TR/93/TR93-0003.ps.gz

-- 
This process can check if this value is zero, and if it is, it does
something child-like.
                -- Forbes Burkowski, CS 454, University of Washington

Reply via email to