From: matz@... (Yukihiro Matsumoto)
Date: 2001-06-15T08:16:54+09:00
Subject: [ruby-talk:16483] Re: Opinion sought: parsing non-regular languages

Hi,

In message "[ruby-talk:16482] Re: Opinion sought: parsing non-regular languages"
    on 01/06/15, "Benjamin J. Tilly" <ben_tilly@operamail.com> writes:

|>  * it makes regex more complex, which already is too complex for my
|>    brain to understand.
|
|Regular expressions are not that complex.  The average
|regular expression can be described in several lines of
|a natural language.

Well, I didn't mean regular expressions themselves, but meant regex
implementation, which is my concern.

|>I wish I could accomplish it by finding workaround.
|
|Does anyone have a practical use for this in mind?

I have ever seen backtracking programming like prolog by using this
feature.  I have to admit I felt like it's insane.

							matz.