Re: LR-parser-based lexical analysis - does it work?

"Brian Smith" <brian-l-smith@uiowa.edu>
18 Oct 2002 23:20:55 -0400

          From comp.compilers
Related articles
LR-parser-based lexical analysis - does it work? soenke.kannapinn@wincor-nixdorf.com (=?iso-8859-1?Q?S=F6nke_Kannapinn?=) (2002-10-13)
Re: LR-parser-based lexical analysis - does it work? cfc@shell01.TheWorld.com (Chris F Clark) (2002-10-18)
Re: LR-parser-based lexical analysis - does it work? vmakarov@redhat.com (Vladimir N. Makarov) (2002-10-18)
Re: LR-parser-based lexical analysis - does it work? vbdis@aol.com (VBDis) (2002-10-18)
Re: LR-parser-based lexical analysis - does it work? brian-l-smith@uiowa.edu (Brian Smith) (2002-10-18)
Re: LR-parser-based lexical analysis - does it work? grosch@cocolab.de (Josef Grosch) (2002-10-18)
Re: LR-parser-based lexical analysis - does it work? zackw@panix.com (Zack Weinberg) (2002-10-20)
| List of all articles for this month |
From: "Brian Smith" <brian-l-smith@uiowa.edu>
Newsgroups: comp.compilers
Date: 18 Oct 2002 23:20:55 -0400
Organization: http://groups.google.com/
References: 02-10-030
Keywords: lex, LR(1)
Posted-Date: 18 Oct 2002 23:20:55 EDT

"=?iso-8859-1?Q?S=F6nke_Kannapinn?=" <soenke.kannapinn@wincor-nixdorf.com> wrote
> In a compiler generator project we are thinking about building
> scanners using LR parser techniques.


ANTLR (http://www.antlr.org) uses predicated LL(k) grammars for its
scanners. I believe that due to the predicates that it can lex even
context-sensitive languages, which means it is "stronger" than LR(k)
for any k (I believe). So, maybe it will work for what you want.


ANTLR is written in Java and can produce Java, C++, and C#
translators.


- Brian

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.