Related articles |
---|
Grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-05) |
New tool to write JIT compilers bonzini@gnu.org (2000-02-05) |
Re: Grammar ambiguity idbaxter@semdesigns.com (Ira D. Baxter) (2000-02-10) |
Re: Grammar ambiguity rsherry@home.com (Robert Sherry) (2000-02-10) |
Re: Grammar ambiguity j.coulmance@itecor.com (Jocelyn Coulmance) (2000-02-12) |
Re: grammar ambiguity world!cfc@uunet.uu.net (Chris F Clark) (2000-02-12) |
Re: Grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-12) |
Re: grammar ambiguity compres@world.std.com (Chris F Clark) (2000-02-12) |
Re: Grammar ambiguity cbrtjr@ix.netcom.com (Charles E. Bortle, Jr.) (2000-02-13) |
Re: Grammar ambiguity j.coulmance@itecor.com (Jocelyn Coulmance) (2000-02-19) |
Re: grammar ambiguity wclodius@aol.com (2000-02-21) |
Re: grammar ambiguity world!cfc@uunet.uu.net (Chris F Clark) (2000-02-27) |
Re: Grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-27) |
Re: grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-27) |
[4 later articles] |
From: | Chris F Clark <compres@world.std.com> |
Newsgroups: | comp.compilers |
Date: | 12 Feb 2000 23:57:30 -0500 |
Organization: | The World Public Access UNIX, Brookline, MA |
References: | 00-02-024 00-02-051 |
Keywords: | parse, bibliography |
I was asked for a reference on the following section, and it seemed worth
posting:
> A different approach to extending the reach of parsers is the use of
> non-terminal lookahead. I have 3 papers by someone who researched
> that, and called the technique non-canonical LR if I recall correctly.
One of the papers was:
Building Efficient Two-Stack Parsers:
One-Symbol Look-ahead Parsing for a Broad Class of Context Free Grammars
Robert E. Buckley
University of South Australia
(Bob.Buckley@UniSA.edu.au)
Michael J. Oudshoorn
University of Adelaide
(michael@cs.adelaide.edu.au)
BTW, they do not call their method "non-canonical" (at least not in
the above paper). That name was invented by Knuth and refers to
parsing mathods that reduce something other than the left-most
possible reduction, and includes their technique (as they can reduce
the look-ahead non-terminal before the non-terminal in conflict).
Hope this helps,
-Chris
*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. CompuServe : 74252,1375
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)
------------------------------------------------------------------------------
Web Site in Progress: Web Site : http://world.std.com/~compres
Return to the
comp.compilers page.
Search the
comp.compilers archives again.