| Deutsch English Français Italiano |
|
<67f96eae$0$716$14726298@news.sunsite.dk> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!3.eu.feeder.erje.net!feeder.erje.net!usenet.goja.nl.eu.org!dotsrc.org!filter.dotsrc.org!news.dotsrc.org!not-for-mail Date: Fri, 11 Apr 2025 15:34:06 -0400 MIME-Version: 1.0 User-Agent: Mozilla Thunderbird Subject: Re: Clair Grant on VMS code base Newsgroups: comp.os.vms References: <vsh5m5$3is6e$1@dont-email.me> <vsmj7h$19qc0$1@dont-email.me> <vsmk9b$18rgf$1@dont-email.me> <vsp6ol$eli$1@dont-email.me> <vsv6jf$28vt6$1@dont-email.me> <vt34b1$26vpf$1@dont-email.me> <vt34qq$26k93$1@dont-email.me> <vt3m9a$2n50b$1@dont-email.me> <vtbqjj$29rog$2@dont-email.me> Content-Language: en-US From: =?UTF-8?Q?Arne_Vajh=C3=B8j?= <arne@vajhoej.dk> In-Reply-To: <vtbqjj$29rog$2@dont-email.me> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Lines: 39 Message-ID: <67f96eae$0$716$14726298@news.sunsite.dk> Organization: SunSITE.dk - Supporting Open source NNTP-Posting-Host: 33efd6eb.news.sunsite.dk X-Trace: 1744400046 news.sunsite.dk 716 arne@vajhoej.dk/68.14.27.188:61543 X-Complaints-To: staff@sunsite.dk Bytes: 2436 On 4/11/2025 3:29 PM, Arne Vajhøj wrote: > On 4/8/2025 1:27 PM, Simon Clubley wrote: >> As I mentioned above, this is no longer about DCL. I picked the above >> standalone example, a LL(1) RD parser, because it's a really good example >> of the different scale of effort involved in writing it in Macro-32 >> instead of in C. > > I have not made any claim about effort either. > > Are you sure that you have understood the topic?? > > The classic assumptions are: > > LOC = a * FP > effort = b * LOC**c = a * b * FP**c > > where a, b and c are language specific and c > 1. > > The topic is whether the first one is true (strictly speaking > it does not need to be linear for my original claim to be > true - it would be true for any LOC = a * f(FP) where f > does not depend on language). > > Whether a[Macro-32] * b[Macro-32] * FP**c[Macro-32] is at a different > scale than a[C] * b[C] * FP**c[C] does not say anything about that. But of course one thing is theory - something else is reality. Are there anybody in the audience that has a VAX with C and 5 minutes to spare? If so could you grab: https://raw.githubusercontent.com/brookewerner/Recursive-Descent-Parser/refs/heads/master/recursiveDescentParser.c and do a CC/LIST/MACH and count Macro-32 lines? Arne