Related articles |
---|
Ada95 to Ada2005 parser - currently using lex/yacc - problem with Unic twometresteve@googlemail.com (2006-12-21) |
Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with haberg@math.su.se (2006-12-22) |
Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with tricky.tommy@comhem.se (Tommy Nordgren) (2007-03-08) |
Re: Ada95 to Ada2005 parser - currently using lex/yacc - problem with tom@infoether.com (Tom Copeland) (2007-03-16) |
From: | haberg@math.su.se (Hans Aberg) |
Newsgroups: | comp.compilers |
Date: | 22 Dec 2006 01:09:11 -0500 |
Organization: | Mathematics |
References: | 06-12-082 |
Keywords: | Ada, i18n |
Posted-Date: | 22 Dec 2006 01:09:10 EST |
twometresteve@googlemail.com wrote:
> 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":
help-flex@gnu.org
http://lists.gnu.org/mailman/listinfo/help-flex
--
Hans Aberg
Return to the
comp.compilers page.
Search the
comp.compilers archives again.