From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 0D958BC2A for ; Fri, 5 Aug 2005 03:03:19 +0200 (CEST) Received: from smtp1.adl2.internode.on.net (smtp1.adl2.internode.on.net [203.16.214.181]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id j7513HQT026580 for ; Fri, 5 Aug 2005 03:03:18 +0200 Received: from rosella (ppp11-151.lns1.syd7.internode.on.net [59.167.11.151] (may be forged)) by smtp1.adl2.internode.on.net (8.12.9/8.12.9) with ESMTP id j7513Bo2018601; Fri, 5 Aug 2005 10:33:12 +0930 (CST) Subject: Re: [Caml-list] ocamllex problem From: skaller To: Jonathan Roewen Cc: caml-list@yquem.inria.fr In-Reply-To: References: Content-Type: multipart/signed; micalg=pgp-sha1; protocol="application/pgp-signature"; boundary="=-TOqPGh+dFbF04mQ/Qgo6" Date: Fri, 05 Aug 2005 11:03:11 +1000 Message-Id: <1123203791.6720.63.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailer: Evolution 2.2.1.1 X-Miltered: at nez-perce with ID 42F2BAD5.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 ocamllex:01 yup:01 dfa:01 non-trivial:01 pointers:01 frisch:01 regexp:01 nfa:01 dfa:01 wrote:01 sourceforge:01 sourceforge:01 algorithm:01 algorithm:01 X-Attachments: type="application/pgp-signature" name="signature.asc" X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 --=-TOqPGh+dFbF04mQ/Qgo6 Content-Type: text/plain Content-Transfer-Encoding: quoted-printable On Fri, 2005-08-05 at 11:53 +1200, Jonathan Roewen wrote: > Yes, I'm retarded. Ignore me ;-) No way .. you picked something I didn't know: > > | ':'((letter|' ')* as s) { STRING s } I check the manual .. yup, you can match subgroups like that.. How does that work??? The algorithm for handling this for a DFA is non-trivial. Any pointers to the algorithm used? Alain Frisch pointed me at some nasty papers on this, one with a regexp -> NFA conversion and the other with a NFA-> DFA conversion, but I couldn't figure out how to do the direct regexp->DFA conversion, I'd sure like to find an algorithm for that.. --=20 John Skaller --=-TOqPGh+dFbF04mQ/Qgo6 Content-Type: application/pgp-signature; name=signature.asc Content-Description: This is a digitally signed message part -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.5 (GNU/Linux) iD8DBQBC8rrNsRp8/9aGVGsRAtj4AJ9QMAB9vD4lUuiG+O16k96uSwxs2QCfX3Lv oueOdcDmjqRFir6mXnv624c= =MYnt -----END PGP SIGNATURE----- --=-TOqPGh+dFbF04mQ/Qgo6--