Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] ANNOUNCE: mod_caml 1.0.6 - includes security patch
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-01-16 (06:15)
From: james woodyatt <jhw@w...>
Subject: Re: [Caml-list] ANNOUNCE: mod_caml 1.0.6 - includes security patch
On 15 Jan 2004, at 08:53, Richard Jones wrote:
> On Thu, Jan 15, 2004 at 05:19:44PM +0100, Markus Mottl wrote:
>> I know it looks awful, but the four backslashes in the regexp
>> pattern for re2 indeed only stand for one. They have to be escaped
>> in the OCaml-string and also for PCRE again,
>> i.e. twice. Substitution patterns use the $-sign for escaping -
>> therefore escaping only needs to be done once.
> Another reason to hasten the addition of regular expressions to the
> OCaml lexer, 'a la Perl!

Doesn't the lexer already have regular expressions?  I think you mean 
something to make regular expressions into first-class values in the 
language.  I'm not sure that's necessary.

In my recently released Pagoda Core Foundation library, there is an 
implementation of lazily evaluated deterministic finite automata.  It 
also contains a functional lexical analyzer implementation that uses 
it.  What remains to be done-- and I'm sorta planning to get around to 
doing it myself one of these years-- is to compile regular expressions 
from string values and to do appropriate syntactical glucose with 

Since I released the library under a BSD style license, it's certainly 
*possible* that someone could write an extension that doesn't require 
any changes to the core language.

j h woodyatt <>

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: