Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!gem.mps.ohio-state.edu!ginosko!uunet!super!schrader
From: schrader@super.ORG (Jennifer A. Schrader)
Newsgroups: comp.object
Subject: Re: OOD applied to interpreters and compilers
Message-ID: <15231@super.ORG>
Date: 10 Oct 89 14:55:52 GMT
References: <1989Oct2.204603.10320@polyslo.CalPoly.EDU> <8497@goofy.megatest.UUCP>
Sender: news@super.ORG
Reply-To: schrader@metropolis.UUCP (Jennifer A. Schrader)
Distribution: usa
Organization: Supercomputing Research Center, Bowie, Md.
Lines: 22

In article <8497@goofy.megatest.UUCP> djones@megatest.UUCP (Dave Jones) writes:
>From article <1989Oct2.204603.10320@polyslo.CalPoly.EDU>, by ttwang@polyslo.CalPoly.EDU (Thomas Wang):
>
>> I managed to write a LL(1) backtracing parser generator in one
>> month using C++, so I can comfortably say ...
>
>
>I managed to write an LR(1) parser-generator with default reductions
>and equivalent state merging, in C, in under three weeks.
>
>Going once, going twice...

I managed to write an LW(3,498) concurrent parser-generator with 
default reductions, equivalent state-merging and sub-differentiation with
seven yak-and-poker retrieval and an alternate compliler-optimizer 
with a small coffee-maker in just under three minutes in True
Basic.  And it worked the first time.


(SOLD!)

Jenn