Re: lexing backwards

"Ron Pinkas" <Ron@Profit-Master.com>
18 May 2003 23:51:21 -0400

          From comp.compilers
Related articles
[6 earlier articles]
Re: lexing backwards monnier+comp.compilers/news/@rum.cs.yale.edu (Stefan Monnier) (2003-04-15)
Re: lexing backwards cfc@TheWorld.com (Chris F Clark) (2003-04-15)
Re: lexing backwards genew@mail.ocis.net (2003-05-06)
Re: lexing backwards Ron@Profit-Master.com (Ron Pinkas) (2003-05-14)
Re: lexing backwards Ron@Profit-Master.com (Ron Pinkas) (2003-05-16)
Re: lexing backwards genew@mail.ocis.net (2003-05-16)
Re: lexing backwards Ron@Profit-Master.com (Ron Pinkas) (2003-05-18)
Re: lexing backwards genew@mail.ocis.net (2003-05-24)
| List of all articles for this month |
From: "Ron Pinkas" <Ron@Profit-Master.com>
Newsgroups: comp.compilers
Date: 18 May 2003 23:51:21 -0400
Organization: PTS
References: 03-04-015 03-04-026 03-04-030 03-05-044 03-05-090 03-05-132
Keywords: lex
Posted-Date: 18 May 2003 23:51:20 EDT

> Take 2: (I still enjoy take 1, but my educated public demands
> more sophisticated entertainment.) No comment, no comment:
> a=b---c;
> Parse that backwards.
> ...


Please note that while the subject of the thread is indeed "lexing
backwards", nothing in my post made any attempt to address *backward*
lexing. My original post was in reply to a reply, which highlighted
certain common classes of tokens. My reply addressed that specific
subject, and attempted to expand and possibly further clarify that
approach, as the conceptual basis for developing generic lexing
engine.


Ron

Post a followup to this message

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