On Sat, 2007-03-24 at 16:52 -0400, Chris King wrote: > On 3/24/07, Erick Tryzelaar <[EMAIL PROTECTED]> wrote: > > How > > difficult would it be to support something like this? > > > > regmatch "host:/foo/bar/baz" with > > | ((alphanumeric+ as ?host) ":" (_* as ?path)) as ?arg => Some (arg, > > host, port) > > | _ => None > > endregmatch; > > I thought Felix did this already, at least for regexps?
It does it using TRE binding, but not in the lexer generator. As mentioned in prior post, Ocamllex does it for a deterministic automaton, which none of Laurikari's paper cover explicitly, and I have hacked some of the ocaml sources to try to figure out what it means -- the Ocamllex sources aren't well commented, and it does other things like compress the DFA as well. Someone has done a Haskell implementation of tagged automata, but I don't know if it's a DFA or NFA based implementation. -- John Skaller <skaller at users dot sf dot net> Felix, successor to C++: http://felix.sf.net ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Felix-language mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/felix-language
