Related articles |
---|
[6 earlier articles] |
Re: Formal semantics of language semantics lex@cc.gatech.edu (Lex Spoon) (2002-09-29) |
Re: Formal semantics of language semantics whopkins@alpha2.csd.uwm.edu (Mark) (2002-09-29) |
Re: Formal semantics of language semantics nmm1@cus.cam.ac.uk (Nick Maclaren) (2002-10-13) |
Re: Formal semantics of language semantics haberg@matematik.su.se (Hans Aberg) (2002-10-13) |
Re: Formal semantics of language semantics scgupta@solomons.cs.uwm.edu (Satish C. Gupta) (2002-10-13) |
Re: Formal semantics of language semantics lex@cc.gatech.edu (Lex Spoon) (2002-10-13) |
Re: Formal semantics of language semantics anw@merlot.uucp (Dr A. N. Walker) (2002-10-18) |
Re: Formal semantics of language semantics whopkins@alpha2.csd.uwm.edu (Mark) (2002-10-18) |
Re: Formal semantics of language semantics whopkins@alpha2.csd.uwm.edu (Mark) (2002-10-18) |
Re: Formal semantics of language semantics nmm1@cus.cam.ac.uk (Nick Maclaren) (2002-10-20) |
Re: Formal semantics of language semantics nmm1@cus.cam.ac.uk (Nick Maclaren) (2002-10-20) |
Re: Formal semantics of language semantics merlot!anw@mailbox1.ucsd.edu (Dr A. N. Walker) (2002-10-25) |
Re: Formal semantics of language semantics whopkins@alpha2.csd.uwm.edu (Mark) (2002-10-25) |
[4 later articles] |
From: | "Dr A. N. Walker" <anw@merlot.uucp> |
Newsgroups: | comp.compilers |
Date: | 18 Oct 2002 23:07:23 -0400 |
Organization: | School of Mathematical Sciences, Nottingham University, UK. |
References: | 02-09-149 02-09-162 02-10-005 |
Keywords: | semantics |
Posted-Date: | 18 Oct 2002 23:07:23 EDT |
Nick Maclaren <nmm1@cus.cam.ac.uk> wrote:
>Ingo Dittmer <i.dittmer@fh-osnabrueck.de> wrote:
>>Many. All two-level-grammars (van-Wijngarden, [...]
>Hang on. The two-level grammars that I know of DON'T handle the
>semantics, but extend the syntax to things like the type rules. That
>was most definitely so for the van Wijngarden grammar used in Algol
>68, for example. [...]
It is true that the van Wijngaarden grammar used to define
Algol 68 in the RR did not attempt the semantics; but it is *also*
true that vW grammars *can* be used to define semantics%, and, as Ingo
said, this was being done from the '60s. I doubt whether it's
particularly useful to do so, but that's a different problem.
Cleaveland and Uzgalis showed in their book how to do this.
It could "easily" be extended to a purely grammatical way to "run" a
given piece of code on an abstract machine with a given input stream
so that the code parses to either a compilation error or else a
suitable output stream. Again, this is more of the nature of a proof
of concept rather than a practical way of writing a compiler and
running the resulting code ....
________
% At least, on the assumption that by "semantics" we mean something
more than "what's left over after syntax". Otherwise, then of
course shifting everything into the vWG doesn't do semantics, but
rather shifts all the semantics into syntax.
--
Andy Walker, School of MathSci., Univ. of Nott'm, UK.
anw@maths.nott.ac.uk
Return to the
comp.compilers page.
Search the
comp.compilers archives again.