Path: csiph.com!usenet.pasdenom.info!weretis.net!feeder4.news.weretis.net!nuzba.szn.dk!pnx.dk!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Robert Klemme Newsgroups: comp.lang.java.programmer Subject: Re: regexp(ing) Backus-Naurish expressions ... Date: Wed, 13 Mar 2013 08:07:25 +0100 Lines: 22 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Trace: individual.net pxJUaKu4MIelPCjlVIK1JAF8RiwTlQu7kq7Ygght7GxvvMo0zJR3CmrSx9oQ6eXGg= Cancel-Lock: sha1:7h+Wk9uN8qLiTXae2EJQcjD71TI= User-Agent: Mozilla/5.0 (Windows NT 6.0; WOW64; rv:17.0) Gecko/20130215 Thunderbird/17.0.3 In-Reply-To: X-Antivirus: avast! (VPS 130312-0, 12.03.2013), Outbound message X-Antivirus-Status: Clean Xref: csiph.com comp.lang.java.programmer:22942 On 10.03.2013 15:57, Roedy Green wrote: > On Sun, 10 Mar 2013 02:27:32 +0000 (UTC), > qwertmonkey@syberianoutpost.ru wrote, quoted or indirectly quoted > someone who said : > >> Any ideas you would share? > > Regexes are quite limited. When you bang into their limits you can > write a finite state machine or use a parser. Roedy, I'm still curious what would make me want to write a FSM by hand over using a Regex engine. What limitations and reasons did you have in mind when you wrote the above? Cheers robert -- remember.guy do |as, often| as.you_can - without end http://blog.rubybestpractices.com/