home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!munnari.oz.au!yoyo.aarnet.edu.au!news.adelaide.edu.au!cs.adelaide.edu.au!andrewd
- From: andrewd@cs.adelaide.edu.au (Andrew Dunstan)
- Newsgroups: comp.lang.ada
- Subject: Re: GNU-NYU Ada project
- Date: 24 Nov 1992 04:30:58 GMT
- Organization: The University of Adelaide
- Lines: 27
- Distribution: world
- Message-ID: <1esb62INNl0j@huon.itd.adelaide.edu.au>
- References: <1992Nov19.184504.22639@coe.montana.edu> <62223@mimsy.umd.edu> <1ep7l5INN3kb@huon.itd.adelaide.edu.au> <1992Nov23.010531.16148@u.washington.edu>
- NNTP-Posting-Host: achilles.cs.adelaide.edu.au
-
- In article <1992Nov23.010531.16148@u.washington.edu>, nobby@byron.u.washington.edu (Vitaly Shmatikov) writes:
- |> In article <1ep7l5INN3kb@huon.itd.adelaide.edu.au> andrewd@cs.adelaide.edu.au (Andrew Dunstan) writes:
- |> [... stuff deleted ...]
- |>
- |> >This is not quite correct. (This discussion really belongs in comp.compilers.)
- |> >The class LL(1) is smaller than the class LALR(1). In fact, the class LL(k) is
- |> >smaller than the class LALR(1) for any k. However. the class LALR(1) = LR(1). This
- |>
- |> I believe this is wrong. Lookahead components in LALR(1) states are more
- |> general than those of LR(1). There might be situations where reduction of LR(1)
- |> to LALR(1) introduces a conflict although I don't have an example handy.
- |> The correct relation is LALR(1) ( LR(1).
-
- I did not say that every LR(1) grammar is LALR(1). This is clearly not true.
- What I said was that every language describable by an LR(1) grammar can also
- be described by an LALR(1) grammar. This is true. See Fischer & LeBlanc's
- "Crafting A Compiler", or Sippu & Soisalon-Soininen's encyclopaedic
- "Parsing Theory".
-
- --
- #######################################################################
- # Andrew Dunstan # There's nothing good or bad #
- # Department of Computer Science # but thinking makes it so. #
- # University of Adelaide # #
- # South Australia # - Shakespeare #
- # net: andrewd@cs.adelaide.edu.au # #
- #######################################################################
-