From: arne@vajhoej.dk   
      
   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   
      
   --- SoupGate-DOS v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)