Re: Can Pascal be parsed by LR(1) parsing algorithm?

rekers@cwi.nl (Jan Rekers)
16 Oct 90 11:01:48 GMT

          From comp.compilers
Related articles
[2 earlier articles]
Re: Can Pascal be parsed by LR(1) parsing algorithm? hankd@dynamo.ecn.purdue.edu (1990-10-10)
Re: Can Pascal be parsed by LR(1) parsing algorithm? joel@decwrl.dec.com (1990-10-15)
Can Pascal be parsed by LR(1) parsing algorithm? meissner@osf.org (1990-10-10)
Re: Can Pascal be parsed by LR(1) parsing algorithm? KARSTEN@tfl.dk (Karsten Nyblad, TFL, Denmark) (1990-10-10)
Re: Can Pascal be parsed by LR(1) parsing algorithm? bliss@sp64.csrd.uiuc.edu (1990-10-10)
Re: Can Pascal be parsed by LR(1) parsing algorithm? lindsay@comp.vuw.ac.nz (1990-10-16)
Re: Can Pascal be parsed by LR(1) parsing algorithm? rekers@cwi.nl (1990-10-16)
Re: Can Pascal be parsed by LR(1) parsing algorithm? firth@sei.cmu.edu (1990-10-17)
Re: Can Pascal be parsed by LR(1) parsing algorithm? firth@sei.cmu.edu (1990-10-17)
Re: Can Pascal be parsed by LR(1) parsing algorithm? firth@sei.cmu.edu (1990-10-18)
Re: Can Pascal be parsed by LR(1) parsing algorithm? djones@megatest.uucp (1990-10-21)
Re: Can Pascal be parsed by LR(1) parsing algorithm? crocker@Alliant.COM (1990-10-23)
Re: Can Pascal be parsed by LR(1) parsing algorithm? piet@cs.ruu.nl (1990-10-26)
[3 later articles]
| List of all articles for this month |
Newsgroups: comp.compilers
From: rekers@cwi.nl (Jan Rekers)
Keywords: pascal, parse, LR(1)
Organization: CWI, Amsterdam
References: <9010091533.AA02386@apple.com> <9010101445.AA06181@dynamo.ecn.purdue.edu> <1990Oct16.015524.25858@comp.vuw.ac.nz>
Date: 16 Oct 90 11:01:48 GMT

In article <1990Oct16.015524.25858@comp.vuw.ac.nz>,
lindsay@comp.vuw.ac.nz (Lindsay Groves) writes:


|> For example, the following syntax diagram describes the language
|> consisting of all non-empty palindromes of even length over the alphabet
|> {a, b}. This language is inherently ambiguous (ie cannot be recognised
|> by a deterministic PDA), so it is definitely not LL(1) (nor LL(k),
|> LR(k), ...):


The language of non-empty palindromes is not inherently ambiguous, the
language of _sequences_of_ non-empty palindromes is. The syntax diagram
you provide does describe _sequences_ of palindromes.


Jan Rekers (rekers@cwi.nl) Centrum voor Wiskunde en Informatica (CWI)
P.O. Box 4079, 1009 AB Amsterdam, The Netherlands


--

Post a followup to this message

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