|Recursive-descent parser generator wanted email@example.com (AG Hartenstein-UNI KL-FRG) (1988-02-11)|
|Re: Recursive-descent parser generator wanted blia.UUCPfirstname.lastname@example.org (1988-02-25)|
|Re: Recursive-descent parser generator wanted harvard!rutgers!cs.rochester.edu!scott@BBN.COM (Michael Scott) (1988-03-15)|
|Date:||Thu, 11 Feb 88 18:49:18 MET|
|From:||"AG Hartenstein-UNI KL-FRG" <email@example.com>|
I am looking for a parser-generator, which generates recursive-descent parsers
in PASCAL. Some time ago I saw a note about such a program named LILA, which
has been implemented at the Katholieke Universiteit Leuwen.
If anybody knows which person I have to contact to get this program, I would
be very thankful, if he would mail me the adress.
If you know about other parser-generators, which work in the same way, I
would be interested in information about these systems, too.
Many thanks in advance,
Dipl.-Inform. Michael Ryba phone: +49 631 205-2892
Kaiserslautern University e-mail: firstname.lastname@example.org
Dept. of Computer Science
P.O. Box 3049
D-6750 Kaserslautern, F.R.G.
[At the risk of much flamage, I'd be interested in comments about why one
might prefer an R.D. parser generator to an LR one. We've beaten error
recovery to death, unless someone has something genuinely new. -John]
Return to the
Search the comp.compilers archives again.