|Ada95 to Ada2005 parser - currently using lex/yacc - problem with Unic firstname.lastname@example.org (2006-12-21)|
|Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with email@example.com (2006-12-22)|
|Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with firstname.lastname@example.org (Tommy Nordgren) (2007-03-08)|
|Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with email@example.com (Tom Copeland) (2007-03-16)|
|From:||firstname.lastname@example.org (Hans Aberg)|
|Date:||22 Dec 2006 01:09:11 -0500|
|Posted-Date:||22 Dec 2006 01:09:10 EST|
> In particular, is it going to be at all viable to reuse my exising
> lex/yacc grammar with a tool that supports Unicode - before upgrading
> the grammar to support Ada2005?
Well, you can use a Flex generated lexer to parse UTF-8/32, by rewriting
Unicode regular expression into ones of those encodings. I wrote some
Haskell functions doing that, posted in the Help-Flex mailing list
2005-01-11, "Unicode Flex Character Classes":
Return to the
Search the comp.compilers archives again.