|Van Wijngaarden grammars firstname.lastname@example.org (1991-07-22)|
|Re: van Wijngaarden grammars email@example.com (1991-07-25)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (1991-07-25)|
|Re: Van Wijngaarden grammars email@example.com (1991-07-29)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (1991-08-02)|
|Van Wijngaarden grammars email@example.com (Stephen J Bevan) (1991-08-02)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (Charles Lindsey) (1991-08-07)|
|Van Wijngaarden grammars email@example.com (1996-02-24)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (1996-02-26)|
|Re: Van Wijngaarden grammars email@example.com (Michael Parkes) (1996-02-27)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (Dave Lloyd) (1996-02-27)|
|Van Wijngaarden grammars email@example.com (Dave Lloyd) (1996-02-27)|
|Re: Van Wijngaarden grammars firstname.lastname@example.org (Gordon V. Cormack) (1996-03-01)|
|From:||Charles Lindsey <email@example.com>|
|Organization:||Dept. Of Comp Sci, Univ. of Manchester, UK.|
|References:||91-07-047 91-08-005 91-08-013|
|Date:||7 Aug 91 08:56:23 GMT|
In 91-08-013 firstname.lastname@example.org (Stephen J Bevan) writes:
>My question is :-
>Are (Extended) Affix Grammars considered to be equivalent to van Wijngaarden
Roughly speaking, the difference between a pure W-Grammar and an Affix
Grammar is the same as the difference between an untyped language and a
strongly typed one. W-Grammars are very dangerous unless used with great
care, and they are in general unparseable (if you use all the nasty tricks
that are theoretically possible - of course we never did any such thing in
the ALGOL 68 Report :-) ).
Here is an example out of the original ALGOL 68 Report.
one out of LMOODSETY MOOD RMOODSETY mode FORM : MOOD FORM; ... .
Now the metagrammar can metaproduce 'real integral boolean' out of
'LMOODSETY MOOD RMOODSETY' in many ways (e.g. 'LMOODSETY' = 'real integral',
'MOOD' = 'boolean', 'RMOODSETY' = 'EMPTY'). Thus the 'MOOD' can be made to
correspond to any one of 'real', 'integral' or 'boolean', which is of course
the whole purpose of that rule.
But you could not do the same thing in an Affix Grammar (or in Prolog, which
is actually very similar to an Affix Grammar). And you would have the
greatest difficulty writing a parser that could use the rule in the form I
Return to the
Search the comp.compilers archives again.