Re: Van Wijngaarden grammars

solution@gate.net (Ken Walter)
26 Feb 1996 00:41:45 -0500

          From comp.compilers
Related articles
[2 earlier articles]
Re: Van Wijngaarden grammars dww@math.fu-berlin.de (1991-07-25)
Re: Van Wijngaarden grammars tjj@thumper.bellcore.com (1991-07-29)
Re: Van Wijngaarden grammars hugh@cs.kun.nl (1991-08-02)
Van Wijngaarden grammars bevan@computer-science.manchester.ac.uk (Stephen J Bevan) (1991-08-02)
Re: Van Wijngaarden grammars chl@cs.man.ac.uk (Charles Lindsey) (1991-08-07)
Van Wijngaarden grammars fanf2@thor.cam.ac.uk (1996-02-24)
Re: Van Wijngaarden grammars solution@gate.net (1996-02-26)
Re: Van Wijngaarden grammars mparks@oz.net (Michael Parkes) (1996-02-27)
Re: Van Wijngaarden grammars dave@occl-cam.demon.co.uk (Dave Lloyd) (1996-02-27)
Van Wijngaarden grammars dave@occl-cam.demon.co.uk (Dave Lloyd) (1996-02-27)
Re: Van Wijngaarden grammars gvcormac@undergrad.math.uwaterloo.ca (Gordon V. Cormack) (1996-03-01)
| List of all articles for this month |
From: solution@gate.net (Ken Walter)
Newsgroups: comp.compilers
Date: 26 Feb 1996 00:41:45 -0500
Organization: Solution Technology
References: 96-02-297
Keywords: algol68, parse

fanf2@thor.cam.ac.uk (Tony Finch) writes:
:>Has anyone written a compiler generator that uses van Wijngaarden
:>grammars to describe the language to be compiled?


I vaguely remember one that used a restricted form of W-grammers. The
restrictions were equivalent to making the meta-productions
convertable to an attribute grammers. W-grammers are equivalent to
the most general form a grammer which can compute anything, so its not
likely that any marketable compiler would result. It would be too
slow from all the generality.


Ken Walter
--

Post a followup to this message

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