Re: LL vs LR languages (not grammars)

fjh@mundook.cs.mu.OZ.AU (Fergus Henderson)
30 Jun 1996 16:44:06 -0400

          From comp.compilers

Related articles
LL vs LR languages (not grammars) platon!adrian@uunet.uu.net (1996-06-24)
Re: LL vs LR languages (not grammars) leichter@smarts.com (Jerry Leichter) (1996-06-26)
Re: LL vs LR languages (not grammars) ikastan@alumnae.caltech.edu (1996-06-30)
Re: LL vs LR languages (not grammars) fjh@mundook.cs.mu.OZ.AU (1996-06-30)
Re: LL vs LR languages (not grammars) schoebel@minnie.informatik.uni-stuttgart.de (1996-07-01)
Re: LL vs LR languages (not grammars) ikastan@alumnae.caltech.edu (1996-07-01)
Re: LL vs LR languages (not grammars) ikastan@alumnae.caltech.edu (1996-07-02)
Re: LL vs LR languages (not grammars) schoebel@minnie.informatik.uni-stuttgart.de (1996-07-05)
| List of all articles for this month |

From: fjh@mundook.cs.mu.OZ.AU (Fergus Henderson)
Newsgroups: comp.compilers,comp.compilers.tools.pccts
Date: 30 Jun 1996 16:44:06 -0400
Organization: Comp Sci, University of Melbourne
References: 96-06-103 96-06-109
Keywords: parse

A Johnstone wrote:
| We're looking at top down vs bottom up parsers with infinite
| lookahead. [...] are there any _languages_ which are
| inherently LR and not LL(oo)? (LL with infinite lookahead [...])


Jerry Leichter <leichter@smarts.com> writes:
>I'm not sure what L(oo) would be.


Judging by the crossposting, I suspect A Johnstone was talking about LL
parsers with backtracking, as is supported by PCCTS. An LL(1) parser with
backtracking would not have any difficulty with your example language


> L = { x^{2n}y^{2n} e, x^{2n+1}y^{2n+1} o}


because it could try the first (even) alternative, and then if that
failed it could backtrack and try the other (odd) one.


--
Fergus Henderson <fjh@cs.mu.oz.au>
WWW: <http://www.cs.mu.oz.au/~fjh>
PGP: finger fjh@128.250.37.3
--


Post a followup to this message

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