From: | Hans-Peter Diettrich <DrDiettrich1@netscape.net> |
Newsgroups: | comp.compilers |
Date: | Wed, 12 Jun 2024 11:27:21 +0200 |
Organization: | Compilers Central |
References: | 24-06-003 |
Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="29487"; mail-complaints-to="abuse@iecc.com" |
Keywords: | syntax, semantics, comment |
Posted-Date: | 12 Jun 2024 10:52:28 EDT |
In-Reply-To: | 24-06-003 |
On 6/10/24 2:21 PM, John R Levine wrote:
> generates small programs from
> the grammars of several popular programs,
I think that the *syntactic grammar* of program *languages* is meant:
>>
The key idea is to measure the compilation success rates of programs
sampled from context-free grammars.
<<
Then I wonder how ever valid random programs can be generated for
languages that require a declaration before use of an identifier,
clearly a *semantic* issue. A CQ of 40 for C indicates to me that
certain semantic rules have been built into the program generator.
Or what did I not understand right?
DoDi
[The paper describes the grammars they use. C grammar requires declarations
precede other statements so that's easy to get right. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.