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] Need NFA/DFA conversion help
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] Need NFA/DFA conversion help
On Thu, 2004-09-16 at 21:50, Diego Olivier Fernandez Pons wrote:

> In the same way a grammar that admits 'actions in the middle of a
> regexp [] rather than at the end' could hardly qualify as a 'rational
> language' which is what regexp theoretically describe.

Yes, so I am seeking an extension of the theory strong
enough to allow such 'actions' but weak enough to still
allow determinism -- if it exists. And I'll need a constructive
proiof -- that is, an algorithm :)

> - general textbook
> Parsing techniques (Dick Grune, Ceriel J.H. Jacobs) (electronic
> version on free download)

This looks like it would be a great reference but the FTP site
seems to be down.

John Skaller,
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language

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