Left and Right recursive non-terminals

cowboy@cv.lexington.ibm.com
14 Dec 1996 00:39:16 -0500

          From comp.compilers
Related articles
Left and Right recursive non-terminals cowboy@cv.lexington.ibm.com (1996-12-14)
Re: Left and Right recursive non-terminals bart@time.cirl.uoregon.edu (1996-12-15)
Re: Left and Right recursive non-terminals dlmoore@ix.netcom.com (David L Moore) (1996-12-15)
Re: Left and Right recursive non-terminals perle@cs.tu-berlin.de (1996-12-18)
Re: Aho and Ullman theory of parsing books adrian@dcs.rhbnc.ac.uk (1996-12-20)
Re: Left and Right recursive non-terminals bart@time.cirl.uoregon.edu (1996-12-20)
Re: Left and Right recursive non-terminals vonbrand@inf.utfsm.cl (Horst von Brand) (1996-12-26)
| List of all articles for this month |
From: cowboy@cv.lexington.ibm.com
Newsgroups: comp.compilers
Date: 14 Dec 1996 00:39:16 -0500
Organization: IBM T.J. Watson Research Center
Keywords: parse, theory, question

The recent discussions on LL(k) has reminded me of a topic I can no longer
find...


I'm sure I read somewhere that a non-terminal that is both left and right
recursive renders the grammar ambiguous (I think for any k).


Was I dreaming? I can't locate a reference in any of my papers here, and
a perusal through both dragon books didn't turn up anything - though at
those hours, I could've missed a semi ;ª}


Thanks,
Rick Nelson
--

Post a followup to this message

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